Abstract
There is a significant necessity to compress the medical images for the purposes of communication and storage.
Most currently available compression techniques produce an extremely high compression ratio with a high-quality loss. In medical applications, the diagnostically significant regions (interest region) should have a high image quality. Therefore, it is preferable to compress the interest regions by utilizing the Lossless compression techniques, whilst the diagnostically lessersignificant regions (non-interest region) can be compressed by utilizing the Lossy compression techniques. In this paper, a hybrid technique of Set Partition in Hierarchical Tree (SPIHT) and Bat inspired algorithms have been utilized for Lossless compression the interest region, and the non-interest region is loosely compressed with the Discrete Cosine Transform (DCT) technique. The experimental results present that the proposed hybrid technique enhances the compression performance and ratio. Also, the utilization of DCT increases compression performance with low computational complexity.
Most currently available compression techniques produce an extremely high compression ratio with a high-quality loss. In medical applications, the diagnostically significant regions (interest region) should have a high image quality. Therefore, it is preferable to compress the interest regions by utilizing the Lossless compression techniques, whilst the diagnostically lessersignificant regions (non-interest region) can be compressed by utilizing the Lossy compression techniques. In this paper, a hybrid technique of Set Partition in Hierarchical Tree (SPIHT) and Bat inspired algorithms have been utilized for Lossless compression the interest region, and the non-interest region is loosely compressed with the Discrete Cosine Transform (DCT) technique. The experimental results present that the proposed hybrid technique enhances the compression performance and ratio. Also, the utilization of DCT increases compression performance with low computational complexity.