Extended coherent point drift algorithm with correspondence priors and optimal subsampling.
Vladislav GolyanikBertram TaetzGerd ReisDidier StrickerPublished in: WACV (2016)
Keyphrases
- optimal solution
- dynamic programming
- worst case
- computational cost
- k means
- learning algorithm
- experimental evaluation
- significant improvement
- preprocessing
- np hard
- search space
- globally optimal
- optimization algorithm
- times faster
- cost function
- computational complexity
- expectation maximization
- locally optimal
- bayesian framework
- prior information
- closed form
- path planning
- tree structure
- computationally efficient
- linear programming
- neural network
- image segmentation