An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths.
Ulrich DerigsPublished in: Inf. Process. Lett. (1985)
Keyphrases
- preprocessing
- high precision
- cost function
- high accuracy
- feature extraction
- significant improvement
- classification accuracy
- multiscale
- classification method
- detection method
- experimental evaluation
- dynamic programming
- pairwise
- computational cost
- medical images
- unsupervised learning
- shortest path
- matching algorithm
- k means
- optimal path