Scientific article
Open access

Facial Image Compression Based on Structured Codebooks in Overcomplete Domain

Published inEURASIP journal on applied signal processing, vol. 2006, no. 69042, p. 1-11
Publication date2006

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.[12345678910111213141516171819202122232425262728293031

Citation (ISO format)
VILA FORCEN, Jose Emilio et al. Facial Image Compression Based on Structured Codebooks in Overcomplete Domain. In: EURASIP journal on applied signal processing, 2006, vol. 2006, n° 69042, p. 1–11. doi: 10.1155/ASP/2006/69042
Main files (1)
Article (Published version)
ISSN of the journal1110-8657

Technical informations

Creation03/03/2015 4:36:17 PM
First validation03/03/2015 4:36:17 PM
Update time03/14/2023 10:57:16 PM
Status update03/14/2023 10:57:16 PM
Last indexation08/29/2023 3:05:34 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack