Lossless compression of DICOM images using genetic algorithm

Kaur, Harpreet; Kaur, Rupinder; Kumar, Navdeep

doi:10.1109/ngct.2015.7375268

Cited by 7 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Every individual sub-image is mapped to a fractional number by RGB representation and then decreased to an effective quotient. This technique reported better CR, when the least significant bits of every bytes is changed, hence, the image quality is saved with higher CR.HarpeetKaru et al devised lossless image compression technique for compressing significant parts by the extraction of a region of interest in DICOM images [28]. Then, Huffman coding is used to compress the extracted region and GA further enhances the compression performance.…”

Section: Related Studiesmentioning

confidence: 99%

Modified Firefly Algorithm for Vector Quantization Codebook Design in Image Compression

Preethi,

Loganathan

2019

IJEAT

View full text Add to dashboard Cite

In the recent days, the importance of image compression techniques is exponentially increased due to the generation of massive amount of data which needs to be stored or transmitted. Numerous approaches have been presented for effective image compression by the principle of representing images in its compact form through the avoidance of unnecessary pixels. Vector quantization (VA) is an effective method in image compression and the construction of quantization table is an important process is an important task. The compression performance and the quality of reconstructed data are based on the quantization table, which is actually a matrix of 64 integers. The quantization table selection is a complex combinatorial problem which can be resolved by the evolutionary algorithms (EA). Presently, EA became famous to resolve the real world problems in a reasonable amount of time. This chapter introduces Firefly (FF) with Teaching and learning based optimization (TLBO) algorithm termed as FF-TLBO algorithm for the selection of quantization table and introduces Firefly with Tumbling algorithm termed as FF-Tumbling algorithm for the selection of search space. As the FF algorithm faces a problem when brighter FFs are insignificant, the TLBO algorithm is integrated to it to resolve the problem and Tumbling efficiently train the algorithm to explore all direction in the solution space. This algorithm determines the best fit value for every bock as local best and best fitness value for the entire image is considered as global best. When these values are found by FF algorithm, compression process takes place by efficient image compression algorithm like Run Length Encoding and Huffman coding. The proposed FF-TLBO and FF-Tumbling algorithm is evaluated by comparing its results with existing FF algorithm using a same set of benchmark images in terms of Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Signal to Noise Ratio (SNR). The obtained results ensure the superior performance of FF-TLBO and FF-Tumbling algorithm over FF algorithm and make it highly useful for real time applications.

show abstract

Section: Related Studiesmentioning

confidence: 99%