The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
단조롭고 연속적인 2차원 워핑(2DW)을 위한 새로운 동적 프로그래밍(DP) 기반 알고리즘이 제시됩니다. 이 알고리즘은 저자가 이전에 보고한 알고리즘보다 시간 복잡도가 훨씬 낮은 단조성과 연속성 제약을 받는 이미지 쌍 사이의 최적의 픽셀 간 매핑을 검색합니다. 이러한 복잡성 감소는 XNUMXDW 문제를 나타내는 다단계 결정 프로세스의 개선으로 인해 발생합니다. 구현 기법으로 빔 탐색을 접목한 다항식 차수 근사 알고리즘도 제시했다. 이론적 및 실험적 비교를 통해 현재 근사 알고리즘이 이전 근사 알고리즘보다 더 나은 성능을 제공한다는 것을 보여줍니다.
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.
부
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
부
@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},}
부
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 -