Paper
13 November 2003 Very low bit rate image coding using redundant dictionaries
Lorenzo Peotta, Lorenzo Granai, Pierre Vandergheynst
Author Affiliations +
Abstract
Very low bit rate image coding is an important problem regarding applications such as storage on low memory devices or streaming data on the internet. The state of the art in image compression is to use 2-D wavelets. The advantages of wavelet bases lie in their multiscale nature and in their ability to sparsely represent functions that are piecewise smooth. Their main problem on the other hand, is that in 2-D wavelets are not able to deal with the natural geometry of images, i.e they cannot sparsely represent objects that are smooth away from regular submanifolds. In this paper we propose an approach based on building a sparse representation of images in a redundant geometrically inspired library of functions, followed by suitable coding techniques. Best N-term non- linear approximations in general dictionaries is, in most cases, a NP-hard problem and sub-optimal approaches have to be followed. In this work we use a greedy strategy, also known as Matching Pursuit to compute the expansion. Finally the last step in our algorithm is an enhancement layer that encodes the residual image: in our simulation we have used a genuine embedded wavelet codec.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lorenzo Peotta, Lorenzo Granai, and Pierre Vandergheynst "Very low bit rate image coding using redundant dictionaries", Proc. SPIE 5207, Wavelets: Applications in Signal and Image Processing X, (13 November 2003); https://doi.org/10.1117/12.505452
Lens.org Logo
CITATIONS
Cited by 25 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Chemical species

Associative arrays

Wavelets

Image compression

JPEG2000

Linear filtering

Image enhancement

Back to Top