Boundary Location from an Initial Plan: The Bead Chain Algorithm.
C. W. K. GrittonEdward A. ParrishPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (1983)
Keyphrases
- k means
- learning algorithm
- experimental evaluation
- theoretical analysis
- computational complexity
- optimization algorithm
- worst case
- improved algorithm
- dynamic programming
- segmentation algorithm
- computationally efficient
- linear programming
- partial plans
- recognition algorithm
- times faster
- matching algorithm
- high accuracy
- computational cost
- np hard
- optimal solution
- input data
- probabilistic model
- detection algorithm
- path planning
- convex hull
- query processing
- preprocessing