Automatic Detection of Liver Lesions Using Hybrid Classification Techniques

DOI : 10.17577/IJERTV3IS051004

Download Full-Text PDF Cite this Publication

Text Only Version

Automatic Detection of Liver Lesions Using Hybrid Classification Techniques

Hamsa Ruby. R1, Radhika 2 and Sajithra. S. I 3

PG Scholar 1, Faculty of Electronics Communication Engineering 2, PG Scholar3, PPG Institute of Technology

Coimbatore, India

Abstract: – In this paper proposed a novel classifier method with Optimization technique for liver disease. LIBSVM is used for classification to classify the liver diseases. This paper concentration on five different types of diseases they are carcinoma, cirrhosis, fatty livers, hepatitis and cystic liver. Accurate classifications are done by using preprocessing and feature extraction. In preprocessing, speckle noise reduction and carried out by filtering technique afterwards segmentation process are taken in this paper. Feature extraction is done using gray level and co-occurrence matrix (GLCM). Several type of features are given as a input to the classification for liver diseases identification. This method outperforms the liver identification in terms of accuracy and execution time. Experimental shows the good performance than the existing method.

  1. INTRODUCTION

    Liver disease is roughly divided into focal, in which disease is concentrated in a small area and the remaining liver is normal, and diffused, which is distributed throughout the liver. Specialized radiologists determine whether liver tissue is normal or abnormal, but the accuracy of their diagnosis depends strongly on their experience, visual interpretation of images, and comparison with different pathologies. The similarity of diagnostic criteria for certain diseases, however, might confuse radiologists and cause them to make the incorrect judgments.

    Chronic liver disease is a signicant cause of morbidity and mortality in developed nations. It is commonly caused by viral hepatitis and alcohol abuse [20]

    Image analysis and classification are important in computer- aided diagnosis widely used in characterizing medical images. The crucial step is in extracting appropriate features enabling accurate distinction. Feature extraction techniques include the gray level co-occurrence matrix (GLCM) [21], Gabor filters [22, 23 and 24], and wavelet transforms [25]. GLCM has been applied to texture feature extraction in medical image processing. In [26] used features from RF echoes prior to machine processing, image histograms, image gradients, co- occurrence matrices, and run-length matrices. In [27] proposed ultrasonic image analysis classifying liver symptoms as normal, hepatitis, or liver cirrhosis. They used the forward sequential search to find useful texture parameters from the co- occurrence matrix, statistical feature matrix, texture spectrum, and fractal dimension descriptors. In [28] used features from GLCM to distinguish between the normal liver and two types of liver tumor, hepatoma and hemangeoma.

    A feature extraction module proposed in [29] calculates the average gray level and 48 texture characteristics derived from

    spatial ROI-based GLCM to characterize the normal liver, hepatic cysts, hemangioma, and hepatocellular carcinoma.

    In this paper proposed a novel classification method with Optimization technique to identify the liver diseases. Five type of liver diseases are concentration and identified they are carcinoma, cirrhosis, fatty livers, hepatitis and cystic liver. Section II reveals about the related work for liver diseases identification. Section III discusses about the preprocessing, in which filtering technique and segmentation methods are described. Section IV tells about the classification of LIBSVM with Optimization technique. To prove the proposed method by experimental result and it is described in section V. Section VI describes about conclusion of proposed research.

  2. LITERATURE SURVEY

    There is a large literature demonstrating an association between chronic alcoholism and cognitive dysfunction [13, 14,

    15 and 16]. Cognitive impairments observed in chronic alcoholics without liver disease are commonly thought to encompass executive functions including abstraction, planning, problem solving and working memory [14], while patients with the neurodegenerative WernickeKorsakoffs disease typically display impairments in the formation and retrieval of new memory [17, 18]. Despite the large number of neuro- scientific studies of alcoholism, there have been relatively few studies specifically investigating the contribution of liver disease to the spectrum of cognitive changes observed in alcoholics [19]. Several authors have hypothesised that the cerebral and hepatic consequences of alcoholism may combine to produce more severe cognitive dysfunction in ALD patients than in non-ALD patients [19].

    There is a small literature directly assessing cognition in cholestatic liver disease, specifically primary biliary cirrhosis (PBC) and primary sclerosing cholangitis (PSC). A series of studies by Tarter et al. (44, 45) form the foundation of our understanding of cognition in these diseases. One study observed that a greater proportion of individuals with either PBC or PSC were impaired on tests of attention, concentration and psychomotor function relative to a control group of Crohns disease patients (44). Another study compared 14 PBC patients to 10 PBC patients with co-existent Sjogrens syndrome and 10 normal controls (45).

  3. PREPROCESSING

    A. Speckle Noise Reduction

    The speckle noise model may be approximated as multiplicative and is given by

    , = , , + , (1)

    Where , represent the noisy pixel and represent the noisy free pixel, , signify the multiplicative noise and indicate the additive noise respectively i,j are indices of the spatial locations. Because the effect of additive noise is considerably smaller compared with that of multiplicative noise (1) may be written as

    , = , . (2)

    Logarithmic compression is applied to the envelope detected echo signal in order to fit within the display range [7]. Logarithmic compression affects the speckle noise statistics and it becomes very close to white Gaussian noise. The logarithmic compression transforms multiplicative form in (2) to additive noise form as

    log . = log , + log(, ) (3)

  4. FEATURE EXTRACTION

    1. Feature Extraction using Gray Level Co-occurrence Matrix (GLCM)

      Co-occurrence features [9] are a popular and effective texture descriptor using statistical approach. Given an image of n gray levels, s, characteristics of images are estimated from the second-order statistical features by considering the spatial relationship of pixels in the image. A GLCM element P , d i, j is the joint probability of the gray level pairs I and j in a given direction seperated by distance of d units. For each region of interest (ROI) in this work, five features are determined for texture discrimination: Energy (ENR), Entropy (ENT), Sum Entropy (SEN), Difference Entropy (DEN) and Standard Deviation (STD). Each subdivided block is an independent ROI. Multi-distance and multi-direction can be used to extract a large number of features. Extract the GLCM features using one distance d = 1 and four direction{ = 0, 900 , 1800, 2700 }, which result in 20 that is 1 × 4 × 5) features extracted for each block.

      ENR = n1 n1 P2 i, j

      (5)

      . = . + , (4)

      i=0 j=0 d

      The term log . is the noisy image in the medical image after logarithmic compression is denoted as , and the term log , , log(, ) these are the noise free pixel and noisy component after logarithmic compression, as . , , respectivel.

      De-speckling or speckle suppression is a pre-processing step

      for many ultrasound image processing problems. A wide variety of filters exist in the literature [1, 2, 3 and 4].This work analyzes the effect of applying select filters such as Box, Gaussian in linear filters, Min, Max, Midpoint, Median in Non Linear Order statistics filters,), Wiener Filter (Adaptive), Homomorphic Filter and Speckle Reduction Anisotropic Diffusion filters [5, 6 and 7] on liver ultrasound images for the removal of speckle noise.

    2. Active Contour Segementation

    Segmentation using active contours model (Snakes) was

    ENT = n1 n1 Pd i, j log2Pd i, j SEN = 2n2 Px+y k log2Px+y (k) DEN = n1 Pxy k log2Pxy (k)

    k=0

    k=0

    i =0 j=0

    i=0 j=0

    STD = n 1 n 1 Pd i,j 2

    n×n

    Where

    i=0 j =0

    = n 1 n 1 Pd (i,j)

    n×n

    i=0 j=0

    Px+y k = n1 n1 Pd i, j

    For i + j = k, here k=0,1,,2n-2.

    (6)

    (7)

    (8)

    (9)

    (10)

    (11)

    introduced in [8]. The idea behind active contours, or

    P k = n1 n1 P i, j

    (12)

    deformable models, for image segmentation is quite simple.

    xy

    i=0

    j=0 d

    The user specifies an initial guess for the contour, which is then moved by image driven forces to the boundaries of the desired objects. In such models, two types of forces are considered – the internal forces, defined within the curve, are designed to keep the model smooth during the deformation process, while the external forces, which are computed from the underlying image data, are defined to move the model toward an object boundary or other desired features within the image. One way of describing this curve is by using an explicit parametric form, which is the approach used in snakes. This causes difficulties when the curves have to undergo splitting or merging, during their evolution to the desired shape. To address this difficulty, the implicit active contour approach, instead of explicitly following the moving interface itself, takes the original interface and embeds it in higher dimensional scalar function, defined over the entire image. The use of level set method has provided more flexibility and convenience in the implementation of active contours

    for i j = k, k=0,1,,n-1

    GLCM features extraction (GFE) can be expressed as

    GFE = Img Img × Rp (13) Where

    GFE bIJ = F GLCM bIJ = bIJ , fp (14)

    Where fp is the feature vector and p is the number components (features extracted from bIJ )

    The GLCM function is introduced in (14) can be defined as

    GLCM: Img Mn×n N (15)

    Where Mn×n N is the set of square matrices with the dimension n × n. The function in (15) takes a block bIJ of the image Img and returns its GLCM, given a direction and a distance.

    The F function introduced in equation (14) can be dened a

    F: Mn×n R Img × Rp (16)

    where the function of equation (16) takes a GLCM of a block

    bIJ and returns bIJ , fp .

  5. CLASSIFICATION:

    The classification of abnormality and normality is improved here by using PSO with LSVM technique.

    1. Particle swarm optimization

      Particle swarm optimization (PSO) is a population-based optimization algorithm modeled after the simulation of social behavior of birds in a flock [11]. The algorithm of PSO is initialized with a group of random particles and then searches for optima by updating generations. Each particle is flown through the search space having its position adjusted based on its distance from its own personal best position and the distance from the best particle of the swarm. The performance of each particle, i.e. how close the particle is from the global optimum, is measured using a fitness function which depends on the optimization problem. Each particle i flies through an n- dimensional search space, Rn , and maintains the following:

      xi, the current position of ith particle (x-vector)

      pi, the personal best position of ith particle (p-vector), and

      vi, the current velocity of ith particle (v-vector).

      The personal best position associated with a particle, i, is the best position that the particle has visited so far. If f denotes the fitness function, then the personal best of i at a time step t is updated as:

    2. Library Support Vector Machine:

    LIBSVM is a library for Support Vector Machines (SVMs). The goal is to easily apply SVM to their applications. LIBSVM has gained wide popularity in machine learning and many other areas. In this work, we present implementation of LIBSVM. Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection.

    A typical use of LIBSVM involves two steps: first, training a data set to obtain a model and second, using the model to predict information of a testing data set. For SVC and SVR, LIBSVM can also output probability estimates.

    This is same as SVM technique; where in training SVM an m by 1 vector of training labels (type must be double) is taken.

    Then parameters for gamma in LIBSVM are taken from PSO algorithm. And the Cost parameter is set as the parameter C of C-SVC is taken.

    1. Kernels:

    Kernel methods in general have gained increased due to the grown of popularity of the Support Vector Machines. Support Vector Machines are linear classifiers and regressors that, through the Kernel trick, operate in reproducing Kernel Hilbert spaces and are thus able to perform non-linear classification and regression in their input space.

    Here Radial Bias Function Kernel is used and it is expressed as

    RBF = exp 1 (21)

    22 xxi 2

    And detailed description is given in [12]. This is given as

    kernel in LIBSVM technique. By this the classification of abnormal and normal MRI brain images is performed and their affected disease is identified.

  6. EXPERIMENTAL RESULT

