O(N) implementation of the fast marching algorithm.
Liron YatzivAlberto BartesaghiGuillermo SapiroPublished in: J. Comput. Phys. (2006)
Keyphrases
- experimental evaluation
- times faster
- hardware implementation
- k means
- detection algorithm
- dynamic programming
- computational cost
- preprocessing
- optimization algorithm
- parallel implementation
- matching algorithm
- cost function
- segmentation algorithm
- high accuracy
- simulated annealing
- data sets
- worst case
- np hard
- search space
- linear programming
- theoretical analysis
- tree structure
- multi objective
- significant improvement
- recognition algorithm
- objective function