Open Access Open Access  Restricted Access Subscription Access

Hybrid Image Compression using Modified Singular Value Decomposition and Adaptive Set Partitioning in Hierarchical Tree


Affiliations
1 Department of Electronics, Kuvempu University Shankaraghatta, Shimoga – 577451, Karnataka, India
2 Department of Physics, Karnataka University, Pavate Nagar, Dharwad – 580003, Karnataka, India
 

Objectives: Image communication in web applications becomes handy because of highly developed compression tools. Human eye fixate on an image’s preview, carefully adjusting the quality and optimization settings until we’ve found that sweet spot, where the file size and quality are both the best they can possibly be. Method: This paper presents a new algorithm, which uses modified singular value decomposition (SVD) and adaptive Set Partition Hierarchical Tree (ASPIHT) for grayscale image compression. This hybrid method uses modified rank one updated SVD as a pre-processing step for ASPIHT to increase the quality of the reconstructed image. Findings: The high energy compaction in SVD process offers high image quality with less compression and requires a number of bits for reconstruction. On the other hand, ASPIHT compression also offers high image quality by coding more significant coefficients adaptively with high compression at specified bitrates. The proposed method is a combination of both SVD and ASPIHT for image compression and is tested with several test images and results are compared with those of SPIHT, ASPIHT without arithmetic coding and JPEG2000. Novelty: This method improves the quality of reconstruction without altering the compression rates of SPIHT algorithm. The tabulated results show significant improvement in PSNR at higher compression ratios as compared to other methods.

Keywords

Adaptive Set Partitioned Hierarchical Tree, Image Compression, Rank One Updated Singular Value Decomposition
User

Abstract Views: 227

PDF Views: 0




  • Hybrid Image Compression using Modified Singular Value Decomposition and Adaptive Set Partitioning in Hierarchical Tree

Abstract Views: 227  |  PDF Views: 0

Authors

R. Naveen Kumar
Department of Electronics, Kuvempu University Shankaraghatta, Shimoga – 577451, Karnataka, India
B. N. Jagadale
Department of Electronics, Kuvempu University Shankaraghatta, Shimoga – 577451, Karnataka, India
J. S. Bhat
Department of Physics, Karnataka University, Pavate Nagar, Dharwad – 580003, Karnataka, India

Abstract


Objectives: Image communication in web applications becomes handy because of highly developed compression tools. Human eye fixate on an image’s preview, carefully adjusting the quality and optimization settings until we’ve found that sweet spot, where the file size and quality are both the best they can possibly be. Method: This paper presents a new algorithm, which uses modified singular value decomposition (SVD) and adaptive Set Partition Hierarchical Tree (ASPIHT) for grayscale image compression. This hybrid method uses modified rank one updated SVD as a pre-processing step for ASPIHT to increase the quality of the reconstructed image. Findings: The high energy compaction in SVD process offers high image quality with less compression and requires a number of bits for reconstruction. On the other hand, ASPIHT compression also offers high image quality by coding more significant coefficients adaptively with high compression at specified bitrates. The proposed method is a combination of both SVD and ASPIHT for image compression and is tested with several test images and results are compared with those of SPIHT, ASPIHT without arithmetic coding and JPEG2000. Novelty: This method improves the quality of reconstruction without altering the compression rates of SPIHT algorithm. The tabulated results show significant improvement in PSNR at higher compression ratios as compared to other methods.

Keywords


Adaptive Set Partitioned Hierarchical Tree, Image Compression, Rank One Updated Singular Value Decomposition



DOI: https://doi.org/10.17485/ijst%2F2017%2Fv10i28%2F155978