IDEAS home Printed from https://ideas.repec.org/a/ijs/ijsrse/v2y2016i3idhijsrset16236.html

Modified Huffman Algorithm for Image Encoding and Decoding

Author

Listed:
  • Sona Khanna
  • Suman Kumari
  • Tadir

Abstract

Lossless compression of a progression of symbols is a decisive part of data and signal compression. Huffman coding is lossless in nature; it is also generally utilized in lossy compression as the eventual step after decomposition and quantization of a signal. In signal compression, the disintegration and quantization part seldom manages to harvest a progression of completely autonomous symbols. Here we present a schema giving prominent results than forthright Huffman coding by exploiting this fact. We cleft the inceptive symbol sequence into two arrangements in such a way that the symbol statistics are, sanguinely, different for the two possessions. Sole Huffman coding for each of these disposition will reduce the average bit rate. This split is done recursively for each arrangement until the cost league with the split is larger than the attainment. Assay was done on distinct signals. The harvest using the cleft schema was a bit rate devaluation of ordinarily besides than 10% compared to forthright Huffman coding, and 0- 15% surpassing than JPEG-like Huffman coding, inimitable at low bit rates.

Suggested Citation

  • Sona Khanna & Suman Kumari & Tadir, 2016. "Modified Huffman Algorithm for Image Encoding and Decoding," International Journal of Scientific Research in Science, Engineering and Technology, International Journal of Scientific Research in Science, Engineering and Technology, vol. 2(3), pages 444-448, June.
    • Handle: RePEc:ijs:ijsrse:v2:y2016:i3:id:hijsrset16236
    Note: Article URL: https://ijsrset.com/IJSRSET16236
    as

    Download full text from publisher

    File URL: https://ijsrset.com/IJSRSET16236
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrset.com/paper/1313.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ijs:ijsrse:v2:y2016:i3:id:hijsrset16236. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrset.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.