An Algorithm to Find a Perfect Map for Graphoid Structures.
Marco BaiolettiGiuseppe BusanelloBarbara VantaggiPublished in: IPMU (1) (2010)
Keyphrases
- detection algorithm
- dynamic programming
- improved algorithm
- computational complexity
- times faster
- np hard
- learning algorithm
- objective function
- search space
- theoretical analysis
- experimental evaluation
- high accuracy
- clustering method
- segmentation algorithm
- recognition algorithm
- selection algorithm
- computational cost
- significant improvement
- k means
- preprocessing
- simulated annealing
- path planning
- maximum a posteriori
- single pass
- image reconstruction
- ant colony optimization
- optimization algorithm
- input data
- worst case
- search algorithm
- image sequences