Contextual Image Compression

from Adaptive Sparse Data Representations

L. Demaret, A. Iske, W. Khachabi

MOTIVATION FUNCTIONAL INTERPRETATION
Classical framework Besov spaces optimality for heterogeneous functions, bad directionality non-optimal for piecewise smooth functions
Two images with same Besov norms. Right: random rearrangement of wavelet coe. (cf. oscillation spaces, Jaard)

ADAPTIVE TRIANGULATIONS AND IMAGES

Goal: Contour representation ANISOTROPIC TRIANGULATIONS Continuous and piecewise ane splines Adaptivity High computational cost
Arbitrary triangulation (B. Lehner)

C1 W 1,2

C 0.5

C 0, L DELAUNAY TRIANGULATIONS L2 L1 Circumcircle of a triangle does not contain any other vertex Minimises the maximal angle among triangulations of a set of vertices uniqueness = connectivity transmission not needed
1 p

wavelet coecients > threshold L2-approximation error: 2 = O(1/ N ) f fn L measure of the essential singularities

W 1,1, BV

Problem: Find quasi-optimal vertices ? search of a sparse representation in a huge set of Delaunay triangulations

(1) Red: wavelets-approximable functional spaces. (2) Domain of a characteristic function of a smooth function.

ADAPTIVE THINNING ALGORITHMS

CONTEXTUAL COMPRESSION
COMPRESSION OF PIXEL POSITIONS Signicant Points are not random Cluster of points along singularities

Local cell of a vertex

Local cell after point suppression

Original

2000 vertices

Greedy renement algorithm Edge suppresion (2-step) Post-processing: moving vertices L2-optimisation of vertices values
Delaunay Triangulation Interpolated Reconstruction 8000 Randomly chosen pixels 8000 pixels output by AT for Fruits Contextual box of the current pixel (cross)

APPROXIMATION PROPERTIES
Denition Horizon functions For ]0, 1], a function f is an horizon, if it is of the following form: if y g(x), f (x, y) := c2, else
1

Our Method: Use of causal boxes Contexts: density of points in the causal box COMPRESSION OF GREY VALUES Optimal Luminances still contain many structures

f (x) = |x|3/2, = 0.5

60 points

where g C 1,([0, 1]). Proposition Let f be an -horizon on [0, 1]2. Then there exists a constant C > 0, s.t. for each n N there is a Delaunay triangulation Tn with n vertices, which satises f L n f L2 T C +1 n2 2

Random grey values

Red: edges with big variation Green: edges with small variation

Red: longest causal edges

where L n f ist the projection of f on STn , space of continuous linear splines over Tn. T

Our Method: Transmit grey value dierencesw along the longest edge Contexts: lenght of the longest causal edge

RESULTS
Cameraman JPEG2000 29.84 dB, 3247 B CAT 30.66 dB, 3233 B

WORK IN PROGRESS
Extension to Video approximation : 3D Thinning, Delaunay tetrahedralization Approximation theory for larger classes Kolmogorov entropy faster algorithm/implementation, shape-preserving denoising medical imaging inverse problems

Comparison of ratedistortion curves (bits per pixel vs PSNR) for: JPEG2000 (thin curve) AT (our old method, dashed ) CAT (new method, fat curve).

Fruits JPEG2000 34.15 dB,9829 B CAT 35.04 dB, 9825 B

REFERENCES
L. DEMARET, N. DYN, A. ISKE Image compression by linear splines over adaptive triangulations. Signal Processing Journal 86(7), July 2006, 16041616. L. DEMARET, A. ISKE Adaptive image approximation by linear splines over locally optimal Delaunay triangulations IEEE Signal Processing Letters 13(5), May 2006, 281284.

Lena JPEG2000 33.56 dB, 6986 B CAT 33.75 dB, 6873 B

L. DEMARET, A. ISKE, W. KHACHABI Sparse Representation of Video Data by Adaptive Tetrahedralizations , to appear in Proc. of the Workshop Local Adaptive Filters, EURANDOM, november 2008 L. DEMARET, A. ISKE, W. KHACHABI Contextual image compression from adaptive sparse data representations, Proc. of this conference