An efficient algorithm to find lattice chains.
Riccardo BernardiniPublished in: IEEE Trans. Circuits Syst. Video Technol. (1996)
Keyphrases
- preprocessing
- computationally efficient
- dynamic programming
- experimental evaluation
- learning algorithm
- detection algorithm
- k means
- single pass
- objective function
- significant improvement
- cost function
- optimal solution
- optimization algorithm
- experimental study
- theoretical analysis
- segmentation algorithm
- times faster
- tree structure
- input data
- selection algorithm
- memory efficient
- lattice structure
- high accuracy
- computational complexity
- computational cost
- np hard
- search space
- similarity measure
- particle swarm optimization
- data structure
- hardware implementation
- concept lattice
- improved algorithm
- memory requirements
- path planning
- segmentation method
- probabilistic model
- worst case
- edge detection