<!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>Automated Monitoring and Control System for Forestry Enterprises</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Artem Kruglov Ural Federal University 62000</institution>
          ,
          <addr-line>Yekterinburg,Mira st., 19</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article gives a description of a package solution for monitoring and control of forestry enterprise activity. The solution consists of manufacturing execution system (MES) and mobile application for roundwood volume control in situ. The system enables on-line workflow monitoring at the low landing as well as roundwood acceptance and shipment on line monitoring. This solution provides full automation of gathering data about raw material logistic at each processing stage till delivery.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Sales department
Directory of clients
and contracts;
production plan
Forest workers</p>
      <p>Management
Insights about current
condition and activity
of the roundwood yard
Dispatch
reports</p>
      <p>Control and
accounting of the
forest enterprise
activity</p>
      <p>Step-by-step data
about roundwood
yard activity</p>
      <p>Roundwood yard</p>
      <p>specialists
Production
directory</p>
      <p>Side rods</p>
      <p>Planning
department of
forest exploitation</p>
      <p>Chew directory and
stuff composition</p>
      <p>Registration of the
income and dispatch</p>
      <p>of the timber</p>
      <p>Forest
use reports</p>
      <p>Fig. 1 –Model of the automation objects
 Jumbled timber income</p>
      <p>These operations are stored in form of specifications. The specifications are uploaded to the
system’s server in the .json text format. The transmitted package also includes inner image which is
used for the measurement and further visual validation of the volume and quantity of the processed
roundwood. The example of the package is listed below.
{
"datetime": "2017-04-19T07:55:45",
"device_id": "54b1ea3ca62185bc",
"dictionaries": {
"contract_sale": "e17ec2f1-833f-443b-8116-aaa91e97118c",
"depot_master": "841c3aa8-5fdd-460c-9fa6-a958a41049f0",
"driver": "c93a8e70-dd42-4958-8794-2439fc34fae2",
"forest_declaration_area": "6e193c4c-9f60-48b1-a8fb-0d9a23f9b072",
"load_operator": "aa313f4c-4327-4a44-9d02-e8fcd69a75fd",
"outcome_type_enum": "Log truck",
"railway_carriage_text": "",
"railway_route_text": "",
"team_sortiment": "2f288591-9fb9-4a57-a109-61ca85ded806",
"team_wood": "",
"unload_operator": "0475a24e-99fc-4dd7-8442-bc1df3b5ed05",
"wood_outcome_deriction_enum": "",
"wood_sortiment": "50c53bb9-3144-4a91-9590-ee14c0966071",
"wood_type": "",
"wood_type_enum": "",
"woodcutter": ""
}
},
"images": ["image array"],
"operation_type": 0,
"reporter_name": "Last name, First name",
"specific_id": "1492588545754",
"specific_name": "Specification",
"sum_logs": 0,
"sum_volume": 0.0,
"timbers": []</p>
      <p>The data exchange between “FoRest” software and the main system is realized through assigned
in the system’s settings catalogue titled “FoRest downloads” – that is network resource for
downloading files from the software. This folder must include folder “processed” for storing files
which are processed and taken into account by the system.
2. Round timber automatic measurement
“FoRest” is designed to conduct operations with maximum possible automatic performance,
however, it provides tools for manual editing of the processing result. The software is designed for
mobile devices under Android OS ver. 4.3 or above. The sequence of operations for obtaining the log
pile measurement results is following:
1) Uploading one or two images into the program. Number of images is selected according to
the available viewpoints of the log pile ends and assigned in the global settings of the program
2) Calibration of each image. Calibration consists in determination of the inner and outer
parameters of the camera. It can be implemented in automatic mode with particular standard
object detection or manually by the user.
3) Automatic detection of abuts. This stage is performed independently from the user
4) Manual editing. It is implemented in cases of algorithm detection error, for example for the
overlapped abuts.
5) Result generation and analysis. Program output is presented in the form of a detailed report
which can be edited afterwards or exported in doc, xls, pdf format.</p>
    </sec>
    <sec id="sec-2">
      <title>2.1. Automatic analysis Automatic analysis and editing module is the key feature of the software. Automatic detection is performed independently; result of the operation is displayed to the user immediately after algorithm execution.</title>
      <p>
        One of the most common deterministic methods is the Hough transform (HT) method. On the basis
