Novel Color Image Compression Algorithm Based-On Quadtree

α
Dr. A. A. El-Harby
Dr. A. A. El-Harby
σ
G. M. Behery
G. M. Behery
α Damietta University

Send Message

To: Author

Novel Color Image Compression Algorithm Based-On Quadtree

Article Fingerprint

ReserarchID

CSTGV611Z2

Novel Color Image Compression Algorithm Based-On Quadtree Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

This paper presents a novel algorithm having two image processing systems that have the ability to compress the colour image. The proposed systems divides the colour image into RGB components, each component is selected to be divided. The division processes of the component into blocks are based on quad tree method. For each selection, the other two components are divided using the same blocks coordinates of the selected divided component. In the first system, every block has three minimum values and three difference values. While the other system, every block has three minimum values and one average difference. From experiments, it is found that the division according to the G component is the best giving good visual quality of the compressed images with appropriate compression ratios. It is also noticed, the performance of the second system is better than the first one. The obtained compression ratios ofthe second system are between 1.3379 and 5.0495 at threshold value 0.1, and between 2.3476 and 8.9713 at threshold value 0.2.

References

31 Cites in Article
  1. Arash Abadpour,Shohreh Kasaei (2005). Color PCA eigenimages and their application to compression and watermarking.
  2. Fouzi Douak,Redha Benzid,Nabil Benoudjit (2011). Color image compression algorithm based on the DCT transform combined to an adaptive block scanning.
  3. Amit Phadikar,P Santi,Maity (2010). Quality access control of compressed color images using data hiding.
  4. Evgeny Gershikov,Emilia Lavi-Burlak,Moshe Porat (2007). Correlation-based approach to color image compression.
  5. B Sowmya,B Sheela Rani (2011). Colour image segmentation using fuzzy clustering techniques and competitive neural network.
  6. S Immanuel Alex Pandian,J Anitha (2009). A Neural Network Approach for Color Image Compression in Transform Domain.
  7. W Kurdthongmee (2008). A novel hardware-oriented Kohonen SOM image compression algorithm and its FPGA implementation.
  8. N Sudha (2004). An ASIC implementation of Kohonen's map based colour image compression.
  9. Joewono Widjaja (2012). Noisy face recognition using compression-based joint wavelet-transform correlator.
  10. Hong Pan,Li-Zuo Jin,Xiao-Hui Yuan,Si-Yu Xia,Liang-Zheng Xia (2010). Context-based embedded image compression using binary wavelet transform.
  11. M S Joshi,R R Manthalhkar,Y V Joshi (2010). Color Image Compression Using Wavelet and Ridgelet Transform.
  12. Loay George,Eman Al-Hilo (2011). Speeding-up Fractal Color Image Compression Using Moments Features Based on Symmetry Predictor.
  13. Loay George,Eman Al-Hilo (2010). Isometric process behavior in fractal color image compression by zero-mean method.
  14. S Ghosh,J Mukherjee (2004). A novel fractal technique for color image compression.
  15. Helmut Jürgensen,Ludwig Staiger,Hideki Yamasaki (2007). Finite automata encoding geometric figures.
  16. Yung-Kuan Chan (2004). Block image retrieval based on a compressed linear quadtree.
  17. N Udaya Kumar1,K Vasavi (2011). AN EFFICIENT COLOR CODING SCHEME FOR COLOR IMAGES USING QUAD TREE DECOMPOSITION AND COLOR PALETTES.
  18. Yuancheng Li,Qiu Yang,Runhai Jiao (2010). Image compression scheme based on curvelet transform and support vector machine.
  19. Bibhas Chandra Dhara,Bhabatosh Chanda (2007). Color image compression based on block truncation coding using pattern fitting principle.
  20. G Sreelekha,P Sathidevi (2010). An HVS based adaptive quantization scheme for the compression of color images.
  21. Satish Kumar Singh,Shishir Kumar (2011). Novel adaptive color space transform and application to image compression.
  22. Pan-Pan Niu,Xiang-Yang Wang,Yi-Ping Yang,Ming-Yu Lu (2011). A novel color image watermarking scheme in nonsampled contourlet-domain.
  23. Kuo-Liang Chung,Hsu-Lien,Hsueh-I Huang,Lu (2004). Efficient region segmentation on compressed gray images using quadtree and shading representation.
  24. Guangtao Zhai,Weisi Lin,Jianfei Cai,Xiaokang Yang,Wenjun Zhang (2009). Efficient quadtree based block-shift filtering for deblocking and deranging.
  25. Kazuya Sasazaki,Sato Saga,Junji Maeda,Yukinori Suzuki (2008). Vector quantization of images with variable block size.
  26. R Kutil,C Gfrerer (2011). A generalization of quad-trees applied to lossy image coding.
  27. D Anand Kumar1,Ch Demudubabu,Mohan Babu (2012). Image compression using area subdivision algorithm relying on Quadtree.
  28. A El-Harby,G Behery (2008). Qualitative Image Compression Algorithm Relying on Quadtree.
  29. Evgeny Gershikov,Moshe Porat (2007). On color transforms and bit allocation for optimal subband image compression.
  30. Bibhas Chandra,Dhara,Bhabatosh Chand (2007). Color image compression based on block truncation coding using pattern fitting principle.
  31. Muhammad Rahman,Mohammad Ehsan Shahmi Chowdhury (2003). A New Approach to Detect Deepfake Video using Multi-Input Convolutional Neural Network.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. A. A. El-Harby. 2012. \u201cNovel Color Image Compression Algorithm Based-On Quadtree\u201d. Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 12 (GJCST Volume 12 Issue F13): .

Download Citation

Issue Cover
GJCST Volume 12 Issue F13
Pg. 13- 22
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

October 22, 2012

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 10208
Total Downloads: 2654
2026 Trends
Related Research

Published Article

This paper presents a novel algorithm having two image processing systems that have the ability to compress the colour image. The proposed systems divides the colour image into RGB components, each component is selected to be divided. The division processes of the component into blocks are based on quad tree method. For each selection, the other two components are divided using the same blocks coordinates of the selected divided component. In the first system, every block has three minimum values and three difference values. While the other system, every block has three minimum values and one average difference. From experiments, it is found that the division according to the G component is the best giving good visual quality of the compressed images with appropriate compression ratios. It is also noticed, the performance of the second system is better than the first one. The obtained compression ratios ofthe second system are between 1.3379 and 5.0495 at threshold value 0.1, and between 2.3476 and 8.9713 at threshold value 0.2.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Novel Color Image Compression Algorithm Based-On Quadtree

Dr. A. A. El-Harby
Dr. A. A. El-Harby Damietta University
G. M. Behery
G. M. Behery

Research Journals