A Corner-Finding Algorithm for Chain-Coded Curves

PaCeQuant: A Tool for High-Throughput Quantification of Pavement Cell Shape Characteristics

“…2, B-E). First, the local curvature is estimated for each point along the contour by applying the robust algorithm of Freeman and Davis (1977) 2B). Points where signs change refer to inflection points connecting the apical parts of lobe contours (Fig.…”

On REE and EER Methods for Mining Corner Points on the Images

“…This paper reviews two corner detection algorithms [12,13] using boundary-based approach. These are different from ordinary techniques [3,5,6,[8][9][10][11] which detect cosine angle for change in the boundary curve. These algorithms define their settings of geometries as a rectangle (R) and two ellipses (EE) for global, intermediate and local views respectively.…”

“…Many authors have proposed variety of algorithms in the existing literature [3][4][5][6][7][8][9][10][11][12][13]. Rosenfeld and Johnston [8] use k-cosine angle measurement to find corners.…”

“…Rosenfeld and Weszka [9] introduce some modifications of [8] in which the maxima of the difference between successive of the averaged k-cosine angle on a digital curve between the k backward and forward vector were used. Freeman and Davis [6] corner detector contains the chain scanned [8] with line sliding along the contour. The change in local curvature is measured by calculating the difference in angles between consecutive segment locations and detects corners where highest change in curve occurs.…”

“…The change in local curvature is measured by calculating the difference in angles between consecutive segment locations and detects corners where highest change in curve occurs. The corner detector of Beus and Tiu [3] was modification of [6] which introduces an arm limit value τ to specify the upper bound for length of moving line. This paper reviews two corner detection algorithms [12,13] using boundary-based approach.…”