Facial image compression based on structured codebooks in overcomplete domain
Summary: 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.
- Facial image compression based on wavelet transform and vector quantization
- Low-complexity compression algorithm for hyperspectral images based on distributed source coding
- Adaptive image compression using local pattern information
- Distributed source coding techniques for lossless compression of hyperspectral images
- Segmentation based coding of human face images for retrieval
This page was built for publication: Facial image compression based on structured codebooks in overcomplete domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871504)