A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres.
Yves NievergeltPublished in: Numerische Mathematik (2002)
Keyphrases
- detection algorithm
- computational complexity
- dynamic programming
- theoretical analysis
- search space
- learning algorithm
- experimental evaluation
- matching algorithm
- particle swarm optimization
- high accuracy
- computational cost
- cost function
- preprocessing
- times faster
- objective function
- piecewise linear
- recognition algorithm
- hyperplane
- d objects
- expectation maximization
- worst case
- optimal solution
- feature extraction