Faster circularity estimation by randomization

Abstract

A fast algorithm that approximately estimates the circularity of a digital object is proposed. The algorithm is shown to be capable of incorporating the existing empirical measures of circularity, which are mostly based on area and perimeter computation. The minimum-area orthogonal cover of the object is obtained by a fast combinatorial technique that simultaneously provides approximate measures of the area and the perimeter of the object, wherein lies its strength and novelty. A randomization technique has also been incorporated to make the algorithm more efficient in terms of its running time. Exhaustive experimentation has been performed to verify the robustness of the algorithm, and some results are furnished in this paper to demonstrate its efficacy and elegance.