S. Casadei et S. Mitter, HIERARCHICAL IMAGE SEGMENTATION - PART-I - DETECTION OF REGULAR CURVES IN A VECTOR GRAPH, International journal of computer vision, 27(1), 1998, pp. 71-100
The problem of edge detection is viewed as a hierarchy of detection pr
oblems where the geometric objects to be detected (e.g., edge points,
curves, regions) have increasing complexity and spatial extent. An ear
ly stage of the proposed hierarchy consists in detecting the regular p
ortions of the visible edges. The input to this stage is given by a gr
aph whose vertices are tangent vectors representing local and uncertai
n information about the edges. A model relating the input vector graph
to the curves to be detected is proposed. An algorithm with linear ti
me complexity is described which solves the corresponding detection pr
oblem in a worst-case scenario. The stability of curve reconstruction
in the presence of uncertain information and multiple responses to the
same edge is analyzed and addressed explicitly by the proposed algori
thm.