This paper describes a novel approach to digital image compression using a new mathematical transform: the curvelet transform. The transform has shown promising results over wavelet transform for 2-D signals. Wavelets, though well suited to point singularities have limitations with orientation selectivity, and therefore, do not represent two-dimensional singularities (e.g. smooth curves) effectively. This paper employs the Curvelet transform for image compression, exhibiting good approximation properties for smooth 2D functions. Curvelet improves wavelet by incorporating a directional component. The Curvelet transform finds a direct discrete-space construction and is therefore computationally efficient. In this paper, we divided 2-D spectrum into fine slices using iterated tree structured filter bank. Different amount of quantized curvelet coefficients were then selected for lossy compression and entropy encoding. A comparison with wavelet based compression was made for standard images like Lena, Barbara, etc. Curvelet transform has resulted in high quality image compression for natural images. Our implementation offers exact reconstruction, prone to perturbations, ease of implementation and low computational complexity. The algorithm works fairly well for grayscale and colored images.
|Title of host publication||2005 Pakistan Section Multitopic Conference, INMIC|
|Publication status||Published - 1 Dec 2005|
|Event||2005 Pakistan Section Multitopic Conference, INMIC - Karachi, Pakistan|
Duration: 24 Dec 2005 → 25 Dec 2005
|Conference||2005 Pakistan Section Multitopic Conference, INMIC|
|Abbreviated title||INMIC 2005|
|Period||24/12/05 → 25/12/05|