Adaptive image approximation by linear splines over locally optimal delaunay triangulations

Locally optimal Delaunay triangulations are constructed to improve previous image approximation schemes. Our construction relies on a local optimization procedure, termed exchange. The efficient implementation of the exchange algorithm is addressed, and its complexity is discussed. The good performance of our improved image approximation is illustrated by numerical comparisons.

[1]  Armin Iske,et al.  Progressive scattered data filtering , 2003 .

[2]  Michael W. Marcellin,et al.  JPEG2000 - image compression fundamentals, standards and practice , 2002, The Kluwer International Series in Engineering and Computer Science.

[3]  Nira Dyn,et al.  Image compression by linear splines over adaptive triangulations , 2006, Signal Process..

[4]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Yehoshua Y. Zeevi,et al.  The farthest point strategy for progressive image sampling , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).

[6]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[7]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[8]  Sheng-Jyh Wang,et al.  Representing images using points on image surfaces , 2005, IEEE Transactions on Image Processing.

[9]  Armin Iske,et al.  Scattered Data Coding in Digital Image Compression , 2002 .

[10]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .