DocumentCode
1742269
Title
Piecewise linear two-dimensional warping
Author
Uchida, Seiichi ; Sakoe, Hiroaki
Author_Institution
Graduate Sch. of Inf. Sci., Kyushu Univ., Fukuoka, Japan
Volume
3
fYear
2000
fDate
2000
Firstpage
534
Abstract
An efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires far less complexity than previous DP-based elastic matching algorithms. This complexity reduction results from piecewise linearization of a 2D-2D mapping which specifies an elastic matching between two given images. Since this linearization can be guided by a priori knowledge related to image patterns to be matched, the present DP algorithm often provides sufficient matching as is shown by experimental results
Keywords
computational complexity; dynamic programming; image matching; interpolation; piecewise linear techniques; 2D elastic matching; 2D-2D mapping; image patterns; piecewise linear two-dimensional warping; piecewise linearization; Computational complexity; Dynamic programming; Heuristic algorithms; Image analysis; Image recognition; Information science; Interpolation; Pattern matching; Piecewise linear techniques; Stability criteria;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2000. Proceedings. 15th International Conference on
Conference_Location
Barcelona
ISSN
1051-4651
Print_ISBN
0-7695-0750-6
Type
conf
DOI
10.1109/ICPR.2000.903601
Filename
903601
Link To Document