of this method, the algorithm of probabilistic pair voting (PPV) for fast and reliable detection of
circular objects is proposed [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The algorithm guarantees reliable recognition for overlaps, noise and
moderate deformations of the shape. In work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] an algorithm for recognizing incomplete ellipses
based on iterative randomized Hough transform (IRHT) is considered. This method is resistant to
strong noise, but it has a high cost of computation and works with objects of a strictly elliptical shape.
The authors of the paper [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] developed an algorithm for the localized Hough transform to analyze the
Cherenkov radiation, which significantly reduce the time costs for performing Hough transform. In
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], Hough transform is used to estimate the parameters after determining the assumed ellipses by the
arc selection strategy.
      </p>
      <p>
        Other methods for recognizing ellipses include the static RANSAC method described in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], the authors proposed a new scheme for recognizing ellipses using curve segments. A similar
algorithm was proposed in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], where the detection of ellipses is implemented by combining the edge
contours according to curvature and convexity.
      </p>
      <p>
        The method proposed in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is a randomized iterative workflow that uses the geometric properties
of the isophot curve in the image to select the most significant edge pixels and classify them into
subsets with an equal curvature. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the BFOA algorithm was considered using the example of
circle recognition, and its modification was proposed for recognizing a set of figures in the image.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] authors considered algorithms for tracing automobile wheels for the task of constructing
an automatic classifier of vehicles. In this paper, a modified algorithm of Viola and Jones is proposed
with the construction of a basic feature set over vector gradient map. The method provides good
resistance to various lighting conditions and noise with no type II errors.
      </p>
      <p>
        The best result during the tests were obtained by ELSD algorithm [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. This algorithm effectively
detects elliptical arcs and also excludes type II errors.
      </p>
      <p>The ELSD algorithm is a three-step process:
1) at the first stage of the heuristic method - candidates for the desired figures;
2) then each candidate goes through a validation phase (validation of candidates);
3) Finally, to select the best geometric interpretation, a model selection stage is required.</p>
      <p>
        The first step is based on the greedy (heuristic) approach, which was proposed in the algorithm for
