Academic Journals Database
Disseminating quality controlled scientific knowledge

Facial Image Compression Based on Structured Codebooks in Overcomplete Domain

ADD TO MY LIST
 
Author(s): Vila-Forcén JE | Voloshynovskiy S | Koval O | Pun T

Journal: EURASIP Journal on Advances in Signal Processing
ISSN 1687-6172

Volume: 2006;
Issue: 1;
Start page: 069042;
Date: 2006;
Original page

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.
Save time & money - Smart Internet Solutions     

Tango Rapperswil
Tango Rapperswil