Abstract

This paper uses the newly developed concept of ‘sparsity’ in signal processing to the context of Image Compression. The first step of the scheme is to use a sparsifying transform on the image. The sparse set of coefficients is encoded via Sparse PCA. Wavelet Transform had been used profusely for image compression tasks. But the choice is not the ideal one. The partial reconstruction error from wavelet coefficients is an order of magnitude higher than the ideal error rate. In this paper image compression is carried in the curvelet domain—a better choice compared to wavelets, at least theoretically, since the reconstruction error rate with curvelet coefficients is of the same asymptotic order as that of the ideal error rate. The compression scheme is tested on the Lena and Barbara image as well as the USPS and Yale Face databases.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.