Recursive Algorithms of Maximum Entropy Thresholding on Circular Histogram

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">Image number</td><td class="align_center">Brute force (considering symmetry)</td><td class="align_center">Recursive algorithm</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">e</td><td class="align_center">9134.8758</td><td class="align_center">139.6414</td></tr><tr><td class="align_left">f</td><td class="align_center">9155.4190</td><td class="align_center">138.3274</td></tr><tr><td class="align_left">Average time</td><td class="align_center">9145.1474</td><td class="align_center">138.9844</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Comparison of computation speed for four-class thresholding with different methods (in seconds).</div>

Mathematical Problems in Engineering

tab4

Table 4

Table 4: Recursive Algorithms of Maximum Entropy Thresholding on Circular Histogram 