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
Discontinuous seam-carving for video retargeting
TL;DR: A new algorithm for video retargeting that uses discontinuous seam-carving in both space and time for resizing videos and proposes a novel automatically computed measure of spatio-temporal saliency.
Journal ArticleDOI
Learning Full Pairwise Affinities for Spectral Segmentation
TL;DR: This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation by employing a semi-supervised learning technique and provides high-quality segmentations with object details by directly incorporating the full range connections in the spectral framework.
Journal ArticleDOI
Brain tumor detection and segmentation in a CRF (conditional random fields) framework with pixel-pairwise affinity and superpixel-level features.
TL;DR: A robust segmentation method using model-aware affinity demonstrates comparable performance with other state-of-the art algorithms for brain tumor MRI scans.
Journal ArticleDOI
Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree
TL;DR: A new efficient edge-preserving filter-“tree filter”-to achieve strong image smoothing, which can smooth out high-contrast details while preserving major edges, which is not achievable for bilateral-filter-like techniques.
Patent
System and method for waving detection based on object trajectory
Ning Xu,Haiying Guan +1 more
TL;DR: In this article, a system and method for detecting a waving motion from a sequence of ordered points is described, in which the system consists of selecting a subset of the ordered points, determining if the subset defines a circular shape, and storing an indication of whether or not the waving motion.
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.