Hierarchical Image Segmentation—Part I: Detection of Regular Curves in a Vector Graph

  • Authors:
  • Stefano Casadei;Sanjoy Mitter

  • Affiliations:
  • Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

  • Venue:
  • International Journal of Computer Vision
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of edge detection is viewed as a hierarchyof detection problems where the geometric objects to be detected(e.g., edge points, curves, regions)have increasing complexity and spatial extent.An early stage of the proposed hierarchy consists in detectingthe regular portions of the visible edges.The input to this stage is given by a graph whose verticesare tangent vectors representing local and uncertaininformation about the edges.A model relating the input vector graph tothe curves to be detected is proposed.An algorithm with linear time complexityis described which solves the corresponding detection problem in a worst-case scenario.The stability of curve reconstruction in the presenceof uncertain information and multiple responses to the same edgeis analyzed and addressed explicitly by the proposed algorithm.