A Novel Approach on Discrete Cosion Transform Based Image Compression Technique For Lung Cancer

In medical field the volume of medical image data produced every day is ever growing, particularly in grouping with the improved scanning resolutions and the importance of volumetric medical image data sets. In this work, five image compression methods are simulated. They are Karhunen-Loève Transform (KLT), Walsh-Hadamard Transform (WHT), Fast Fourier Transform (FFT), proposed Sparse Fast Fourier Transform (SFFT) and Discrete Cosine Transform (DCT). The results of simulation are shown and compared different quality parameters of it are by applying on various lung cancer CT Scan medical images. The DCT method algorithm was given better results like Compression Ratio (CR), Structural Content (SC), Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR) compare to other Transform methods. The DCT technique given improved result compared with other methods in all evaluation measures.

The health care field have large amount of medical images.So they need decrease the large volume amount of medical images.The Image compression is a process that focused on decreasing the size without losing quality, decrease the storage space of images and information of image.Lung cancer is the most common cause of cancer death in the world.Tobacco smoking cause's etiology breath and lung cancer.Patients at highly effected by the lung cancer 1 .It's could present with a variety of indications and is regularly screened by more common sicknesses.Several patients report no indications what so always, so it is vital that exact questions be enquired to try to produce info about symptoms they may not reflect abnormal 2 .In the case of an abnormal chest x-ray, the patient should directly undergo a chest CT scan for further evaluation.Figure 1 shows that the unusual lung CTs inpatients who originally obtainable with weight loss and cough.The positron emission tomography was clarifying that the extent of the cancer 3 .When lung cancer is assumed, the patient stated to an oncologist, who will decide the supreme suitable diagnostic process (e.g., bronchoscopy, CT guided lung biopsy, sputum cytology or media stinoscopy) and utmost favorable whole course of therapy for the lung cancer patient's specific needs.The image compression techniques like KLT, WHT, FFT, SFFT and DCT were used to compress the lung cancer CT scan medical images.Anamitra Bardhan Roy discussed comparison of FFT, DCT, DWT, WHT Compression Techniques.Walaa M. Abd-Elhafiez et.al said the compression analysis results have indicated that the performance of the suggested method is much better, where the constructed images are less distorted and compressed with higher factor.
The actual context that determines when to use lossless versus lossy compression and the actual parameters for tweaking the compression system are left to the judgment of the implementer and the use case.Compression standards, such as JPEG or JPEG-LS, have a very limited set of options regarding their setup.Harjeet pal singh et.al defined compression is reducing the size of graphics file, without compromising on its quality.

Image Compression Methodology
Image compression is process to remove the redundant information from the image so that only essential information can be stored to reduce the storage size, transmission bandwidth and transmission time 4,5 .Figure 2 shows that the essential information is extracted by various transforms techniques such that it can be reconstructed without losing quality and information of the image [6][7] [8].In this work comparative analysis of image compression is done by seven transform methods 9,10,11 , which are Karhunen-Loève Transform (KLT), Walsh-Hadamard Transform (WHT), Fast Fourier Transform (FFT), proposed Sparse Fast Fourier Transform (SFFT) and Discrete Cosine Transform (DCT).

Karhunen-Loève Transform (KLT)
Hotelling transform also known as Karhunen-Loève Transform or KLT, minimizes MSE that is present between original (sub) image and (decompressed) reconstruction 12,13 .Thus for any image KLT is the optimal information compaction transformation as well as for any number of retained coefficients.KLT basic functioning is dependent on image but, this however makes pre-computing impossible and hence this does not qualify it as a practical option suitable for image compression.
There are several applications where KLT 14 has been widely used as in multi-spectral analysis of satellite-gathered images through the resulting spectral signature of imaged regions.Also there is significant data reduction that is attained while storing satellite images considering multispectral sets have been transformed to KLT space.Recently KLT has been used to facilitate images in facial recognition 15 .It is important to note that image set size is possibly much bigger in the subsequent two applications.
Let us take into consideration a sample set of real-valued images from an ensemble of images 16 .Create vectors with the equivalent pixel taken from each of the images, i.e. if there are D images each of size then form the column vectors for , (with superscript T representing the transpose).Calculate the sample mean vector using the formula .
Use a computational formula to create the sample covariance matrix as where are the eigenvectors with associated eigenvalue set .The KLT kernel is a unitary matrix, [V], whose columns, (arranged in descending order of eigenvalue amplitude), are used to transform each zero-meaned vector:

