Coarse-to-fine dynamic programming

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 23, Issue 12, 2001, Pages 1379-1390

  Raphael, C ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

A star; Brachistochrone; Coarse to fine; Dynamic programming; Global optimization; Iterated complete path; Mine recognition

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; GLOBAL OPTIMIZATION; GRAPH THEORY; PATTERN RECOGNITION; PROBLEM SOLVING; STATE SPACE METHODS;

MINE RECOGNITION;

DYNAMIC PROGRAMMING;

EID: 0035670767     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.977562     Document Type: Article

References (26)

1. A tutorial on hidden Markov models and selected applications in speech recognition
2. A maximum likelihood approach to continuous speech recognition
3. An omnifont open-vocabulary OCR system for english and arabic
4. Handwritten word recognition using segmentation-free hidden Markov modeling and segmentation-based dynamic programming techniques
5. Document image decoding using Markov source models
6. Dynamic programming for detecting, tracking, and matching deformable contours
7. Dynamic programming generation of curves on brain surfaces
8. Minimal trellises for block codes
9. Efficient maximum likelihood decoding of linear block codes using a trellis
10. A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
11. On complexity of trellis structure of linear block codes
12. New prospects in line detection by dynamic programming
13. A formal basis for the heuristic determination of minimum cost paths
14. Heuristic image decoding using separable models
15. A grammatical approach to mine detection
16. Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees
17. Multiresolution path planning for mobile robots
18. SANDROS: A dynamic graph search algorithm for motion planning
19. New heuristic algorithms for efficient hierarchical path planning
20. A hierarchical strategy for path planning among moving obstacles