@article {10.3844/jcssp.2009.388.391,
article_type = {journal},
title = {Binary Merge Coding for Lossless Image Data Compression},
author = {Chandra, N. Subhash and Raju, M. Bala and bahanu, M. Arya and Vikram, B. Raja and Govardhan, A. and Basha, S. Mahaboob},
volume = {5},
number = {5},
year = {2009},
month = {May},
pages = {388-391},
doi = {10.3844/jcssp.2009.388.391},
url = {https://thescipub.com/abstract/jcssp.2009.388.391},
abstract = {Problem statement: Image processing applications were drastically increasing over the years. In such a scenario, the fact that, the digital images need huge amounts of disk space seems to be a crippling disadvantage during transmission and storage. So, there arises a need for data compression of images. Approach: This study proposed a novel technique called binary merge coding for lossless compression of images. This method was based on spatial domain of the image and it worked under principle of Inter-pixel redundancy reduction. This technique was taken advantage of repeated values in consecutive pixels positions. For a set of repeated consecutive values only one value was retained. Results: The proposed binary merge coding achieved the compression rate of the brain image was 1.6572479. Comparatively, it is 100% more than the compression rate achieved by standard JPEG. Conclusion/Recommendations: This technique was simple in implementation and required no additional memory area. The experimental results of binary merge coding were compared with standard JPEG and it showed that, the binary merge coding improved compression rate compared to JPEG. The same algorithm can be extending to color images. This algorithm can also used for lossy compression with few modifications.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}