Efficient Graph-Based Image Segmentation
TLDR
An efficient segmentation algorithm is developed based on a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image and it is shown that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties.Abstract:
This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.read more
Citations
More filters
Journal ArticleDOI
Comprehensive insights into evaluation and benchmarking of real-time skin detectors: Review, open issues & challenges, and recommended solutions
TL;DR: Decision making using multiple criteria such as reliability, time complexity, and error rate within a dataset is used for evaluating and benchmarking real-time skin detectors to come up with solutions for future directions.
Proceedings ArticleDOI
An integrated approach to visual perception of articulated objects
TL;DR: To robustly perceive objects and understand interactions, the method tightly integrates pose tracking, shape reconstruction, and the estimation of their kinematic structure to improve the performance of perception.
Journal ArticleDOI
Fusion of Geometry and Color Information for Scene Segmentation
TL;DR: A novel segmentation scheme where multidimensional vectors are used to jointly represent color and depth data and normalized cuts spectral clustering is applied to them in order to segment the scene.
Journal ArticleDOI
Hierarchical Segmentation Using Tree-Based Shape Spaces
TL;DR: A novel approach that acts by transforming an input hierarchy into a new saliency map that relies on the notion of shape space: a graph representation of a set of regions extracted from the image that represents a new hierarchy of segmentations highlighting regions having some specific characteristics.
Proceedings ArticleDOI
Robot learning with a spatial, temporal, and causal and-or graph
TL;DR: A stochastic graph-based framework for a robot to understand tasks from human demonstrations and perform them with feedback control is proposed, which unifies both knowledge representation and action planning in the same hierarchical data structure, allowing a robots to expand its spatial, temporal, and causal knowledge at varying levels of abstraction.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
TL;DR: A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clusters is possible in some cases by extensions of the method.