<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Development of parallel implementation of the informative areas generation method in the spatial spectrum domain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>N. Kravtsova</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>R. Paringer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A. Kupriyanov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Image Processing Systems Institute - Branch of the Federal Scientific Research Centre “Crystallography and Photonics” of Russian Academy of Sciences</institution>
          ,
          <addr-line>151 Molodogvardeyskaya st., 443001, Samara</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Samara National Research University</institution>
          ,
          <addr-line>34 Moskovskoe Shosse, 443086, Samara</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>51</fpage>
      <lpage>54</lpage>
      <abstract>
        <p>This paper proposes parallel implementation of the image informative segments extraction method. The images are segmented in the spatial spectrum domain. Median energy in each selected segment is viewed as an area. For time saving purpose parallel implementation was developed for the areas calculation phase. The developed software implementation was tested on the high performance multicore computing system. Currently computer processing of medical diagnostic images is one of the vital research tools and a way to improve efficiency of early detection of various diseases. Change of the body fluids composition is one of the information-bearing health condition areas. Metabolic change that occurs due to pathological conditions affects the fluid composition; there are numerous changes in the molecular composition of tissues and body fluids. Converting the fluid from one phase state to another is one of the ways to detect such changes. Crystallization is one of the most convenient methods to change the fluid phase. Crystal properties modification is caused by changed physical and chemical properties of a body fluid. The investigation of these properties is the crucial problem of crystal analysis [1]. In medicine, studied crystallograms are the structures formed by salt crystallization caused by body fluid drying. In clinical practice the crystallogram analysis is based on their images. It is not always possible to visually identify changes in such key crystallogram parameters as predominant bar direction, bar density etc., which contribute to major pathologic signs. Quantified analysis and objectivity are among computer analysis advantages. The information contained in the image is structurally excessive. It is known that if the parallel bars of certain direction were predominant on the original image, the bars of the same direction would dominate the Fourier transform of an original image. This property can be used to analyze crystallograms [2, 3] and other images of branched structure. The developed method based on discriminatory analysis algorithm is applied to generate the informative areas set, which is used in this paper to identify the characteristics of the initial crystallogram images. In the article, we propose a parallel implementation of the method to speed up computations.</p>
      </abstract>
      <kwd-group>
        <kwd>diagnostic crystallogram</kwd>
        <kwd>spatial spectrum</kwd>
        <kwd>discriminant analysis</kwd>
        <kwd>k-NN classification</kwd>
        <kwd>parallel implementation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>High-Performance Computing / N. Kravtsova, R. Paringer, A. Kupriyanov</title>
        <p>
          The methods based on the discriminative analysis algorithm proved to be a good solution to form up new problem-specified
