<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">15159</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2021.015159</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>The Research of Automatic Classification of Ultrasound Thyroid Nodules</article-title>
<alt-title alt-title-type="left-running-head">The Research of Automatic Classification of Ultrasound Thyroid Nodules</alt-title>
<alt-title alt-title-type="right-running-head">The Research of Automatic Classification of Ultrasound Thyroid Nodules</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>An</surname>
<given-names>Yanling</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author"  corresp="yes">
<name name-style="western">
<surname>Hu</surname>
<given-names>Shaohai</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
<email>shhu@bjtu.eud.cn</email>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Liu</surname>
<given-names>Shuaiqi</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Zhao</surname>
<given-names>Jie</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="aff" rid="aff-3">3</xref>
<email>zhaojie_hbu@163.com</email>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western">
<surname>Zhang</surname>
<given-names>Yu-Dong</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Institute of Information Science, Beijing Jiaotong University</institution>, <addr-line>Beijing, 100044</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>College of Electronic and Information Engineering, Hebei University</institution>, <addr-line>Baoding, 071000</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Machine Vision Technology Innovation Center of Hebei Province</institution>, <addr-line>Baoding, 071000</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Informatics, University of Leicester</institution>, <addr-line>Leicester, LE1 7RH</addr-line>, <country>UK</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1">&#x002A;Corresponding Authors: Shaohai Hu. Email: <email>shhu@bjtu.eud.cn</email>; Jie Zhao. Email: <email>zhaojie_hbu@163.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-06-26"><day>26</day><month>06</month><year>2021</year></pub-date>
<volume>128</volume>
<issue>1</issue>
<fpage>203</fpage>
<lpage>222</lpage>
<history>
<date date-type="received"><day>26</day><month>11</month><year>2020</year></date>
<date date-type="accepted"><day>01</day><month>3</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 An et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>An et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_15159.pdf"></self-uri>
<abstract>
<p>This paper proposes a computer-aided diagnosis system which can automatically detect thyroid nodules (TNs) and discriminate them as benign or malignant. The system firstly uses variational level set active contour with gradients and phase information to complete automatic extraction of the boundaries of thyroid nodules images. Then according to thyroid ultrasound images and clinical diagnostic criteria, a new feature extraction method based on the fusion of shape, gray and texture is explored. Due to the imbalance of thyroid sample classes, this paper introduces a weight factor to improve support vector machine, offering different classes of samples with different weights. Finally, thyroid nodules are classified and discriminated by the improved support vector machine. Experiments show that the efficiency of discrimination on benign and malignant thyroid nodules is improved.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Thyroid nodules</kwd>
<kwd>active contour model</kwd>
<kwd>feature extraction</kwd>
<kwd>image classification</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Thyroid nodule is a common disease and timely detection and treatment can prevent it from turning into malignant tumors. The continuously improved accuracy of ultrasound diagnosis of thyroid nodules has made ultrasound diagnosis the preferred laboratory examination of thyroid nodular disease [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. In the process of detecting and assessing disease severity, computer-aided analysis [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>] improves the readability of medical images and provides a reliable second opinion, which helps doctors to make a more accurate diagnostic decision. Computer-aided diagnosis system has been successfully applied to the analysis of ultrasound images of liver, breast, prostate and other soft tissues of different internal organs. Currently, comparatively fewer researches apply computer-aided analysis to assess thyroid diseases. And early studies on thyroid texture analysis are limited to extracting features from histograms. For example, Iakovidis et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] proposed a fuzzy local binary pattern (FLBP) for ultrasound texture characterization to automatic classification of thyroid nodules. Chang et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] applied support vector machine for feature selection and classification of thyroid nodules in ultrasound images. Morifuji et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] studied whether thyroid nodules are malignant; Acharya et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] combined local binary pattern (LBP) and Gabor transform features for automatic classification of ultrasound thyroid nodules. On one hand, these studies demonstrated the effectiveness of histogram on thyroid tissue feature. On the other hand, the feature-based histogram cannot compile the distribution of the image pixels on space. Thus, for thyroid ultrasound image texture analysis, the new approach combines histogram features with statistical features. These statistical features include Haralick co-occurrence features [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>], Muzzolini spatial characteristics [<xref ref-type="bibr" rid="ref-11">11</xref>], Radon transform features [<xref ref-type="bibr" rid="ref-12">12</xref>] and LBP features [<xref ref-type="bibr" rid="ref-13">13</xref>]. Most of these methods use histogram, second or even senior statistical texture descriptors to indicate thyroid ultrasound mode. In order to consider the uncertainty caused by the inherent speckle noise of thyroid ultrasound images, Iakovidis et al. [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>] proposed FLBP algorithm. But the selection of fuzzy parameters increases the feature dimension, which, is not conducive to the classification hyperplane search from the classification point of view. Moreover, the training costs will be greatly improved, while the speed of classification will be appropriately reduced.</p>
<p>To sum up, the diagnosis of thyroid disease is mainly carried out through studying the ultrasonic image texture features and the echo pattern at home and abroad. Research based on shape information is rare. Therefore, this paper makes quantitative analysis and study on morphological characteristics. Description of thyroid nodules&#x2019; morphological characteristic parameters is extracted and fused with texture and gray feature to analyze thyroid, so as to discriminate the tumor as benign or malignant. It offers a reference for the clinical thyroid nodule detection and diagnosis.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Segmentation of the Nodules&#x2019; Region</title>
<p>With the advantages of automatically processing topology changes, active contour segmentation based on level set becomes a widely used method in the field of image segmentation [<xref ref-type="bibr" rid="ref-16">16</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>]. The basic idea is to represent contour as the zero-level set of the level set function, then the level set function is embedded to the curve evolution equation. The evolution of the curve is obtained through the evolution of its zero-level set. In this paper, we choose the classic DRLSE model as the prototype of the segmentation model. The relevant theoretical of the DRLSE model and the disadvantages existing in practical application will be described as follows.</p>
<sec id="s2_1">
<label>2.1</label>
<title>DRLSE Model and Analysis</title>
<p>The DRLSE model, proposed by [<xref ref-type="bibr" rid="ref-18">18</xref>], is a variational level set partitioning method based on edge information. Its energy functional is as follows:</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-1.png"/><tex-math id="tex-eqn-1"><![CDATA[$
\begin{equation} \begin{array}{l} \varepsilon \left(\phi \right)=\mu R_{p}\left(\phi \right)+\lambda L\left(\phi \right)\\ 
\hspace*{23pt}=\mu \displaystyle\int {}_{\Omega }^{}{}{}p\left(\nabla \phi \right)dx+\lambda \int {}_{\Omega }^{}{}{}g\delta \left(\phi \right)\nabla \phi dx \end{array} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mtable columnalign="left"><mml:mtr columnalign="left"><mml:mtd columnalign="left"><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign="left"><mml:mtd columnalign="left"></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mstyle displaystyle="true"><mml:mrow><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msubsup><mml:mrow></mml:mrow><mml:mi>&#x03A9;</mml:mi><mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:mstyle><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2207;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mstyle displaystyle="true"><mml:mrow><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msubsup><mml:mrow></mml:mrow><mml:mi>&#x03A9;</mml:mi><mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:mstyle><mml:mi>g</mml:mi><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2207;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-1"><!--<alternatives><inline-graphic xlink:href="ieqn-1.png"/><tex-math id="tex-ieqn-1"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-1"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the level set function, <inline-formula id="ieqn-2"><!--<alternatives><inline-graphic xlink:href="ieqn-2.png"/><tex-math id="tex-ieqn-2"><![CDATA[$
 \varepsilon 
$]]></tex-math>--><mml:math id="mml-ieqn-2"><mml:mi>&#x03B5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the energy functional form, <inline-formula id="ieqn-3"><!--<alternatives><inline-graphic xlink:href="ieqn-3.png"/><tex-math id="tex-ieqn-3"><![CDATA[$
 R_{p} 
$]]></tex-math>--><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> is the distance adjustment term of the level set, <inline-formula id="ieqn-4"><!--<alternatives><inline-graphic xlink:href="ieqn-4.png"/><tex-math id="tex-ieqn-4"><![CDATA[$
 \nabla 
$]]></tex-math>--><mml:math id="mml-ieqn-4"><mml:mi mathvariant="normal">&#x2207;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is Laplacian operator, <inline-formula id="ieqn-5"><!--<alternatives><inline-graphic xlink:href="ieqn-5.png"/><tex-math id="tex-ieqn-5"><![CDATA[$
 \Omega 
$]]></tex-math>--><mml:math id="mml-ieqn-5"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the local region of image, and <inline-formula id="ieqn-6"><!--<alternatives><inline-graphic xlink:href="ieqn-6.png"/><tex-math id="tex-ieqn-6"><![CDATA[$
 p 
$]]></tex-math>--><mml:math id="mml-ieqn-6"><mml:mi>p</mml:mi></mml:math><!--</alternatives>--></inline-formula> is energy density function. At last, <inline-formula id="ieqn-7"><!--<alternatives><inline-graphic xlink:href="ieqn-7.png"/><tex-math id="tex-ieqn-7"><![CDATA[$
 \mu 
$]]></tex-math>--><mml:math id="mml-ieqn-7"><mml:mi>&#x03BC;</mml:mi></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-8"><!--<alternatives><inline-graphic xlink:href="ieqn-8.png"/><tex-math id="tex-ieqn-8"><![CDATA[$
 \lambda 