i

p t + 1 = { pi t if f(xi t+1 ) f(pi t )

xi t+1 if f xi t+1 <f pi t

(17)

To evaluate the proposed work which is implemented here is

If the position of the global best particle is denoted by gbest , then :

gbest p1 t , p1 t , , pm t

= min f(p1 t , f(p2 t ), f(pm t )} (18)

The velocity updates are calculated as a linear combination of position and velocity vectors. Thus, the velocity of particle i is updated and the position of particle i is updated by the following equations.

vi t + 1 = w. vi t + c1r1 pi t xi t + c1r1 gbest

xi t (19)

xi t + 1 = xi t + vi t + 1 (20)

In the formula, w is the inertia weight [10], c1 and c2 are the acceleration constants, r1 and r2 are random numbers in the range [0,1] and Vi1 must be in the range [Vmax , Vmax ], where Vmax is the maximum velocity.

analyzed and results produced from this algorithm are shown here. To prove its efficiency here it is compared the proposed LIBSVM with optimization technique with segmentation and existing system of SVM technique without segmentation [29]. The images are collected from freely available open source and this technique is implemented in MATLAB software of R2012a version environment. The performance of this work is measured using accuracy of correctly classified and execution time taken for this work to complete the process.

Table I : Comparison of Accuracy

Technique

Accuracy

Existing SVM without

segmentation

92.91

Proposed LIBSVM with Optimization technique with

segmentation

96.5

The above table I provide the comparison of accuracy between existing system and proposed system. From the table observes that the proposed system provides better accuracy than the existing classification system.

Figure 1: Comparison of Accuracy

Accuracy

97

<3>Accuracy (%)

96

95

94

93 Accuracy

92

91

Existing system Proposed System

Techniques

The figure 1 illustrates the comparison of accuracy between proposed LIBSVM with segmentation and existing SVM without segmentation.

Table II: Comparison of Execution time

Technique

Execution time

Proposed

12s

Existing

9s

Time (s)

The above table II provides the comparison of execution time between existing system and proposed system. From the table observes that the proposed system provides less execution time than the existing classification system.

15

Execution time

10

5

Execution time

0

Proposed

Existing

Techniques

The figure 2 illustrates the comparison of execution time between proposed LIBSVM with segmentation and existing SVM without segmentation. From the figure 2 analyzed that the proposed system gives less execution time than the existing system.

REFERENCES

  1. Aboshosha, A., Hassan, M., Ashour, M., El Mashade, M.: Image denoising based on spatial filters, an analytical study. In: Proc. International Conference on Computer Engineering & Systems, ICCES, pp. 245250 (2009), doi:10.1109/ICCES.2009.5384036.

  2. Motwani, M.C., Gadiya, M.C., Motwani, R.C., Harris Jr., F.C.: Survey of image denoising techniques, doi:10.1.1.107.1823

  3. Kaur, N., Chadda, S., Thakur, R.: A Survey of Image De-noising Filters. IJCST 3(1), 505507 (2012) ISSN 0976-8491(Online), 2229-4333 (Print).

  4. Fujita, Y., Hamamoto, Y., Segawa, M., Terai, S., Sakaida, I.: An Improved Method for Cirrhosis Detection using Livers Ultrasound images. In: International Conference on Pattern Recognition, pp. 2294 2297 (2010), doi:10.1109/ICPR.2010.561.

  5. Yoo, B., Nishimura, T.: A Study of Ultrasound Images Enhancement using Adaptive Speckle Reducing Anisotropic Diffusion. In: Proc. IEEE International Symposium on Industrial Electronics, pp. 581585. Seoul Olympic Parktel, Seoul (2009), doi:10.1109/ISIE.2009.5213936

  6. Christos, P., Loizou, C.S.: Pattichis Despeckle Filtering Algorithms and Software for Ultrasound Imaging. Morgan & Claypool (2008).

  7. Yu, Y., Acton, S.T.: Speckle Reducing Anisotropic Diffusion. IEEE Transactions on Image Processing 11(11), 12601270 (2002), doi:10.1109/TIP.2002.804276.

  8. M. Kass, A. Witkin, and T. Terzopoulous. Snakes: Active contour models. International Journal of Computer Vision, pages 321-331, 1988.

  9. S. Zhixin, S. Srirangaraj, and G. Venu, Text extraction from gray scale historical document images using adaptive local connectivity map," in ICDAR '05: Proceedings of the Eighth International Conference on Document Analysis and Recognition. Washington, DC, USA: IEEE Computer Society, 2005, pp. 794-798.

  10. Y. Shi, and R. Eberhart, "A modified particle swarm optimizer," in the Proceedings of the IEEE International Conference on Evolutionary Computation, Piscataway, NJ, pp. 69-73, 1998.

  11. J. Kennedy, and R. Eberhart, Swarm Intelligence, San Francisco: Morgan Kaufmann Publishers, 2001.

  12. Chih-Wei Hsu, Chih-Chung Chang, and Chih-Jen Lin, A Practical Guide to Support Vector Classification, April 15, 2010.

  13. Desmond J E, Chen S H, DeRosa E, et al. Increased frontocerebellar activation in alcoholics during verbal working memory: an fMRI study. Neuroimage 2003; 19: 151020.

  14. Ratti M T, Bo P, Giardini A, et al. Chronic alcoholism and the frontal lobe: which executive functions are imparied? Acta Neurol Scand 2002; 105: 27681.

  15. Ratti M T, Soragna D, Sibilla L, et al. Cognitive impairment and cerebral atrophy in heavy drinkers. Prog Neuropsychopharmacol Biol Psychiatry 1999; 23: 24358.

  16. Sullivan E V, Fama R, Rosenbloom MJ, et al. A profile of neuropsychological deficits in alcoholic women. Neuropsychology 2002; 16: 7483.

  17. Cermak L S, Verfaellie M, Letourneau L, et al. Episodic effects on picture identification for alcoholic Korsakoff patients. Brain Cogn 1993; 22: 8597.

  18. Cermak L S, Bleich R P, Blackford S P. Deficits in the implicit retention of new associations by alcoholic Korsakoff patients. Brain Cogn 1988; 7: 31223.

  19. Edwin D, Flynn L, Klein A, et al. Cognitive impairment in alcoholic and nonalcoholic cirrhotic patients. Hepatology 1999; 30: 13637.

  20. R. Allan, K. Thoirs, and M. Phillips, Accuracy of ultrasound to identify chronic liver disease, World J Gastroenterol., vol. 28, no. 16, p. 35103520, July 2010.

  21. R. M. Haralick, K. Shanmugam, and I. Dinstein, Textural features for image classification, IEEE Trans. Syst. Man. Cybern., Vol.SMC-3, No.6, pp. 610-621, Jun., 1973.

  22. B. S. Manjunath and W. Y. Ma, Texture features for browsing and retrieval of image data, IEEE Trans. Pattern Anal. Machine Intell., Vol.18, No.8, pp. 837-842, Aug., 1996.

  23. D. A. Clausi and M. E. Jernigan, Designing Gabor filters for optimal texture separability, Pattern Recognit., Vol.33, pp. 1835-1849, 2000.

  24. A. Kumar and G. K. H. Pang, Defect detection in texture materials using Gabor filters, IEEE Trans. Ind. Applicat., Vol.38, No.2, pp. 425- 440, Mar./Apr., 2002.

  25. P. Rivaz and N. Kingsbury, Fast segmentation using level set curves of complex wavelet surfaces, in Proc. IEEE Int. Conf. on Image Processing, Vancouver, BC, Canada, pp. 592-595, Sep., 2000.

  26. Y. M. Kadah, A. A. Farag, J. M. Zurada, A. M. Badawi, and A.-B. M. Youssef, Classification algorithms for quantitative tissue characterization of diffuse liver disease from ultrasound images, IEEE Trans. Medical Imaging, Vol.15, No.4, pp. 466-478, Aug., 1996.

  27. Y. N. Sun, M.-H. Horng, X.-Z. Lin, and J.-Y. Wang, Ultrasound image analysis for liver diagnosis: A noninvasive alternative to determine liver disease, IEEE Eng. Med. Biol. Mag., pp. 93-101, Nov./Dec., 1996.

  28. E.-L. Chen, P.-C. Chung, C.-L. Chen, H.-M. Tsai, and C.-I. Chang, An automatic diagnostic system for CT liver image classification, IEEE Trans. Biomedical Engineering, Vol.45, No.6, pp. 783-794, Jun., 1998

  29. Raghesh Krishnan K and R. Sudhakar, Automatic Classification of Liver Diseases from Ultrasound Images Using GLRLM Texture Features, Soft Computing Applications, AISC 195, pp. 611624, Springer-Verlag Berlin Heidelberg 2013

Leave a Reply