List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Lossless Grey-scale Image Compression Using Source Symbols Reduction and Huffman Coding
Full text
 PDF(203.7KB)
Source 
International Journal of Image Processing (IJIP)
Table of Contents
Download Complete Issue    PDF(3.43MB)
Volume:  3    Issue:  5
Pages:  184-251
Publication Date:   November 2009
ISSN (Online): 1985-2304
Pages 
246 - 251
Author(s)  
Saravanan C - India
Ponalagusamy R - India
 
Published Date   
30-11-2009 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   lossless image compression, source symbols reduction, Huffman coding 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. OpenJ-Gate
3. Docstoc
4. Scribd
5. PDFCAST
6. CiteSeerX
7. ScientificCommons
8. WorldCat
9. Google Scholar
10. Academic Index
11. refSeek
12. ResearchGATE
13. Bielefeld Academic Search Engine (BASE)
14. iSEEK
15. Socol@r
 
 
Usage of Images have been increased and used in many applications. Image compression plays vital role in saving storage space and saving time while sending images over network. A new compression technique has been proposed to achieve more compression ratio by reducing number of source symbols. The source symbols are reduced by applying source symbols reduction and further the Huffman Coding is applied to achieve compression. The source symbols reduction technique reduces the number of source symbols by combining together to form a new symbol. Thus the number of Huffman Code to be generated also reduced. The Huffman code symbols reduction achieves better compression ratio. The experiment has been conducted using the proposed technique and the Huffman Coding on standard images. The experiment result has been analyzed and the result shows that the newly proposed compression technique achieves 10% more compression ratio than the regular Huffman Coding. 
 
 
 
1 Gonzalez, R.C. and Woods, R.E., Digital Image Processing 2nd ed., Pearson Education, India, 2005.
2 Salomon, Data Compression, 2nd Edition. Springer, 2001.
3 Othman O. Khalifa, Sering Habib Harding and Aisha-Hassan A. Hashim, Compression using Wavelet Transform, Signal Processing: An International Journal, Volume (2), Issue (5),2008, pp. 17-26.
4 Singara Singh , R. K. Sharma, M.K. Sharma, Use of Wavelet Transform Extension for Graphics Image Compression using JPEG2000 Framework, International Journal of Image Processing, Volume 3, Issue 1, Pages 55-60, 2009.
5 Abramson, N., Information Theory and Coding, McGraw-Hill, New York, 1963.
6 Huffman, D.A., A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. 40(9), pp.1098-1101, 1952.
7 Steven Pigeon, Yoshua Bengio — A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols — Université de Montréal, Rapport technique #1081.
8 Steven Pigeon, Yoshua Bengio — A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols Revisited — Université de Montréal, Rapport technique #1095.
9 R.G. Gallager — Variation on a theme by Huffman — IEEE. Trans. on Information Theory, IT-24(6), 1978, pp. 668-674.
10 D.E. Knuth — Dynamic Huffman Coding — Journal of Algorithms, 6, 1983 pp. 163-180.
11 J.S. Vitter — Design and analysis of Dynamic Huffman Codes — Journal of the ACM, 34#4, 1987, pp. 823-843.
12 Chiu-Yi Chen; Yu-Ting Pai; Shanq-Jang Ruan, Low Power Huffman Coding for High Performance Data Transmission, International Conference on Hybrid Information Technology, 2006, 1(9-11), 2006 pp.71 – 77.
13 Lakhani, G, Modified JPEG Huffman coding, IEEE Transactions Image Processing, 12(2), 2003 pp. 159 – 169.
14 R. Ponalagusamy and C. Saravanan, Analysis of Medical Image Compression using Statistical Coding Methods, Advances in Computer Science and Engineering: Reports and Monographs, Imperial College Press, UK, Vol.2., pp 372-376, 2007.
 
 
 
 
 
 
 
 
Saravanan C : Colleagues
Ponalagusamy R : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.