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
Patent
Region-based image denoising
Abstract: An “Image Denoiser” provides a probabilistic process for denoising color images by segmenting an input image into regions, estimating statistics within each region, and then estimating a clean (or denoised) image using a probabilistic model of image formation. In one embodiment, estimated blur between each region is used to reduce artificial sharpening of region boundaries resulting from denoising the input image. In further embodiments, the estimated blur is used for additional purposes, including sharpening edges between one or more regions, and selectively blurring or sharpening one or more specific regions of the image (i.e., “selective focus”) while maintaining the original blurring between the various regions.
Book ChapterDOI
Semi-convolutional Operators for Instance Segmentation
TL;DR: In this paper, the authors show theoretically and empirically that constructing dense pixel embeddings that can separate object instances cannot be easily achieved using convolutional operators, and they show that simple modifications, which they call semi-convolutional, have a much better chance of succeeding at this task.
Journal ArticleDOI
New Hierarchical Saliency Filtering for Fast Ship Detection in High-Resolution SAR Images
TL;DR: A new hierarchical saliency filtering method for fast and accurate ship detection in high-resolution SAR images by gradually filter out the false alarms from candidate regions and extract the target outlines for accurate detection.
Journal ArticleDOI
Remote sensing image segmentation advances: A meta-analysis
TL;DR: The conceptual characteristics of image segmentation methods are presented with a special focus on semantic segmentation, including statistics and quantitative data regarding the applied segmentation algorithm, the software utilized and the data source among others.
Proceedings ArticleDOI
Semantic segmentation of street scenes by superpixel co-occurrence and 3D geometry
Branislav Micusik,Jana Kosecka +1 more
TL;DR: The main novelty of this generative approach is the introduction of an explicit model of spatial co-occurrence of visual words associated with super-pixels and utilization of appearance, geometry and contextual cues in a probabilistic framework.
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.