Algorithm of Visvalingam-Whyatt for polyline simplification (piecewise approximation) was used for image compression. The compression method was investigated for different tolerances and steps in the algorithm application for pixel rows and columns
[1] Mahdi, O.A.; Mohammed, M.A.; Mohamed, A.J. "Implementing a Novel Approach and Convert Audio Compression to Text Coding via Hybrid Technique". International Journal of Computer Science Issues 9 (6, No. 3): 53–59. Retrieved 6 March 2013.
[2] A. Skodras, C. Christopoulos, T. Ebrahimi, “The JPEG 2000 Still Image Compression Standard”, IEEE Signal processing magazine, 23 p., 2001.
[3] M. R. Nelson, “LZW data compression”, Dr. Dobb's Journal, pp.28-36, 1989.
[4] Ziv, Inequalities and Algorithms for Universal Data Compression, Probl. Peredachi Inf., 1996, Volume 32, Issue 1, 35–40.
[5] Visvalingam, M. and Herbert, S., 1999, A computer science perspective on the bend simplification algorithm. Cartography and Geographic Information Science 26(4), 253-270.
[6] Visvalingam, M. and Whyatt, J.D., 1993, Line generalisation by repeated elimination of points. Cartographic Journal, 30(1), 46-51.
[7] Visvalingam, M. and Williamson, P.J, 1995, Simplification and generalization of large scale data for roads. Cartography and Geographic Information Science 22(4), 3-15.
[8] U. Ramer, “An iterative procedure for the polygonal approximation of plane curves”, Computer Graphics and Image Processing, 1(3): pp.244–256, 1972.
[9] D. Douglas, T. Peucker, “Algorithms for the reduction of the number of points required to represent a digitized line or its caricature”, The Canadian Cartographer, 10(2): pp.112–122, 1973.
[10] R. Melnyk, P. Viazovskyy, “Image compression using piecewise-linear approximation”, Computer science and information technologies; 20-24 November, 2012 Lviv, Ukraine.
[11] SUNY Institute of Technology 2012. Available: http://web.cs.sunyit.edu/~poissad/projects/Curve/about_algorithms/whyatt....