areas [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. These methods permit to improve the reliability of data classification [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ].
        </p>
        <p>The discriminative analysis is used to eliminate the correlation between the areas and consequently to reduce the size of the
areas set. The usage of this algorithm allows, on the one hand, to maintain the informativeness of the feature set for classification
and, on the other hand, to reduce the number of areas to apply less complicated classification methods and to reduce the
classification error value.</p>
        <p>An individual separability criterion was calculated for each area based on equation:
J=tr((T)-1B), where T = B + W, B is between-group scattering matrix, W is intragroup scattering matrix.</p>
        <p>The informative areas set is further generated in the following manner:
 The areas are ranged in the order of decreasing of individual separability criteria values.
 The initial areas set consists of a feature with the largest criteria. Classification is carried out.
 Then the area with the next value of separability criterion is added to the set. Classification based on the new set of areas is
carried out.
 Repeat item 3 until all areas are included into the set.</p>
        <p>The informative set of areas is the one with classification results yielding the minimum error value. The classification error
that defines the number of cases with the classifier acquiring incorrect value is calculated from the equation: ε = (m/n) · 100%, –
where m is the number of classification errors, n is the total number of images tested.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. Parallel implementation of the method to generate informative areas</title>
      <p>The entire algorithm of informative areas generation may be presented as a diagram shown in Figure 1. The analysis of the
algorithm structure showed that the first stage of areas computing has the maximum computational complexity.</p>
      <p>As mentioned above most of the algorithm run time is spent on computing the areas. This stage includes pre-processing of the
learning sample, generation of spatial spectrum for each learning image and calculation of the area values. The number of
calculations can be reduced if one take into account that the spatial spectrum image is symmetrical relative to its center, and for
this reason the areas calculation may and must be performed only on the half of the spatial spectrum image. In order to speed up
the algorithm run time this paper will apply task division. This paper will not use an MPI technology but will apply task
distribution by threads, that is why the way of splitting the image into tasks is not important. In case of sample pre-processing
and spatial spectrum image generation a single image is sent to each thread. Then at the areas calculation stage each thread
reveives a separate element - an image segment calculated on the basis of the proposed segmentation. The next task is sent to the
thread as soon as it completes handling of the element.</p>
      <p>Application of this segmentation pattern allows substantial run-time saving at the first stage of the algorithm. During this
resource-intensive stage such method of tasks segmentation by threads has permitted to achieve the three-fold acceleration when
four threads were used. The curve in Figure 2 shows the relation between acceleration and the number of areas.</p>
    </sec>
    <sec id="sec-3">
      <title>4. Classification results</title>
      <p>After classification for all possible segmentations, areas were selected using the developed area selection algorithm. Figure 3
shows the relation between classification error and the number of areas taken in the descending order of their separability
criterion in case of classification with 2-nearest neighbors methods to split into 4 sectors and 8 rings
r s
ebm fo tcer</p>
      <p>o
uN s
5. Conclusion</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgements</title>
      <p>This paper presented the method to generate a set of informative local areas of a spatial spectrum in order to classify medical
crystallogram images, and an option of parallel implementation of such method. In addition, the research included experimental
testing of the developed software implementation, which demonstrated that parallel algorithm implementation provided almost
three-fold acceleration at the areas calculation stage. The next step is to implement parallel computing at the smart area analysis
stage in order to improve the informative area set calculation speed.</p>
      <p>This work was partially supported by the Ministry of education and science of the Russian Federation in the framework of the
implementation of the Program of increasing the competitiveness of SSAU among the world’s leading scientific and educational
centers for 2013-2020 years; by the Russian Foundation for Basic Research grants (# 15-29-03823, # 15-29-07077, #
16-41</p>
      <sec id="sec-4-1">
        <title>High-Performance Computing / N. Kravtsova, R. Paringer, A. Kupriyanov</title>
        <p>630761; # 16-29-11698, # 17-01-00972); by the ONIT RAS program # 6 “Bioinformatics, modern information technologies and
mathematical methods in medicine” 2017</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Shirokanev</surname>
            <given-names>AS</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kirsh</surname>
            <given-names>DV</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>AV</given-names>
          </string-name>
          .
          <article-title>Researching of a crystal lattice parameter identifica-tion algorithm based on the gradient steepest descent method</article-title>
          .
          <source>Computer Optics</source>
          <year>2017</year>
          ;
          <volume>41</volume>
          (
          <issue>3</issue>
          ):
          <fpage>453</fpage>
          -
          <lpage>460</lpage>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2017-41-3-
          <fpage>453</fpage>
          -460.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Paringer</surname>
            <given-names>RA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>AV</given-names>
          </string-name>
          .
          <article-title>The Method for Effective Clustering the Dendrite Crystallogram Images</article-title>
          .
          <source>9th Open German-Russian Workshop on Pattern Recognition and Image Understanding (OGRW</source>
          <year>2014</year>
          ).
          <source>Electronic on-site Proceedings</source>
          , University of Koblenz-Landau,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Paringer</surname>
            <given-names>RA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>AV</given-names>
          </string-name>
          .
          <article-title>Research methods for classification of the crystallogramms images</article-title>
          .
          <source>Proceedings of the 12th international conference PRIP'2014</source>
          . Minsk, Belarus,
          <year>2014</year>
          ;
          <volume>1</volume>
          :
          <fpage>231</fpage>
          -
          <lpage>234</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Kravtsova</surname>
            <given-names>N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paringer</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Development of methods for crystallogramms images classification based on technique of detection informative areas in the spectral space</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          <year>2016</year>
          ;
          <volume>1638</volume>
          :
          <fpage>357</fpage>
          -
          <lpage>363</lpage>
          DOI: 10.18287/
          <fpage>1613</fpage>
          -0073-2016-1638-357-36.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Gaidel</surname>
            <given-names>AV</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krasheninnikov</surname>
            <given-names>VR</given-names>
          </string-name>
          .
          <article-title>Feature selection for diagnozing the osteoporosis by femoral neck X-ray images</article-title>
          .
          <source>Computer Optics</source>
          <year>2016</year>
          ;
          <volume>40</volume>
          (
          <issue>6</issue>
          ):
          <fpage>939</fpage>
          -
          <lpage>946</lpage>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>2412</fpage>
          -6179-2016-40-6-
          <fpage>939</fpage>
          -946.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Fukunaga</surname>
            <given-names>K.</given-names>
          </string-name>
          <article-title>Introduction to statistical pattern recognition</article-title>
          . San Diego: Academic Press,
          <year>1990</year>
          ; 592 p.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Ilyasova</surname>
            <given-names>NYu</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>AV</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paringer</surname>
            <given-names>RA</given-names>
          </string-name>
          .
          <article-title>Formation features for improving the quality of medical diagnosis based on the discriminant analysis methods</article-title>
          .
          <source>Computer Optics</source>
          <year>2014</year>
          ;
          <volume>38</volume>
          (
          <issue>4</issue>
          ):
          <fpage>851</fpage>
          -
          <lpage>855</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Biryukova</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paringer</surname>
            <given-names>R</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kupriyanov</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Development of the effective set of features construction technology for texture image classes discrimination</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          <year>2016</year>
          ;
          <volume>1638</volume>
          :
          <fpage>263</fpage>
          -
          <lpage>269</lpage>
          . DOI:
          <volume>10</volume>
          .18287/
          <fpage>1613</fpage>
          -0073-2016-1638-357-363.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>