An Approximation Algorithm for Two-Dimensional Warping

A new efficient two-dimensional warping algorithm is presented, in which sub-optimal warping is attained by iterating DP-based local optimization of warp on partially overlapping subplane sequence. From an experimental comparison with a conventional approximation algorithm based on beam search DP, relative superiority of the proposed algorithm is established. key words: two-dimensional warping, dynamic programming, approximation algorithm

[1]  Seiichi Uchida,et al.  An Efficient Two-Dimensional Warping Algorithm , 1999 .

[2]  Haluk Derin,et al.  Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Seiichi Uchida,et al.  A monotonic and continuous two-dimensional warping based on dynamic programming , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).