A Novel Plant Root Foraging Algorithm for Image Segmentation Problems

<table>The comparison of the thresholded images by ARFO-based and ABC-based algorithms (<svg height="11.425" id="M806" style="vertical-align:-0.27588pt" version="1.1" viewbox="0 0 70.75 11.425" width="70.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M998 650l-8 -28q-71 -4 -86 -16t-22 -69l-50 -397q-3 -28 -4.5 -44t2 -29t6.5 -18.5t17 -10.5t24.5 -6.5t37.5 -3.5l-8 -28h-271l7 28q63 6 78 22t25 90l60 415h-2l-353 -552h-23l-130 536h-2l-70 -254q-44 -158 -47 -188q-5 -38 9 -51t71 -18l-6 -28h-241l8 28
q45 4 67 18.5t35 45.5q16 38 74 233l52 173q24 79 11.5 98t-89.5 26l6 28h177l136 -508l337 508h172z" id="x1D440"></path></g><g transform="matrix(.017,-0,0,-.017,21.192,11.112)"><path d="M535 230h-483v50h483v-50z" id="x2212"></path></g><g transform="matrix(.017,-0,0,-.017,34.944,11.112)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g><g transform="matrix(.017,-0,0,-.017,47.829,11.112)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,62.516,11.112)"><path d="M244 635q90 0 143 -72t53 -177q0 -133 -65 -229.5t-171 -139.5q-79 -32 -140 -32l-5 30q109 18 185 91t101 186l-68 -36q-29 -16 -60 -16q-79 0 -129 51.5t-50 130.5q0 80 57 146.5t149 66.5zM228 602q-52 0 -78 -45.5t-26 -98.5q0 -69 36.5 -115.5t97.5 -46.5
q53 0 90 28q4 31 4 66q0 51 -9.5 95.5t-39 80.5t-75.5 36z" id="x39"></path></g>
</svg>).</table>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A Novel Plant Root Foraging Algorithm for Image Segmentation Problems 