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
Temporally Consistent Superpixels
TL;DR: This paper presents a highly competitive approach for temporally consistent super pixels for video content based on energy-minimizing clustering utilizing a novel hybrid clustering strategy for a multi-dimensional feature space working in a global color subspace and local spatial subspace.
Journal ArticleDOI
Harmony Potentials
Xavier Boix,Josep M. Gonfaus,Joost van de Weijer,Andrew D. Bagdanov,Joan Serrat,Jordi Gonzàlez +5 more
TL;DR: A new consistency potential is proposed for image labeling problems that can encode any possible combination of labels, penalizing only unlikely combinations of classes, and an effective sampling strategy is proposed over this expanded label set that renders tractable the underlying optimization problem.
Journal ArticleDOI
A Quaternion Framework for Color Image Smoothing and Segmentation
Özlem N. Subakan,Baba C. Vemuri +1 more
TL;DR: A novel quaternionic Gabor filter (QGF) which can combine the color channels and the orientations in the image plane is introduced and it is shown that these filters are optimally localized both in the spatial and frequency domains and provide a good approximation to quaternionics quadrature filters.
Patent
Integrated Systems and Methods For Video-Based Object Modeling, Recognition, and Tracking
Liang Zhao,Matthew G. Berry +1 more
TL;DR: In this article, an image of an object is extracted from a particular frame in the video file, and a subsequent image is also extracted from another frame in a subsequent frame by calculating a similarity value between the extracted images from the particular frame and subsequent frame.
Journal ArticleDOI
VCells: Simple and Efficient Superpixels Using Edge-Weighted Centroidal Voronoi Tessellations
Jie Wang,Xiaoqiang Wang +1 more
TL;DR: VCells, the proposed Edge-Weighted Centroidal Voronoi Tessellations (EWCVTs)-based algorithm, is used to generate superpixels, i.e., an oversegmentation of an image, which is capable of generating roughly uniform subregions and nicely preserving local image boundaries.
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.