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
A Novel Interpolation Scheme for Range Data with Side Information
TL;DR: A novel interpolation technique that exploits side information from a standard color camera to increase the resolution of range maps and allows to obtain a more accurate interpolation with sharper edges if compared with standard approaches.
Proceedings ArticleDOI
Local region detector + CNN based landmarks for practical place recognition in changing environments
Peer Neubert,Peter Protzel +1 more
TL;DR: The proposed method outperforms the best existing holistic method for place recognition in such changing environments and can additionally handle severe viewpoint changes, and the combination of the best performing detectors with superpixel based spatial image support shows promising results.
Book ChapterDOI
Fast, quality, segmentation of large volumes – isoperimetric distance trees
TL;DR: A new approach based on a novel speed-up of the isoperimetric algorithm that can solve the problem of leaks through a bottleneck and is shown to overcome common problems with watershed-based techniques and to provide fast, high-quality results on large datasets.
Proceedings ArticleDOI
Perception-motivated interpolation of image sequences
TL;DR: This work presents a method for image interpolation which is able to create high-quality, perceptually convincing transitions between recorded images and finds that it suffices to focus on exact edge correspondences, homogeneous regions and coherent motion to compute such solutions.
Journal ArticleDOI
Color learning and illumination invariance on mobile robots: A survey
Mohan Sridharan,Peter Stone +1 more
TL;DR: The goal is to determine the suitability of the state-of-the-art vision algorithms for mobile robot domains, and to identify the challenges that still need to be addressed to enable mobile robots to learn and adapt models for color, so as to operate autonomously in natural conditions.
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.