Walsh-Hadamard Transform (WHT)
Walsh system functions forms the very basis for Walsh transform.Walsh functions are orthogonal and have only +1 and -1 values 17 .In general, the Walsh transform can be generated by the Hadamard matrix as follows: WHT here was employed to facilitate face as well as signature 18,19 recognition as WHT coefficients output array comprises only of integer values, resultantly Hadamard transform thus becomes a quick transform, and implementation is feasible in O (N log N) additions as well as subtractions.

Fourier Transform
Fourier Transform is known to decompose image as two components: sinus and cosines.This implies that FT will transform any image from spatial to frequency domain respectively 20 .Fact is that any function can be precisely approximated using sum of infinite sinus and cosines functions 21 .Fourier Transform essentially is a method to execute this.Mathematically a two dimensional images Fourier transform is: ...( 2) Here f is the image value in its spatial domain and F in its frequency domain.Transformation results in complex numbers.This can be showing either using a real and complex image or using a magnitude and phase image 22 .Though, in image processing algorithms it the magnitude image alone which is of interest as it has the information required regarding the geometric structures of the images.Nonetheless, in case there is a necessity to modify image in the particular forms what is required to retransform is the need to preserve both.

Fast Fourier Transform
The Fast Fourier Transform (FFT) algorithm was established by Carl Friedrich Gauss nearby 1805.The FFT is used to compute the Discrete Fourier Transform (DFT).The bigger size M = NxN matrix split into smaller size N's of DFT in the time domain.The new Radix-2 Decimation in Time (DIT) FFT is the effective and simplest method.It's also used to compute 2 n point DFT.In the FFT method the given weights are multiplied by indexes.The output should be the bit reverse form of the given input signal.The compound conjugate regularity is used to signify the imaginary part.

