Abstract

The generation of high volume of medical images in recent years has increased the demand for more efficient compression methods to cope up with the storage and transmission problems. In the case of medical images, it is important to ensure that the compression process does not affect the image quality adversely. In this paper, a predictive image coding method is proposed which preserves the quality of the medical image in the diagnostically important region (DIR) even after compression. In this method, the image is initially segmented into two portions, namely DIR and non-DIR portions, using a graph-based segmentation procedure. The prediction process is implemented using two identical feed-forward neural networks (FF-NNs) at the compression and decompression stages. Gravitational search and particle swarm algorithms are used for training the FF-NNs. Prediction is performed in both a lossless (LLP) and near-lossless (NLLP) manner for evaluating the performances of the two FF-NN training algorithms. The prediction error sequence which is the difference between the actual and predicted pixel values is further compressed using a Markov model-based arithmetic coding. The proposed method is tested using CLEF med 2009 database. The experimental results demonstrate that the proposed method is equipped for compressing the medical images with minimum degradation in the image quality. It is found that the gravitational search method achieves higher PSNR values compared to the particle swarm and backpropagation methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.