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
Proceedings ArticleDOI
Towards total scene understanding: Classification, annotation and segmentation in an automatic framework
TL;DR: A fully automatic learning framework that is able to learn robust scene models from noisy Web data such as images and user tags from Flickr.com that significantly outperforms state-of-the-art algorithms.
Proceedings ArticleDOI
Automatic Salient Object Segmentation Based on Context and Shape Prior
TL;DR: A novel automatic salient object segmentation algorithm which integrates both bottom-up salient stimuli and object-level shape prior, leading to binary segmentation of the salient object.
Journal ArticleDOI
Hierarchical Image Saliency Detection on Extended CSSD
TL;DR: This work proposes a multi-layer approach and constructs an extended Complex Scene Saliency Dataset (ECSSD) to include complex but general natural images and improves detection quality on many images that cannot be handled well traditionally.
Journal ArticleDOI
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
TL;DR: The primary purpose of this paper is to examine the effectiveness of “Split Bregman” techniques for solving image segmentation problems, and to compare this scheme with more conventional methods.
Proceedings Article
Learning Visual Attributes
TL;DR: It is shown that attributes can be learnt starting from a text query to Google image search, and can then be used to recognize the attribute and determine its spatial extent in novel real-world images.
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.