A Faster Algorithm for 3D Discrete Lines.
Vincent BoyerJean-Jacques BourdinPublished in: Eurographics (Short Presentations) (1998)
Keyphrases
- preprocessing
- learning algorithm
- k means
- optimal solution
- significant improvement
- np hard
- experimental evaluation
- segmentation algorithm
- probabilistic model
- high accuracy
- times faster
- recognition algorithm
- matching algorithm
- hough transform
- highly efficient
- line detection
- optimization algorithm
- theoretical analysis
- computationally efficient
- computational cost
- multiscale
- particle swarm optimization
- input data
- linear programming
- dynamic programming
- detection algorithm
- clustering method
- computational complexity
- data streams
- path planning
- objective function
- improved algorithm
- similarity measure
- neural network