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
Fast human detection for indoor mobile robots using depth images
TL;DR: A fast human detection algorithm for mobile robots equipped with depth cameras that is able to detect humans in different postures and with occlusions and performs comparably well on a single CPU core against another HOD-based algorithm that runs on a GPU even when the number of training examples is decreased by half.
Proceedings ArticleDOI
4D Light Field Superpixel and Segmentation
TL;DR: The essential element of image pixel, i.e., rays in the light space is considered and light field superpixel (LFSP) segmentation is proposed to eliminate the ambiguity and a robust refocus-invariant LFSP segmentation algorithm is developed.
Proceedings ArticleDOI
Discrete-Continuous Gradient Orientation Estimation for Faster Image Segmentation
TL;DR: It is demonstrated that based on a discrete-continuous optimization of oriented gradient signals, this paper is able to provide segmentation performance competitive to state-of-the-art on BSDS 500 (even without any spectral analysis) while reducing computation time and memory demands.
Journal ArticleDOI
A novel learning-based feature recognition method using multiple sectional view representation
TL;DR: A deep learning framework based on multiple sectional view (MSV) representation named MsvNet is proposed for feature recognition, and a novel view-based feature segmentation and recognition algorithm is presented that outperforms the state-of-the-art learning-based multi-feature recognition method in terms of recognition performances.
Journal ArticleDOI
Map-aided localization in sparse global positioning system environments using vision and particle filtering
TL;DR: The algorithm is shown to statistically outperform a tightly coupled GPS/inertial navigation solution both in full GPS coverage and in extended GPS blackouts, and as a function of road type, filter likelihood models, bias models, and filter integrity tests.
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.