EURASIP Journal on Applied Signal Processing 
Volume 2006 (2006), Article ID 69042, 11 pages
doi:10.1155/ASP/2006/69042

Facial Image Compression Based on Structured Codebooks in Overcomplete Domain

J. E. Vila-Forcén, S. Voloshynovskiy, O. Koval, and T. Pun

Stochastic Image Processing Group, CUI, University of Geneva, 24 rue du Général-Dufour, Geneva 1211, Switzerland

Received 31 July 2004; Revised 16 June 2005; Accepted 27 June 2005

Abstract

We advocate facial image compression technique in the scope of distributed source coding framework. The novelty of the proposed approach is twofold: image compression is considered from the position of source coding with side information and, contrarily to the existing scenarios where the side information is given explicitly; the side information is created based on a deterministic approximation of the local image features. We consider an image in the overcomplete transform domain as a realization of a random source with a structured codebook of symbols where each symbol represents a particular edge shape. Due to the partial availability of the side information at both encoder and decoder, we treat our problem as a modification of the Berger-Flynn-Gray problem and investigate a possible gain over the solutions when side information is either unavailable or available at the decoder. Finally, the paper presents a practical image compression algorithm for facial images based on our concept that demonstrates the superior performance in the very-low-bit-rate regime.