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
Patch Match Filter: Efficient Edge-Aware Filtering Meets Randomized Search for Fast Correspondence Field Estimation
TL;DR: This paper presents a generic and fast computational framework for general multi-labeling problems called Patch Match Filter (PMF), and explores effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., Based-based randomized search and efficient edge-aware image filtering.
Proceedings ArticleDOI
How Good are Detection Proposals, really?
TL;DR: 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 are provided.
Journal ArticleDOI
Cosaliency Detection Based on Intrasaliency Prior Transfer and Deep Intersaliency Mining
TL;DR: A novel cosaliency detection approach using deep learning models, called intrasaliency prior transfer and deep intersaliency mining, which can extract more intrinsic and general hidden patterns to discover the homogeneity of cosalient objects in terms of some higher level concepts.
Book ChapterDOI
LSTM-CF: Unifying Context Modeling and Fusion with LSTMs for RGB-D Scene Labeling
TL;DR: Wang et al. as discussed by the authors proposed a Long Short-Term Memorized Context Fusion (LSTM-CF) model that captures and fuses contextual information from multiple channels of photometric and depth data, and incorporated this model into deep CNNs for end-to-end training.
Journal ArticleDOI
Green streets − Quantifying and mapping urban trees with street-level imagery and computer vision
TL;DR: In this article, a multi-step computer vision algorithm segments and quantifies the percent of tree cover in street-scapes images to a high degree of precision, and then models the relationship between neighbouring images along city street segments.
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.