Research Article | OPEN ACCESS
Lossy Image Compression by Rounding the Intensity Followed by Dividing (RIFD)
Dr. M.A. Otair and F. Shehadeh
Faculty of Computer Sciences and Informatics, Amman Arab University, 11953 Amman, Jordan
Research Journal of Applied Sciences, Engineering and Technology 2016 6:680-685
Received: August 5, 2015 | Accepted: September 7, 2015 | Published: March 15, 2016
Abstract
Several millions of digital images are transmitted every minute via mobile applications. The main feature of these images is their huge sizes. However, most of their details are not important such as natural images. Continuous efforts are achieved to utilize the wireless bandwidth and capacity for mobile users. One of the most significant efforts is the image compression. The aim of this study is to introduce a new lossy technique called RFID for compressing images, in order to overcome these problems by achieving high compression ratio. The proposed technique depends on increasing the redundancy and similarity among the neighboring pixels of images by rounding the pixels' intensities followed by the dividing process, which makes compression feasible. It can be applied alone or followed by any lossless compression algorithm. Experimental results show a great performance when RIFD followed by Huffman algorithm.
Keywords:
Compression ratio, huffman algorithm, lossy compression, mobile applications,
References
-
Ames, G., 2002. Image Compression. Retrieved form: www.cis.upenn.edu/~eas205.
Direct Link -
Frendendall, G.L. and W.L. Behrend, 1960. Picture quality-procedures for evaluating subjective effects of interference. P. IRE, 48: 1030-1034.
CrossRef -
Gautam, B., 2010. Image compression using discrete cosine transform & discrete wavelet transform. B.Sc. Thesis, National Institute of Technology.
-
Huffman, D.A., 1952. A method for the construction of minimum-redundancy codes. P. IRE, 40(9): 1098-1101.
CrossRef -
Kodituwakku, S.R. and U.S. Amarasinghe, 2007. Comparison of lossless data compression algorithms for text data. Indian J. Comput. Sci. Eng., 1(4): 416-425.
-
Mathur, M.K., S. Loonker and D. Saxena, 2012. Lossless Huffman coding technique for image compression and reconstruction using binary trees. Int. J. Comp. Tech. Appl., 3(1): 76-79.
-
Nelson, M., 1992. The Data Compression Book. M&T Books, New York.
-
Pane, J.F. and L. Joe, 2005. Making better use of bandwidth data compression and network management technologies. Prepared for the United States Army, The RAND Corporation.
-
Starosolski, R., 2007. Simple fast and adaptive lossless image compression algorithm. Software Pract. Exper., 37(1): 65-91.
CrossRef -
Verma, P., P. Verma, A. Sahu, S. Sahu and N. Sahu, 2012. Comparison between different compression and decompression techniques on MRI scan images. Int. J. Adv. Res. Comput. Eng. Technol. (IJARCET), 1(7): 109-113.
-
Wei, W., 2008. An Introduction to Image Compression. National Taiwan University, Taipei, Taiwan, ROC, 2008.
-
White Paper, 2008. An Explanation of Video Compression Techniques. Axis Communications.
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|