Advanced contour compression algorithm using weighted curvature, Lagrange curve approximation, and improvement adapitive arithmetic coding

Contour compression is to encode the boundaries of objects and important for object-orient image compression and cartoon-like image compression. In this paper, we propose an advanced algorithm to perform lossy compression for contours. First, we find that among all curves, the 3rd order polynomial is most suitable for contour compression. Second, we suggest that, instead of encoding the coefficients of curves directly, it is more efficient to encode the heights of curves. Moreover, we apply an alternative definition of curvature to find the dominant points. Furthermore, we apply the improved version of adaptive arithmetic coding, including increasing the probabilities of the values with the same sign or with similar amplitudes, to encode the heights of curves. Simulations show that, when the error is similar, the proposed algorithm requires much less number of bits than other existing methods for contour compression.

[1]  Borut Zalik,et al.  Compressed vertex chain codes , 2007, Pattern Recognit..

[2]  A. Dziech,et al.  A new method for contour compression , 2005 .

[3]  Francisco José Madrid-Cuevas,et al.  Polygonal approximation of digital planar curves through break point suppression , 2010, Pattern Recognit..

[4]  Borut Zalik,et al.  Chain code lossless compression using move-to-front transform and adaptive run-length encoding , 2014, Signal Process. Image Commun..

[5]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[6]  Sabri A. Mahmoud,et al.  Polygonal approximation of planar curves using triangular suppression , 2010, 10th International Conference on Information Science, Signal Processing and their Applications (ISSPA 2010).

[7]  Francisco José Madrid-Cuevas,et al.  The computation of polygonal approximations for 2D contours based on a concavity tree , 2014, J. Vis. Commun. Image Represent..

[8]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[9]  Dilip K. Prasad,et al.  PRO: A Novel Approach to Precision and Reliability Optimization Based Dominant Point Detection , 2013 .

[10]  Hermilo Sánchez-Cruz Proposing a new code by considering pieces of discrete straight lines in contour shapes , 2010, J. Vis. Commun. Image Represent..

[11]  Hiok Chai Quek,et al.  A parameter independent line fitting method , 2011, The First Asian Conference on Pattern Recognition.

[12]  Mohammad Tanvir Parvez Optimized polygonal approximations through vertex relocations in contour neighborhoods , 2015, Image Vis. Comput..

[13]  André Ricardo Backes,et al.  Polygonal approximation of digital planar curves through vertex betweenness , 2013, Inf. Sci..