<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JSIP</journal-id><journal-title-group><journal-title>Journal of Signal and Information Processing</journal-title></journal-title-group><issn pub-type="epub">2159-4465</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jsip.2015.63023</article-id><article-id pub-id-type="publisher-id">JSIP-59273</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Computed Tomography Image Enhancement Using Cuckoo Search: A Log Transform Based Approach
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>mira</surname><given-names>S. Ashour</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Sourav</surname><given-names>Samanta</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Nilanjan</surname><given-names>Dey</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Noreen</surname><given-names>Kausar</given-names></name><xref ref-type="aff" rid="aff4"><sup>4</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Wahiba</surname><given-names>Ben Abdessalemkaraa</given-names></name><xref ref-type="aff" rid="aff5"><sup>5</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Aboul</surname><given-names>Ella Hassanien</given-names></name><xref ref-type="aff" rid="aff6"><sup>6</sup></xref></contrib></contrib-group><aff id="aff4"><addr-line>Faculty for Mathematics and Computer Science, Alfaisal University, Riyadh, Saudi Arabia</addr-line></aff><aff id="aff1"><addr-line>Department of Electronics &amp;amp; Electrical Communications Engineering, Faculty of Engineering, Tanta University, Tanta, Egypt</addr-line></aff><aff id="aff2"><addr-line>Department of Computer Science &amp;amp; Engineering, University Institute of Technology, 
Burdwan, India</addr-line></aff><aff id="aff5"><addr-line>College of Computers and Information Technology, Taif University, Taif, Saudi Arabia</addr-line></aff><aff id="aff6"><addr-line>Scientific Research Group, Cairo University, Cairo, Egypt</addr-line></aff><aff id="aff3"><addr-line>Department of Computer Science &amp;amp; Engineering, Bengal College of Engineering Technology, Durgapur, 
India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>amirasashour@yahoo.com(MSA)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>15</day><month>07</month><year>2015</year></pub-date><volume>06</volume><issue>03</issue><fpage>244</fpage><lpage>257</lpage><history><date date-type="received"><day>25</day>	<month>July</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>28</month>	<year>August</year>	</date><date date-type="accepted"><day>31</day>	<month>August</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Medical image enhancement is an essential process for superior disease diagnosis as well as for detection of pathological lesion accurately. Computed Tomography (CT) is considered a vital medical imaging modality to evaluate numerous diseases such as tumors and vascular lesions. However, speckle noise corrupts the CT images and makes the clinical data analysis ambiguous. Therefore, for accurate diagnosis, medical image enhancement is a must for noise removal and sharp/clear images. In this work, a medical image enhancement algorithm has been proposed using log transform in an optimization framework. In order to achieve optimization, a well-known meta-heuristic algorithm, namely: Cuckoo search (CS) algorithm is used to determine the optimal parameter settings for log transform. The performance of the proposed technique is studied on a low contrast CT image dataset. Besides this, the results clearly show that the CS based approach has superior convergence and fitness values compared to PSO as the CS converge faster that proves the efficacy of the CS based technique. Finally, Image Quality Analysis (IQA) justifies the robustness of the proposed enhancement technique.
 
