CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Enhanced Run Length Coding for JPEG Image Compression

by Amritpal Singh, V. P Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 72 - Number 20
Year of Publication: 2013
Authors: Amritpal Singh, V. P Singh
10.5120/12658-9304

Amritpal Singh, V. P Singh . An Enhanced Run Length Coding for JPEG Image Compression. International Journal of Computer Applications. 72, 20 ( June 2013), 21-26. DOI=10.5120/12658-9304

@article{ 10.5120/12658-9304,
author = { Amritpal Singh, V. P Singh },
title = { An Enhanced Run Length Coding for JPEG Image Compression },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 72 },
number = { 20 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 21-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume72/number20/12658-9304/ },
doi = { 10.5120/12658-9304 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:38:26.127983+05:30
%A Amritpal Singh
%A V. P Singh
%T An Enhanced Run Length Coding for JPEG Image Compression
%J International Journal of Computer Applications
%@ 0975-8887
%V 72
%N 20
%P 21-26
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Run length coding is the standard coding technique for compressing the images, especially when images are compressed by block transformation. This method counts the number of repeated zeros which is represented as RUN and appends the non-zero coefficient represented as LEVEL following the sequence of zeros. Then it was observed that for the occurrence of consecutive non-zero sequence the value of RUN is zero for most of the time, so this redundancy was removed by encoding the non zero coefficient (LEVEL) only, instead of an ordered pair of RUN (= 0)/ LEVEL. According to this scheme the single zero present between two non zero coefficients would be encoded as (1,0) . The proposed work aims at removing the unintended RUN, LEVEL (1,0) pair used for a single zero present between the two non-zero characters. So instead of using (1,0) pair for the zero between non-zero characters, a single '0' will be encoded. The proposed scheme has been tested on various images and results confirmed that the proposed run length scheme produces effective results.

References
  1. T. Cebrail, S. K. Sarikoz, "An overview of Image Compression Approaches", The 3rd International conference on Digital Telecommunications, IEEE 2008.
  2. R C. Gonzalez and R E. Woods, Digital Image Processing. Prentice-Hall, 2008.
  3. Jain A. K. - "Fundamentals of Digital Image Processing", Prentice Hall, 1989.
  4. G. K. Wallace, 'The JPEG Still Picture Compression Standard', Communications of the ACM, Vol. 34, Issue 4, pp. 30-44.
  5. W. B. Pennebaker, J. L. Mitchell, "JPEG still image data compression standard", Van Nostrand Reinland, New York, 1993.
  6. Z. Wang, G. Wu, H. R. Sheikh, E. P. Simoncelli, E. H. Yang, A. C. Bovik," Quality aware images" IEEE Trans. Image Processing, vol. 15, pp. 1680-1689, June 2006.
  7. N. Ahmed, T. Natarajan, and K. R. Rao. "Discrete cosine transform," IEEE Trans. Comput. , vol. C-23, pp. 90-93, Jan. 1974.
  8. Beaudoin, Normand," An Accurate Discrete Fourier Transform for image processing", Pattern Recognition, Vol. 3, pp. 935-939, 2002.
  9. R. C. Reininger, J. D. Gibson, "Distribution of Two Dimensional DCT Coefficients for Images" IEEE Trans. Comm. Vol. 31, pp. 835-839, June, 1983.
  10. H. A. Peterson, H. Peng. J. H. Morgan, W. B. Pennebaker, "Quantization of color image components in the DCT domain", Human Vision, Visual Processing, and Digital Display. Proc. SPIE, pp. 210-222, 1991.
  11. A. J. Ahumada Jr. , H. A. Peterson, "Luminance Model-Based DCT Quantization for color Image Compression" Human Vision, Visual Processing, and Digital Display III, B. E. Rogowitz, ed. , SPIE, 1992.
  12. N. Ponomarenko, V. Lukin, K. Egiazarian, E. Delpc," Comparison of Lossy Compression performance on Natural color Images", IEEE 2009.
  13. Wai C. Chu, "On Lossless and Lossy Compression of Step Size Matrices in Jpeg Coding" IEEE 2013.
  14. O. Johnson, "On the Redundancy of Binary Huffman Codes" IEEE Trans. Inform. Theory, Vol. IT-26, No-2, pp. 220-223, Mar. 1980.
  15. C. Tu, J. Liang, and T. D. Tran, "Adaptive run-length coding," IEEE Signal Processing Letters, vol. 10, pp. 61-64, Mar. 2003.
  16. E. H Yang and L. Wang, "Joint optimization of run-length coding, Huffman coding and quantization table with complete baseline JPEG decoder compatibility," in Proc. ICIP 2007, vol. 3, pp. 181- 184, Sept. 2007.
  17. Akhtar M. B. , Qureshi A. M. , Qamar-ul-Islam, "Optimized Run length coding for jpeg Image Compression used in Space Research Program of IST", IEEE 2011.
  18. Zhou Wang and Alan C. Bovik, "Mean squared error, Love it or leave it?", IEEE Signal Processing Magazine Jan 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Image Compression JPEG entropy coding run length coding

Powered by PhDFocusTM