Image Compression on Region of Interest based on SPIHT Algorithm
Author(s) -
Sudeepti Dayal,
Neelesh Gupta,
Neetu Sharma
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2015907587
Subject(s) - computer science , compression (physics) , image compression , set partitioning in hierarchical trees , image (mathematics) , data compression , algorithm , artificial intelligence , image processing , materials science , composite material
Image abbreviation is utilized for reducing the size of a file without demeaning the quality of the image to an objectionable level. The depletion in file size permits more images to be deposited in a given number of spaces. It also minimizes the time necessary for images to be transferred. Storage of medical images is most researched area in the current scenario. To store a medical image there are two parameters on which the image is divided, region of interest and non region of interest. The best way to store an image is to compress it in such a way that no important information is lost. Compression can be done in two ways namely, lossy and lossless compression. Under that several compression algorithms are applied. In the paper two algorithms are used that are, discrete cosine transform, applied to non region of interest (lossy) and discrete wavelet transform, applied to region of interest (lossless). The paper introduces SPIHT (set partitioning hierarchical tree) algorithm which is applied on the wavelet transform to obtain good compression ratio from which an image can be stored efficiently.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom