An efficient two-dimensional warping algorithm

Seiichi Uchida, Hiroaki Sakoe

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)

Abstract

SUMMARY A new dynamic programming (DP) based algorithm for monotonie and continuous two-dimensional warping (2DW) is presented. This algorithm searches for the optimal pixel-to-pixel mapping between a pair of images subject to monotonicity and continuity constraints with by far less time complexity than the algorithm previously reported by the authors. This complexity reduction results from a refinement of the multi-stage decision process representing the 2DW problem. As an implementation technique, a polynomial order approximation algorithm incorporated with beam search is also presented. Theoretical and experimental comparisons show that the present approximation algorithm yields better performance than the previous approximation algorithm.

Original languageEnglish
Pages (from-to)693-700
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE82-D
Issue number3
Publication statusPublished - Jan 1 1999

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'An efficient two-dimensional warping algorithm'. Together they form a unique fingerprint.

Cite this