Particle-SfT: A Provably-Convergent, Fast Shape-from-Template Algorithm.
Erol OzgurAdrien BartoliPublished in: Int. J. Comput. Vis. (2017)
Keyphrases
- provably convergent
- matching algorithm
- dynamic programming
- np hard
- worst case
- k means
- detection algorithm
- optimization algorithm
- significant improvement
- computational cost
- prior information
- objective function
- learning algorithm
- search space
- computationally efficient
- deformable template
- improved algorithm
- shape representation
- probabilistic model
- computational complexity
- preprocessing
- medical images
- d objects
- template matching
- convergence rate
- cost function
- digitized images
- face recognition