Year: 2017
Type: article
Abstract: Image compression is the process of minimizing the size of file without degrading the file quality.The reduction in file size permits number of files to be stored in a memory space.The proposed compression method used the decision tree algorithm for compression of a grey scale images.The Decision tree reads an image which needs to compress.Patches are created and assign weight to each patch on the basis of similarity between patches.Decision tree is formed based on the similarity between the pixels.Then data is merged to form compressed image otherwise define root node which has maximum weight, left node which has less weight than root node and right node which has minimum weight and decision tree is created.The proposed method is evaluated using the Image Quality Measures (IQM) like Peak-Signal to Noise Ratio (PSNR), Compression Ratio (CR), Mean Square Error (MSE) and Elapsed Time (ET).The experimental results of the proposed method are compared with Huffman method and Wavelet Difference Reduction method.From the experimental results it has been concluded that the proposed method is better than Huffman method and Wavelet Difference Reduction.
Author: Amanpreet Kaur
Institution: Punjabi University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2765387148
