This paper emphasizes on designing of a novice quantizer that is more suitable for compressing images through new transform known as curvelet transform. The new transform is believed to capture image information more efficiently than the wavelet transform by providing basis elements in addition to possessing the qualities of wavelet. It was designed to represent edges and other singularities along curves much more efficiently than traditional transforms, i.e. using many fewer coefficients for a given accuracy of reconstruction. This compression algorithm is tested on various images like plain, textured and building images. The results are compared with the existing techniques like curvelet with existing quatizer, wavelet with existing quantizer and wavelet with proposed quantzer. The proposed algorithm “curvelets with proposed quantizer” outperforms the existing techniques. The performance is evaluated through visual clarity, Peak Signal to Noise Ratio (PSNR) and compression metrics such as Compression ratio and Bit-rate.

">

Curvelets with New Quantizer for Image Compression

G. Jagadeeswar Reddy*, T. Jaya Chandra Prasad**, M. N. Giri Prasad***, M. Madhavi Latha****, T. Satya Savithri*****
ECE Department, EVMCET, AP, India
ECE Department, RGMCET, Kurnool, AP, India.
ECE Department, JNTUCE, Pulivendula, AP, India.
ECE Department, JNTUH, Hyderabad, A.P, India.
ECE Department, JNTUH, Hyderabad, A.P, India.
Periodicity:February - April'2012
DOI : https://doi.org/10.26634/jcs.1.2.1771

Abstract

This paper emphasizes on designing of a novice quantizer that is more suitable for compressing images through new transform known as curvelet transform. The new transform is believed to capture image information more efficiently than the wavelet transform by providing basis elements in addition to possessing the qualities of wavelet. It was designed to represent edges and other singularities along curves much more efficiently than traditional transforms, i.e. using many fewer coefficients for a given accuracy of reconstruction. This compression algorithm is tested on various images like plain, textured and building images. The results are compared with the existing techniques like curvelet with existing quatizer, wavelet with existing quantizer and wavelet with proposed quantzer. The proposed algorithm “curvelets with proposed quantizer” outperforms the existing techniques. The performance is evaluated through visual clarity, Peak Signal to Noise Ratio (PSNR) and compression metrics such as Compression ratio and Bit-rate.

Keywords

Quantizer, Compression ratio, Bit-rate, curvelet, wavelet

How to Cite this Article?

Reddy, G. J., Jayachandraprasad, T., Giriprasad, M. N., Latha, M. M., and Savithri, T. S. (2012). Curvelets With New Quantizer For Image Compression. i-manager’s Journal on Communication Engineering and Systems, 1(2), 12-16. https://doi.org/10.26634/jcs.1.2.1771

References

[1]. F.G. Meyer and R.R. Coifman (1997 ). “Brushlets: a tool for directional image analysis and image compression,” Applied and Computational Harmonic Analysis, pp.147- 187.
[2]. Colm Mulcahy, “Image compression using the Haar wavelet transform” Spelman Science and Math journal, pp:22-31.
[3]. J. Rissanen, “Stochastic Complexity in Statistical Inquiry,” World Scientific, 189.
[4]. G.J. Sullivan (1996 ). “Efficient Scalar Quantization of Exponential and Laplacian Random Variables,” IEEE Trans. on Information Theory,Vol. 42, No.5, pp.1365-1374; Sept .
[5]. M.N. Do, and M. Vetterli (2000). “Orthonormal finite ridgelet transform for image compression,” in proc. IEEE Int. Conf. Image Processing (ICIP), Sept.
[6]. Pat Yip, (2000). “The Transform and Data Compression Handbook”, CRC Press ; sept.
[7]. M.L. Hilton, (1994). “Compressing still and Moving Images with wavelets”, Multimedia systems, Vol.2, No.3.
[8]. Anil K. Jain, (2000). “Fundamentals of Digital Image Processing”, Prentice Hall.
[9]. E.J. Candes and D.L. Donoho, (1999). “Curvelets.” Manuscript. http://www.stat.stanford.edu/~donoho/ Reports/1998/curvelets.zip; 1999.
[10]. Candes, E., Demanet, L., Donoho, D., and Ying, L. (2005). “Fast Discrete Curvelet Transforms,” Applied and Comp. Math., Caltech; July.
[11]. M. Frazier, B. Jawerth, and G. Weiss, (1991). “Littlewood- Paley Theory and the study of function spaces”. NSF-CBMS Regional Conf. Ser in Mathematics, 79. American Math. Soc.: Providence, RI; 1991.
[12]. D. Marr and E. Hildreth, (1980). “Theory of edge detection," Proc. Royal Society of London B 207, pp. 187- 217.
[13]. S.G. Mallat, (1989). “A theory for multiresolution signal decomposition: the wavelet representation," IEEE Transactions on Pattern Analysis and Machine Intelligence 11(7), pp. 674-693.
[14]. E. Simoncelli, W. Freeman, E. Adelson, and D. Heeger, “Shiftable multi-scale transforms [or "what's wrong with orthonormal wavelets"]," IEEE Trans. Information Theory ;1992.
[15]. B. Alpert, G. Beylkin, R. Coifman, and V. Rokhlin, (1993). “Wavelet-like bases for the fast solution of secondkind integral equations," SIAM J. Sci. Comput.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.