AnyDijkstra, an algorithm to compute shortest paths on images with anytime properties.
Diego Ulisse PizzagalliRolf KrausePublished in: CoRR (2022)
Keyphrases
- shortest path
- shortest path problem
- shortest path algorithm
- segmentation algorithm
- finding the shortest path
- optimal solution
- dynamic programming
- similarity measure
- optimal path
- segmentation method
- strongly connected components
- path length
- path planning
- np hard
- objective function
- ant colony optimization
- input image
- flow graph