$]]></tex-math>--><mml:math id="mml-ieqn-8"><mml:mi>&#x03BB;</mml:mi></mml:math><!--</alternatives>--></inline-formula> are respectively the weight coefficients of the regularization term and the length term. The first item is the regularization term of the level set function <inline-formula id="ieqn-9"><!--<alternatives><inline-graphic xlink:href="ieqn-9.png"/><tex-math id="tex-ieqn-9"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-9"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> regularization term is to ensure that the level set function <inline-formula id="ieqn-10"><!--<alternatives><inline-graphic xlink:href="ieqn-10.png"/><tex-math id="tex-ieqn-10"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-10"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is approximately to the signed distance function to the greatest extent during the curve evolution, which avoids periodic initialization of curve evolution in the evolution process. The second term is weighted length term which takes the <inline-formula id="ieqn-11"><!--<alternatives><inline-graphic xlink:href="ieqn-11.png"/><tex-math id="tex-ieqn-11"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-11"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function as the weight. It is used to drive zero-level set curves to evaluate to the target edge. Based on the image gradient, the<inline-formula id="ieqn-12"><!--<alternatives><inline-graphic xlink:href="ieqn-12.png"/><tex-math id="tex-ieqn-12"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-12"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function is an edge-stopping function which can be obtained by:</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-2.png"/><tex-math id="tex-eqn-2"><![CDATA[$
\begin{equation} g\triangleq \frac{1}{1+\left| \nabla G_{\sigma }*I\right| ^{2}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-2" display="block"><mml:mi>g</mml:mi><mml:mo>&#x225C;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>I</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-13"><!--<alternatives><inline-graphic xlink:href="ieqn-13.png"/><tex-math id="tex-ieqn-13"><![CDATA[$
 G_{\sigma } 
$]]></tex-math>--><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>&#x03C3;</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> is the Gauss filter function, <inline-formula id="ieqn-14"><!--<alternatives><inline-graphic xlink:href="ieqn-14.png"/><tex-math id="tex-ieqn-14"><![CDATA[$
 I 
$]]></tex-math>--><mml:math id="mml-ieqn-14"><mml:mi>I</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the image, and <inline-formula id="ieqn-15"><!--<alternatives><inline-graphic xlink:href="ieqn-15.png"/><tex-math id="tex-ieqn-15"><![CDATA[$
 \nabla 
$]]></tex-math>--><mml:math id="mml-ieqn-15"><mml:mi mathvariant="normal">&#x2207;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the gradient operator.</p>
<p>DRLSE model features simple numerical solution and speedy convergence. Moreover, it does not need to reinitialize the level set. However, for the segmentation of medical ultrasound images, due to the low contrast between tissues and organs in ultrasound images, fuzzy boundary, intensity inhomogeneity in images before and after ultrasonic field, the <inline-formula id="ieqn-16"><!--<alternatives><inline-graphic xlink:href="ieqn-16.png"/><tex-math id="tex-ieqn-16"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-16"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function cannot reach zero on the boundary, while curve evolution can not stop at the target boundary. As shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, a thyroid nodule ultrasound image. We put the initial contour inside the target and evolve it through expansion curve. The experimental results show that the curve evolution crosses the target boundary, leading to edge leakage.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>A comparison of the inaccurate boundary locations of the DRLSE model. (a1) Original image1 (b1) DRLSE segmentation (a2) Original image2 (b2) DRLSE segmentation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-1.png"/>
</fig>
<p>The problem is that when an edge-stopping function deals with weak edges, it is not zero at the weak edge due to the relevant small gradient of the weak edge [<xref ref-type="bibr" rid="ref-19">19</xref>]. Therefore, it is necessary to search for a new edge-stopping function which can guarantee the convergence at the weak boundary.</p>
<p>Considering the importance and the stability of the phase information, this paper tries to use phase information to segment the thyroid ultrasound image. We design an edge-stopping function that combines phase information with gradient information, replace the edge-stopping function based on gradient in DRLSE model and solve the problem that the evolution curve cannot be stopped at the target boundary in DRLSE model.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Phase Coherence Thyroid Nodule Segmentation Analysis</title>
<p>The phase congruency detection is a new method to detect features. Rather than detecting based on intensity gradient features, it analyzes the mutation location of image gray level from the frequency domain [<xref ref-type="bibr" rid="ref-20">20</xref>]. Studies have shown that image features perceived by human eyes are often located in the high point of phase congruency, while edge detection of phase congruency is assumed that the most congruent phase points of the Fourier components in the image were feature points. Thus, edge detection is a more reliable way than the conventional gradient calculation method. Based on this principle, Morrone et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] defined the phase congruency function:</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-3.png"/><tex-math id="tex-eqn-3"><![CDATA[$
\begin{equation} PC\left(x\right)=\max _{\varphi \left(x\right)\in \left(0,2\pi \right)}\frac{\sum _{n}A_{n}\cos \left(\varphi _{n}\left(x\right)-\varphi \left(x\right)\right)}{\sum _{n}A_{n}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-3" display="block"><mml:mi>P</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mfrac><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-17"><!--<alternatives><inline-graphic xlink:href="ieqn-17.png"/><tex-math id="tex-ieqn-17"><![CDATA[$
 PC\left(x\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-17"><mml:mi>P</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the phase congruency measure, obtaining maximum value at the target edge while obtaining a smaller value in the background area with its value which ranges from 0 to 1, <inline-formula id="ieqn-18"><!--<alternatives><inline-graphic xlink:href="ieqn-18.png"/><tex-math id="tex-ieqn-18"><![CDATA[$
 A_{n} 
$]]></tex-math>--><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> represents the magnitude of the <italic>n</italic>-th harmonic cosine component. <inline-formula id="ieqn-19"><!--<alternatives><inline-graphic xlink:href="ieqn-19.png"/><tex-math id="tex-ieqn-19"><![CDATA[$
 \varphi _{n} 
$]]></tex-math>--><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> is the initial phase of the second component of <inline-formula id="ieqn-20"><!--<alternatives><inline-graphic xlink:href="ieqn-20.png"/><tex-math id="tex-ieqn-20"><![CDATA[$
 n 
$]]></tex-math>--><mml:math id="mml-ieqn-20"><mml:mi>n</mml:mi></mml:math><!--</alternatives>--></inline-formula>, <inline-formula id="ieqn-21"><!--<alternatives><inline-graphic xlink:href="ieqn-21.png"/><tex-math id="tex-ieqn-21"><![CDATA[$
 \varphi _{n}\left(x\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> represents the local phase point of the Fourier components of the point <inline-formula id="ieqn-22"><!--<alternatives><inline-graphic xlink:href="ieqn-22.png"/><tex-math id="tex-ieqn-22"><![CDATA[$
 x 
$]]></tex-math>--><mml:math id="mml-ieqn-22"><mml:mi>x</mml:mi></mml:math><!--</alternatives>--></inline-formula>. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> is the experimental results comparison between the gradient detection and phase detection of the thyroid ultrasound images. We can find the phase congruency performs better than gradient operator in detecting the edge of the target.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Experimental comparison chart of gradient edge detection and phase detection. (a1) Original image (b1) Gradient edge detection (c1) Phase edge detection (a2) Original image (b2) Gradient edge detection (c2) Phase edge detection</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-2.png"/>
</fig>
<p>Therefore, a boundary indicator function based on the phase congruency operator and gradient operator is proposed in this paper. Let <inline-formula id="ieqn-23"><!--<alternatives><inline-graphic xlink:href="ieqn-23.png"/><tex-math id="tex-ieqn-23"><![CDATA[$
 I 
$]]></tex-math>--><mml:math id="mml-ieqn-23"><mml:mi>I</mml:mi></mml:math><!--</alternatives>--></inline-formula> be the image and <inline-formula id="ieqn-24"><!--<alternatives><inline-graphic xlink:href="ieqn-24.png"/><tex-math id="tex-ieqn-24"><![CDATA[$
 I\left(i,j\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-24"><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the gray level of the pixels in <inline-formula id="ieqn-25"><!--<alternatives><inline-graphic xlink:href="ieqn-25.png"/><tex-math id="tex-ieqn-25"><![CDATA[$
 i 
$]]></tex-math>--><mml:math id="mml-ieqn-25"><mml:mi>i</mml:mi></mml:math><!--</alternatives>--></inline-formula>-th row and <inline-formula id="ieqn-26"><!--<alternatives><inline-graphic xlink:href="ieqn-26.png"/><tex-math id="tex-ieqn-26"><![CDATA[$
 j 
$]]></tex-math>--><mml:math id="mml-ieqn-26"><mml:mi>j</mml:mi></mml:math><!--</alternatives>--></inline-formula>-th column in image <inline-formula id="ieqn-27"><!--<alternatives><inline-graphic xlink:href="ieqn-27.png"/><tex-math id="tex-ieqn-27"><![CDATA[$
 I 
$]]></tex-math>--><mml:math id="mml-ieqn-27"><mml:mi>I</mml:mi></mml:math><!--</alternatives>--></inline-formula>, and the phase <inline-formula id="ieqn-28"><!--<alternatives><inline-graphic xlink:href="ieqn-28.png"/><tex-math id="tex-ieqn-28"><![CDATA[$
 PC\left(i,j\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-28"><mml:mi>P</mml:mi><mml:mi>C</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the phase congruency function value of the <inline-formula id="ieqn-29"><!--<alternatives><inline-graphic xlink:href="ieqn-29.png"/><tex-math id="tex-ieqn-29"><![CDATA[$
 i 
$]]></tex-math>--><mml:math id="mml-ieqn-29"><mml:mi>i</mml:mi></mml:math><!--</alternatives>--></inline-formula>-th row and <inline-formula id="ieqn-30"><!--<alternatives><inline-graphic xlink:href="ieqn-30.png"/><tex-math id="tex-ieqn-30"><![CDATA[$
 j 
$]]></tex-math>--><mml:math id="mml-ieqn-30"><mml:mi>j</mml:mi></mml:math><!--</alternatives>--></inline-formula>-th column. At the edge of the image, phase congruency of the image is relatively larger, which is <inline-formula id="ieqn-31"><!--<alternatives><inline-graphic xlink:href="ieqn-31.png"/><tex-math id="tex-ieqn-31"><![CDATA[$
 pc\left(i,j\right)\geq k 
$]]></tex-math>--><mml:math id="mml-ieqn-31"><mml:mi>p</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>k</mml:mi></mml:math><!--</alternatives>--></inline-formula>. <inline-formula id="ieqn-32"><!--<alternatives><inline-graphic xlink:href="ieqn-32.png"/><tex-math id="tex-ieqn-32"><![CDATA[$
 k 
$]]></tex-math>--><mml:math id="mml-ieqn-32"><mml:mi>k</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the manually set constant, which is set to 0 on this occasion. Phase congruency is smaller in the flat areas of the image. To avoid trapping into local minimum value, we still choose edge-stopping function based on gradient. Therefore, combining phase information with gradient information, we construct a new edge indicating function <inline-formula id="ieqn-33"><!--<alternatives><inline-graphic xlink:href="ieqn-33.png"/><tex-math id="tex-ieqn-33"><![CDATA[$
 g_{p}\left(I\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> (also called edge-stopping function) acting as edge stopping power, which forces the level set evolution curve stopping at the target edge. The function is specifically defined as follows:</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-4.png"/><tex-math id="tex-eqn-4"><![CDATA[$
\begin{equation} g_{p}\left(I\right)=\left\{\begin{array}{l@{\quad}l} 
\displaystyle\frac{1}{1+\left| \nabla I\left(x,\mathrm{y}\right)\right| ^{2}},& pc\left(i,j\right)\leq k\\ 
0,&pc\left(i,j\right)\leq k\, \end{array}\right\} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">y</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mstyle></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mi>k</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mi>k</mml:mi><mml:mspace width="thinmathspace" /></mml:mtd></mml:mtr></mml:mtable><mml:mo>}</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>In light with the <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, a 3D comparison of the effects is shown. The comparison is between the original edge-stopping function based on the gradient information and the edge-stopping function combining the phase information with the gradient information for thyroid ultrasound images at the tumor edge. It can be seen that the improved boundary function convergent at the weak boundary.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>3D effect comparison between gradient edge detection and phase detection</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-3.png"/>
</fig>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Level Set of the Segmentation Model Improvement</title>
<p>Based on geometric evolutionary theory and partial differential equations theory, we use boundary indicator function <inline-formula id="ieqn-34"><!--<alternatives><inline-graphic xlink:href="ieqn-34.png"/><tex-math id="tex-ieqn-34"><![CDATA[$
 g_{p}\left(I\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> that combines the phase information with gradient information to control the curve evolution. We construct a new energy functional as follows:</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-5.png"/><tex-math id="tex-eqn-5"><![CDATA[$
\begin{equation} \begin{array}{l} \varepsilon \left(\phi \right)=\mu R_{p}\left(\phi \right)+\lambda L\left(\phi \right)+\alpha A\left(\phi \right)\\ 
\hspace*{23pt}=\mu \displaystyle\int {}_{\Omega }^{}{}{}p\left(\nabla \phi \right)dx+\lambda \int {}_{\Omega }^{}{}{}g\delta \left(\phi \right)\nabla \phi dx+\alpha \int {}_{\Omega }^{}{}{}gH\left(-\phi \right)dx \end{array} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mtable columnalign="left"><mml:mtr columnalign="left"><mml:mtd columnalign="left"><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:msub><mml:mi>R</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign="left"><mml:mtd columnalign="left"></mml:mtd><mml:mtd columnalign="left"><mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mstyle displaystyle="true"><mml:mrow><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msubsup><mml:mrow></mml:mrow><mml:mi>&#x03A9;</mml:mi><mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:mstyle><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2207;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mstyle displaystyle="true"><mml:mrow><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msubsup><mml:mrow></mml:mrow><mml:mi>&#x03A9;</mml:mi><mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:mstyle><mml:mi>g</mml:mi><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2207;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mi>d</mml:mi><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mstyle displaystyle="true"><mml:mrow><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:msubsup><mml:mrow></mml:mrow><mml:mi>&#x03A9;</mml:mi><mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:mstyle><mml:mi>g</mml:mi><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-35"><!--<alternatives><inline-graphic xlink:href="ieqn-35.png"/><tex-math id="tex-ieqn-35"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-35"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the level set function, <inline-formula id="ieqn-36"><!--<alternatives><inline-graphic xlink:href="ieqn-36.png"/><tex-math id="tex-ieqn-36"><![CDATA[$
 \varepsilon 
$]]></tex-math>--><mml:math id="mml-ieqn-36"><mml:mi>&#x03B5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the energy functional form, <inline-formula id="ieqn-37"><!--<alternatives><inline-graphic xlink:href="ieqn-37.png"/><tex-math id="tex-ieqn-37"><![CDATA[$
 R_{p} 
$]]></tex-math>--><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> is the distance adjustment term of the level set, <inline-formula id="ieqn-38"><!--<alternatives><inline-graphic xlink:href="ieqn-38.png"/><tex-math id="tex-ieqn-38"><![CDATA[$
 \nabla 
$]]></tex-math>--><mml:math id="mml-ieqn-38"><mml:mi mathvariant="normal">&#x2207;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is Laplacian operator, <inline-formula id="ieqn-39"><!--<alternatives><inline-graphic xlink:href="ieqn-39.png"/><tex-math id="tex-ieqn-39"><![CDATA[$
 \Omega 
$]]></tex-math>--><mml:math id="mml-ieqn-39"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the local region of image, and <inline-formula id="ieqn-40"><!--<alternatives><inline-graphic xlink:href="ieqn-40.png"/><tex-math id="tex-ieqn-40"><![CDATA[$
 p 
$]]></tex-math>--><mml:math id="mml-ieqn-40"><mml:mi>p</mml:mi></mml:math><!--</alternatives>--></inline-formula> is energy density function. At last, <inline-formula id="ieqn-41"><!--<alternatives><inline-graphic xlink:href="ieqn-41.png"/><tex-math id="tex-ieqn-41"><![CDATA[$
 \mu 
$]]></tex-math>--><mml:math id="mml-ieqn-41"><mml:mi>&#x03BC;</mml:mi></mml:math><!--</alternatives>--></inline-formula>, <inline-formula id="ieqn-42"><!--<alternatives><inline-graphic xlink:href="ieqn-42.png"/><tex-math id="tex-ieqn-42"><![CDATA[$
 \lambda 
$]]></tex-math>--><mml:math id="mml-ieqn-42"><mml:mi>&#x03BB;</mml:mi></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-43"><!--<alternatives><inline-graphic xlink:href="ieqn-43.png"/><tex-math id="tex-ieqn-43"><![CDATA[$
 \alpha 
$]]></tex-math>--><mml:math id="mml-ieqn-43"><mml:mi>&#x03B1;</mml:mi></mml:math><!--</alternatives>--></inline-formula> are respectively the weight coefficients of the regularization term, the length term and the area term. <inline-formula id="ieqn-44"><!--<alternatives><inline-graphic xlink:href="ieqn-44.png"/><tex-math id="tex-ieqn-44"><![CDATA[$
 H 
$]]></tex-math>--><mml:math id="mml-ieqn-44"><mml:mi>H</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the Heaviside function and <inline-formula id="ieqn-45"><!--<alternatives><inline-graphic xlink:href="ieqn-45.png"/><tex-math id="tex-ieqn-45"><![CDATA[$
 \delta 
$]]></tex-math>--><mml:math id="mml-ieqn-45"><mml:mi>&#x03B4;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the Dirac function. The first item is the regularization term of the level set function <inline-formula id="ieqn-46"><!--<alternatives><inline-graphic xlink:href="ieqn-46.png"/><tex-math id="tex-ieqn-46"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-46"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> regularization term is to ensure that the level set function <inline-formula id="ieqn-47"><!--<alternatives><inline-graphic xlink:href="ieqn-47.png"/><tex-math id="tex-ieqn-47"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-47"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is approximately to the signed distance function to the greatest extent during the curve evolution, which avoids periodic initialization of curve evolution in the evolution process. The second term is weighted length term which takes the <inline-formula id="ieqn-48"><!--<alternatives><inline-graphic xlink:href="ieqn-48.png"/><tex-math id="tex-ieqn-48"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-48"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function as the weight. It is used to drive zero-level set curves to evaluate to the target edge. The third term is the weighted area term which takes the <inline-formula id="ieqn-49"><!--<alternatives><inline-graphic xlink:href="ieqn-49.png"/><tex-math id="tex-ieqn-49"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-49"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function as the weigh. It corresponds to the balloon force and is used to speed up the evolution. When the initial contour is outside of the target, <inline-formula id="ieqn-50"><!--<alternatives><inline-graphic xlink:href="ieqn-50.png"/><tex-math id="tex-ieqn-50"><![CDATA[$
 \alpha 
$]]></tex-math>--><mml:math id="mml-ieqn-50"><mml:mi>&#x03B1;</mml:mi></mml:math><!--</alternatives>--></inline-formula> takes a positive value which could make the contour rapidly shrinks. While the initial contour is inside of the target, <inline-formula id="ieqn-51"><!--<alternatives><inline-graphic xlink:href="ieqn-51.png"/><tex-math id="tex-ieqn-51"><![CDATA[$
 \alpha 
$]]></tex-math>--><mml:math id="mml-ieqn-51"><mml:mi>&#x03B1;</mml:mi></mml:math><!--</alternatives>--></inline-formula> takes a negative value which could make the contour rapidly expanses. Based on the image gradient, the <inline-formula id="ieqn-52"><!--<alternatives><inline-graphic xlink:href="ieqn-52.png"/><tex-math id="tex-ieqn-52"><![CDATA[$
 g 
$]]></tex-math>--><mml:math id="mml-ieqn-52"><mml:mi>g</mml:mi></mml:math><!--</alternatives>--></inline-formula> function is an edge-stopping function According to the variational theory, the gradient descent flow of the steepest descent of minimize functional <inline-formula id="ieqn-53"><!--<alternatives><inline-graphic xlink:href="ieqn-53.png"/><tex-math id="tex-ieqn-53"><![CDATA[$
 \varepsilon 
$]]></tex-math>--><mml:math id="mml-ieqn-53"><mml:mi>&#x03B5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is:</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-6.png"/><tex-math id="tex-eqn-6"><![CDATA[$
\begin{equation} \frac{\partial \varepsilon }{\partial \phi }=\mu \left[\Delta \phi -div\left(\frac{\Delta \phi }{\left| \Delta \phi \right| }\right)\right]+\lambda \delta \left(\phi \right)div\left(g_{p}\frac{\Delta \phi }{\left| \Delta \phi \right| }\right)+\alpha g_{p}\delta \left(\phi \right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-6" display="block"><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>&#x03B5;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>&#x03D5;</mml:mi></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>&#x03D5;</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The descent flow equation is the evolution equation of the level set segmentation model that combines the phase with gradient information. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the effect of image segmentation of the above algorithm.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Contrast segmentation results of thyroid ultrasound images. (a1) Original image 1 (b1) DRLSE model (c1) The proposed model (a2) Original image 2 (b2) DRLSE model (c2) The proposed model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-4.png"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Feature Extraction</title>
<p>On the basis of segmentation, the feature extraction of nodules is carried out. In clinic, doctors discriminate the thyroid nodules as malignant or benign according to nine parameters: morphology of nodules, boundary, capsule, acoustic halo, depth-width ratio, internal echo, calcification spot, rear echo and blood flow. Among these features, shape, boundary, capsule, acoustic halo and depth-width ratio can be described through contour feature extraction of the nodules. While internal echo, calcification spot, rear echo can be described through the gray and texture since they are related to the gray distribute on of thyroid nodule ultrasound image. Therefore, this paper puts forward a new feature extraction algorithm that combines the feature of the information of shape, texture and gray of the ultrasonic image for discrimination of benign and malignant thyroid nodules.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Shape Feature Extraction</title>
<p>On the basis of segmentation, contour features of nodule, including shape, orientation and edge, extract the features of nodules&#x2019; circularity, depth-width ratio, the average direction number, the standard deviation of the normalized radial length, roughness index and envelope and acoustic halo [<xref ref-type="bibr" rid="ref-22">22</xref>]. The circularity, the average direction number and the standard deviation of normalized radial length of nodules are parameters which are associated with the nodule shape (reflecting the irregular degree of nodules). The depth-width ratio reflects the growth pattern of nodules. Roughness index describes the nodules (Burr) edge, while envelope and acoustic halo features reflect whether the nodules have envelope and acoustic halo or not.</p>
<p>(1) Circularity (Roundness)</p>
<p>Assuming that the whole area of the tumor is <inline-formula id="ieqn-54"><!--<alternatives><inline-graphic xlink:href="ieqn-54.png"/><tex-math id="tex-ieqn-54"><![CDATA[$
 S 
$]]></tex-math>--><mml:math id="mml-ieqn-54"><mml:mi>S</mml:mi></mml:math><!--</alternatives>--></inline-formula> and the perimeter is <inline-formula id="ieqn-55"><!--<alternatives><inline-graphic xlink:href="ieqn-55.png"/><tex-math id="tex-ieqn-55"><![CDATA[$
 L 
$]]></tex-math>--><mml:math id="mml-ieqn-55"><mml:mi>L</mml:mi></mml:math><!--</alternatives>--></inline-formula>, we define the circularity as:</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-7.png"/><tex-math id="tex-eqn-7"><![CDATA[$
\begin{equation} E=4\pi S/L^{2} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-7" display="block"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>S</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msup><mml:mi>L</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Image is composed of pixels, so <italic>L</italic> can be represented by the number of pixels on the edge. <italic>S</italic> can be represented by the number of pixels on the edge. The closer to circle the tumor shape is, the bigger <italic>E</italic> value will be, and the more likely the tumor is benign, and vice versa.</p>
<p>(2) Standard deviation of the normalized radial length</p>
<p>The distance between the centroid of the tumor area and the edge of the image is considered as the radial length of the tumor, as shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Radial length schematic diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-5.png"/>
</fig>
<p>Normalized radial length is obtained by normalizing the radial length, as shown in the following:</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-8.png"/><tex-math id="tex-eqn-8"><![CDATA[$
\begin{equation} d\left(i\right)=\frac{\sqrt{\left(x\left(i\right)-x_{0}\right)^{2}+\left(y\left(i\right)-y_{0}\right)^{2}}}{\max \left(d\left(i\right)\right)},\quad i=1,2,\cdots ,N \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-8" display="block"><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-56"><!--<alternatives><inline-graphic xlink:href="ieqn-56.png"/><tex-math id="tex-ieqn-56"><![CDATA[$
 \left(x_{0},y_{0}\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-56"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the centric coordinates, <inline-formula id="ieqn-57"><!--<alternatives><inline-graphic xlink:href="ieqn-57.png"/><tex-math id="tex-ieqn-57"><![CDATA[$
 \left(x_{i},y_{i}\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-57"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the coordinates of <italic>i</italic>-th point on the edge of tumor. <italic>N</italic> is the number of points  on the tumor edge. <inline-formula id="ieqn-58"><!--<alternatives><inline-graphic xlink:href="ieqn-58.png"/><tex-math id="tex-ieqn-58"><![CDATA[$
 \max \left(d\left(i\right)\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-58"><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the maximum value in radius. Therefore, the average value <inline-formula id="ieqn-59"><!--<alternatives><inline-graphic xlink:href="ieqn-59.png"/><tex-math id="tex-ieqn-59"><![CDATA[$
 d_{ave} 
$]]></tex-math>--><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and the standard deviation <inline-formula id="ieqn-60"><!--<alternatives><inline-graphic xlink:href="ieqn-60.png"/><tex-math id="tex-ieqn-60"><![CDATA[$
 std 
$]]></tex-math>--><mml:math id="mml-ieqn-60"><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi></mml:math><!--</alternatives>--></inline-formula> of the normalized radial length are obtained by the following calculation:</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-9.png"/><tex-math id="tex-eqn-9"><![CDATA[$
\begin{equation} d_{ave}=\frac{1}{N}\sum _{i=1}^{N}d\left(i\right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-10.png"/><tex-math id="tex-eqn-10"><![CDATA[$
\begin{equation} std=\sqrt{\frac{1}{N-1}\sum _{i=1}^{N}\left(d\left(i\right)-d_{ave}\right)^{2}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-10" display="block"><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The principle that discriminates benign and malignant tumor through the standard deviation of normalized radial length macroscopically reflects the similarity between the contour and the circle.</p>
<p>The smaller the standard deviation is, the more similar to circle the target is, and the more likely is benign tumor.</p>
<p>(3) Average direction number</p>
<p>In the process of edge extraction, we set the angle between any pixel and the adjacent pixel as <inline-formula id="ieqn-61"><!--<alternatives><inline-graphic xlink:href="ieqn-61.png"/><tex-math id="tex-ieqn-61"><![CDATA[$
 \alpha _{i} 
$]]></tex-math>--><mml:math id="mml-ieqn-61"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>, the number of pixels on the image edge as <inline-formula id="ieqn-62"><!--<alternatives><inline-graphic xlink:href="ieqn-62.png"/><tex-math id="tex-ieqn-62"><![CDATA[$
 N 
$]]></tex-math>--><mml:math id="mml-ieqn-62"><mml:mi>N</mml:mi></mml:math><!--</alternatives>--></inline-formula>. The average direction number is defined as:</p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-11.png"/><tex-math id="tex-eqn-11"><![CDATA[$
\begin{equation} D=\sum _{i=1}^{N}\alpha _{i}/N \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-11" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>N</mml:mi></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The average direction number is mainly used to reflect the smooth degree of the tumor edge, the smoother the edge is, the smaller the average direction is.</p>
<p>(4) Depth-Width Ratio (DWR)</p>
<p>In clinical, DWR is a frequently applied quantitative feature of thyroid ultrasound. <inline-formula id="ieqn-63"><!--<alternatives><inline-graphic xlink:href="ieqn-63.png"/><tex-math id="tex-ieqn-63"><![CDATA[$
 \mathit{Depth} 
$]]></tex-math>--><mml:math id="mml-ieqn-63"><mml:mrow><mml:mi mathvariant="italic">D</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">h</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> represents the distance between the furthest two points on the edge. <inline-formula id="ieqn-64"><!--<alternatives><inline-graphic xlink:href="ieqn-64.png"/><tex-math id="tex-ieqn-64"><![CDATA[$
 \mathit{Width} 
$]]></tex-math>--><mml:math id="mml-ieqn-64"><mml:mrow><mml:mi mathvariant="italic">W</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">h</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> represents the distance between the nearest two points on the edge. DWR is defined as:</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-12.png"/><tex-math id="tex-eqn-12"><![CDATA[$
\begin{equation} DWR=\frac{\mathit{Depth}}{\mathit{Width}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-12" display="block"><mml:mi>D</mml:mi><mml:mi>W</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">D</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">W</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">d</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">h</mml:mi></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>In some extent, it reflects the growth pattern of tumor. It is generally considered that if the DWR is less than 1, the malignant degree of tumor is low.</p>
<p>(5) Boundary roughness <italic>R</italic></p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-13.png"/><tex-math id="tex-eqn-13"><![CDATA[$
\begin{equation} R=\frac{1}{N}\sum _{i=1}^{N}\left| d\left(i\right)-d\left(i+1\right)\right| \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-13" display="block"><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The roughness is the average of the sum of the absolute value of the difference of standard radius of the adjacent two points on the edge in clockwise or counterclockwise direction. Obviously, the rougher the edges are (and sometimes more Burr), the bigger value it will be, and the more likely for  it is cancer.</p> 
<p>(6) The envelope and acoustic halo feature</p>
<p>The description of the edge feature of benign nodules generally involves envelope and acoustic halo. The quantification of edge features can be calculated through the gray distribution [<xref ref-type="bibr" rid="ref-23">23</xref>] at the adjacent areas of the nodules&#x2019; boundary. In the level set method, two strip areas which locate inside and outside of the nodule can be obtained. We respectively took a level set function &#x2212;0.5, 0 and 0.5, among which the level set &#x2212;0.5 corresponds to the nodule interior, level set 0 corresponds to the nodule boundary and level set 0.5 corresponds to the nodule exterior, as shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Strip areas in and out of the tumor boundary</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-6.png"/>
</fig>
<p>Assume that the numbers of pixel in the internal and external strip areas are <inline-formula id="ieqn-65"><!--<alternatives><inline-graphic xlink:href="ieqn-65.png"/><tex-math id="tex-ieqn-65"><![CDATA[$
 n_{1} 
$]]></tex-math>--><mml:math id="mml-ieqn-65"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-66"><!--<alternatives><inline-graphic xlink:href="ieqn-66.png"/><tex-math id="tex-ieqn-66"><![CDATA[$
 n_{2} 
$]]></tex-math>--><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>, and the gray mean values are <inline-formula id="ieqn-67"><!--<alternatives><inline-graphic xlink:href="ieqn-67.png"/><tex-math id="tex-ieqn-67"><![CDATA[$
 u_{1} 
$]]></tex-math>--><mml:math id="mml-ieqn-67"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-68"><!--<alternatives><inline-graphic xlink:href="ieqn-68.png"/><tex-math id="tex-ieqn-68"><![CDATA[$
 u_{2} 
$]]></tex-math>--><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>. We use inter variance to measure the gray statistical differences between the internal and external areas:</p>
<p><disp-formula id="eqn-14">
<label>(14)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-14.png"/><tex-math id="tex-eqn-14"><![CDATA[$
\begin{equation*} \mathit{InterVar}=\frac{n_{1}\left(u_{1}-u\right)^{2}+n_{2}\left(u_{2}-u\right)^{2}}{\left(n_{1}+n_{2}\right)} \end{equation*}
$]]></tex-math>--><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-69"><!--<alternatives><inline-graphic xlink:href="ieqn-69.png"/><tex-math id="tex-ieqn-69"><![CDATA[$
 u=\frac{n_{1}u_{1}+n_{2}u_{2}}{n_{1}+n_{2}} 
$]]></tex-math>--><mml:math id="mml-ieqn-69"><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math><!--</alternatives>--></inline-formula>. The bigger <inline-formula id="ieqn-70"><!--<alternatives><inline-graphic xlink:href="ieqn-70.png"/><tex-math id="tex-ieqn-70"><![CDATA[$
 \mathit{InterVar} 
$]]></tex-math>--><mml:math id="mml-ieqn-70"><mml:mrow><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is, the greater possibility for the gray level of internal, the more statistically significant difference external adjacent areas have, and the more possibility for the envelope and halo exist. By normalizing the processing, <inline-formula id="ieqn-71"><!--<alternatives><inline-graphic xlink:href="ieqn-71.png"/><tex-math id="tex-ieqn-71"><![CDATA[$
 \mathit{InterVar} 
$]]></tex-math>--><mml:math id="mml-ieqn-71"><mml:mrow><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is independent with the gray level and the average separability is defined as:</p>
<p><disp-formula id="eqn-16">
<label>(15)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-16.png"/><tex-math id="tex-eqn-16"><![CDATA[$
\begin{equation} \mathit{AveSep}=\frac{\mathit{InterVar}}{\mathit{TotalVal}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:mi mathvariant="italic">A</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">I</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-72"><!--<alternatives><inline-graphic xlink:href="ieqn-72.png"/><tex-math id="tex-ieqn-72"><![CDATA[$
 \mathit{TotalVar} 
$]]></tex-math>--><mml:math id="mml-ieqn-72"><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi><mml:mi mathvariant="italic">V</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the variance of the gray level of all pixels of the internal and external strip areas. The maximum of the average separability <inline-formula id="ieqn-73"><!--<alternatives><inline-graphic xlink:href="ieqn-73.png"/><tex-math id="tex-ieqn-73"><![CDATA[$
 \mathit{AvgSep} 
$]]></tex-math>--><mml:math id="mml-ieqn-73"><mml:mrow><mml:mi mathvariant="italic">A</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">g</mml:mi><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">p</mml:mi></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is 1.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Gray Feature Extraction</title>
<p>Two frequently used clinical features are extracted based on the gray information of the ultrasound image of thyroid gland, which are attenuation coefficient (AC) and micro calcium degree.</p>
<p>(1) Attenuation coefficient</p>
<p>Posterior echo is an important criterion for clinicians to diagnose thyroid tumor. For benign tumors, posterior echo is obviously enhanced. And for malignant tumors, posterior echo is obviously attenuated. Hence, we use the attenuation coefficient to do quantitative processing. A rectangular region of interest is selected from the direction which the tumor region and its posterior echo region appear the biggest change. The attenuation coefficient is defined as the average gray level ratio of the tumor region and the posterior echo region. The average gray levels of region of interest (ROI) in tumor area and posterior echo area are:</p>
<p><disp-formula id="eqn-17">
<label>(16)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-17.png"/><tex-math id="tex-eqn-17"><![CDATA[$
\begin{equation} MI_{\mathit{Tumor}}=\sum _{y=0}^{H-1}\sum _{x=0}^{W-1}I_{\mathit{Tumor}}\left(x,y\right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-17" display="block"><mml:mi>M</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-18">
<label>(17)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-18.png"/><tex-math id="tex-eqn-18"><![CDATA[$
\begin{equation} MI_{Echo}=\sum _{y=0}^{H-1}\sum _{x=0}^{W-1}I_{{_{Echo}}}\left(x,y\right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-18" display="block"><mml:mi>M</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where the height and width of ROI are <inline-formula id="ieqn-74"><!--<alternatives><inline-graphic xlink:href="ieqn-74.png"/><tex-math id="tex-ieqn-74"><![CDATA[$
 H 
$]]></tex-math>--><mml:math id="mml-ieqn-74"><mml:mi>H</mml:mi></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-75"><!--<alternatives><inline-graphic xlink:href="ieqn-75.png"/><tex-math id="tex-ieqn-75"><![CDATA[$
 W 
$]]></tex-math>--><mml:math id="mml-ieqn-75"><mml:mi>W</mml:mi></mml:math><!--</alternatives>--></inline-formula>, respectively, <inline-formula id="ieqn-76"><!--<alternatives><inline-graphic xlink:href="ieqn-76.png"/><tex-math id="tex-ieqn-76"><![CDATA[$
 x 
$]]></tex-math>--><mml:math id="mml-ieqn-76"><mml:mi>x</mml:mi></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-77"><!--<alternatives><inline-graphic xlink:href="ieqn-77.png"/><tex-math id="tex-ieqn-77"><![CDATA[$
 y 
$]]></tex-math>--><mml:math id="mml-ieqn-77"><mml:mi>y</mml:mi></mml:math><!--</alternatives>--></inline-formula> are expressed as the pixel coordinates, <inline-formula id="ieqn-78"><!--<alternatives><inline-graphic xlink:href="ieqn-78.png"/><tex-math id="tex-ieqn-78"><![CDATA[$
 I_{\mathit{Tumor}}\left(x,y\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-78"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> represents the gray level of the pixels in ROI of the tumor area and <inline-formula id="ieqn-79"><!--<alternatives><inline-graphic xlink:href="ieqn-79.png"/><tex-math id="tex-ieqn-79"><![CDATA[$
 I_{Echo}\left(x,y\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> is the gray level of the pixels in ROI of the posterior echo area. So the attenuation coefficient named AC is defined as:</p>
<p><disp-formula id="eqn-19">
<label>(18)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-19.png"/><tex-math id="tex-eqn-19"><![CDATA[$
\begin{equation} AC=\frac{MI_{\mathit{Tumor}}}{MI_{Echo}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-19" display="block"><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>M</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mi>c</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>(2) Micro calcification degree</p>
<p>Calcification in the nodule is a common feature in thyroid ultrasound images. Calcification can be divided into three types: Micro calcification: <inline-formula id="ieqn-80"><!--<alternatives><inline-graphic xlink:href="ieqn-80.png"/><tex-math id="tex-ieqn-80"><![CDATA[$
 {\leq} 1100~um 
$]]></tex-math>--><mml:math id="mml-ieqn-80"><mml:mrow><mml:mo>&#x2264;</mml:mo></mml:mrow><mml:mn>1100</mml:mn><mml:mtext>&#xA0;</mml:mtext><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula> pinpoint-ish strong light spots; Coarse calcification: <inline-formula id="ieqn-81"><!--<alternatives><inline-graphic xlink:href="ieqn-81.png"/><tex-math id="tex-ieqn-81"><![CDATA[$
 {\gt} 1100~um 
$]]></tex-math>--><mml:math id="mml-ieqn-81"><mml:mrow><mml:mo>&#x003E;</mml:mo></mml:mrow><mml:mn>1100</mml:mn><mml:mtext>&#xA0;</mml:mtext><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula> strong light cluster; Arc calcification: the surface of the bump which is curved or the ring of the bright band accompanied by sound shadow. Calcification plays an important role in differentiating thyroid cancer, and different calcification patterns have different clinical significance. This paper uses the pixel gray level to measure the intensity of light spots and the number of pixels to calculate calcification area and measure whether the calcification is micro calcification or not. Moreover, this paper proposes a micro calcification degree measuring method which is specific to thyroid nodule. As gray information of ultrasonic image is easily influenced by instrument, the average of total pixel gray level within nodules is taken as a reference in this paper. By calculating the average pixel gray level within nodules and the pixel gray level within calcified plaque, we work out the relationship between them to draw a conclusion. We define the strong light spot whose pixel gray level within nodules is larger than 200% as the calcification point. Binarization processing is carried out for the strong light spots and the non-strong light spots, forming <inline-formula id="ieqn-82"><!--<alternatives><inline-graphic xlink:href="ieqn-82.png"/><tex-math id="tex-ieqn-82"><![CDATA[$
 m 
$]]></tex-math>--><mml:math id="mml-ieqn-82"><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula> regions of strong light cluster with the pixel number in each region being denoted by <inline-formula id="ieqn-83"><!--<alternatives><inline-graphic xlink:href="ieqn-83.png"/><tex-math id="tex-ieqn-83"><![CDATA[$
 n_{i},~i=1,2,\cdot \cdot \cdot ,m 
$]]></tex-math>--><mml:math id="mml-ieqn-83"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula>. Then we calculate the area of light spots in the cluster region and <inline-formula id="ieqn-84"><!--<alternatives><inline-graphic xlink:href="ieqn-84.png"/><tex-math id="tex-ieqn-84"><![CDATA[$
 n_{i}S 
$]]></tex-math>--><mml:math id="mml-ieqn-84"><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mi>S</mml:mi></mml:math><!--</alternatives>--></inline-formula>. If the result is smaller than a threshold value <inline-formula id="ieqn-85"><!--<alternatives><inline-graphic xlink:href="ieqn-85.png"/><tex-math id="tex-ieqn-85"><![CDATA[$
 \gamma 
$]]></tex-math>--><mml:math id="mml-ieqn-85"><mml:mi>&#x03B3;</mml:mi></mml:math><!--</alternatives>--></inline-formula>, then the cluster area is micro calcific, where <inline-formula id="ieqn-86"><!--<alternatives><inline-graphic xlink:href="ieqn-86.png"/><tex-math id="tex-ieqn-86"><![CDATA[$
 \gamma =1.21\times 10^{6}~um^{2} 
$]]></tex-math>--><mml:math id="mml-ieqn-86"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mn>1.21</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msup><mml:mtext>&#xA0;</mml:mtext><mml:mi>u</mml:mi><mml:msup><mml:mi>m</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math><!--</alternatives>--></inline-formula> means the area of micro calcification based on medical judgment and <inline-formula id="ieqn-87"><!--<alternatives><inline-graphic xlink:href="ieqn-87.png"/><tex-math id="tex-ieqn-87"><![CDATA[$
 w 
$]]></tex-math>--><mml:math id="mml-ieqn-87"><mml:mi>w</mml:mi></mml:math><!--</alternatives>--></inline-formula> micro calcification regions will be got. The micro calcification degree is defined as the ratio of the area of micro calcification region within the nodules and the number of pixels in the region of calcification within the nodules:</p>
<p><disp-formula id="eqn-20">
<label>(19)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-20.png"/><tex-math id="tex-eqn-20"><![CDATA[$
\begin{equation} Cal=\frac{\sum _{j=1}^{w}n_{j}}{\sum _{i=1}^{m}n_{i}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-20" display="block"><mml:mi>C</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The micro calcification degree can well reflect the existence and degree of micro calcification in the nodules. <inline-formula id="ieqn-88"><!--<alternatives><inline-graphic xlink:href="ieqn-88.png"/><tex-math id="tex-ieqn-88"><![CDATA[$
 Cal\in \left[0,1\right] 
$]]></tex-math>--><mml:math id="mml-ieqn-88"><mml:mi>C</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula>, if micro calcification degree is 0, then no micro calcified plaque exists in the nodule. There is no statistical significance using calcification feature to diagnose benign and malignant nodules. The higher degree of micro calcification is, the greater possibility of malignant nodules has.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Texture Feature Extraction</title>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Local Two Valued Pattern</title>
<p>Deriving from a definition of local neighbor texture, the local binary pattern is a texture measurement within the gray scale [<xref ref-type="bibr" rid="ref-24">24</xref>]. It uses the structural method to analyze the fixed window features and the statistical method to extract the whole feature. The initial LBP operator is defined as: set one pixel <inline-formula id="ieqn-89"><!--<alternatives><inline-graphic xlink:href="ieqn-89.png"/><tex-math id="tex-ieqn-89"><![CDATA[$
 f\left(x_{c},y_{c}\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-89"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> in a local region in the image as the center point <inline-formula id="ieqn-90"><!--<alternatives><inline-graphic xlink:href="ieqn-90.png"/><tex-math id="tex-ieqn-90"><![CDATA[$
 g_{c} 
$]]></tex-math>--><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>, which combines with the eight pixels points <inline-formula id="ieqn-91"><!--<alternatives><inline-graphic xlink:href="ieqn-91.png"/><tex-math id="tex-ieqn-91"><![CDATA[$
 g_{0},\cdots g_{7} 
$]]></tex-math>--><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> within its surrounding <inline-formula id="ieqn-92"><!--<alternatives><inline-graphic xlink:href="ieqn-92.png"/><tex-math id="tex-ieqn-92"><![CDATA[$
 3\times 3 
$]]></tex-math>--><mml:math id="mml-ieqn-92"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math><!--</alternatives>--></inline-formula> window, forming a texture primitive <inline-formula id="ieqn-93"><!--<alternatives><inline-graphic xlink:href="ieqn-93.png"/><tex-math id="tex-ieqn-93"><![CDATA[$
 T=\left\{\left.g_{c},g_{0},\cdots ,g_{7}\right\}\right. 
$]]></tex-math>--><mml:math id="mml-ieqn-93"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula>. Taking the gray level of window center point <inline-formula id="ieqn-94"><!--<alternatives><inline-graphic xlink:href="ieqn-94.png"/><tex-math id="tex-ieqn-94"><![CDATA[$
 g_{c} 
$]]></tex-math>--><mml:math id="mml-ieqn-94"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> as the threshold, the gray level of the adjacent eight pixels is compared with the threshold, if the gray level of the adjacent pixels is greater than that of the threshold, then the pixel position is 1, otherwise, it will be 0. Thereby a series of binary values <inline-formula id="ieqn-95"><!--<alternatives><inline-graphic xlink:href="ieqn-95.png"/><tex-math id="tex-ieqn-95"><![CDATA[$
 d_{i}\left(0\leq i\leq 7\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mn>7</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula> are achieved, as shown below:</p>
<p><disp-formula id="eqn-21">
<label>(20)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-21.png"/><tex-math id="tex-eqn-21"><![CDATA[$
\begin{equation} d_{i}=\left\{\begin{array}{l@{\quad}l@{\quad}l}
 1&if&\Delta g_{i}\geq 0\\ 0&if&\Delta g_{i}\lt 0 \end{array}\right. \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-21" display="block"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mtd><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mtd><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-96"><!--<alternatives><inline-graphic xlink:href="ieqn-96.png"/><tex-math id="tex-ieqn-96"><![CDATA[$
 \Delta g_{i}=g_{i}-g_{c} 
$]]></tex-math>--><mml:math id="mml-ieqn-96"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>. After this process, the 8-pixel points within the <inline-formula id="ieqn-97"><!--<alternatives><inline-graphic xlink:href="ieqn-97.png"/><tex-math id="tex-ieqn-97"><![CDATA[$
 3\times 3 
$]]></tex-math>--><mml:math id="mml-ieqn-97"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math><!--</alternatives>--></inline-formula> window can generate a binary code of 8 bits, and then a binary number of 8 bits can be read in a clockwise direction. Through giving different weights to different positions, the 8-bit binary code can be switched to an unsigned integer, namely switching it to decimal number according to the formula <xref ref-type="disp-formula" rid="eqn-20">(20)</xref>. This number is defined as the LBP value of the window, reflecting the texture information of the region, that is, the LBP code value which describes the spatial structure characteristic of local image texture is expressed as:</p>
<p><disp-formula id="eqn-22">
<label>(21)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-22.png"/><tex-math id="tex-eqn-22"><![CDATA[$
\begin{equation} LBP=\sum _{i=0}^{7}d_{i}*2^{i} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-22" display="block"><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Theory of LBP algorithm is simple, while it can reflect the subtle variations among texture without parameter setting problem getting involved. Comparing with other methods, it is a fast and efficient texture description operator. However, it is obviously unreasonable if all cases are treated with single mapping transformation. For example, if the center pixel gray level is 60, while its adjacent pixel&#x2019;s gray level is 59. In this case, coding the pixel as 0 is obviously unreasonable. Moreover, LBP operator usually applies the LBP histogram as the texture feature of regional description. If feature dimension is too large, from the classification point of view, it causes difficulty in searching the classification hyperplane and improves the training cost. To overcome these shortcomings, literature [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>] proposed the FLBP algorithm, carrying out fuzzy coding for the distance. But the coding number will increase along with different fuzzy degree, causing the curse of dimensionality. Hence, based on this algorithm, this paper makes an improvement on it. According to sensory awareness, most of the nodules in thyroid ultrasound image are in elliptical shape. We improve the neighborhood and use elliptical local binary pattern (ELBP) to encode the thyroid  ultrasound image.</p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Thyroid Ultrasound Feature Extraction Algorithm Based on Fuzzy Elliptical Local Binary Pattern</title>
<p>(1) The neighborhood improvement</p>
<p>In the ELBP method, the distribution of the neighborhood pixels is in elliptical shape, as shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. There are three related parameters: &#x2460; the axis of the ellipse is denoted by <inline-formula id="ieqn-98"><!--<alternatives><inline-graphic xlink:href="ieqn-98.png"/><tex-math id="tex-ieqn-98"><![CDATA[$
 A 
$]]></tex-math>--><mml:math id="mml-ieqn-98"><mml:mi>A</mml:mi></mml:math><!--</alternatives>--></inline-formula>; &#x2461; the minor axis of the ellipse is denoted by <inline-formula id="ieqn-99"><!--<alternatives><inline-graphic xlink:href="ieqn-99.png"/><tex-math id="tex-ieqn-99"><![CDATA[$
 B 
$]]></tex-math>--><mml:math id="mml-ieqn-99"><mml:mi>B</mml:mi></mml:math><!--</alternatives>--></inline-formula>; &#x2462; the number of adjacent pixels is denoted by <inline-formula id="ieqn-100"><!--<alternatives><inline-graphic xlink:href="ieqn-100.png"/><tex-math id="tex-ieqn-100"><![CDATA[$
 m 
$]]></tex-math>--><mml:math id="mml-ieqn-100"><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>ELBP model example of different parameters</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-7.png"/>
</fig>
<p>The X, Y coordinates of each neighborhood pixels <inline-formula id="ieqn-101"><!--<alternatives><inline-graphic xlink:href="ieqn-101.png"/><tex-math id="tex-ieqn-101"><![CDATA[$
 p_{i} 
$]]></tex-math>--><mml:math id="mml-ieqn-101"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> are <inline-formula id="ieqn-102"><!--<alternatives><inline-graphic xlink:href="ieqn-102.png"/><tex-math id="tex-ieqn-102"><![CDATA[$
 p_{ix} 
$]]></tex-math>--><mml:math id="mml-ieqn-102"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-103"><!--<alternatives><inline-graphic xlink:href="ieqn-103.png"/><tex-math id="tex-ieqn-103"><![CDATA[$
 p_{iy} 
$]]></tex-math>--><mml:math id="mml-ieqn-103"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>, and their corresponding center pixels are determined by the following formulas:</p>
<p><disp-formula id="eqn-23">
<label>(22)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-23.png"/><tex-math id="tex-eqn-23"><![CDATA[$
\begin{equation} R_{i}=\sqrt{\frac{A^{2}B^{2}}{A^{2}\sin ^{2}\theta _{i}+B\cos ^{2}\theta _{i}}} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-23" display="block"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>B</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>sin</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:msup><mml:mi>cos</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:msqrt></mml:math>
<!--</alternatives>--></disp-formula></p>
<p><disp-formula id="eqn-24">
<label>(23)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-24.png"/><tex-math id="tex-eqn-24"><![CDATA[$
\begin{equation} p_{ix}=R_{i}*\cos \theta _{i},p_{iy}=R_{i}*\sin \theta _{i} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-24" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-104"><!--<alternatives><inline-graphic xlink:href="ieqn-104.png"/><tex-math id="tex-ieqn-104"><![CDATA[$
 \theta _{i}=\left(\frac{360}{m}*\left(i-1\right)\right)^{{^{\circ }}} 
$]]></tex-math>--><mml:math id="mml-ieqn-104"><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>360</mml:mn><mml:mi>m</mml:mi></mml:mfrac><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mrow><mml:mo>&#x2218;</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msup></mml:math><!--</alternatives>--></inline-formula>. The nearest neighbor interpolation method is used on non-integer coordinates to obtain integer coordinates.</p>
<p>(2) The distance coding improvements</p>
<p>We can see in literature [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>] that the parameter <italic>F</italic> is introduced to better describe the spatial structure of the local image texture. As described before, classic LBP uses a single LBP code to describe a <inline-formula id="ieqn-105"><!--<alternatives><inline-graphic xlink:href="ieqn-105.png"/><tex-math id="tex-ieqn-105"><![CDATA[$
 3\times 3 
$]]></tex-math>--><mml:math id="mml-ieqn-105"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math><!--</alternatives>--></inline-formula> texture primitives, while in FLBP method, a primitive can be described by multiple codes with each LBP code having a corresponding weight WLBP. Bigger weights prove the greater possibility to be LBP patterns, the CLBP of each LBP code is defined as:</p>
<p><disp-formula id="eqn-25">
<label>(24)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-25.png"/><tex-math id="tex-eqn-25"><![CDATA[$
\begin{equation} C_{LBP}=\prod _{i=0}^{7}u_{{d_{i}}}\left(i\right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-25" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-106"><!--<alternatives><inline-graphic xlink:href="ieqn-106.png"/><tex-math id="tex-ieqn-106"><![CDATA[$
 d_{i}\in \left\{0,1\right\} 
$]]></tex-math>--><mml:math id="mml-ieqn-106"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula>, <inline-formula id="ieqn-107"><!--<alternatives><inline-graphic xlink:href="ieqn-107.png"/><tex-math id="tex-ieqn-107"><![CDATA[$
 u_{{d_{i}}} 
$]]></tex-math>--><mml:math id="mml-ieqn-107"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> denotes the binary descriptor operation. LBP code values can be obtained by the formula <xref ref-type="disp-formula" rid="eqn-21">(21)</xref>, and the total weight relationship of all modes is as follows:</p>
<p><disp-formula id="eqn-26">
<label>(25)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-26.png"/><tex-math id="tex-eqn-26"><![CDATA[$
\begin{equation} \sum _{LBP=0}^{255}W_{LBP}=1 \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-26" display="block"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>255</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>Based on the above literature, to select the center value more reasonably, we multiply the LBP codes appeared in each texture primitive by its corresponding weight and then sum them and round up the result. The FLBP code value which described the spatial structure of local image texture is obtained expressed as:</p>
<p><disp-formula id="eqn-27">
<label>(26)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-27.png"/><tex-math id="tex-eqn-27"><![CDATA[$
\begin{equation} FLBP=\sum _{LBP=0}^{255}LBP*W_{LBP} \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-27" display="block"><mml:mi>F</mml:mi><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>255</mml:mn></mml:mrow></mml:munderover><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>The improved fuzzy elliptical local binary pattern (FELBP) operator is applied on image processing, and the processed images are shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The example results of FELBP operator processing. (a) The original figure (b) F &#x003D; 0 (c) F &#x003D; 5 (d) F &#x003D; 10 (e) F &#x003D; 15</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-8.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-8">Fig. 8a</xref> is the original image, while <xref ref-type="fig" rid="fig-8">Figs. 8b</xref>&#x2013;<xref ref-type="fig" rid="fig-8">8e</xref> are the FELBP images when the F value is taken as 0, 5, 10, 15, respectively. It can be seen that <xref ref-type="fig" rid="fig-8">Fig. 8b</xref>, the one with smaller <italic>F</italic> value, depicts more texture details relatively. At the meantime, its noise is more obvious. <xref ref-type="fig" rid="fig-8">Fig. 8e</xref> with a larger <italic>F</italic> value mainly describes the edge outline information of the thyroid image, especially the edge of nodules and the trachea. And some smaller textures are filtered out. <xref ref-type="fig" rid="fig-8">Figs. 8c</xref> and <xref ref-type="fig" rid="fig-8">8d</xref> with middle <italic>F</italic> values describe the texture information of middle layers. In general, with the increasing <italic>F</italic> values, detailed texture information in image described by FELBP is gradually weakened, while contour information such as edge information is gradually enhanced.</p>
<p>In order to find the most suitable feature subspace to classify benign and malignant thyroid, we adjust the fuzzy degree parameter F value to seek the best classification performance. Taking <inline-formula id="ieqn-108"><!--<alternatives><inline-graphic xlink:href="ieqn-108.png"/><tex-math id="tex-ieqn-108"><![CDATA[$
 F=0,1,2,\cdots ,15 
$]]></tex-math>--><mml:math id="mml-ieqn-108"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mn>15</mml:mn></mml:math><!--</alternatives>--></inline-formula>, the statistical FELBP model value of the thyroid ultrasound image is input to SVM [<xref ref-type="bibr" rid="ref-25">25</xref>] classifier of different kernel functions for validation. <xref ref-type="fig" rid="fig-9">Fig. 9</xref> is the classification accuracy of different kernel functions with variable degree of fuzzy parameters F. The performance described by <inline-formula id="ieqn-109"><!--<alternatives><inline-graphic xlink:href="ieqn-109.png"/><tex-math id="tex-ieqn-109"><![CDATA[$
 F=0 
$]]></tex-math>--><mml:math id="mml-ieqn-109"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math><!--</alternatives>--></inline-formula> is corresponding with the traditional LBP. Its classification accuracy reaches the highest point of 72.3% under the polynomial kernel function of SVM. For each SVM kernel function, its classification accuracy obtained through FELBP is higher than that through LBP. In the SVM [<xref ref-type="bibr" rid="ref-26">26</xref>] polynomial kernel function, the maximum classification accuracy of FELBP reaches 90.1% when <inline-formula id="ieqn-110"><!--<alternatives><inline-graphic xlink:href="ieqn-110.png"/><tex-math id="tex-ieqn-110"><![CDATA[$
 F=10 
$]]></tex-math>--><mml:math id="mml-ieqn-110"><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mn>10</mml:mn></mml:math><!--</alternatives>--></inline-formula>. Thus, we find the optimal feature subspace which is suitable for the classification of benign and malignant thyroid nodule. These improvements solve the problems as single transformation mapping of LBP algorithm and its being sensitive to noise. The problem that the feature dimension being too big is yet to be solved properly. Therefore, this paper extracts the entropy of nodule region as the texture feature. After processing the FELBP algorithm, the nodal region entropy in the processed image is extracted using <inline-formula id="ieqn-111"><!--<alternatives><inline-graphic xlink:href="ieqn-111.png"/><tex-math id="tex-ieqn-111"><![CDATA[$
 P_{\mathit{FELBP}} 
$]]></tex-math>--><mml:math id="mml-ieqn-111"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">F</mml:mi><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">L</mml:mi><mml:mi mathvariant="italic">B</mml:mi><mml:mi mathvariant="italic">P</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> to represent the probability of occurrence of model value FELBP. The entropy represents the texture feature of nodule region and also reflects uniformity degree of the internal echo to a certain extent. The stronger FELBP model value diversification is, the bigger entropy value is, the simpler texture is, and the more uniform internal echo is. If all the parameters of probability are equal, the entropy will achieve maximum. Its entropy is defined as:</p>
<p><disp-formula id="eqn-28">
<label>(27)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-28.png"/><tex-math id="tex-eqn-28"><![CDATA[$
\begin{equation} \phi =-\sum _{LBP=0}^{255}P_{\mathit{FELBP}}\log \left(P_{\mathit{FELBP}}\right) \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-28" display="block"><mml:mi>&#x03D5;</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>255</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">F</mml:mi><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">L</mml:mi><mml:mi mathvariant="italic">B</mml:mi><mml:mi mathvariant="italic">P</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">F</mml:mi><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">L</mml:mi><mml:mi mathvariant="italic">B</mml:mi><mml:mi mathvariant="italic">P</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Classification accuracy of different kernel functions with variable degree of fuzzy parameters <italic>F</italic></title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-9.png"/>
</fig>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>The Improved SVM</title>
<p>SVM has good generalization performance in dealing with situations like small sample, nonlinearity and high dimension, which conforms exactly to the actual situation of thyroid samples. But in the standard SVM algorithm [<xref ref-type="bibr" rid="ref-27">27</xref>], samples are assumed to be distributed evenly, while in practical thyroid tumor classification, the samples of benign and malignant thyroid tumor are uneven. SVM would overfit the class with more samples and underestimate the commission errors due to less samples, leading to an overall low classification performance of SVM.</p>
<p>Due to the uneven samples, the predicted result appears with a bias towards class with more samples since the standard SVM regards different kinds of penalty parameter as the same. Therefore, this article introduces a weighting factor, by giving different weights to different classes of sample, to get the SVM based on the weighted degree of SVM, thus effectively compensates the shortcoming of low classification accuracy for small sample class.</p>
<p>In the SVM that based on weighted degree, the original problem can be expressed as:</p>
<p><disp-formula id="eqn-29">
<label>(28)</label>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="eqn-29.png"/><tex-math id="tex-eqn-29"><![CDATA[$
\begin{equation} 
\left\{\begin{array}{l} 
\min \displaystyle\frac{1}{2}\left\| w\right\| ^{2}+C\sum _{i=1}^{l}m\xi _{i}\\ 
 s.t.\\ 
 y_{i}\left(w\cdot \phi \left(x_{i}\right)+b\right)\geq 1-\xi _{i},\quad i=1,\ldots ,l \\ 
 \xi _{i}\geq 0,\quad  i=1,\ldots ,l
 \end{array}\right. \end{equation}
$]]></tex-math>--><mml:math id="mml-eqn-29" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>w</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>C</mml:mi><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:munderover><mml:mi>m</mml:mi><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>w</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mi>&#x03D5;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>l</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2265;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>l</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
<!--</alternatives>--></disp-formula></p>
<p>where <inline-formula id="ieqn-112"><!--<alternatives><inline-graphic xlink:href="ieqn-112.png"/><tex-math id="tex-ieqn-112"><![CDATA[$
 x_{i} 
$]]></tex-math>--><mml:math id="mml-ieqn-112"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> is the samples of each class, <inline-formula id="ieqn-113"><!--<alternatives><inline-graphic xlink:href="ieqn-113.png"/><tex-math id="tex-ieqn-113"><![CDATA[$
 w 
$]]></tex-math>--><mml:math id="mml-ieqn-113"><mml:mi>w</mml:mi></mml:math><!--</alternatives>--></inline-formula> is normal vector and <inline-formula id="ieqn-114"><!--<alternatives><inline-graphic xlink:href="ieqn-114.png"/><tex-math id="tex-ieqn-114"><![CDATA[$
 b 
$]]></tex-math>--><mml:math id="mml-ieqn-114"><mml:mi>b</mml:mi></mml:math><!--</alternatives>--></inline-formula> is intercept of hyperplane and <inline-formula id="ieqn-115"><!--<alternatives><inline-graphic xlink:href="ieqn-115.png"/><tex-math id="tex-ieqn-115"><![CDATA[$
 \phi 
$]]></tex-math>--><mml:math id="mml-ieqn-115"><mml:mi>&#x03D5;</mml:mi></mml:math><!--</alternatives>--></inline-formula> is a map function. <inline-formula id="ieqn-116"><!--<alternatives><inline-graphic xlink:href="ieqn-116.png"/><tex-math id="tex-ieqn-116"><![CDATA[$
 C 
$]]></tex-math>--><mml:math id="mml-ieqn-116"><mml:mi>C</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the penalty parameter which is positive. <inline-formula id="ieqn-117"><!--<alternatives><inline-graphic xlink:href="ieqn-117.png"/><tex-math id="tex-ieqn-117"><![CDATA[$
 m 
$]]></tex-math>--><mml:math id="mml-ieqn-117"><mml:mi>m</mml:mi></mml:math><!--</alternatives>--></inline-formula> is the weight of class and is to set different penalty parameters for different classes. For binary classification, <inline-formula id="ieqn-118"><!--<alternatives><inline-graphic xlink:href="ieqn-118.png"/><tex-math id="tex-ieqn-118"><![CDATA[$
 y_{i}=\left\{-1,1\right\} 
$]]></tex-math>--><mml:math id="mml-ieqn-118"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula>. The penalty parameter of positive class is <inline-formula id="ieqn-119"><!--<alternatives><inline-graphic xlink:href="ieqn-119.png"/><tex-math id="tex-ieqn-119"><![CDATA[$
 C\cdot m_{+} 
$]]></tex-math>--><mml:math id="mml-ieqn-119"><mml:mi>C</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> while the penalty parameter of negative class is <inline-formula id="ieqn-120"><!--<alternatives><inline-graphic xlink:href="ieqn-120.png"/><tex-math id="tex-ieqn-120"><![CDATA[$
 C\cdot m_{-} 
$]]></tex-math>--><mml:math id="mml-ieqn-120"><mml:mi>C</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>. If only <inline-formula id="ieqn-121"><!--<alternatives><inline-graphic xlink:href="ieqn-121.png"/><tex-math id="tex-ieqn-121"><![CDATA[$
 m_{+} 
$]]></tex-math>--><mml:math id="mml-ieqn-121"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-122"><!--<alternatives><inline-graphic xlink:href="ieqn-122.png"/><tex-math id="tex-ieqn-122"><![CDATA[$
 m_{-} 
$]]></tex-math>--><mml:math id="mml-ieqn-122"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> meet the condition of <inline-formula id="ieqn-123"><!--<alternatives><inline-graphic xlink:href="ieqn-123.png"/><tex-math id="tex-ieqn-123"><![CDATA[$
 m_{+}n_{+}=m_{-}n_{-} 
$]]></tex-math>--><mml:math id="mml-ieqn-123"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula>, the upper bound of the error dividing proportion of positive and negative samples will be the same. That is to say, if the positive class and negative class weights <inline-formula id="ieqn-124"><!--<alternatives><inline-graphic xlink:href="ieqn-124.png"/><tex-math id="tex-ieqn-124"><![CDATA[$
 m_{+} 
$]]></tex-math>--><mml:math id="mml-ieqn-124"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-125"><!--<alternatives><inline-graphic xlink:href="ieqn-125.png"/><tex-math id="tex-ieqn-125"><![CDATA[$
 m_{-} 
