Title
Particle-SfT: A Provably-Convergent, Fast Shape-from-Template Algorithm.
Abstract
The Shape-from-Template (SfT) problem is to recover the 3D shape of a deformable object from a single image, given a 3D template and a deformation constraint. We propose Particle-SfT, a new SfT algorithm which handles isometric and non-isometric deformations. We build Particle-SfT upon a particle system guided by deformation and reprojection constraint projections. Reconstruction is achieved by evolving particles to a globally attractive equilibrium, while taking observable external forces such as gravity into account, if any. Particle-SfT may be used to refine an existing initial shape. However, in practice we simply use the template as initial guess. This is because, as opposed to the existing refining methods, Particle-SfT has an extremely wide convergence basin. Particle-SfT is also faster than the existing refining methods. This is because it moves pieces of the shape's mesh independently to achieve larger step size by optimal constraint projection. We proved its convergence to a fixed-point. We experimented it with synthetic and real data. It has the same accuracy as the best performing isometric method and consistently outperforms all existing elastic methods in almost all cases, while being much faster.
Year
DOI
Venue
2017
10.1007/s11263-016-0968-4
International Journal of Computer Vision
Keywords
Field
DocType
convergent,fast,isometric,elastic,particle,shape-from-template
Convergence (routing),Particle system,Observable,Computer science,Algorithm,Deformation (mechanics),Particle
Journal
Volume
Issue
ISSN
123
2
0920-5691
Citations 
PageRank 
References 
1
0.36
19
Authors
2
Name
Order
Citations
PageRank
Erol Ozgur1276.17
Adrien Bartoli2114789.14