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
Journal ArticleDOI
Efficient and robust pupil size and blink estimation from near-field video sequences for human-machine interaction.
Siyuan Chen,Julien Epps +1 more
TL;DR: A novel self-tuning threshold method, applicable to any infrared-illuminated eye images without a tuning parameter, is proposed for segmenting the pupil from the background images recorded by a low cost webcam placed near the eye.
Journal ArticleDOI
Images as Occlusions of Textures: A Framework for Segmentation
Michael T. McCann,Dustin G. Mixon,Matthew Fickus,Carlos A. Castro,John A. Ozolek,Jelena Kovacevic +5 more
TL;DR: A flexible segmentation framework that draws on existing work on nonnegative matrix factorization and image deconvolution is described, and results on synthetic texture mosaics and real histology images show the promise of the method.
Journal ArticleDOI
Superpixel-Based Multitask Learning Framework for Hyperspectral Image Classification
TL;DR: The experimental results show that the performance of the proposed GS4E-MTLSVM is better than those of several state-of-the-art methods, while the computational complexity has been greatly reduced, compared with the pixel-based spatial–spectral Schroedinger eigenmaps method.
Proceedings ArticleDOI
Improved single image dehazing using segmentation
TL;DR: A novel algorithm is introduced to restore the clear day image by the segmented hazy image by using the graph-based image segmentation method to segment the hazed image by choosing the optimal parameter.
Book ChapterDOI
Visual saliency based object tracking
TL;DR: This paper presents a novel method of on-line object tracking with the static and motion saliency features extracted from the video frames locally, regionally and globally, and it can detect any category of objects as long as they are salient.
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.