In image pattern recognition, elastic matching based on dynamic programming (DP) has been used as an effective technique to obtain a deformation-invariant distance between image patterns. A practical problem of elastic matching is its huge computation time. In this report, a fast elastic matching technique based on coarse-to-fine DP (CFDP) is proposed. In CFDP, a heuristic search strategy is employed to reduce computation time while keeping the global optimality of matching. The effect of the proposed technique on reducing computation time was indicated by experimental results.
|Number of pages||6|
|Journal||Research Reports on Information Science and Electrical Engineering of Kyushu University|
|Publication status||Published - Sep 1 2004|
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Electrical and Electronic Engineering