Linked Edges as Stable Region Boundaries

10 years 10 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most stable region boundaries in grayscale images for this purpose. In contrast to common edge detection algorithms as Canny, which only analyze local discontinuities in image brightness, our method integrates mid-level information by analyzing regions that support the local gradient magnitudes. We use a component tree where every node contains a single connected region obtained from thresholding the gradient magnitude image. Edges in the tree are defined by an inclusion relationship between nested regions in different levels of the tree. Region boundaries which are similar in shape (i.\,e.~have a low chamfer distance) across several levels of the tree are included in the final result. Since the component tree can be calculated in quasi-linear time and chamfer matching between nodes in the component tree is reduced ...
Michael Donoser, Hayko Riemenschneider and Horst B
Added 31 Mar 2010
Updated 14 May 2010
Type Conference
Year 2010
Where CVPR
Authors Michael Donoser, Hayko Riemenschneider and Horst Bischof
Comments (0)