A new algorithm to find raster-based least-cost paths using cut and fill operations.
Jieun BaekYosoon ChoiPublished in: Int. J. Geogr. Inf. Sci. (2017)
Keyphrases
- preprocessing
- detection algorithm
- computational complexity
- dynamic programming
- k means
- optimization algorithm
- significant improvement
- np hard
- similarity measure
- improved algorithm
- path planning
- matching algorithm
- segmentation algorithm
- expectation maximization
- worst case
- experimental evaluation
- evolutionary algorithm
- search space
- linear programming
- particle swarm optimization
- markov random field
- computationally efficient
- theoretical analysis
- shortest path
- lower bound
- times faster
- convergence rate
- recognition algorithm
- data sets