Representing Images in 200 Bytes: Compression via Triangulation

A rapidly increasing portion of internet traffic is dominated by requests from mobile devices with limited and metered bandwidth constraints. To satisfy these requests, it has become standard practice for websites to transmit small and extremely compressed image previews as part of the initial page load process to improve responsiveness. Increasing thumbnail compression beyond the capabilities of existing codecs is therefore an active research direction. In this work, we concentrate on extreme compression rates, where the size of the image is typically 200 bytes or less. First, we propose a novel approach for image compression that, unlike commonly used methods, does not rely on block-based statistics. We use an approach based on an adaptive triangulation of the target image, devoting more triangles to high entropy regions of the image. Second, we present a novel algorithm for encoding the triangles. The results show favorable statistics, in terms of PSNR and SSIM, over both the JPEG and the WebP standards.

[1]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[2]  D. Salesin,et al.  Diffusion curves: a vector representation for smooth-shaded images , 2013, CACM.

[3]  Shen-En Qian Satellite Data Compression , 2013 .

[4]  Michael S. Bernstein,et al.  ImageNet Large Scale Visual Recognition Challenge , 2014, International Journal of Computer Vision.

[5]  David Minnen,et al.  Variable Rate Image Compression with Recurrent Neural Networks , 2015, ICLR.

[6]  Xi Chen,et al.  Evolution Strategies as a Scalable Alternative to Reinforcement Learning , 2017, ArXiv.

[7]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[8]  Michael Breuß,et al.  Clustering-based quantisation for PDE-based image compression , 2017, Signal, Image and Video Processing.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

[11]  Michael Elad,et al.  Compression of facial images using the K-SVD algorithm , 2008, J. Vis. Commun. Image Represent..

[12]  J. Jiang,et al.  Image compression with neural networks - A survey , 1999, Signal Process. Image Commun..

[13]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

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

[15]  Pascal Barla,et al.  Diffusion curves: a vector representation for smooth-shaded images , 2008, ACM Trans. Graph..

[16]  Edward J. Delp,et al.  The use of asymmetric numeral systems as an accurate replacement for Huffman coding , 2015, 2015 Picture Coding Symposium (PCS).

[17]  Michel Barlaud,et al.  Fractal image compression based on Delaunay triangulation and vector quantization , 1996, IEEE Trans. Image Process..

[18]  Laurent D. Cohen,et al.  Image compression with anisotropic triangulations , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[19]  Joachim Weickert,et al.  Beating the Quality of JPEG 2000 with Anisotropic Diffusion , 2009, DAGM-Symposium.

[20]  Rui Zhong,et al.  Dictionary based surveillance image compression , 2015, J. Vis. Commun. Image Represent..

[21]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .