A robustness test of the braided device foreshortening algorithm.
Raquel Kale MoyanoHector FernandezJuan M. MachoJordi BlascoLuis San-RománAna Paula NarataIgnacio LarrabidePublished in: SIPAIM (2017)
Keyphrases
- computational cost
- worst case
- dynamic programming
- cost function
- segmentation algorithm
- expectation maximization
- high accuracy
- experimental evaluation
- np hard
- data structure
- computational efficiency
- objective function
- learning algorithm
- tree structure
- classification algorithm
- computationally efficient
- data sets
- improved algorithm
- k means
- optimal solution
- probabilistic model
- significant improvement
- search algorithm
- matching algorithm
- convergence rate
- affine transformation
- recognition algorithm
- bayesian networks