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

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 Image Compression Algorithm for Discontinuous Series of Similar Pixels

by Kshitiz Agarwal, Karm Veer Arya
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 17
Year of Publication: 2010
Authors: Kshitiz Agarwal, Karm Veer Arya
10.5120/355-538

Kshitiz Agarwal, Karm Veer Arya . An Image Compression Algorithm for Discontinuous Series of Similar Pixels. International Journal of Computer Applications. 1, 17 ( February 2010), 89-90. DOI=10.5120/355-538

@article{ 10.5120/355-538,
author = { Kshitiz Agarwal, Karm Veer Arya },
title = { An Image Compression Algorithm for Discontinuous Series of Similar Pixels },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 17 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 89-90 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number17/355-538/ },
doi = { 10.5120/355-538 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:43:02.144465+05:30
%A Kshitiz Agarwal
%A Karm Veer Arya
%T An Image Compression Algorithm for Discontinuous Series of Similar Pixels
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 17
%P 89-90
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper represents lossy compression technique which can be effectively used for correlated pixels in both continuous and discontinuous series. Generally, compression is achieved by reducing redundancy through removal of similar pixels. Here, dependency of effective compression over their continuity has been removed. The efficiency of the proposed method has been described mathematically, proving it suitable for higher bit images.

References
  1. Christopher H. Messom, Gourab Sen Gupta and Serge N. Demidenko "Hough Transform Run Length Encoding for Real Time Image Processing" IEEE transactions on instrumentation and measurement, vol. 56, no. 3, June 2007.
  2. Nikolay Manchev "Parallel algorithm for Run Length Encoding", Proceedings of third international conference on information theory, 2006.
  3. J. Trein, A.Th.Schwarzbacher, B. Hoppe and K.-H. Noffz "A Hardware Implementation of a Run Length Encoding Compression Algorithm with Parallel Inputs", ISSC 2008, Galway, June 18-19.
  4. C.E Shannon and D.A Huffman "Optimizing a Scheme for Run-Length Encoding", Proceedings of IEEE, January 1969.
  5. Hatsukazu Tanaka and Alberto leon- Garcia "Efficient Run-Length Encodings", IEEE Transactions on Information Theory, vol. it-28, no. 6, November 1982.
  6. Chengjie Tu, Jie Liang and Trac D. Tran "Adaptive Runlength Coding", IEEE ICIP 2002.
  7. Salomon.(2004). Data compression Complete Reference, 3ed. New York: Springer.
  8. Bell, T. C., I. H. Witten, and J. G. Cleary (1990) Text Compression, Englewood Cliffs, NJ, Prentice-Hall.
  9. Golomb, Solomon W. (1966) "Run-Length Encodings," IEEE Transactions on Information Theory IT-12(3):399-401.
Index Terms

Computer Science
Information Sciences

Keywords

Compression Ratio Run length encoding

Powered by PhDFocusTM