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
Auto-directed video stabilization with robust L1 optimal camera paths
TL;DR: A novel algorithm for automatically applying constrainable, L1-optimal camera paths to generate stabilized videos by removing undesired motions without the need of user interaction or costly 3D reconstruction of the scene is presented.
Journal ArticleDOI
A Formal Study of Shot Boundary Detection
TL;DR: A unified shot boundary detection system based on graph partition model is presented and it is shown that the proposed approach is among the best in the evaluation of TRECVID 2005.
Proceedings ArticleDOI
DeepEdge: A multi-scale bifurcated deep network for top-down contour detection
TL;DR: This work claims that recognizing objects and predicting contours are two mutually related tasks, and shows that it can invert the commonly established pipeline: instead of detecting contours with low-level cues for a higher-level recognition task, it exploits object-related features as high- level cues for contour detection.
Proceedings ArticleDOI
Learning 3-D Scene Structure from a Single Still Image
TL;DR: This work considers the problem of estimating detailed 3D structure from a single still image of an unstructured environment and uses a Markov random field (MRF) to infer a set of "plane parameters" that capture both the 3D location and 3D orientation of the patch.
Journal ArticleDOI
Superparsing: Scalable Nonparametric Image Parsing with Superpixels
Joseph Tighe,Svetlana Lazebnik +1 more
TL;DR: In this paper, a Markov Random Field (MRF) is used to combine scene-level matching with global image descriptors, followed by superpixel level matching with local features and efficient MRF optimization for incorporating neighborhood context.
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.