$]]></tex-math>--><mml:math id="mml-ieqn-125"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub></mml:math><!--</alternatives>--></inline-formula> satisfy: <inline-formula id="ieqn-126"><!--<alternatives><inline-graphic xlink:href="ieqn-126.png"/><tex-math id="tex-ieqn-126"><![CDATA[$
 \frac{m_{+}}{n_{+}}=\frac{m_{-}}{n_{-}} 
$]]></tex-math>--><mml:math id="mml-ieqn-126"><mml:mfrac><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msub></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub></mml:mfrac></mml:math><!--</alternatives>--></inline-formula>, upper and lower bounds of the positive and negative samples have the same error dividing proportion upper bound, which compensates for the tendency of the standard SVM to predict results against small sample categories.</p>
<p>The following steps are summarized to implement the classification model in this paper:</p>
<p>(1) Segment the nodule region and extract the nodule boundary based on the segmentation to obtain the 6 shape feature parameters: the nodule circularity, depth-width ratio, average direction number, the standard deviation of normalized radial length, roughness index, envelope and acoustic halo features;</p>
<p>(2) According to the gray level information of the thyroid ultrasound image, obtain the quantitative values of the two commonly used clinical features, the attenuation coefficient and the micro calcification degree;</p>
<p>(3) Operate FELBP to get FELBP image, calculate the entropy of the nodule region in the operated image and take it as the texture feature;</p>
<p>(4) Combine the quantitative values of the calculated shape, gray level and texture features into a nine-dimension feature vectors as the input of subsequent classifier. The feature values of these clearly diagnosed cases are used to train the classifier through cross validation, so as to achieve the optimal parameters of the classifier. Use the classifier with optimal parameters to identify the benign and malignant thyroid nodules.</p>
</sec>
<sec id="s5">
<label>5</label>
<title>Experiments Analysis</title>
<p>To evaluate B-ultrasound examination results correctly and improve the accuracy of the discrimination on benign and malignant thyroid nodules, this study cooperates with the departments of ultrasound in Qinhuangdao First Hospital and Affiliated Hospital of Hebei University. All the images are derived from the ultrasound diagnosis departments of these two hospitals. The images in this paper are collected from patients aged from 20 to 45 during the period from December 1st, 2011 to March 1st, 2013. Among these images, there are 240 in total which are involved in the test, including 150 benign thyroid nodules images and 90 malignant ones, which are diagnosed by hospital experts and confirmed by postoperative pathology. The ultrasonic diagnostic meters being used are Philips iU22 as well as HDI 5000 Sono color ultrasonic diagnostic meter with 7&#x007E;12 MHz probe frequency.</p>
<p>Parameters selection is very important in the classification of SVM classifier for inappropriate parameters which often leads to poor classification results. This paper uses cross validation method [<xref ref-type="bibr" rid="ref-28">28</xref>] and exhaustive method to test different values of all parameters by trial and error and finally obtain the best parameters group.</p>
<p>There are 240 groups of thyroid images feature data, among which 90 groups are labeled as (&#x2212;1), and 150 groups are labeled as (&#x002B;1). The asymmetric amount ratio of the two types of sample data is about 1:2. Dividing the data into 3 parts, we analyze the data with the cross-validation method. The parameter selection is realized by 3 cross validation: firstly, the training sample is divided into 3 parts, one is set as the test set and the other two as the training sets, and then rotate the three samples till every sample to be test set for once, which means every sample are going through a process of training and forecasting for 3 times. The kernel function of SVM includes Sigmoid kernel function, Gauss kernel function, RBF kernel function and polynomial kernel function as shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Effect of 4 kinds of kernel functions with different C values on the classification accuracy</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-10.png"/>
</fig>
<p>Two significantly changed lines in the figure above are RBF [<xref ref-type="bibr" rid="ref-29">29</xref>] kernel and polynomial kernel functions. When <inline-formula id="ieqn-127"><!--<alternatives><inline-graphic xlink:href="ieqn-127.png"/><tex-math id="tex-ieqn-127"><![CDATA[$
 C=6 
$]]></tex-math>--><mml:math id="mml-ieqn-127"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mn>6</mml:mn></mml:math><!--</alternatives>--></inline-formula> RBF kernel function has a higher accuracy. Its recognition accuracy is independent of the selected <inline-formula id="ieqn-128"><!--<alternatives><inline-graphic xlink:href="ieqn-128.png"/><tex-math id="tex-ieqn-128"><![CDATA[$
 \sigma 
$]]></tex-math>--><mml:math id="mml-ieqn-128"><mml:mi>&#x03C3;</mml:mi></mml:math><!--</alternatives>--></inline-formula> value. When <inline-formula id="ieqn-129"><!--<alternatives><inline-graphic xlink:href="ieqn-129.png"/><tex-math id="tex-ieqn-129"><![CDATA[$
 C=10 
$]]></tex-math>--><mml:math id="mml-ieqn-129"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mn>10</mml:mn></mml:math><!--</alternatives>--></inline-formula> and <inline-formula id="ieqn-130"><!--<alternatives><inline-graphic xlink:href="ieqn-130.png"/><tex-math id="tex-ieqn-130"><![CDATA[$
 C=70 
$]]></tex-math>--><mml:math id="mml-ieqn-130"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mn>70</mml:mn></mml:math><!--</alternatives>--></inline-formula>, polynomial kernel function has a relatively high accuracy rate reaching 92.5%. Let the value of <inline-formula id="ieqn-131"><!--<alternatives><inline-graphic xlink:href="ieqn-131.png"/><tex-math id="tex-ieqn-131"><![CDATA[$
 C 
$]]></tex-math>--><mml:math id="mml-ieqn-131"><mml:mi>C</mml:mi></mml:math><!--</alternatives>--></inline-formula> be fixed, and adjust the parameter d of polynomial kernel function to observe the results.</p>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> shows that choosing different kernel parameters in polynomial kernel will result in different effects on the classification accuracy. When <inline-formula id="ieqn-132"><!--<alternatives><inline-graphic xlink:href="ieqn-132.png"/><tex-math id="tex-ieqn-132"><![CDATA[$
 C=10 
$]]></tex-math>--><mml:math id="mml-ieqn-132"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mn>10</mml:mn></mml:math><!--</alternatives>--></inline-formula>, and polynomial kernel parameter <inline-formula id="ieqn-133"><!--<alternatives><inline-graphic xlink:href="ieqn-133.png"/><tex-math id="tex-ieqn-133"><![CDATA[$
 d=4 
$]]></tex-math>--><mml:math id="mml-ieqn-133"><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn></mml:math><!--</alternatives>--></inline-formula>, we get the highest classification accuracy, which are adopted to the classification of SVM classifier.</p>
<p>For a diagnosis system, three indicators are doctors&#x2019; priority concern, which are accuracy, sensitivity and specificity. Sensitivity reflects the system recognition rate to malignant tumor. The higher sensitivity is, the higher recognition rate to malignant tumor will be. While specificity reflects the system recognition rate to benign tumor. The higher specificity is, the lower rate of benign samples will be wrongly accused of malignant. As defined in <xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>The effect of Polynomial kernel parameters on the classification accuracy when <italic>C</italic> &#x003D; 70 and <italic>C</italic> &#x003D; 10</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_15159-fig-11.png"/>
</fig>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The main indicators of cancer diagnostic evaluation</title>
</caption>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="table-1.png"/>-->
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Indicators</th>
<th>Formulas</th>
</tr>
</thead>
<tbody>
<tr>
<td>Accuracy</td>
<td><inline-formula id="ieqn-134"><!--<alternatives><inline-graphic xlink:href="ieqn-134.png"/><tex-math id="tex-ieqn-134"><![CDATA[$
 \mathit{Accuracy}=\left(TP+TN\right)/\left(TP+TN+FP+FN\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-134"><mml:mrow><mml:mi mathvariant="italic">A</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">u</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula></td>
</tr>
<tr>
<td>Sensitivity</td>
<td><inline-formula id="ieqn-135"><!--<alternatives><inline-graphic xlink:href="ieqn-135.png"/><tex-math id="tex-ieqn-135"><![CDATA[$
 \mathit{Sensitivity}=TP/\left(TP+FN\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-135"><mml:mrow><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">v</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula></td>
</tr>
<tr>
<td>Specificity</td>
<td><inline-formula id="ieqn-136"><!--<alternatives><inline-graphic xlink:href="ieqn-136.png"/><tex-math id="tex-ieqn-136"><![CDATA[$
 \mathit{Specificity}=TN/\left(TN+FP\right) 
$]]></tex-math>--><mml:math id="mml-ieqn-136"><mml:mrow><mml:mi mathvariant="italic">S</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">f</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">y</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><!--</alternatives>--></inline-formula></td>
</tr>
</tbody>
</table>
<!--</alternatives>-->
<table-wrap-foot>
<fn id="table-1fn1" fn-type="other">
<p>Notes: TP is the number of correctly classified malignant tumors; TN is the number of correctly classified benign tumors; FP is the number of misclassified benign tumors; FN is the number of misclassified malignant tumors.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>The extracted feature vectors are input into different classifiers to analyze and compare the performance of the classification. The experiments of each classifier are conducted 10 times, respectively recording different feature extraction algorithms as well as the average classification performance of the 10 experiments. And referring to the evaluation criteria, accuracy, sensitivity and specificity of the classification results are obtained. The performance comparison among different feature extraction algorithms and different classifiers is shown in <xref ref-type="table" rid="table-2">Tab. 2</xref>.</p>
<p>LBP represents traditional local binary pattern; GLCM (Grey-Level Co-occurrence Matrix) is proposed in [<xref ref-type="bibr" rid="ref-9">9</xref>], which is the feature extraction algorithm based on the gray level co-occurrence matrix of thyroid tumor; FELBP is an updated fuzzy elliptic local binary pattern, improving the coding of neighborhood and distance of LBP; LBP-A-S and FELBP-A-S are fusion feature methods that combine attenuation and shape features on the basis of LBP and FELBP, respectively. It can be seen in <xref ref-type="table" rid="table-2">Tab. 2</xref> that the proposed method in this paper features the highest classification stability and accuracy under above experimental conditions. Using computer-aided diagnosis aims to improve specificity under 100% sensitivity, ensure all samples in the malignant categories identified as malignant and reduce the situations that benign tumors being mistaken for malignant under the condition that all the malignant samples can be detected. In this way, most of the benign samples would not send to the biopsy, which can reduce the amount of biopsy.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>The performance comparison among different feature extraction algorithms and different classifiers</title>
</caption>
<!--<alternatives>
<graphic mimetype="image" mime-subtype="tif" xlink:href="table-2.png"/>-->
<table>
<colgroup width="36">
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Acc (%)/Sen (%)/Spe (%)</th>
<th>Weighted SVM</th>
<th>SVM</th>
<th>BPANN</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="3">LBP</td>
<td>73.45</td>
<td>70.78</td>
<td>68.39</td>
</tr>
<tr>
<td>85.67</td>
<td>84.89</td>
<td>80.98</td>
</tr>
<tr>
<td>67.21</td>
<td>59.88</td>
<td>60.32</td>
</tr>
<tr>
<td rowspan="3">GLCM</td>
<td>79.44</td>
<td>75.61</td>
<td>74.27</td>
</tr>
<tr>
<td>88.77</td>
<td>83.81</td>
<td>80.74</td>
</tr>
<tr>
<td>68.76</td>
<td>70.34</td>
<td>68.14</td>
</tr>
<tr>
<td rowspan="3">FELBP</td>
<td>86.97</td>
<td>85.34</td>
<td>82.43</td>
</tr>
<tr>
<td>90.56</td>
<td>89.90</td>
<td>85.44</td>
</tr>
<tr>
<td>77.86</td>
<td>72.78</td>
<td>76.62</td>
</tr>
<tr>
<td rowspan="3">LBP-A-S</td>
<td>90.67</td>
<td>84.76</td>
<td>82.11</td>
</tr>
<tr>
<td>95.20</td>
<td>87.82</td>
<td>85.72</td>
</tr>
<tr>
<td>84.87</td>
<td>80.11</td>
<td>75.73</td>
</tr>
<tr>
<td rowspan="3">FELBP-A-S</td>
<td>92.67</td>
<td>87.33</td>
<td>84.33</td>
</tr>
<tr>
<td>99.23</td>
<td>89.89</td>
<td>75.78</td>
</tr>
<tr>
<td>86.49</td>
<td>84.97</td>
<td>84.65</td>
</tr>
</tbody>
</table>
<!--</alternatives>-->
</table-wrap>
<p>From <xref ref-type="table" rid="table-2">Tab. 2</xref>, we can know that the weighted degree of SVM introduced in this paper efficiently compensate the adverse effect to the classification and prediction accuracy of small class samples caused by unbalanced sample size in each class by giving different classes of samples with different weights. After all, the proposed method has better image segmentation effect, and archive a higher objective evaluation index, and it is worthy to be extended to practical application.</p>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusions</title>
<p>Under the research and application background of the ultrasound diagnosis of thyroid nodules, this paper takes the database of thyroid nodules ultrasound images in hospitals as the research object, and combines existing medical conditions with computer technology, image processing technology, artificial intelligence technology and data analysis to process and analyze ultrasound images with computer. Moreover, this paper puts forward an automatic diagnosis system of thyroid nodules based on ultrasound images (TN-CAD). In this system, firstly the level set active contour model of the phase and gradient information is used to complete automatic boundaries extraction of thyroid tumor images, and then a feature extraction algorithm which is specific to thyroid nodule is explored. Finally, an improved support vector machine (SVM) is used for benign and malignant discrimination on thyroid nodules. Experimental results show the effectiveness of the proposed algorithm.</p>
</sec>
</body>
<back>
<ack>
<p>Thank you for the supported by the High-Performance Computing Center of Hebei University.</p>
</ack>
<fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This work was supported in part by National Natural Science Foundation of China under Grant Nos. 61572063 and 61401308, Natural Science Foundation of Hebei Province under Grant Nos. F2016201142, F2018210148, F2019201151 and F2020201025, Science Research Project of Hebei Province under Grant Nos. BJ2020030, QN2016085 and QN2017306, Foundation of President of Hebei University under Grant No. XZJJ201909, Opening Foundation of Machine Vision Technology Innovation Center of Hebei Province under Grant Nos. 2018HBMV01 and 2018HBMV02, Natural Science Foundation of Hebei University under Grant Nos. 2014-303 and 8012605.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bozan</surname>, <given-names>M. B.</given-names></string-name>, <string-name><surname>Yazar</surname>, <given-names>F. M.</given-names></string-name>, <string-name><surname>Kale</surname>, <given-names>L. T.</given-names></string-name>, <string-name><surname>Y&#x00FC;zba&#x015F;&#x0131;o&#x011F;lu</surname>, <given-names>M. F.</given-names></string-name>, <string-name><surname>Boran</surname>, <given-names>O. F.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Delta neutrophil index and neutrophil-to-lymphocyte ratio in the differentiation of thyroid malignancy and nodular goiter</article-title>. <source>World Journal of Surgery</source><italic>,</italic> <volume>45</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>507</fpage>&#x2013;<lpage>514</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s00268-020-05822-6</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zheng</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2019</year>). <article-title>Ultrasonic classification of multicategory thyroid nodules based on logistic regression</article-title>. <source>Ultrasound Quarterly</source><italic>,</italic> <volume>36</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>1</fpage>. DOI <pub-id pub-id-type="doi">10.1097/RUQ.0000000000000453</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Aboudi</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Guetari</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Khlifa</surname>, <given-names>N.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Multi-objectives optimization of features selection for the classification of thyroid nodules in ultrasound images</article-title>. <source>IET Image Processing</source><italic>,</italic> <volume>14</volume><italic>(</italic><issue>9</issue><italic>),</italic> <fpage>1901</fpage>&#x2013;<lpage>1908</lpage>. DOI <pub-id pub-id-type="doi">10.1049/iet-ipr.2019.1540</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yue</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>L.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2020</year>). <article-title>Comparison study of radiomics and deep learning-based methods for thyroid nodules classification using ultrasound images</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>8</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>52010</fpage>&#x2013;<lpage>52017</lpage>. DOI <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2980290</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Iakovidis</surname>, <given-names>D. K.</given-names></string-name>, <string-name><surname>Keramidas</surname>, <given-names>E. G.</given-names></string-name>, <string-name><surname>Maroulis</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Fuzzy local binary patterns for ultrasound texture characterization</article-title>. <conf-name>International Conference on Image Analysis &#x0026; Recognition</conf-name>, pp. <fpage>11</fpage>&#x2013;<lpage>15</lpage>, <publisher-loc>Verlag</publisher-loc>: <publisher-name>Springer</publisher-name>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chang</surname>, <given-names>C. Y.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>S. J.</given-names></string-name>, <string-name><surname>Tsai</surname>, <given-names>M. F.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Application of support-vector-machine-based method for feature selection and classification of thyroid nodules in ultrasound images</article-title>. <source>Pattern Recognition</source><italic>,</italic> <volume>43</volume><italic>(</italic><issue>10</issue><italic>),</italic> <fpage>3494</fpage>&#x2013;<lpage>3506</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.patcog.2010.04.023</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Morifuji</surname>, <given-names>H.</given-names></string-name></person-group> (<year>1989</year>). <article-title>Analysis of ultrasound B-mode histogram in thyroid tumors</article-title>. <source>Nippon Geka Gakkai Zasshi</source><italic>,</italic> <volume>90</volume><italic>(</italic><issue>2</issue><italic>),</italic> <fpage>210</fpage>&#x2013;<lpage>221</lpage>. DOI <pub-id pub-id-type="doi">10.2664/1989/9022102</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Acharya</surname>, <given-names>U. R.</given-names></string-name>, <string-name><surname>Chowriappa</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Fujita</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Bhat</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Dua</surname>, <given-names>S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2016</year>). <article-title>Thyroid lesion classification in 242 patient population using Gabor transform features from high resolution ultrasound images</article-title>. <source>Knowledge-Based Systems</source><italic>,</italic> <volume>107</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>235</fpage>&#x2013;<lpage>245</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.knosys.2016.06.010</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xian</surname>, <given-names>G. M.</given-names></string-name></person-group> (<year>2010</year>). <article-title>An identification method of malignant and benign liver tumors from ultrasonography based on GLCM texture features and fuzzy SVM</article-title>. <source>Expert Systems with Applications</source><italic>,</italic> <volume>37</volume><italic>(</italic><issue>10</issue><italic>),</italic> <fpage>6737</fpage>&#x2013;<lpage>6741</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.eswa.2010.02.067</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shin</surname>, <given-names>Y. G.</given-names></string-name>, <string-name><surname>Yoo</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Kwon</surname>, <given-names>H. J.</given-names></string-name>, <string-name><surname>Hong</surname>, <given-names>J. H.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>H. S.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2016</year>). <article-title>Histogram and gray level co-occurrence matrix on gray-scale ultrasound images for diagnosing lymphocytic thyroiditis</article-title>. <source>Computers in Biology &#x0026; Medicine</source><italic>,</italic> <volume>75</volume><italic>,</italic> <fpage>257</fpage>&#x2013;<lpage>266</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.compbiomed.2016.06.014</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mahdi</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Ravish</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Ramsha</surname>, <given-names>U.</given-names></string-name>, <string-name><surname>Eraj</surname>, <given-names>H.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Influence of gain settings on strain ratios of elastographic image and texture parameters of B-mode image on thyroid tissue</article-title>. <source>Biomedical Research</source><italic>,</italic> <volume>29</volume><italic>(</italic><issue>7</issue><italic>),</italic> <fpage>1316</fpage>&#x2013;<lpage>1320</lpage>. DOI <pub-id pub-id-type="doi">10.4066/biomedicalresearch.29-17-3994</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Savelonas</surname>, <given-names>M. A.</given-names></string-name>, <string-name><surname>Iakovidis</surname>, <given-names>D. K.</given-names></string-name>, <string-name><surname>Dimitropoulos</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Maroulis</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2007</year>). <article-title>Computational characterization of thyroid tissue in the radon domain</article-title>. <source>IEEE International Symposium on Computer-Based Medical Systems</source><italic>,</italic> <volume>2007</volume><italic>,</italic> <fpage>189</fpage>&#x2013;<lpage>192</lpage>. DOI <pub-id pub-id-type="doi">10.1109/CBMS.2007.33</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Prabal</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Alfredo</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Debdoot</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Michael</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Evaluation of commonly used algorithms for thyroid ultrasound images segmentation and improvement using machine learning approaches</article-title>. <source>Journal of Healthcare Engineering</source><italic>,</italic> <volume>2018</volume><italic>,</italic> <fpage>8087624</fpage>. DOI <pub-id pub-id-type="doi">10.1155/2018/8087624</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Iakovidis</surname>, <given-names>D. K.</given-names></string-name>, <string-name><surname>Keramidas</surname>, <given-names>E. G.</given-names></string-name>, <string-name><surname>Maroulis</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Fusion of fuzzy statistical distributions for classification of thyroid ultrasound patterns</article-title>. <source>Artificial Intelligence in Medicine</source><italic>,</italic> <volume>50</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>33</fpage>&#x2013;<lpage>41</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.artmed.2010.04.004</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Keramidas</surname>, <given-names>E. G.</given-names></string-name>, <string-name><surname>Iakovidis</surname>, <given-names>D. K.</given-names></string-name>, <string-name><surname>Maroulis</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Dimitropoulos</surname>, <given-names>N.</given-names></string-name></person-group> (<year>2008</year>). <article-title>Thyroid texture representation via noise resistant image features</article-title>. <source>IEEE International Symposium on Computer-Based Medical Systems</source><italic>,</italic> <volume>2008</volume><italic>,</italic> <fpage>560</fpage>&#x2013;<lpage>565</lpage>. DOI <pub-id pub-id-type="doi">10.1109/CBMS.2008.108</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Multi-modal medical image segmentation based on vector-valued active contour models</article-title>. <source>Information Ences</source><italic>,</italic> <volume>513</volume><italic>,</italic> <fpage>504</fpage>&#x2013;<lpage>518</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.ins.2019.10.051</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dhara</surname>, <given-names>A. K.</given-names></string-name>, <string-name><surname>Mukhopadhyay</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Dutta</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Garg</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Khandelwal</surname>, <given-names>N.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2016</year>). <article-title>A combination of shape and texture features for classification of pulmonary nodules in lung CT images</article-title>. <source>Journal of Digital Imaging</source><italic>,</italic> <volume>29</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>466</fpage>&#x2013;<lpage>475</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s10278-015-9857-6</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname>, <given-names>C. M.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Gui</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Fox</surname>, <given-names>M. D.</given-names></string-name></person-group> (<year>2010</year>). <article-title>Distance regularized level set evolution and its application to image segmentation</article-title>. <source>IEEE Transactions Image Process</source><italic>,</italic> <volume>19</volume><italic>(</italic><issue>12</issue><italic>),</italic> <fpage>3243</fpage>&#x2013;<lpage>3254</lpage>. DOI <pub-id pub-id-type="doi">10.1109/TIP.2010.2069690</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S. H.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Fruit category classification via an eight-layer convolutional neural network with parametric rectified linear unit and dropout technique</article-title>. <source>Multimedia Tools and Applications</source><italic>,</italic> <volume>79</volume><italic>(</italic><issue>21&#x2013;22</issue><italic>),</italic> <fpage>15117</fpage>&#x2013;<lpage>15133</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s11042-018-6661-6</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Extremely optimized drlse method and its application to image segmentation</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>7</volume><italic>(</italic><issue>8</issue><italic>),</italic> <fpage>119603</fpage>&#x2013;<lpage>119619</lpage>. DOI <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2937512</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Morrone</surname>, <given-names>M. C.</given-names></string-name>, <string-name><surname>Owens</surname>, <given-names>R. A.</given-names></string-name></person-group> (<year>1987</year>). <article-title>Feature detection from local energy</article-title>. <source>Pattern Recognition Letters</source><italic>,</italic> <volume>6</volume><italic>(</italic><issue>5</issue><italic>),</italic> <fpage>303</fpage>&#x2013;<lpage>313</lpage>. DOI <pub-id pub-id-type="doi">10.1016/0167-8655(87)90013-4</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S. H.</given-names></string-name>, <string-name><surname>Hong</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Sensorineural hearing loss identification via nine-layer convolutional neural network with batch normalization and dropout</article-title>. <source>Multimedia Tools and Applications</source><italic>,</italic> <volume>79</volume><italic>(</italic><issue>21&#x2013;22</issue><italic>),</italic> <fpage>15135</fpage>&#x2013;<lpage>15150</lpage>. DOI <pub-id pub-id-type="doi">10.1007/s11042-018-6798-3</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Hou</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Hong</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Cerebral micro-bleed detection based on the convolution neural network with rank based average pooling</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>5</volume><italic>,</italic> <fpage>16576</fpage>&#x2013;<lpage>16583</lpage>. DOI <pub-id pub-id-type="doi">10.1109/Access.6287639</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tuncer</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Dogan</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Ozyurt</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2020</year>). <article-title>An automated residual exemplar local binary pattern and iterative relieff based corona detection method using lung X-ray image</article-title>. <source>Chemometrics and Intelligent Laboratory Systems</source><italic>,</italic> <volume>203</volume><italic>,</italic> <fpage>104054</fpage>. DOI <pub-id pub-id-type="doi">10.1016/j.chemolab.2020.104054</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tang</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Nayak</surname>, <given-names>D. R.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2020</year>). <article-title>Least-square support vector machine and wavelet selection for hearing loss identification</article-title>. <source>Computer Modeling in Engineering &#x0026; Sciences</source><italic>,</italic> <volume>125</volume><italic>(</italic><issue>1</issue><italic>),</italic> <fpage>299</fpage>&#x2013;<lpage>313</lpage>. DOI <pub-id pub-id-type="doi">10.32604/cmes.2020.011069</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Phillips</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2017</year>). <article-title>Tea category identification using computer vision and generalized eigenvalue proximal SVM</article-title>. <source>Fundamenta Informaticae</source><italic>,</italic> <volume>151</volume><italic>(</italic><issue>1&#x2013;4</issue><italic>),</italic> <fpage>325</fpage>&#x2013;<lpage>339</lpage>. DOI <pub-id pub-id-type="doi">10.3233/FI-2017-1495</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Prochazka</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Gulati</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Holinka</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Smutek</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2019</year>). <article-title>Patch-based classification of thyroid nodules in ultrasound images using direction independent features extracted by two-threshold binary decomposition</article-title>. <source>Computerized Medical Imaging and Graphics</source><italic>,</italic> <volume>71</volume><italic>(</italic><issue>4</issue><italic>),</italic> <fpage>9</fpage>&#x2013;<lpage>18</lpage>. DOI <pub-id pub-id-type="doi">10.1016/j.compmedimag.2018.10.001</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Laza</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Pavon</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Reboiro-Jato</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Fdez-Riverola</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2011</year>). <article-title>Evaluating the effect of unbalanced data in biomedical document classification</article-title>. <source>Journal of Integrative Bioinformatics</source><italic>,</italic> <volume>8</volume><italic>(</italic><issue>3</issue><italic>),</italic> <fpage>177</fpage>&#x2013;<lpage>190</lpage>. DOI <pub-id pub-id-type="doi">10.1515/jib-2011-177</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname>, <given-names>S. H.</given-names></string-name>, <string-name><surname>Zhan</surname>, <given-names>T. M.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>M.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2016</year>). <article-title>Multiple sclerosis detection based on biorthogonal wavelet transform, RBF kernel principal component analysis, and logistic regression</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>4</volume><italic>,</italic> <fpage>7567</fpage>&#x2013;<lpage>7576</lpage>. DOI <pub-id pub-id-type="doi">10.1109/ACCESS.2016.2620996</pub-id>.</mixed-citation></ref>
</ref-list>
</back>
</article>