An Efficient Two-Dimensional Warping Algorithm
An Efficient Two-Dimensional Warping Algorithm
复制标题
一种高效的二维变形算法
DOI：
--
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
H. Sakoe
中科院分区：
文献类型：
--
作者：
S. Uchida;H. Sakoe
提出了一种新的基于动态规划（DP）的单调连续二维翘曲算法。该算法搜索受单调性和连续性约束的一对图像之间的最佳像素到像素映射，其时间复杂度远低于作者先前报道的算法。这种复杂性的降低源于对表示2DW问题的多阶段决策过程的细化。提出了一种结合波束搜索的多项式阶近似算法作为实现方法。理论和实验比较表明，该近似算法比以前的近似算法具有更好的性能。关键词：二维翘曲，图像匹配，动态规划，对应优化，马尔可夫过程公式
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. key words: two-dimensional warping, image matching, dynamic programming, correspondence optimization, Markovian process formulation