recognizing LSD segments [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The authors declare that a heuristic approach should be applied
without applying critical parameters with the maximum resolved feature. The step of validating
candidates is based on the probabilistic method of the opposite [13]. This operation provides effective
protection against false positives. Similar to the second step, the principle of model selection is based
on selection criteria. The principle of the algorithm is the following:
      </p>
    </sec>
    <sec id="sec-3">
      <title>The flow chart of the algorithm is given in Fig. 2.</title>
      <p>Gray-level image X
grad = compute_gradient(X)</p>
      <p>foreach x[i] in X
R = region_grow(x[i],grad)
C = curve_grow(R,grad)
line = fit_rectangle(R)
circle = fit_circular_ring(C)
ellipse = fit_elliptical_ring(C)
No
(nfa_l,nfa_c,nfa_e) = NFA(line,circle,ellipse)</p>
      <p>NFA_min = min(nfa_l,nfa_c,nfa_e)</p>
      <p>NFA_min &lt;= 1</p>
      <p>Yes
L = NFA_min</p>
      <p>List L</p>
      <p>Fig 2. ELSD algorithm flow chart
To apply the ELSD algorithm in the log abut detection the following changes were needed:
 Discard detection of linear segments which is unnecessary for the given task.
 Discard elliptical and circular arcs with the minimum curvature of the line, since these contours
describe linear fragments.
 Discard contours with anomalously minimal and maximum radii after analyzing the radiuses of
the arcs. Generally the log abuts in the image have approximately equal radius, and any
significant deviation from this range indicates obvious foreign objects in the image.
 Discard segments of curves with small lengths after analyzing the lengths of the arcs as far as
these arcs generally belong to the background objects (grass, sawdust).
 Major arcs are completed to a full ellipse or circle.</p>
      <p>Result of the automatic detection is shown in Fig. 3.</p>
      <p>a</p>
      <p>b
Fig. 3 – Result of the automatic detection
c</p>
      <p>
        Detected abuts are highlighted with color marker. The volume measurement is performed
according to the requirements document (GOST 32594-2013 and GOST 2708-75). The particular
measurement method is selected in the global settings.
2.2. Editing
After the automatic algorithm execution some abuts may be undetected while other objects in the
image may be detected incorrectly, so the manual editing should be implemented. Deleting of the
objects is implemented by selecting “–” tool and clicking objects in the image, whereas the tool “+”
should be selected to add new object. Addition of the objects is implemented on the basis of the Lee
algorithm [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The listing of the procedure is given below.
mask.put(p, (byte) 2);
next.add(p);
while (!next.isEmpty()){
replaceQueuees();
for( i=0;i&lt;current.size();i++ ){
checkNeighbors ( current.poll() );
current, next – pixel queues of the current and next level respectively.
      </p>
      <p>Four neighbor pixels are checked for similarity with given pixel. The pixel similarity test function
is following:
void checkForSimilarity( Point startPoint,
Point checkPoint ){
if ( isPixelExists(checkPoint) ){
if(areColorsSimilar( img.getPixel(startPoint.x,
startPoint.y),
img.getPixel(checkPoint.x, checkPoint.y) ) ){
mask.put( checkPoint, SIMILAR );
next.add( checkPoint );
}
else mask.put( checkPoint, NOT_SIMILAR );
}}</p>
      <p>method isPixelExists(checkPoint) checks for image array overrun, mask – structure which stores
the checked pixels labeled as included to or excluded from resulted image area.</p>
      <p>Pixel color similarity test function is flowing:
boolean areColorsSimilar(int c1, int c2){
int differenceR = Abs( c1.red -c2.red );
int differenceG = Abs( c1.green -c2.green );
int differenceB = Abs( c1.blue -c2.blue );
int maxDifference = Max( differenceR,
differenceG, differenceB );
return maxDifference &lt; step ? true : false;
}</p>
      <p>step – algorithm sensitivity.
3. Conclusion
It is manufacturing execution system “Plateau” that stores the overall information on the
manufacturing processes at the low landing, obtained from various sources including the mentioned
software. It allows the key indicators of the forest enterprise performance to be analyzed for any
period, planning the further management strategy. MES system enables 24/7 access from anywhere
through its implementation over the web. Self-service concept allows the management and the stuff
to get all information required without any prior training and special skills.</p>
      <p>The software “FoRest” operating principle involves the automatic detection of the logs’ cross-cut
ends of the image, calculating the diameters of each cut using calibration coefficients and, finally,
cubic capacity of the measured pile based on the obtained data and prior information about the average
length of the log pile. The result of the measurement is formed as a report and copied into the data
store of the analysis system with following tags: type of operation, raw product (tree trunk/wood
assortment), timber species, connected staff (crew, driver, tallyman). Approbation of the software
was performed in the logging enterprise under the manufacturing conditions. According to the testing
results the average error for the log pile photogrammetry measurement is of 5.14% with maximum
error of 9.2% in comparison with manual measurement. Industry standards establish the maximum
volume measurement error for the round timber at the level of ±12%. Thus, a method of the log piles
photogrammetry measurement using the developed algorithm can be successfully applied in the
activity of forest enterprises. “FoRest” is successfully used at the forest enterprises of the Ural Federal
District at the moment
databases with noise. Proceedings of the Second International Conference on Knowledge
Discovery and Data Mining (KDD-96). AAAI Press.
13. Landau U.M. Estimation of a circular arc center and its radius // Computer Vision, Graphics and
Image Proc, 1987, Vol. 38, p. 317–326.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>L.</given-names>
            <surname>Pan</surname>
          </string-name>
          , W.-S.Chu,
          <string-name>
            <given-names>J.M.</given-names>
            <surname>Saragih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Torre</surname>
          </string-name>
          ,
          <article-title>Fast and Robust Circular Object Detection with Probabilistic Pairwise Voting (PPV) /</article-title>
          / IEEE Signal Processing Letters,
          <year>2011</year>
          , №
          <volume>18</volume>
          (
          <issue>11</issue>
          ), p.
          <fpage>639</fpage>
          -
          <lpage>642</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>W.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <article-title>Detection of incomplete ellipse in images with strong noise by iterative randomized Hough transform</article-title>
          (IRHT) // Pattern Recognition,
          <year>2008</year>
          , №
          <volume>41</volume>
          (
          <issue>4</issue>
          ), p.
          <fpage>1268</fpage>
          -
          <lpage>1279</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lebedev</surname>
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ososkov</surname>
            <given-names>G.A.</given-names>
          </string-name>
          <article-title>Fast algorithms for ring recognition and electron identification in the CBM rich detector //</article-title>
          <source>Physics of Particles and Nuclei Letters</source>
          ,
          <year>2009</year>
          , №
          <volume>6</volume>
          (
          <issue>2</issue>
          ), p
          <fpage>161</fpage>
          -
          <lpage>176</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>M.</given-names>
            <surname>Fornaciari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Prati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cucchiara</surname>
          </string-name>
          ,
          <article-title>A fast and effective ellipse detector for embedded vision</article-title>
          applications // Pattern Recognition,
          <year>2014</year>
          , №
          <volume>47</volume>
          (
          <issue>11</issue>
          ), p.
          <fpage>3693</fpage>
          -
          <lpage>3708</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>F.</given-names>
            <surname>Mai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. S.</given-names>
            <surname>Hung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W. F.</given-names>
            <surname>Sze</surname>
          </string-name>
          ,
          <article-title>A hierarchical approach for fast and robust ellipse extraction // Pattern Recognition 2008</article-title>
          , vol.
          <volume>41</volume>
          , no.
          <issue>8</issue>
          , pp.
          <fpage>2512</fpage>
          -
          <lpage>2524</lpage>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>K.</given-names>
            <surname>Hahn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jung</surname>
          </string-name>
          , Y.Han,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hahn</surname>
          </string-name>
          ,
          <article-title>A new algorithm for ellipse detection by curve segments // Pattern Recognition Letters</article-title>
          ,
          <year>2008</year>
          , №
          <volume>13</volume>
          , p.
          <fpage>1836</fpage>
          -
          <lpage>1841</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>D.K.Prasad</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.K.H.Leung</surname>
          </string-name>
          , S.-Y.Cho,
          <article-title>Edge curvature and convexity based ellipse</article-title>
          detection method // Pattern Recognition,
          <year>2012</year>
          , №
          <volume>45</volume>
          (
          <issue>9</issue>
          ), p.
          <fpage>3204</fpage>
          -
          <lpage>3221</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>T.</given-names>
            <surname>Marco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cazzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Leo</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Distante Randomized circle detection with isophotes curvature analysis</article-title>
          // Pattern Recognition,
          <year>2015</year>
          , №
          <volume>48</volume>
          (
          <issue>2</issue>
          ), p.
          <fpage>411</fpage>
          -
          <lpage>421</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mishystin</surname>
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <article-title>Investigation of the BFOA algorithm within the task of recognizing simple figures in an image // Proccedings of IV Young scientist conf</article-title>
          .
          <source>Information management systems and computer monitoring</source>
          , Donetsk,
          <year>2013</year>
          (URL: http://masters.donntu.org/2013/fknt/mishustin/library/bfoa_2013.pdf)
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gladilin</surname>
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kotov</surname>
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikolaev</surname>
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Usilin</surname>
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <article-title>The construction of stable signs of detection and classification of objects with no characteristic brightness contrasts // Information Technologies</article-title>
          and
          <source>Computer Systems</source>
          ,
          <year>2014</year>
          , vol.
          <volume>1</volume>
          , p.
          <fpage>53</fpage>
          -
          <lpage>60</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <article-title>A parameterless line segment and elliptical arc detector with enhanced ellipse fitting / Viorica Patraucean</article-title>
          , Pierre Gurdjos,
          <source>Rafael Grompone von Gioi // ECCV(2), Lecture Notes in Computer Science</source>
          .
          <year>2012</year>
          , vol.
          <volume>7573</volume>
          , p.
          <fpage>572</fpage>
          -
          <lpage>585</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Ester</surname>
          </string-name>
          , Martin; Kriegel,
          <string-name>
            <surname>Hans-Peter; Sander</surname>
          </string-name>
          , Jörg; Xu,
          <string-name>
            <surname>Xiaowei</surname>
          </string-name>
          (
          <year>1996</year>
          ). Simoudis, Evangelos; Han, Jiawei; Fayyad, Usama M.,
          <string-name>
            <surname>eds.</surname>
          </string-name>
          <article-title>A density-based algorithm for discovering clusters in large spatial</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>