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
An L1 image transform for edge-preserving smoothing and scene-level intrinsic decomposition
Sai Bi,Xiaoguang Han,Yizhou Yu +2 more
TL;DR: An image transform based on the L1 norm for piecewise image flattening that can effectively preserve and sharpen salient edges and contours while eliminating insignificant details, producing a nearly piecewise constant image with sparse structures is introduced.
Proceedings ArticleDOI
Context Driven Scene Parsing with Attention to Rare Classes
TL;DR: This paper focuses on rare object classes, which play an important role in achieving richer semantic understanding of visual scenes, compared to common background classes, and makes two novel contributions: rare class expansion and semantic context description.
Journal ArticleDOI
Recovering Occlusion Boundaries from an Image
TL;DR: This paper proposes a hierarchical segmentation process, based on agglomerative merging, that re-estimates boundary strength as the segmentation progresses, and applies Gestalt grouping principles using a conditional random field (CRF) model.
Proceedings ArticleDOI
Evaluation of super-voxel methods for early video processing
Chenliang Xu,Jason J. Corso +1 more
TL;DR: In this article, a comprehensive suite of 3D volumetric quality metrics to measure these desirable supervoxel characteristics is proposed. And the hierarchical graph-based and segmentation by weighted aggregation methods perform best and almost equally well on nearly all the metrics.
Journal ArticleDOI
A stereo imaging system for measuring structural parameters of plant canopies.
TL;DR: An area-based, binocular stereo system composed of commercially available components that allows three-dimensional reconstruction of small- to medium-sized canopies on the level of single leaves under field conditions and provides high spatial and temporal resolution.
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.