Image compression using pictorial representation of data
Mahesh Raj, Divjot Kaur · 2017
The cyber world is growing drastically and hence data storage is emerging as a major concern. This problem is solved by various data compression algorithms like Lempel-Ziv, DEFLATE, Huffman Coding, VORBIS, MP3, EBCOT, etc. but most these algorithms depend on redundancy in data. In this paper, we will discuss data compression which is independent of redundancy and has a compression ratio equal to or more than 2. This is implemented by representing the data pictorially which will be the compressed form and then using the picture to inference the original data. This method divides the data into packets hence making it suitable to be implemented over the internet.