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
Posted Content
Image Co-localization by Mimicking a Good Detector's Confidence Score Distribution
TL;DR: An entropy-based objective function is devised to enforce the above property when learning the common object detector, and it is shown that despite its simplicity, the approach outperforms state-of-the-arts.
Journal ArticleDOI
A Novel SAR Image Change Detection Based on Graph-Cut and Generalized Gaussian Model
TL;DR: Experimental results on simulated and real SAR data sets confirm the robustness and accuracy of the proposed algorithm in which graph-cut and GGD make great contribution on improving the accuracy of detection and speed of algorithm.
Patent
System and method for image processing using multi-touch gestures
TL;DR: In this article, a multi-touch gestural input set which comprises a plurality of touch gestures may be applied to a display of an image, including mobile and stationary gestures, to indicate a different image processing constraint that may apply to modify the digital image.
Proceedings ArticleDOI
Query-adaptive shape topic mining for hand-drawn sketch recognition
TL;DR: A query-adaptive shape topic model is proposed to mine object topics and shape topics related to the sketch, in which, multiple layers of information such as sketch, object, shape, image, and semantic labels are modeled in a generative process.
Journal ArticleDOI
PVR: Patch-to-Volume Reconstruction for Large Area Motion Correction of Fetal MRI
Amir Alansary,Martin Rajchl,Steven McDonagh,Maria Murgasova,M. Damodaram,David F. A. Lloyd,Alice Davidson,Mary A. Rutherford,Joseph V. Hajnal,Daniel Rueckert,Bernhard Kainz +10 more
TL;DR: A novel method for the correction of motion artifacts that are present in fetal magnetic resonance imaging (MRI) scans of the whole uterus is presented and an efficient parallel implementation of PVR is described allowing its execution within reasonable time on commercially available graphics processing units, enabling its use in the clinical practice.
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.