| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
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.続きを見る
|
Mendeley出力