Methodology (Sparse Fast Fourier Transform -sFFT)
For any algorithms which is used to compute DFT must take time at least proportional to its output size, &!(n).Most of the signals in frequency domain are sparse 23 .In general signal processing techniques many applications contain small value of Fourier coefficients or equal to zero.So the resultant DFT is approximately sparse.This is general in video, that is most of the coefficient are negligible.Images and videos are equally sparse 24 .An efficient algorithm is needed to compute FFT for the signals that are sparse in frequency domain.sFFT computes k -sparse approximation, whose runtime depends upon k, the larger coefficient in the signal.This algorithm works in the process of identifying these k values by a filter G. G concentrates in both time and frequency.G is zero for all values except at a small number of time co-ordinates, and the Fourier Transform of G ( is negligible except at a small fraction value which is about of the frequency co-ordinates 25 .Gaussian or Dolph-Chebyshev function convolved with a box-car function is used to identify the large coefficients in sFFT.Using this filter to find location and magnitude of the higher frequency component, parallel acceleration is achieved easily 26 .
Previous sub-linear algorithms have a runtime which is a polynomial in k and log n 3 .The fastest runtime of these algorithms will be For some constants C>2.
The key feature of sFFT is its simple structure.It has an efficient runtime with low big-0 th Constant.For a typical case of n which is a power of 2, the run time is ... (4)  The implementation method and the working of sFFT with mathematical derivative.The research is made with 128x128 medical image to compression and decompression with KLT, WHT, FFT and Proposed sFFT and calculating PSNR, MSE, CR, SC 27 .sFFT Algorithm The structure of the proposed method contains following steps: Step 1: The research is made with FFT to compute the Fourier Transform in a MATLAB application.
Step 2: The execution of the FFT algorithm in MATLAB application.Here the value of i = .

Discrete Cosine Transform
The Discrete Cosine Transform (DCT) is an orthogonal transform, its attempts to the decorrelate the medical image data.After the decorrelation each transform coefficient can be independently encoded without losing the compression efficiency 28 .The DCT transforms the signal from the spatial representation into the frequency representation.The DCT signify an image as a summation of sinusoids of the varying magnitudes and frequencies.DCT property is a typical image utmost of the visually substantial information about an image is focused in just few coefficients of DCT.Afterwards the computation of the DCT coefficients, they are regularized according to a quantization table with the different measures provided by the JPEG image standard computed by the psycho visual evidence.The Selection of quantization table affects the compression ratio and entropy.The value of quantization is inversely proportional to quality of reconstructed image.Its gives better compression ratio and better mean square error 29 .In a Quantization, the less significant frequencies are discarded, and then the maximum important frequencies that remain are used to recover the image in decomposition method.After quantization, the quantized coefficients are rearranged in the zigzag order for the further compressed by an effective lossy coding algorithm.DCT has several merits: (1) It has the ability to pack more information in least coefficients.(2) It decreases the block like appearance called the blocking artifact that outputs when margins between sub-images become visible 30 .
An image is signified as the two dimensional matrix, the 2-D DCT is used to compute a DCT Coefficients of an image.The 2-D DCT for an NXN input order can be defined as follows 31 : ... (6)   Where, P(x, y) is the input matrix image NxN, (x, y) are the coordinate of the matrix elements and (i, j) are the coordinate of the coefficients, and ... (7)   The reconstructed image is the computed by using the inverse DCT (IDCT) according to the ... (8)  The black and white image pixels are ranged from 0 to 255, where 0 matches to pure black and 255 matches to a pure white.As DCT is constructed to work on pixel the values ranging from -128 to 127, the original block is the level off by 128 from every entry 32 .The Step by step Procedure of getting compressed image is using DCT and getting reconstructed image from the compressed image.
Currently encoding is completed and transmitted to receiver side in the form of the one dimensional array.This transmitted order saves in the text format.The array of compressed blocks that establish the image is stored in a extremely reduced amount of the space.Further the compression can be reached by applying suitable scaling factor 33 .In order to rebuild the output data, the rescaling and the de-quantization should be achieved as given in Equation. (9) The de-quantized matrix is then transmuted back using the 2-D inverse-DCT 34 .The equation for the 2-D inversed DCT change is given in the above said Equation.

Performance Evaluation Peak Signal to Noise Ratio (PSNR in dB)
PSNR called as Peak Signal-to-Noise Ratio.PSNR approximates image quality index, however on its own it does not have the capability of drawing a comparison between the features of two distinct images 38,39 .There is a possibility however that lower PSNR image may be considered as an image whose tone quality is comparatively better than one with a higher signal to noise ratio 40 .
... (13)   Its refers to the relation between the power of the humiliating noise that affects the loyalty of its representation and the supreme imaginable power of the signal 41 .As several signals inherently have an extensive dynamic range, PSNR generally is expressed as logarithmic decibel scale.

Mean Square Error (MSE)
Mean square error is a measure of image quality index.Large value of mean square basically implies that a poor quality image 42 .Mean Square Error called as MSE.Generally, it is a criterion that has been widely used and is representative of the classical error estimate as denoted by equation below: ... (14)   where M and N are the image dimensions.

Compression Ratio (CR)
Compression Ratio is the ratio of number bits required to represent the data before compression to the number of bits required to represent data after compression 43 .Increase of compression ratio causes more effective compression technique employed and vice versa 44 .

Structural Content (SC)
Structural content measure that is employed to draw a comparison between two images inherent in several small image patches and to determine the images have in common 45,46 .A comparison is drawn between patches by deploying 2D continuous wavelet that acts as a low level corner detector 47,48 .Large value of structural content SC basically implies a poor ...( 16)

RESULTS AND DISCUSSIONS
The experiment is carried out in MATLAB environment.In this research, the images deployed here for compression are all 128 X 128, 8-bit medical images.Basically meaning that images comprise of 128 X 128 = 16,384 pixels, wherein each pixel is represented by 8 bits or 1 byte.KLT, WHT, FFT, SFFT and DCT algorithm implementation has been carried out on MATLAB software and several different parameters have been ascertained with respect to the three medical images; comparison of reconstructed and original images PSNR, MSE, CR, SC values have been estimated.
In Table -   In

CONCLUSION
This paper is focused on the comparison among four important KLT, WHT, FFT ,SFFT and DCT methods of image compression.In this paper analysis of various Image compression methods for different images is done based on parameters, mean square error (MSE), compression ratio(CR), and peak signal to noise ratio (PSNR).The comparison of KLT, WHT, FFT , SFFT and DCT after compression the parameters like PSNR values, MSE, CR and SC values were good outcome in proposed DCT work.From the above study it can be seen that Proposed DCT take less PSNR value and SC value than KLT, WHT, FFT and SFFT.The Proposed method has more compression ratio and MSE than KLT, WHT , FFT & SFFT.Our simulation results from result and discussion chapter shows that we can achieve higher compression ratio using DCT compression technique.DCT transform gives higher compression ratio but for getting that clarity of the image is partially trade off.It is more suitable for regular applications as it is having a good compression ratio along with preserving most of the information.

Future Work
The result in this paper provides a strong foundation for future work for the compression method.All of the analysis presented in this paper work involved exhaustive simulations using 128X128 pixel medical images, in future we take 256X256 pixel medical images and 512X512 pixcel medical images .The algorithm can be realized in hardware and software implementation as a future work.It can also be a good choice for the image processor of the transform system.This research work has been analysed for high compression ratio.Further research work can be performed to relax high compression ratio constraint and transform.This work has been concentrate transform image using for the elimination of the spatial redundancy by DCT compression of medical images.

Step 3 : 4 : 5 :
The research is made with SFFT to compute the Fourier Transform in a single array.Step The execution of the SFFT algorithm Coding is based on Matlab library function and header files.Step The development and implementation of SFFT algorithm for computing DFT should be Y k j ...(5)

Figure- 4 ,
Figure-5, Figure-6 , Figure-7 charts and Table -1 explained the PSNR, MSE, CR and SC parameters.The DCT method gave less SC value are given three CT image.Also it produced high MSE and CR Value compare to the other exiting methods.It also shows in Figure-3, Figure-4, Figure-5 , Figure-6 and Figure-7.

Table 1 .
1 we have taken 128X128 size Medical image encoding is simulated by using CT images of size 128X 128 with different compression techniques like KLT, WHT, FFT, SFFT and DCT Fig. 4. Graphcial Results of PSNR Value In first CT Image gave good result in DCT for MSE value is 14.424 higher than KLT, WHT, FFT and SFFT value is 2.342, 3.165, 8.437and 10.373 respectively.In second CT Image gave good result in DCT for MSE value is 16.232 higher than KLT, WHT , FFT and SFFT value is 7.0676, 9.9067, 10.0932 and 12.3254 respectively.In third CT Image gave good result in DCT for MSE value is 19.313 higher than KLT, WHT, FFT and SFFT value is 6.874, 7.429 , 10.453 and 12.842 respectively.In first CT Image gave good result in DCT for value CR is 5.9784 higher than KLT, WHT, FFT and SFFT value is 2.6822, 3.7365, 4.4844 and 5.3433 respectively.In second CT Image gave good result in DCT for CR value is 4.985 higher than KLT, WHT , FFT and SFFT value is 1.369, 2.9231, 3.242 and 4.043 respectively.In third CT Image gave good result in DCT for CR value is 6.382 higher than KLT, WHT, FFT and SFFT value is 2.836, 3.1302, 4.043 and 5.132 respectively.In first CT Image gave good result in DCT for value SC is 2.105 less than KLT, WHT, FFT and SFFT value is 3.984, 3.098, 2.965 and 2.615 respectively.In second CT Image gave good result in DCT for SC value is 2.816 less than KLT, WHT, FFT and SFFT value is 4.534, 4.053, 3.785 and 3.166 respectively.In third CT Image gave good result in DCT for SC value is 2.008 less than KLT, WHT, FFT and SFFT value is 3.723, 3.108, 2.768 and 2.564 respectively.