</p></abstract><kwd-group><kwd>Meta-Heuristic</kwd><kwd> Cuckoo Search</kwd><kwd> Image Enhancement</kwd><kwd> Medical Imaging</kwd><kwd> Log Transform</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Image enhancement is one of the protruding research areas in image processing as it is more favorable in numerous applications, namely: military [<xref ref-type="bibr" rid="scirp.59273-ref1">1</xref>] , satellite image processing [<xref ref-type="bibr" rid="scirp.59273-ref2">2</xref>] , geographical imaging [<xref ref-type="bibr" rid="scirp.59273-ref3">3</xref>] and medical image processing [<xref ref-type="bibr" rid="scirp.59273-ref4">4</xref>] . Its techniques are used to process a given image to recognize its features easily [<xref ref-type="bibr" rid="scirp.59273-ref5">5</xref>] clarifying its details that cannot be immediately observed in the original image, especially when the image is corrupted with high level of speckle noise [<xref ref-type="bibr" rid="scirp.59273-ref6">6</xref>] or has insufficient contrast [<xref ref-type="bibr" rid="scirp.59273-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.59273-ref8">8</xref>] . Since medical images are often deteriorated by noise due to different sources of interference and other equipments’ artifact that affects the measurement processes in imaging and data acquisition systems. Thus, advanced medical equipments have attracted much attention to improve medical image technologies as in [<xref ref-type="bibr" rid="scirp.59273-ref9">9</xref>] - [<xref ref-type="bibr" rid="scirp.59273-ref12">12</xref>] . Since the desired region of interest (ROI) is not well distinguishable from the background, the role of image enhancement augments is to improve the visibility of significant features in a medical image to facilitate the diagnosis process and remove/reduce noise.</p><p>Basically, image enhancement is the process of transforming/mapping digital images so that the results are more fitting for further image analysis [<xref ref-type="bibr" rid="scirp.59273-ref13">13</xref>] . According to the objective of image enhancement methods, they are broadly categorized into: spatial domain and frequency domain enhancement [<xref ref-type="bibr" rid="scirp.59273-ref14">14</xref>] [<xref ref-type="bibr" rid="scirp.59273-ref15">15</xref>] . Commonly, there are four categories of enhancement techniques based on the kind of transformation employed, namely: point operations (e.g. histogram equalization), spatial operation (e.g. median filtering), transform operations (e.g. homomorphic filtering) and pseudocoloring [<xref ref-type="bibr" rid="scirp.59273-ref16">16</xref>] .</p><p>Typically, spatial domain techniques directly deal with the image pixels that are controlled to attain the required enhancement. These techniques such as the logarithmic transforms, histogram equalization and power law transforms. They are mainly useful for directly modifying the individual pixel gray level values and thus the entire image overall contrast [<xref ref-type="bibr" rid="scirp.59273-ref17">17</xref>] . Log transformation is one of the basic well-known image enhancement techniques of the spatial domain that can be efficiently used for dark image contrast enhancements. It maps a narrow range of low input gray level values in a broad range of output values [<xref ref-type="bibr" rid="scirp.59273-ref18">18</xref>] [<xref ref-type="bibr" rid="scirp.59273-ref19">19</xref>] . As log functions are most valuable when the input gray level values have an exceptionally large range of values. During log transformation, the image dark pixels are expanded as compare to the higher pixel values that are type of compressed in log transformation that leads to image enhancement.</p><p>Trial and error and low level mathematical operators [<xref ref-type="bibr" rid="scirp.59273-ref20">20</xref>] are widely used in medical studies. However, medical image processing problems are empirical and/or heuristic in nature. Therefore, the experience-based heuristic method is designed to provide a solution which that may not be optimal, but can efficiently achieve a certain set of goals. Since image enhancement algorithm optimization parameters for every image type is an exhaustive task, image enhancement becomes a complex optimization problem leading to the use of a new class of algorithms; Meta-heuristics techniques that can provide superior results in a reasonable amount of time [<xref ref-type="bibr" rid="scirp.59273-ref21">21</xref>] .</p><p>A meta-heuristic technique is a set of algorithms used to define heuristic methods for various problems. These techniques involve defining an objective evaluation criterion to evaluate the fitness of the enhanced image under consideration. Moreover, the algorithm must be able to optimize the parameters of the transformation function, based on the input image. Thus, such techniques have been proposed for automatic image enhancement [<xref ref-type="bibr" rid="scirp.59273-ref22">22</xref>] . Genetic Algorithms (GAs) are considered adaptive heuristic search algorithms based on the evolutionary ideas of natural selection and genetics. GA is valuable in image enhancement as it is a derivative-free and stochastic optimization method [<xref ref-type="bibr" rid="scirp.59273-ref23">23</xref>] . In addition, all meta-heuristic algorithms use a certain randomization and local search and tend to be suitable for global optimization [<xref ref-type="bibr" rid="scirp.59273-ref24">24</xref>] . Several meta-heuristics have been proposed to deal with the computationally inflexible problems such as genetic algorithm and simulated annealing [<xref ref-type="bibr" rid="scirp.59273-ref25">25</xref>] , Particle swarm optimization (PSO) [<xref ref-type="bibr" rid="scirp.59273-ref26">26</xref>] [<xref ref-type="bibr" rid="scirp.59273-ref27">27</xref>] , Cuckoo search [<xref ref-type="bibr" rid="scirp.59273-ref28">28</xref>] [<xref ref-type="bibr" rid="scirp.59273-ref29">29</xref>] , Honey bee (HB) [<xref ref-type="bibr" rid="scirp.59273-ref30">30</xref>] . Among all the meta-heuristic algorithms, the Cuckoo Search (CS) algorithm is very proficient and less time consuming [<xref ref-type="bibr" rid="scirp.59273-ref31">31</xref>] . The CS has the advantage of both local search capabilities and guaranteed global convergence for automatic medical image enhancement application.</p><p>There are various equipments for medical imaging (X-Ray, CT, MRI, etc.) that encompasses information about heart, brain, nerves and other body organs providing physicians with a precise analysis of diagnosis and diseases. In the case of CT, numerous mathematical and medical applications can be applied to determine whether the normal tissue has been infected by the mutations of the cancer cell [<xref ref-type="bibr" rid="scirp.59273-ref32">32</xref>] . The computerized axial tomography (CAT), known as CT, proves its efficiency in medical image processing. It is considered one of the most important events in the application of image processing in medical diagnosis. Medical image enhancement focuses on solving the poor contrast and higher level noise of the medical image. The key step for medical image enhancement is based on selecting the suitable technique to: clarify the images for better human vision via removing noise/blur effect, to increase the contrast and to highlight the important details. In CT, pre-processing and enhancement techniques are used to improve the detection of the region of interest from CT images. Due to new medical instruments used in the medical field, much consideration is directed to medical image enhancement technologies. Since the CT suffers from blurred image and metal artifacts, the CT image enhancement becomes a must.</p><p>In [<xref ref-type="bibr" rid="scirp.59273-ref33">33</xref>] , an optimal enhancement was proposed using PSO for image enhancement, combining both log transform and PSO. The experimental results proved the PSO superiority compared to histogram equalization, linear contrast stretching and genetic algorithm based image enhancement. Consequently, the low contrast CT image of the liver is used to test the proposed algorithm where CS optimizes the parameters of the log transformation to enhance the images. The obtained result is also compared to the PSO based enhancement technique to evaluate the performance of the proposed study, as CS is a well established meta-heuristic algorithm.</p><p>Therefore, in this study a medical image enhancement algorithm has been proposed using log transform based Cuckoo search (CS) algorithm that optimize its paprameters. A low contrast CT image data set is used to test the proposed method performance. In addition, the Image Quality Analysis (IQA) is used to justify the robustness of the proposed enhancement technique.</p><p>The rest of the paper is constructed as follows: Section 2 demonstrates related work on medical image enhancement. Then, Section 3 includes the material and methods used, including the log transform algorithm and the Cuckoo search algorithm. The proposed method of Cuckoo Search optimization algorithm with log transform for CT image enhancement is included in Section 4. Section 5 includes results and discussion. Finally, the conclusion and future work in Section 6.</p></sec><sec id="s2"><title>2. Related Works on Medical Image Enhancement</title><p>In 1960, digital image processing techniques began; consecutively medical imaging started in 1970s [<xref ref-type="bibr" rid="scirp.59273-ref34">34</xref>] . CT is a non-invasive medical examination where algorithms are used to construct an image representing a “slice” through the object [<xref ref-type="bibr" rid="scirp.59273-ref35">35</xref>] . Recent related works to CT de-noising, enhancement and classification can be addressed as follows. Recent wavelet thresholding based de-noising methods have proven its capability with high-fre- quency signal details [<xref ref-type="bibr" rid="scirp.59273-ref36">36</xref>] . The threshold at certain scale is constant for all wavelet coefficients in the standard wavelet thresholding based noise reduction methods. A dual-tree complex wavelet based image de-noising method was introduced in [<xref ref-type="bibr" rid="scirp.59273-ref37">37</xref>] . In [<xref ref-type="bibr" rid="scirp.59273-ref38">38</xref>] a technique for image de-noising in the filtered domain based on the characteristics of the Empirical Mode Decomposition (EMD) and the wavelet technique were presented. An efficient noise reduction technique for CT images using windows-based multi-wavelet transformation and thresholding is proposed in [<xref ref-type="bibr" rid="scirp.59273-ref39">39</xref>] . In the year 2007 [<xref ref-type="bibr" rid="scirp.59273-ref18">18</xref>] , an enhancement technique based on logarithmic transforms coefficient adaptive histogram equalization (LTAHE) has been introduced. The method was based on the properties of logarithmic transform domain histogram as well as the contrast limited adaptive histogram equalization. The performance of the algorithm was compared quantitatively to the classical histogram equalization. The experimental results showed that the proposed algorithm performance was alongside classical histogram equalization.</p><p>In [<xref ref-type="bibr" rid="scirp.59273-ref40">40</xref>] , an image enhancement technique using CS algorithms and morphological operations was presented. The contrast value of the image was attained by calculating the fitness through the CS algorithm. In order to improve the quality of the image; the best contrast value of the image was selected and morphological operations were done by adjusting the intensity parameters. In [<xref ref-type="bibr" rid="scirp.59273-ref41">41</xref>] , a CS based algorithm for low quality fingerprint image contrast enhancement was proposed. The authors used a new objective function as a quality metric for global fingerprint image enhancement along with the CS for the gray level mapping technique for contrast enhancement. The results showed that the suggested CS algorithm can enhance the fingerprint images, on the general level of both noise eradication and quality metrics. In the same year, Bhandaria et al. [<xref ref-type="bibr" rid="scirp.59273-ref42">42</xref>] , introduced a novel contrast enhancement approach based on the CS algorithm and discrete wavelet transform-singular value decomposition (DWT-SVD) for quality improvement of the low contrast satellite images. The CS algorithm has been used to optimize each sub-band of the DWT and then acquired the singular value matrix of the low threshold sub-band image and ultimately used the inverse DWT to reconstruct the enhanced image. The results proved the superiority of the proposed method performance in terms of the Peak signal to noise ratio, Mean and Standard Deviation over the conventional techniques. In [<xref ref-type="bibr" rid="scirp.59273-ref43">43</xref>] , the Cuckoo Search algorithm has been used to tune the image enhancement functions for peak performance. For assessment a comparison to both the Genetic Algorithms and the Particle Swarm Optimization, Histogram Equalization and Linear Contrast Stretch techniques has been conducted. The experimental results have demonstrated the capability of the CS algorithm in optimizing the enhancement functions. Currently, by the year 2015 in [<xref ref-type="bibr" rid="scirp.59273-ref44">44</xref>] , the authors have been presented an image enhancement approach using a combination of the CS algorithm with Morphological Operation. The best contrast value of an image has been selected using the CS algorithm, then the morphological operations have to be performed. The results have been demonstrated that the proposed approach was converted into original color image without noise and adaptive process in order to enhance the quality of images.</p></sec><sec id="s3"><title>3. Materials and Methods</title><sec id="s3_1"><title>3.1. Function Overview</title><p>Commonly, image enhancement algorithms depend on the objective to be achieved as well as the application. The visual evaluation of image quality is highly subjective. Therefore, an urgent need for any image enhancement approach arises.</p><sec id="s3_1_1"><title>3.1.1. Transformation Function</title><p>Generally, any image can be defined as a two-dimensional function, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x5.png" xlink:type="simple"/></inline-formula>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x6.png" xlink:type="simple"/></inline-formula> are spatial coordinates, and the value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x7.png" xlink:type="simple"/></inline-formula> at any pair of coordinates at locations <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x8.png" xlink:type="simple"/></inline-formula> is called the intensity or gray-level (tone) of the image at that point. Classical image enhancement methods aim to improve the image contrast and sharpness of edges and to remove the noise as well. In order to solve this problem, a Logarithmic image processing (LIP) model was originally developed by Jourlin and Pinoli [<xref ref-type="bibr" rid="scirp.59273-ref45">45</xref>] . The LIP is a mathematical framework which provides a set of generalized adaptation of subtraction, addition, multiplication, convolution, etc. for signal and image processing. The brightness of an image are considered in the LIP model as the intensity of light that passes through a light filter with absorption function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x9.png" xlink:type="simple"/></inline-formula>. The absorption function is defined as the percentage of the incident light being absorbed by the light filter, also named as gray tone function. Therefore, an image can be represented by the absorption function. A realistic example of the light filter is the CT images, X-ray film, etc.</p><p>Consequently, instead of representing the CT image by its pixel brightness, it can be represented using the gray tone function as the image enhancement can be done through the gray level transformations. Assume an original image that has <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x10.png" xlink:type="simple"/></inline-formula> columns and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x11.png" xlink:type="simple"/></inline-formula> rows. The enhancement occurs at each pixel at location <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x12.png" xlink:type="simple"/></inline-formula> of the original image. The enhancement can be illustrated in [<xref ref-type="bibr" rid="scirp.59273-ref46">46</xref>] ,</p><disp-formula id="scirp.59273-formula735"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x13.png"  xlink:type="simple"/></disp-formula><p>where, the transformation function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x14.png" xlink:type="simple"/></inline-formula> has a gray value of the input image pixels <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x15.png" xlink:type="simple"/></inline-formula> denoted by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x16.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x17.png" xlink:type="simple"/></inline-formula> is the enhanced image gray value of the pixels<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x18.png" xlink:type="simple"/></inline-formula>.</p><p>For the local information extraction, a window of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x19.png" xlink:type="simple"/></inline-formula> size is used. The transformation is defined as follows:</p><disp-formula id="scirp.59273-formula736"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x20.png"  xlink:type="simple"/></disp-formula><p>As <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x21.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x22.png" xlink:type="simple"/></inline-formula> are parameters. Over <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x23.png" xlink:type="simple"/></inline-formula> window, the local mean of the pixel <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x24.png" xlink:type="simple"/></inline-formula> of the input image is;</p><disp-formula id="scirp.59273-formula737"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x25.png"  xlink:type="simple"/></disp-formula><p>The enhancement function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x26.png" xlink:type="simple"/></inline-formula> that holds both the local and global information is:</p><disp-formula id="scirp.59273-formula738"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x27.png"  xlink:type="simple"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x28.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x29.png" xlink:type="simple"/></inline-formula> are two parameters. The global mean is defined as;</p><disp-formula id="scirp.59273-formula739"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x30.png"  xlink:type="simple"/></disp-formula><p>In addition, the local standard deviation of the input image pixel <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x31.png" xlink:type="simple"/></inline-formula> for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x32.png" xlink:type="simple"/></inline-formula> window is given as;</p><disp-formula id="scirp.59273-formula740"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x33.png"  xlink:type="simple"/></disp-formula><p>By substituting from (4) into (2), the new transformation function is obtained where the contrast of the image is stretched,</p><disp-formula id="scirp.59273-formula741"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x34.png"  xlink:type="simple"/></disp-formula><p>The center of the stretch is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x35.png" xlink:type="simple"/></inline-formula>. The four parameters mentioned before are to produce large variations in the input image. In order to enhance the image, Lee’s algorithm with the log transform is used to increase the overall contrast and sharpness.</p></sec><sec id="s3_1_2"><title>3.1.2. Logarithmic Image Processing (Log Transform)</title><p>The gray tone (intensity) function is restricted as the brightness of an image is usually restricted to an interval; L = [0,255] for an 8-bit image. Where, the value “zero” means no absorption, while the value L corresponds to a totally opaque image. In [<xref ref-type="bibr" rid="scirp.59273-ref47">47</xref>] , a modified method for the implementation of Lee’s algorithm facilitates the good quality enhancement. For an 8-bit image, L = 256, the image intensity function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x36.png" xlink:type="simple"/></inline-formula> is transformed to the gray tone function as,</p><disp-formula id="scirp.59273-formula742"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x37.png"  xlink:type="simple"/></disp-formula><p>Subsequently, the gray tone function is transformed to the normalized negative gray tone function through the following equation,</p><disp-formula id="scirp.59273-formula743"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x38.png"  xlink:type="simple"/></disp-formula><p>Afterward, the logarithm of (9) is applied using Lee’s algorithm as follows,</p><disp-formula id="scirp.59273-formula744"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x39.png"  xlink:type="simple"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula>is the mean value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x41.png" xlink:type="simple"/></inline-formula> in a window of size <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x42.png" xlink:type="simple"/></inline-formula> centered on<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x43.png" xlink:type="simple"/></inline-formula>. Through converting <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x44.png" xlink:type="simple"/></inline-formula> back to the original scale, the enhanced output image <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x45.png" xlink:type="simple"/></inline-formula> is obtained.</p><p>The three control parameters for the algorithm according to (10) are;</p><p>1) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x46.png" xlink:type="simple"/></inline-formula>is used to adapt the image dynamic range. The smaller the value of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x47.png" xlink:type="simple"/></inline-formula>, the brighter the image will appear.</p><p>2)<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x48.png" xlink:type="simple"/></inline-formula>, is used to control the image sharpness. For sharper image the value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x49.png" xlink:type="simple"/></inline-formula> is chosen to be large within its range<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x48.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x50.png" xlink:type="simple"/></inline-formula>.</p><p>3)<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x51.png" xlink:type="simple"/></inline-formula>, is used to control the window size.</p><p>An initial range of [0, 2.0] is used for both <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x52.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x53.png" xlink:type="simple"/></inline-formula>, while the window size <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x54.png" xlink:type="simple"/></inline-formula> is chosen to be 3 for the proposed CT image enhancement application through experiment. Then, a selection of the optimal value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x55.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x56.png" xlink:type="simple"/></inline-formula> to enhance the dark CT image is performed based on the Cuckoo search algorithm to obtain the optimal parameters’ values of the log transformation. This leads to an enhanced CT image.</p></sec></sec><sec id="s3_2"><title>3.2. Evaluation Criteria</title><p>In order to evaluate/measure the quality of the enhanced image, an objective function is required that has three performance measures are:</p><p>・ Edge intensities sum.</p><p>・ Number of edges, as higher intensity of edges and more number of them as compared to the original image indicate good enhanced image.</p><p>・ Entropy value, which contains information about the image.</p><p>The objective function mentioned is:</p><disp-formula id="scirp.59273-formula745"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x57.png"  xlink:type="simple"/></disp-formula><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula>is the enhanced image created using the transformation function in (2). While, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula>is the edge image using Sobel edge detection, which is one of the efficient automatic threshold detector algorithms. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula>is the sum of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x61.png" xlink:type="simple"/></inline-formula> pixel intensities of Sobel edge image <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x62.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x63.png" xlink:type="simple"/></inline-formula> is the number of pixels, whose intensity value is above a threshold in<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x64.png" xlink:type="simple"/></inline-formula>. Using the enhanced image <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x65.png" xlink:type="simple"/></inline-formula> to produce an edge image as follows,</p><disp-formula id="scirp.59273-formula746"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x66.png"  xlink:type="simple"/></disp-formula><p>where,</p><disp-formula id="scirp.59273-formula747"><graphic  xlink:href="http://html.scirp.org/file/6-3400425x67.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.59273-formula748"><graphic  xlink:href="http://html.scirp.org/file/6-3400425x68.png"  xlink:type="simple"/></disp-formula><p>The entropy value is calculated using the histogram on the enhanced image<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x69.png" xlink:type="simple"/></inline-formula>, as:</p><disp-formula id="scirp.59273-formula749"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x70.png"  xlink:type="simple"/></disp-formula><p>where, the histogram transformation is considered one of the fundamental processes for contrast enhancement of gray level images. As, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x71.png" xlink:type="simple"/></inline-formula>is the probability of occurrence of the i<sup>th</sup> intensity value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x72.png" xlink:type="simple"/></inline-formula> image.</p></sec><sec id="s3_3"><title>3.3. Cuckoo Search based Image Enhancement</title><p>Approximately, all meta-heuristics use some form of stochastic components and try to reproduce the best features in nature, especially biological systems. The selection of fitness and adaptation to the environment are essential characteristics that the meta-heuristic algorithms attained. Traditionally, optimization techniques can be divided into two types [<xref ref-type="bibr" rid="scirp.59273-ref48">48</xref>] :</p><p>・ Direct method: is based on the objective function and constraints. This method is slow and requires numerous function evaluations for convergence.</p><p>・ Gradient-based method: used the 1<sup>st</sup> or 2<sup>nd</sup> order derivative of the objective function (OF) and/or constraints for guiding the search process. This method converges to an optimal solution; having less efficiency in non-differentiable or discontinuous problems. Also, it is difficult and unstable because the objective functions have a number of peaks.</p><p>Due to these drawbacks, the researchers develop the meta-heuristic algorithms to resolve the engineering optimization problems. Meta-heuristic algorithms have many methods, such as: simulated annealing (SA), Genetic algorithm (GA), Cuckoo Search (CS), particle swarm optimization (PSO), Firefly algorithm (FA), etc. The CS algorithm has obtained great interests and is found to be proficient as in [<xref ref-type="bibr" rid="scirp.59273-ref49">49</xref>] . Hence, in the current paper the Cuckoo Search algorithm via L&#233;vy flights is used to optimize the parameters of the log transform enhancement method. The CS algorithm is based on the considerable breeding behaviour such as brood parasitism of convincing species of Cuckoos. The CS algorithm is considered a new meta-heuristic algorithm for solving the optimization problems. It is motivated by the obligate brood parasitism of some Cuckoo species laying their eggs in the other host birds’ nest. Several host birds can employ direct conflict with the intruding Cuckoos. The algorithm merged with another key feature which is the L&#233;vy flight behaviour of fruit flies and some of the birds. The L&#233;vy flights are considered a class of random walks primarily devised. In the CS algorithm, each egg represents a new better solution to replace weak solutions in the nest. Using the simplest structure, each nest has one egg.</p><p>In [<xref ref-type="bibr" rid="scirp.59273-ref50">50</xref>] , three idealized rules that describe the Cuckoo Search algorithm are:</p><p>• At a time, each cuckoo lays one egg and leaves it in a randomly chosen nest;</p><p>• In the next generations, the best nests with high quality of eggs (solutions) will be carried over;</p><p>• The number of existing host nests is fixed and a host can discover an alien egg with a probability<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x73.png" xlink:type="simple"/></inline-formula>. In this case, the host bird can either throw the egg away or abandon the nest so as to build a completely new nest in a new location.</p><p>For simplicity, this last assumption can be estimated by a fraction <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x74.png" xlink:type="simple"/></inline-formula> of the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x75.png" xlink:type="simple"/></inline-formula> nests being replaced by new nests (with new random solutions at new locations).The solution fitness can be proportional to the objective function for a maximization problem. Based on these three rules, the basic steps of the Cuckoo Search (CS) are summarized in the next section. In this algorithm, when generating a new solution, a balanced arrangement of both local and global explorative random walk is controlled by a switching parameter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x74.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x76.png" xlink:type="simple"/></inline-formula>. The following equation represents the local random walk:</p><disp-formula id="scirp.59273-formula750"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x77.png"  xlink:type="simple"/></disp-formula><p>where, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x78.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x79.png" xlink:type="simple"/></inline-formula> are two different solutions chosen randomly by indiscriminate permutation, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x80.png" xlink:type="simple"/></inline-formula>is a Heaviside function, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x81.png" xlink:type="simple"/></inline-formula>is a random number drawn from a uniform distribution and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x82.png" xlink:type="simple"/></inline-formula> is the step size.</p><p>The global random walk performed using L&#233;vy flight is given by;</p><disp-formula id="scirp.59273-formula751"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x83.png"  xlink:type="simple"/></disp-formula><p>Here, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x84.png" xlink:type="simple"/></inline-formula>is the step size, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x85.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x86.png" xlink:type="simple"/></inline-formula>is the characteristic scale of the problem of interest.</p></sec></sec><sec id="s4"><title>4. Proposed Method Using Cuckoo Search Optimization Algorithm for Log Transform Parameters Optimization for CT Images</title><p>The CS proves its efficiency for better convergence towards global optimization than any other global search algorithm. Therefore, it is used through this work to support the log transformation. The parameter optimization in the log transformation-based image enhancement technique using CS algorithm is introduced in this work. According to (10), <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x87.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x88.png" xlink:type="simple"/></inline-formula> are the two parameters that have to be optimized in the log transform and the value of the third parameter (window size control <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x89.png" xlink:type="simple"/></inline-formula> ) will be set to 3.</p><p>In addition, in the CS Algorithm, each nest indicates the candidate solution that basically set to be 25 nests. Conversely, in the problem under concern, the search space is limited which leads to very quickly premature convergence towards the optimal solution with 25 nests. Thus, less number of nests are preferred and passed on trial and error, it is obtained that using 10 nests is suitable for our current experimental study.</p><p>In the proposed method, the following assumptions and steps will be tracked:</p><p>1) Each Cuckoo nest is represented by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x90.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x91.png" xlink:type="simple"/></inline-formula>. Clearly, each one belongs to the two dimensional space (d = 2 where, d defines the dimensions of the problem).</p><p>2) The range of the parameters <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x92.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x93.png" xlink:type="simple"/></inline-formula> has taken within the interval [0 to 2.0].</p><p>3) The number of nests is 10.</p><p>4) Each nest is used to enhance the original image using (10).</p><p>5) Fitness of each nest is determined.</p><p>6) The new nest is generated according to the best nest of the previous iteration.</p><p>7) When the algorithm reaches its maximum iteration, it stops and gives the global optimum solution containing values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x94.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x95.png" xlink:type="simple"/></inline-formula>.</p><p>The CS Algorithm for the optimization of the Log transform parameters is below, where during the algorithm: a) after every iteration, all cuckoos move towards the nest using the L&#233;vy flight approach, b) the number of nests is set after reaching the stopping criteria either a fixed number of iteration or tolerance value), c) the solution is randomly initialized by generating <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x96.png" xlink:type="simple"/></inline-formula> different nests (solutions), d) fitness for each of the obtained solutions is evaluated. Find the best nest corresponding to minimum/maximum (according to minimization or maximization) value of fitness. The fitness of the solution should be linked to the objective function of the problem of interest to start iterating and to generate a new nest by Levy flight. A Levy flight can be formed using (15).</p><disp-formula id="scirp.59273-formula752"><graphic  xlink:href="http://html.scirp.org/file/6-3400425x97.png"  xlink:type="simple"/></disp-formula></sec><sec id="s5"><title>5. Results and Discussion</title><p>The field of medical image enhancement is a significant aspect of medical image processing. Medical image enhancement techniques are used to improve some useful information in an image for physicians’ accurate diagnoses and removal/reduction of some unwanted information. Recently, numerous studies are performed in the medical imaging domain as in [<xref ref-type="bibr" rid="scirp.59273-ref51">51</xref>] -[<xref ref-type="bibr" rid="scirp.59273-ref54">54</xref>] .</p><p>Therefore, the proposed work is to study the Computed Tomography image enhancement using extensively the MATLAB 2012a software. The medical image enhancement of the proposed system uses log transform based cuckoo search algorithm and gray level images. The algorithm has been executed at a base station in a Windows 7 platform having 4GB RAM, Intel Core i7 2.80 GHz processor. The proposed method is tested on a database of 51 abdominal, low contrast/quality CT gray level liver lesions images taken from the Scientific Research Group in Egypt database (http://egyptscience.net/).</p><sec id="s5_1"><title>5.1. Comparing the results of Cuckoo Search versus PSO Algorithm</title><p>Generally, there some limitations regarding the computational time consuming that the metaheuristic algorithms suffer from, where the parameter tuning is considered a time-consuming process for tuning algorithms. As the wide range of problems try to find the best tune of the metaheuristic algorithm [<xref ref-type="bibr" rid="scirp.59273-ref55">55</xref>] .</p><p>A comparison between CT of CS and CT of PSO is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> to illustrate the results obtained from CT multiple liver lesions.</p><p>Another comparison set for the CT multiple liver lesions is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. This figure shows a different assessment when using the CS or the PSO compared with the original CT images.</p><p><xref ref-type="fig" rid="fig1">Figure 1</xref> and <xref ref-type="fig" rid="fig2">Figure 2</xref> established that the using CS provides more enhanced images than that are obtained using PSO. It is clear that the enhanced images using CS for the log transformation parameters optimization are clearer and include all portions of the liver with obvious lesion appearance compared to those based on PSO.</p><p>The comparison is done to benchmark the proposed cuckoo search algorithm with the particle swarm optimization based approach. <xref ref-type="table" rid="table1">Table 1</xref> shows a comparison between the fitness of the PSO and that of the CS to optimize the two parameters <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x98.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x99.png" xlink:type="simple"/></inline-formula>. It is performed up to 20 iterations and reports the number of iterations versus PSO and CS for the two parameter values as well as the fitness. This table illustrates that the fitness of the CS is better than that obtained using PSO for each corresponding iteration where,</p><p>1) The fitness value using the CS converges from the 13th iteration. Upon further iterations, the CS has pro-</p><fig-group id="fig1"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Output images using PSO and CS compared to the original image: (a) the original image; (b) the enhanced image based on PSO algorithm and (c) the enhanced image based on the Cuckoo Search algorithm.</title></caption><fig id ="fig1_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x100.png"/></fig><fig id ="fig1_2"><label> (c)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x101.png"/></fig><fig id ="fig1_3"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x102.png"/></fig></fig-group><fig-group id="fig2"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> (a)-(e) Original image; (f)-(j) enhanced based PSO; (k)-(o) enhanced based Cuckoo search.</title></caption><fig id ="fig2_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x103.png"/></fig><fig id ="fig2_2"><label> (c)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x104.png"/></fig><fig id ="fig2_3"><label> (d)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x105.png"/></fig><fig id ="fig2_4"><label> (e)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x106.png"/></fig><fig id ="fig2_5"><label>(f)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x107.png"/></fig><fig id ="fig2_6"><label> (g)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x108.png"/></fig><fig id ="fig2_7"><label> (h)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x109.png"/></fig><fig id ="fig2_8"><label> (i)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x110.png"/></fig><fig id ="fig2_9"><label> (j)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x111.png"/></fig><fig id ="fig2_10"><label>(k)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x112.png"/></fig><fig id ="fig2_11"><label> (l)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x113.png"/></fig><fig id ="fig2_12"><label> (m)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x114.png"/></fig><fig id ="fig2_13"><label> (n)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x115.png"/></fig><fig id ="fig2_14"><label> (o)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x116.png"/></fig><fig id ="fig2_15"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x117.png"/></fig></fig-group><p>duced the same fitness values.</p><p>2) The PSO doesn’t converge up to the 20th iteration. Also, the fitness value of the 20th iteration is less than that obtained using CS.</p><p><xref ref-type="table" rid="table1">Table 1</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref>, clearly reports that CS is superior to PSO in terms of both better fitness value and less time consuming to converge by studying the parameters namely: <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x118.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x119.png" xlink:type="simple"/></inline-formula>.</p></sec><sec id="s5_2"><title>5.2. Image Quality Analysis</title><p>According to the National Imagery Interpretability Rating Scale (NIIRS) [<xref ref-type="bibr" rid="scirp.59273-ref56">56</xref>] , image quality can be viewed as a</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> The fitness versus the number of iterations</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-3400425x120.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Comparison between PSO and CS</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle"  colspan="3"  >Particle Swarm Optimization</th><th align="center" valign="middle"  colspan="3"  >Cuckoo Search</th></tr></thead><tr><td align="center" valign="middle" >Iteration</td><td align="center" valign="middle" >Value of β</td><td align="center" valign="middle" >Value of ψ</td><td align="center" valign="middle" >Fitness</td><td align="center" valign="middle" >Value of β</td><td align="center" valign="middle" >Value of ψ</td><td align="center" valign="middle" >Fitness</td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.239645</td><td align="center" valign="middle" >0.801125</td><td align="center" valign="middle" >0.254787</td><td align="center" valign="middle" >0.03276</td><td align="center" valign="middle" >0.055063</td><td align="center" valign="middle" >0.164771</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >0.190233</td><td align="center" valign="middle" >0.841175</td><td align="center" valign="middle" >0.350391</td><td align="center" valign="middle" >0.03276</td><td align="center" valign="middle" >0.055063</td><td align="center" valign="middle" >0.164771</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >0.129936</td><td align="center" valign="middle" >0.592165</td><td align="center" valign="middle" >0.339073</td><td align="center" valign="middle" >0.03276</td><td align="center" valign="middle" >0.055063</td><td align="center" valign="middle" >0.164771</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >0.112296</td><td align="center" valign="middle" >0.655119</td><td align="center" valign="middle" >0.343742</td><td align="center" valign="middle" >0.03276</td><td align="center" valign="middle" >0.055063</td><td align="center" valign="middle" >0.164771</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >0.107487</td><td align="center" valign="middle" >0.53455</td><td align="center" valign="middle" >0.332492</td><td align="center" valign="middle" >0.042726</td><td align="center" valign="middle" >1.268582</td><td align="center" valign="middle" >0.282222</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >0.115824</td><td align="center" valign="middle" >0.589853</td><td align="center" valign="middle" >0.338578</td><td align="center" valign="middle" >0.042726</td><td align="center" valign="middle" >1.268582</td><td align="center" valign="middle" >0.282222</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >0.140781</td><td align="center" valign="middle" >0.633538</td><td align="center" valign="middle" >0.34222</td><td align="center" valign="middle" >0.196434</td><td align="center" valign="middle" >1.579214</td><td align="center" valign="middle" >0.380859</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >0.14733</td><td align="center" valign="middle" >0.643457</td><td align="center" valign="middle" >0.343771</td><td align="center" valign="middle" >0.196434</td><td align="center" valign="middle" >1.579214</td><td align="center" valign="middle" >0.380859</td></tr><tr><td align="center" valign="middle" >9</td><td align="center" valign="middle" >0.145702</td><td align="center" valign="middle" >0.628194</td><td align="center" valign="middle" >0.342372</td><td align="center" valign="middle" >0.196434</td><td align="center" valign="middle" >1.579214</td><td align="center" valign="middle" >0.380859</td></tr><tr><td align="center" valign="middle" >10</td><td align="center" valign="middle" >0.143447</td><td align="center" valign="middle" >0.631918</td><td align="center" valign="middle" >0.342515</td><td align="center" valign="middle" >0.196434</td><td align="center" valign="middle" >1.579214</td><td align="center" valign="middle" >0.380859</td></tr><tr><td align="center" valign="middle" >11</td><td align="center" valign="middle" >0.149737</td><td align="center" valign="middle" >0.662162</td><td align="center" valign="middle" >0.345147</td><td align="center" valign="middle" >0.079666</td><td align="center" valign="middle" >1.815622</td><td align="center" valign="middle" >0.383329</td></tr><tr><td align="center" valign="middle" >12</td><td align="center" valign="middle" >0.154622</td><td align="center" valign="middle" >0.684663</td><td align="center" valign="middle" >0.346963</td><td align="center" valign="middle" >0.079666</td><td align="center" valign="middle" >1.815622</td><td align="center" valign="middle" >0.383329</td></tr><tr><td align="center" valign="middle" >13</td><td align="center" valign="middle" >0.165177</td><td align="center" valign="middle" >0.731784</td><td align="center" valign="middle" >0.349811</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >14</td><td align="center" valign="middle" >0.143799</td><td align="center" valign="middle" >0.636281</td><td align="center" valign="middle" >0.342539</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >15</td><td align="center" valign="middle" >0.142713</td><td align="center" valign="middle" >0.631166</td><td align="center" valign="middle" >0.342282</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >16</td><td align="center" valign="middle" >0.152313</td><td align="center" valign="middle" >0.673288</td><td align="center" valign="middle" >0.34581</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >17</td><td align="center" valign="middle" >0.131058</td><td align="center" valign="middle" >0.579379</td><td align="center" valign="middle" >0.337402</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >18</td><td align="center" valign="middle" >0.136432</td><td align="center" valign="middle" >0.603201</td><td align="center" valign="middle" >0.339942</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >19</td><td align="center" valign="middle" >0.134301</td><td align="center" valign="middle" >0.593873</td><td align="center" valign="middle" >0.338746</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >0.152568</td><td align="center" valign="middle" >0.67466</td><td align="center" valign="middle" >0.346046</td><td align="center" valign="middle" >0.194583</td><td align="center" valign="middle" >1.583505</td><td align="center" valign="middle" >0.384113</td></tr></tbody></table></table-wrap><p>task-based scale used for military, civilian, and agricultural applications. It is used to model the metrics between an original image and an enhanced version of that image. The goal of the image quality analysis (IQA) is to evaluate and compare the performance of image processing algorithms. The quality is improved due to the image enhancement. The vast majority of the IQA algorithms is to measure local pixel wise differences and then to collapse these local measurements into a scalar which correspond to the overall quality difference [<xref ref-type="bibr" rid="scirp.59273-ref57">57</xref>] . The metrics for IQA are calculated as follows;</p><p>1) The Peak Signal to Noise ratio: is the ratio between the signal maximum power and the power of the corrupting noise that influences the consistency of its representation.</p><disp-formula id="scirp.59273-formula753"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x121.png"  xlink:type="simple"/></disp-formula><p>2) The Maximum Difference: is the difference between any two pixels such that the larger pixel emerges after the smallest pixel. The largest value of maximum difference indicates an image with poor quality.</p><disp-formula id="scirp.59273-formula754"><label>(17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x122.png"  xlink:type="simple"/></disp-formula><p>The Structural Content (SC): compares two images in a number of small image patches that the images have in common.</p><disp-formula id="scirp.59273-formula755"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-3400425x123.png"  xlink:type="simple"/></disp-formula><p>In addition, the Mean Square Error is defined as the mean squared diversity between the original image and the deformed image as it is calculated from the Euclidian distance involving the original and the degraded images. Based on the previous IQA metrics, <xref ref-type="table" rid="table2">Table 2</xref> compares the image quality of both the CS and the PSO algorithms. Note that for both algorithms, the log transform based image enhancement techniques PSNR, MSE or any IQA factors are not taken into consideration for the computation of the fitness function. It is clearly depicted that CS based technique sometimes gives higher PSNR and less MSE than PSO for the current experimental setup for most cases (because of selection of images, parameter setting, etc.) as shown in <xref ref-type="table" rid="table2">Table 2</xref>.</p><p>It is clear from <xref ref-type="table" rid="table2">Table 2</xref>, that almost the PSNR gained by the CS algorithm is either better or near the value with the PSO algorithm. Therefore, the motivation of selecting the CS based approach is that it has faster convergence rate and better fitness (<xref ref-type="table" rid="table1">Table 1</xref>) than that of PSO based approach, often slightly compromising with the image quality.</p></sec></sec><sec id="s6"><title>6. Conclusions</title><p>Although using Computed Tomography (CT) is very common in medical applications nowadays, it still has some disadvantages. Consequently, in this work, the CT image enhancement system is proposed using a log transformation based cuckoo search optimization algorithm. The results show that using the CS is superior to</p><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Different values of IQA parameters</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Image No.</th><th align="center" valign="middle" ></th><th align="center" valign="middle" >Mean Square Error</th><th align="center" valign="middle" >Structural Content</th><th align="center" valign="middle" >Maximum Difference</th><th align="center" valign="middle" >Peak Signal to Noise Ratio</th></tr></thead><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig1">Figure 1</xref>(c) <xref ref-type="fig" rid="fig1">Figure 1</xref>(b)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >1615.431</td><td align="center" valign="middle" >0.268224</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >16.04792</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >3491.34</td><td align="center" valign="middle" >0.166428</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >12.70088</td></tr><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig2">Figure 2</xref>(k) <xref ref-type="fig" rid="fig2">Figure 2</xref>(f)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >882.0331</td><td align="center" valign="middle" >0.376256</td><td align="center" valign="middle" >27</td><td align="center" valign="middle" >18.67595</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >3567.517</td><td align="center" valign="middle" >0.165018</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >12.60714</td></tr><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig2">Figure 2</xref>(l) <xref ref-type="fig" rid="fig2">Figure 2</xref>(g)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >595.5788</td><td align="center" valign="middle" >0.550663</td><td align="center" valign="middle" >68</td><td align="center" valign="middle" >20.38141</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >2911.217</td><td align="center" valign="middle" >0.228922</td><td align="center" valign="middle" >8</td><td align="center" valign="middle" >13.49006</td></tr><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig2">Figure 2</xref>(m) <xref ref-type="fig" rid="fig2">Figure 2</xref>(h)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >2052.392</td><td align="center" valign="middle" >0.306006</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >15.0082</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >2460.211</td><td align="center" valign="middle" >0.277327</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >14.22108</td></tr><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig2">Figure 2</xref>(n) <xref ref-type="fig" rid="fig2">Figure 2</xref>(i)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >4083.985</td><td align="center" valign="middle" >0.203789</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >12.01996</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >1711.182</td><td align="center" valign="middle" >0.344225</td><td align="center" valign="middle" >75</td><td align="center" valign="middle" >15.79784</td></tr><tr><td align="center" valign="middle"  rowspan="2"  ><xref ref-type="fig" rid="fig2">Figure 2</xref>(o) <xref ref-type="fig" rid="fig2">Figure 2</xref>(j)</td><td align="center" valign="middle" >CS</td><td align="center" valign="middle" >6050.041</td><td align="center" valign="middle" >0.137964</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >10.31322</td></tr><tr><td align="center" valign="middle" >PSO</td><td align="center" valign="middle" >5664.836</td><td align="center" valign="middle" >0.144281</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >10.59893</td></tr></tbody></table></table-wrap><p>PSO with respect to the convergence rate and the fitness values. As convergence is the outcome of meta-heuris- tic framework. The CS based approach gives higher fitness than PSO based technique in all iterations (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x124.png" xlink:type="simple"/></inline-formula> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x125.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-3400425x126.png" xlink:type="simple"/></inline-formula>) and the fitness value converges for CS based after the 13th iteration. On the other hand, PSO does not converge even after 20 iterations. All the experimental images are tested to report the robustness of CS based approach in terms of speed giving similar results. Thus, this paper study the effect of mixing different well established methods via using the CS to determine the optimum parameters of the log based enhancement on CT image, is the main objective of the proposed work.</p><p>This work can be further extended using multi-objective optimization techniques and can be compared to the obtained CS algorithm based results. Also, the medical image enhancement based CS can be applied to different medical imaging devices such as MRI, X-Ray, etc. Beside CS, there are several other meta-heuristic algorithms, namely: Firefly algorithm (FA), Bat algorithm, etc. which can be applied for the enhancement purpose which is beyond the scope of this study.</p></sec><sec id="s7"><title>Cite this paper</title><p>Amira S.Ashour,SouravSamanta,NilanjanDey,NoreenKausar,Wahiba BenAbdessalemkaraa,Aboul EllaHassanien,11, (2015) Computed Tomography Image Enhancement Using Cuckoo Search: A Log Transform Based Approach. Journal of Signal and Information Processing,06,244-257. doi: 10.4236/jsip.2015.63023</p></sec></body><back><ref-list><title>References</title><ref id="scirp.59273-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Schwering, P., Kemp, R. and Schutte, K. (2013) Image Enhancement Technology Research for Army Applications. Proceedings of SPIE, 8706, (87060O-2)-(87060O-11).</mixed-citation></ref><ref id="scirp.59273-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Harikrishna, O. and Maheshwari, A. (2012) Satellite Image Resolution Enhancement Using DWT Technique. International Journal of Soft Computing and Engineering (IJSCE), 2, 274-278.</mixed-citation></ref><ref id="scirp.59273-ref3"><label>3</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Dirim</surname><given-names> M. Aksoy</given-names></name>,<name name-style="western"><surname> E. and &amp;Ouml;zsoy</surname><given-names> G. </given-names></name>,<etal>et al</etal>. (<year>2009</year>)<article-title>Remote Sensing and Gis Applications for Monitoring Multi-Temporal Changes of Natural Resources in Bursa-Turkey</article-title><source> Journal of Environmental Sciences</source><volume> 3</volume>,<fpage> 53</fpage>-<lpage>59</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.59273-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Jiang, H. Lou, B. and Liao, S. (2012) Medical Image Enhancement Method Based on Mode Decomposition. Advances in Multimedia Technology (AMT), 1, 21-31. http://dx.doi.org/10.4156/amt.vol1.issue1.3</mixed-citation></ref><ref id="scirp.59273-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Cn, D. and Ma, V. (1988) Information Processing in Medical Imaging. Plenum Press, New York.</mixed-citation></ref><ref id="scirp.59273-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Ilango, G. and Gowri, B. (2012) &amp;epsilon;-Neighbourhood Median Filters to Remove Speckle Noise from CT-Images. International Journal of Applied Information Systems (IJAIS), 4, 40-46. http://dx.doi.org/10.5120/ijais12-450829</mixed-citation></ref><ref id="scirp.59273-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Peli, E. (1990) Contrast in Complex Images. Journal of the Optical Society of America, A7, 2032-2040.http://dx.doi.org/10.1364/JOSAA.7.002032</mixed-citation></ref><ref id="scirp.59273-ref8"><label>8</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Saruchi</surname><given-names> M. </given-names></name>,<etal>et al</etal>. (<year>2012</year>)<article-title>Comparative Study of Different Image Enhancement Techniques</article-title><source> International Journal of Computers &amp; Technology</source><volume> 2</volume>,<fpage> 131</fpage>-<lpage>133</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.59273-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Dey, N., Samanta, S., Chakraborty, S., Das, A., Chaudhuri, S. and Suri, J. (2014) Firefly Algorithm for Optimization of Scaling Factors during Embedding of Manifold Medical Information: An Application in Ophthalmology Imaging. Journal of Medical Imaging and Health Informatics, 4, 384-394. http://dx.doi.org/10.1166/jmihi.2014.1265</mixed-citation></ref><ref id="scirp.59273-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Dey, N., Acharjee, S., Biswas, D., Das, A. and Chaudhuri, S. (2012) Medical Information Embedding in Compressed Watermarked Intravascular Ultrasound Video. Transactions on Electronics and Communication, 57.</mixed-citation></ref><ref id="scirp.59273-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Dey, N., Chaudhuri, S., Chakraborty, S., Ahmed, S., Dey, G. and Maji, P. (2014) Effect of Trigonometric Functions Based Watermarking on Blood Vessel Extraction: An Application in Ophthalmology Imaging. International Journal of Embedding Systems, In Press.</mixed-citation></ref><ref id="scirp.59273-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Araki, T., Ikeda, N., Dey, N., Chakraborty, S., Saba, L., Kumar, D., et al. (2015) A Comparative Approach of Four Different Image Registration Techniques for Quantitative Assessment of Coronary Artery Calcium Lesions Using Intravascular Ultrasound. Computer Methods and Programs in Biomedicine, 118, 158-172.http://dx.doi.org/10.1016/j.cmpb.2014.11.006</mixed-citation></ref><ref id="scirp.59273-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Mustafi, A. and Mahanti, P. (2009) An Optimal Algorithm for Contrast Enhancement of Dark Images Using Genetic Algorithm. Computer an Information Science, 208, 1-8.</mixed-citation></ref><ref id="scirp.59273-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Agrawal, P., Chourasia, V., Kapoor, R. and Agrawal, S. (2014) A Comprehensive Study of the Image Enhancement Techniques. International Journal of Advance Foundation and Research in Computer (IJAFRC), 1, 85-89.</mixed-citation></ref><ref id="scirp.59273-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Maini, R. and Aggarwal, H. (2010) A Comprehensive Review of Image Enhancement Techniques. Journal of Computing, 2, 8-13.</mixed-citation></ref><ref id="scirp.59273-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Jain, A. (1991) Fundamentals of Digital Image Processing. Prentice-Hall, Englewood Cliffs.</mixed-citation></ref><ref id="scirp.59273-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Mundhada, S. and Shandilya, V.K. (2012) Spatial and Transformation Domain Techniques for Image Enhancement. International Journal of Engineering Science and Innovative Technology (IJESIT), 1, 213-216.</mixed-citation></ref><ref id="scirp.59273-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Hossain, F. and Alsharif, M. (2007) Image Enhancement Based on Logarithmic Transform Coefficient and Adaptive Histogram Equalization. Proceedings of the International Conference on Convergence Information Technology, Gyeongju, 21-23 November 2007, 1439-1444. http://dx.doi.org/10.1109/iccit.2007.258</mixed-citation></ref><ref id="scirp.59273-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Jain, R., Kasturi, R. and Schunck, B.G. (1995) Machine Vision. McGraw-Hill International Edition, New York.</mixed-citation></ref><ref id="scirp.59273-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Chang, D. and Wu, W. (1998) Image Contrast Enhancement Based on a Histogram Transformation of Local Standard Deviation. IEEE Transactions on Medical Imaging, 4, 518-531. http://dx.doi.org/10.1109/42.730397</mixed-citation></ref><ref id="scirp.59273-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Talbi, E. (2009) Metaheuristic: From Design to Implementation. John Wiley &amp; Sons, Hoboken.http://dx.doi.org/10.1002/9780470496916</mixed-citation></ref><ref id="scirp.59273-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Tjahjadi, T. and Celik, T. (2012) Automatic Image Equalization and Contrast Enhancement Using Gaussian Mixture Modelling. IEEE Transactions on Image Processing, 21, 145-156. http://dx.doi.org/10.1109/TIP.2011.2162419</mixed-citation></ref><ref id="scirp.59273-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Hole, K., Gulhane, V. and Shellokar, N. (2013) Application of Genetic Algorithm for Image Enhancement and Segmentation. International Journal of Advanced Research in Computer Engin-eering &amp; Technology (IJARCET), 2, 1342- 1346.</mixed-citation></ref><ref id="scirp.59273-ref24"><label>24</label><mixed-citation publication-type="book" xlink:type="simple">Voss, S. (2001) Meta-Heuristics: The State of the Art. In: Nareyek, A., Ed., Local Search for Planning and Scheduling, Springer-Verlag, Berlin, 1-23. http://dx.doi.org/10.1007/3-540-45612-0_1</mixed-citation></ref><ref id="scirp.59273-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Ballerini, L. (1998) Genetic Snakes for Medical Image Segmentation. Proceedings of the Conference on Mathematical Modeling and Estimation Techniques in Computer Vision, San Diego, 19 July 1998, 284-295.http://dx.doi.org/10.1117/12.323453</mixed-citation></ref><ref id="scirp.59273-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Kennedy, J. and Eberhart, R. (1995) Particle Swarm Optimization. Proceedings of the IEEE International Conference on Neural Networks, 4, 1942-1948. http://dx.doi.org/10.1109/ICNN.1995.488968</mixed-citation></ref><ref id="scirp.59273-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Gaurav, K. and Bansa, H. (2013) Particle Swarm Optimization (PSO) Technique for Image Enhancement. International Journal of Electronics &amp; Communication Technology (IJECT), 4, 117-119.</mixed-citation></ref><ref id="scirp.59273-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Dey, N., Samanta, S., Yang, X., Das, A. and Chaudhuri, S. (2013) Optimization of Scaling Factors in Electrocardiogram Signal Watermarking Using Cuckoo Search. International Journal of Bio-Inspired Computing, 5, 315-326.http://dx.doi.org/10.1504/IJBIC.2013.057193</mixed-citation></ref><ref id="scirp.59273-ref29"><label>29</label><mixed-citation publication-type="other" xlink:type="simple">Imtiaz, M. and Wahid, K. (2014) A Color Reproduction Method with Image Enhancement for Endoscopic Images. Proceedings of the 2014 Middle East Conference on Biomedical Engineering (MECBME), Doha, 17-20 February 2014, 17-20. http://dx.doi.org/10.1109/mecbme.2014.6783224</mixed-citation></ref><ref id="scirp.59273-ref30"><label>30</label><mixed-citation publication-type="other" xlink:type="simple">Haddad, O., Afshar, A. and Marino, M. (2006) Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization. Journal of Water Resources Management, 20, 661-680.http://dx.doi.org/10.1007/s11269-005-9001-3</mixed-citation></ref><ref id="scirp.59273-ref31"><label>31</label><mixed-citation publication-type="other" xlink:type="simple">Yang, X. and Deb, S. (2014) Cuckoo Search: Recent Advances and Applications. Neural Computing and Applications, 24, 169-174. http://dx.doi.org/10.1007/s00521-013-1367-1</mixed-citation></ref><ref id="scirp.59273-ref32"><label>32</label><mixed-citation publication-type="other" xlink:type="simple">Wang, S.S., Xia, Y., Liu, Q.G., Luo, J.H., Zhu, Y.M. and Feng, D.D. (2012) Gabor Feature Based Nonlocal Means Filter for Textured Image Denoising. Journal of Visual Communication and Image Representation, 23, 1008-1018.http://dx.doi.org/10.1016/j.jvcir.2012.06.011</mixed-citation></ref><ref id="scirp.59273-ref33"><label>33</label><mixed-citation publication-type="other" xlink:type="simple">Gorai, A. and Ghosh, A. (2009) Gray-Level Image Enhancement by Particle Swarm Optimization. Proceedings of the World Congress on Nature &amp; Biologically Inspired Computing, Coimbatore, 9-11 December 2009, 72-77.</mixed-citation></ref><ref id="scirp.59273-ref34"><label>34</label><mixed-citation publication-type="other" xlink:type="simple">Gonzalez, R. and Woods, R. (2002) Digital Image Processing. Prentice-Hall, Inc., Upper Saddle River.</mixed-citation></ref><ref id="scirp.59273-ref35"><label>35</label><mixed-citation publication-type="other" xlink:type="simple">Wang, C. (2011) Computer-Assisted Coronary CT Angiography Analysis: From Software Development to Clinical Application. Medical Dissertations, Link&amp;ouml;ping University, Link&amp;ouml;ping.</mixed-citation></ref><ref id="scirp.59273-ref36"><label>36</label><mixed-citation publication-type="other" xlink:type="simple">Borsdorf, A., Raupach, R., Flohr, T. and Hornegger, J. (2008) Wavelet Based Noise Reduction in CT-Images Using Correlation Analysis. IEEE Transactions on Medical Imaging, 27, 1685-1703.</mixed-citation></ref><ref id="scirp.59273-ref37"><label>37</label><mixed-citation publication-type="other" xlink:type="simple">Chen, G. and Kegl, B. (2007) Image Denoising with Complex Ridge Lets. Pattern Recognition, 40, 578-585.http://dx.doi.org/10.1016/j.patcog.2006.04.039</mixed-citation></ref><ref id="scirp.59273-ref38"><label>38</label><mixed-citation publication-type="other" xlink:type="simple">Arfia, F., Messaoud, M. and Abid, M. (2010) A New Image Denoising Technique Combining the Empirical Mode Decomposition with a Wavelet Transform Technique. Proceedings of the 17th international Conference on Systems, Signals and Image Processing, Rio de Janeiro, 17-19 June 2010, 514-517.</mixed-citation></ref><ref id="scirp.59273-ref39"><label>39</label><mixed-citation publication-type="other" xlink:type="simple">Ali, S., Vathsal, S. and Lalkishore, K. (2010) An Efficient Denoising Technique for CT Images Using Window-Based Multi Wavelet Transformation and Thresholding. European Journal of Scientific Research, 48, 315-325.</mixed-citation></ref><ref id="scirp.59273-ref40"><label>40</label><mixed-citation publication-type="other" xlink:type="simple">Pooja Rana, P. and Chopra, V. (2015) A Study on Image Enhancement Techniques. International Journal of Advanced Research in Computer and Communication Engineering, 4, 609-611. http://dx.doi.org/10.17148/IJARCCE.2015.45130</mixed-citation></ref><ref id="scirp.59273-ref41"><label>41</label><mixed-citation publication-type="other" xlink:type="simple">Bouaziz, A., Draa, A. and Chikhi, S. (2014) A Cuckoo Search Algorithm for Fingerprint Image Contrast Enhancement. Proceedings of the Second World Conference on Complex Systems (WCCS), Agadir, 10-13 November 2014, 678-685.http://dx.doi.org/10.1109/ICoCS.2014.7060930</mixed-citation></ref><ref id="scirp.59273-ref42"><label>42</label><mixed-citation publication-type="other" xlink:type="simple">Bhandaria, A.K., Sonia, V., Kumara, A. and Singh, G.K. (2014) Cuckoo Search Algorithm Based Satellite Image Contrast and Brightness Enhancement Using DWT-SVD. ISA Transactions, 53, 1286-1296.http://dx.doi.org/10.1016/j.isatra.2014.04.007</mixed-citation></ref><ref id="scirp.59273-ref43"><label>43</label><mixed-citation publication-type="other" xlink:type="simple">Soham, G., Sourya, R., Utkarsh, K. and Arijit, M. (2014) Gray Level Image Enhancement Using Cuckoo Search Algorithm. Advances in Intelligent Systems and Computing, 264, 275-286. http://dx.doi.org/10.1007/978-3-319-04960-1_25</mixed-citation></ref><ref id="scirp.59273-ref44"><label>44</label><mixed-citation publication-type="other" xlink:type="simple">Babu, R.K. and Sunitha, K.V.N. (2015) Enhancing Digital Images through Cuckoo Search Algorithm in Combination with Morphological Operation. Journal of Computer Science, 11, 7-17. http://dx.doi.org/10.3844/jcssp.2015.7.17</mixed-citation></ref><ref id="scirp.59273-ref45"><label>45</label><mixed-citation publication-type="other" xlink:type="simple">Jourlin, M. and Pinoli, J.C. (1988) A Model for Logarithmic Image Processing. Journal of Microscopy, 149, 21-35.http://dx.doi.org/10.1111/j.1365-2818.1988.tb04559.x</mixed-citation></ref><ref id="scirp.59273-ref46"><label>46</label><mixed-citation publication-type="other" xlink:type="simple">Hassanzadeh, T., Vojodi, H. and Mahmoudi, F. (2011) Non-Linear Grayscale Image Enhancement Based on Firefly Algorithm. Lecture Notes in Computer Science, 7077, 174-181. http://dx.doi.org/10.1007/978-3-642-27242-4_21</mixed-citation></ref><ref id="scirp.59273-ref47"><label>47</label><mixed-citation publication-type="other" xlink:type="simple">Nadezhda, S. and Stephanie, S. (2010) Fast and Efficient Iris Image Enhancement Using Logarithmic Image Processing. Proceedings of the Conference on Biometric Technology for Human Identification VII, Orlando, 5-9 April 2010.http://dx.doi.org/10.1117/12.851351</mixed-citation></ref><ref id="scirp.59273-ref48"><label>48</label><mixed-citation publication-type="other" xlink:type="simple">Kaur, G. and Singh, R. (2014) Sharpening Enhancement of Ultra Sound Images Using Firefly Algorithm. International Journal of Advanced Research in Computer Science and Software Engin-eering, 4, 1039-1044.</mixed-citation></ref><ref id="scirp.59273-ref49"><label>49</label><mixed-citation publication-type="other" xlink:type="simple">Samanta, S., Dey, N., Das, P., Acharjee, S. and Chaudhuri, S. (2012) Multilevel Threshold Based Gray Scale Image Segmentation Using Cuckoo Search. Proceedings of the International Conference on Emerging Trends in Electrical, Electronics and Communication Technologies-ICECIT, India, 12-23 December 2012, 27-34.</mixed-citation></ref><ref id="scirp.59273-ref50"><label>50</label><mixed-citation publication-type="other" xlink:type="simple">Yang, X. and Deb, S. (2010) Engineering Optimization by Cuckoo Search. International Journal of Mathematical Modeling and Numerical Optimization, 4, 330-343. http://dx.doi.org/10.1504/IJMMNO.2010.035430</mixed-citation></ref><ref id="scirp.59273-ref51"><label>51</label><mixed-citation publication-type="book" xlink:type="simple">Kriti, J.V., Dey, N. and Kumar, V. (2015) Chapter 5: PCA-PNN and PCA-SVM Based CAD Systems for Breast Density Classification. In: Hassanien, A.-E., Fahmy, M. and Grosan, C., Eds., Applications of Intelligent Optimization in Biology and Medicine: Current Trends and Open Problems, Springer, Berlin, 159-177.</mixed-citation></ref><ref id="scirp.59273-ref52"><label>52</label><mixed-citation publication-type="book" xlink:type="simple">Kausar, N., Palaniappan, S., Al Ghamdi, B.S., Samir, B.B., Dey, N. and Abdullah, A. (2015) Systematic Analysis of Applied Data Mining Based Optimization Algorithms in Clinical Attribute Extraction and Classification for Diagnosis of Cardiac Patients. In: Hassanien, A.-E., Grosan, C. and Tolba, M.F., Eds., Applications of Intelligent Optimization in Biology and Medicine, Springer, Dordrecht, 217-231. http://dx.doi.org/10.1007/978-3-319-21212-8_9</mixed-citation></ref><ref id="scirp.59273-ref53"><label>53</label><mixed-citation publication-type="book" xlink:type="simple">Cheriguene, S., Azizi, N., Zemmal, N., Dey, N., Djellali, H. and Farah, N. (2015) Optimized Tumor Breast Cancer Classification Using Combining Random Subspace and Static Classifiers Selection Paradigms. In: Hassanien, A.-E., Grosan, C. and Tolba, M.F., Eds., Applications of Intelligent Optimization in Biology and Medicine, Springer, Dordrecht, 289-304.</mixed-citation></ref><ref id="scirp.59273-ref54"><label>54</label><mixed-citation publication-type="other" xlink:type="simple">Acharjee, S., Dey, N., Samanta, S., Das, D., Roy, R., Chakraborty, S. and Chaudhuri, S.S. (2015) ECG Signal Compression Using Ant Weight Lifting Algorithm for Tele-Monitoring. Journal of Medical Imaging and Health Informatics, 5, 1246-1250.</mixed-citation></ref><ref id="scirp.59273-ref55"><label>55</label><mixed-citation publication-type="other" xlink:type="simple">Yang, X.S., Chien, S.F. and Ting, T.O. (2014) Computational Intelligence and Metaheuristic Algorithms with Applications. Scientific World Journal, 2014, 1-4. http://dx.doi.org/10.1155/2014/425853</mixed-citation></ref><ref id="scirp.59273-ref56"><label>56</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Irvine</surname><given-names> J.M. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>National Imagery Interpretability Rating Scales (NIIRS): Overview and Methodology</article-title><source> SPIE</source><volume> 3128</volume>,<fpage> 93</fpage>-<lpage>103</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.59273-ref57"><label>57</label><mixed-citation publication-type="other" xlink:type="simple">Chandler, D.M. (2013) Seven Challenges in Image Quality Assessment: Past, Present, and Future Research. ISRN Signal Processing, 2013, 1-53. http://dx.doi.org/10.1155/2013/905685</mixed-citation></ref></ref-list></back></article>