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
Improving Sparse 3D Models for Man-Made Environments Using Line-Based 3D Reconstruction
TL;DR: This work uses appearance-less epipolar guided line matching to create a potentially large set of 3D line hypotheses, which are verified using a global graph clustering procedure, and shows that the proposed method outperforms the current state-of-the-art in terms of runtime and accuracy, as well as visual appearance of the resulting reconstructions.
Proceedings ArticleDOI
Semantically guided location recognition for outdoors scenes
TL;DR: This work shows that semantic segmentation labeling of man-made structures can inform the traditional bag-of-visual words models to obtain proper feature weighting and improve the overall location recognition accuracy.
Proceedings ArticleDOI
Coarse-to-Fine Semantic Video Segmentation Using Supervoxel Trees
TL;DR: An exact, general and efficient coarse-to-fine energy minimization strategy for semantic video segmentation based on a hierarchical abstraction of the supervoxel graph that allows us to minimize an energy defined at the finest level of the hierarchy by minimizing a series of simpler energies defined over coarser graphs.
Journal ArticleDOI
Video Supervoxels Using Partially Absorbing Random Walks
TL;DR: This paper presents the novel video supervoxel generation algorithm using partially absorbing random walks to get more accurate supervoxels in regions with complex textures or weak boundaries and builds a novel Laplacian optimization structure using two adjacent frames to make the approach more efficient.
Proceedings ArticleDOI
Superpixel-based object class segmentation using conditional random fields
Xi Li,Hichem Sahbi +1 more
TL;DR: A novel superpixel-based framework for object class segmentation using conditional random fields (CRFs) is proposed and a higher-order criterion is applied to enforce region label consistency of OCS.
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.