Journal of Computer Science

MEDICAL IMAGE COMPRESSION TECHNIQUE USING LISTLESS SET PARTITIONING IN HIERARCHICAL TREES AND CONTEXTUAL VECTOR QUANTIZATION FOR BRAIN IMAGES

S. Sridevi and V. R. Vijayakumar

DOI : 10.3844/jcssp.2013.1181.1189

Journal of Computer Science

Volume 9, Issue 9

Pages 1181-1189

Abstract

A hybrid image compression techniques has been developed to compress medical images. Due to the extensive use of medical images like CT and MR scan, these medical imagery are stored for a longer period for the continuous monitoring of the patients and the amount of data associated with images is large and it occupies enormous storage capacity. So, the medical images need to be compressed to reduce the storage cost and for transmission without any loss. In this study, a hybrid method which combines the Listless Set Partitioning in Hierarchical Trees (LSPIHT) and the Contextual Vector Quantization (CVQ) method for the compression of brain images. Here, the region containing the most important information for diagnosis is called Region of Interest (ROI) and this is to be compressed with out any loss in the quality. In this method, the ROI is encoded separately using LSPIHT and the Back Ground region (BG) is encoded using CVQ. Finally, the two regions are merged together to get the reconstructed image. Our results show that the proposed method gives very good image quality for diagnosis without any degradable loss. The performance of the compression technique is evaluated using the parameters (CR, MSE, PSNR) and achieved better result compared to other existing methods. As a result, we strongly believe that using our method, we can overcome the limitations in storage and transmission of medical images that are produced day by day.

Copyright

© 2013 S. Sridevi and V. R. Vijayakumar. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.