Path-Value Functions for Which Dijkstra's Algorithm Returns Optimal Mapping.
Krzysztof Chris CiesielskiAlexandre Xavier FalcãoPaulo A. V. MirandaPublished in: J. Math. Imaging Vis. (2018)
Keyphrases
- detection algorithm
- worst case
- k means
- optimal path
- dynamic programming
- optimal solution
- significant improvement
- high accuracy
- preprocessing
- recognition algorithm
- experimental evaluation
- computational cost
- theoretical analysis
- times faster
- learning algorithm
- simulated annealing
- np hard
- search space
- expectation maximization
- computational complexity
- segmentation algorithm
- path planning
- shortest path problem
- improved algorithm
- optimality criterion
- locally optimal
- path finding
- optimal parameters
- globally optimal
- space complexity
- exhaustive search
- convex hull
- clustering method
- probabilistic model
- computationally efficient