Region and edge-adaptive sampling and boundary completion for segmentation

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Edge detection produces a set of points that are likely to lie on discontinuities between objects within an image. We consider faces of the Gabriel graph of these points, a sub-graph of the Delaunay triangulation. Features are extracted by merging these faces using size, shape and color cues. We measure regional properties of faces using a novel shape-adaptive sampling method that overcomes undesirable sampling bias of the Delaunay triangles. Instead, sampling is biased so as to smooth regional statistics within the detected object boundaries, and this smoothing adapts to local geometric features of the shape such as curvature, thickness and straightness. We further identify within the Gabriel graph regions having uniform thickness and orientation which are grouped into directional features for subsequent hierarchical region merging. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Dillard, S. E., Prasad, L., & Grazzini, J. (2010). Region and edge-adaptive sampling and boundary completion for segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6454 LNCS, pp. 64–74). https://doi.org/10.1007/978-3-642-17274-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free