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
New Frontiers in Spectral-Spatial Hyperspectral Image Classification: The Latest Advances Based on Mathematical Morphology, Markov Random Fields, Segmentation, Sparse Representation, and Deep Learning
Pedram Ghamisi,Emmanuel Maggiori,Shutao Li,Roberto Souza,Yuliya Tarablaka,Gabriele Moser,Andrea De Giorgi,Leyuan Fang,Yushi Chen,Mingmin Chi,Sebastiano B. Serpico,Jon Atli Benediktsson +11 more
TL;DR: In recent years, airborne and spaceborne hyperspectral imaging systems have advanced in terms of spectral and spatial resolution, which makes the data sets they produce a valuable source for land cover classification.
Book ChapterDOI
Supervoxel-Consistent Foreground Propagation in Video
Suyog Dutt Jain,Kristen Grauman +1 more
TL;DR: This work proposes a higher order supervoxel label consistency potential for semi-supervised foreground segmentation, leveraging bottom-up supervoxels to guide its estimates towards long-range coherent regions.
Posted Content
How good are detection proposals, really?
TL;DR: In this article, the authors provide an in depth analysis of ten object proposal methods along with four baselines regarding ground truth annotation recall (on Pascal VOC 2007 and ImageNet 2013), repeatability, and impact on DPM detector performance.
Journal ArticleDOI
Category-Independent Object Proposals with Diverse Ranking
Ian Endres,Derek Hoiem +1 more
TL;DR: A category-independent method to produce a bag of regions and rank them, such that top-ranked regions are likely to be good segmentations of different objects, demonstrating the ability to find most objects within a small bag of proposed regions.
Posted Content
Capsules for Object Segmentation
Rodney LaLonde,Ulas Bagci +1 more
TL;DR: The proposed convolutional-deconvolutional capsule network, called SegCaps, shows strong results for the task of object segmentation with substantial decrease in parameter space and is able to handle large image sizes as opposed to baseline capsules.
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.