Image Compression using Approximate Matching and Run Length
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 6
Abstract
Image compression is currently a prominent topic for both military and commercial researchers. Due to rapid growth of digital media and the subsequent need for reduced storage and to transmit the image in an effective manner Image compression is needed. Image compression attempts to reduce the number of bits required to digitally represent an image while maintaining its perceived visual quality. This study concentrates on the lossless compression of image using approximate matching technique and run length encoding. The performance of this method is compared with the available jpeg compression technique over a wide number of images, showing good agreements.
Authors and Affiliations
Samir Kumar Bandyopadhyay , Tuhin Utsab Paul , Avishek Raychoudhury
Keywords
Related Articles
- EP ID EP124396
- DOI -
- Views 81
- Downloads 0
The Mathematical Model of Hybrid Schema Matching based on Constraints and Instances Similarity
Schema matching is a crucial issue in applications that involve multiple databases from heterogeneous sources. Schema matching evolves from a manual process to a semi-automated process to effectively guide users in findi...
Comparison between Traditional Approach and Object-Oriented Approach in Software Engineering Development
This paper discusses the comparison between Traditional approaches and Object-Oriented approach. Traditional approach has a lot of models that deal with different types of projects such as waterfall, spiral, iterative an...
An Improved Homomorphic Encryption for Secure Cloud Data Storage
Cloud computing is the budding paradigm nowadays in the world of computer. It provides a variety of services for the users through the Internet and is highly cost-efficient and flexible. Data storage in the cloud is show...
A Modified Feistel Cipher Involving XOR Operation and Modular Arithmetic Inverse of a Key Matrix
In this paper, we have developed a block cipher by modifying the Feistel cipher. In this, the plaintext is taken in the form of a pair of matrices. In one of the relations of encryption the plaintext is multiplied...
High-Speed FPGA-based of the Particle Swarm Optimization using HLS Tool
The Particle Swarm Optimization (PSO) is a heuristic search method inspired by different biological populations on their swarming or collaborative behavior. This novel work has implemented PSO for the Travelling Salesman...