An Efficient Two-Dimensional Warping Algorithm
Summary :
A new dynamic programming (DP) based algorithm for monotonic 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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.3 pp.693-700
- Publication Date
- 1999/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Image Processing,Computer Graphics and Pattern Recognition
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seiichi UCHIDA, Hiroaki SAKOE, "An Efficient Two-Dimensional Warping Algorithm" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 3, pp. 693-700, March 1999, doi: .
Abstract: A new dynamic programming (DP) based algorithm for monotonic 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_3_693/_p
Copy
@ARTICLE{e82-d_3_693,
author={Seiichi UCHIDA, Hiroaki SAKOE, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Two-Dimensional Warping Algorithm},
year={1999},
volume={E82-D},
number={3},
pages={693-700},
abstract={A new dynamic programming (DP) based algorithm for monotonic 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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Efficient Two-Dimensional Warping Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 693
EP - 700
AU - Seiichi UCHIDA
AU - Hiroaki SAKOE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1999
AB - A new dynamic programming (DP) based algorithm for monotonic 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.
ER -
English
