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
Hierarchical Exploration of Volumes Using Multilevel Segmentation of the Intensity-Gradient Histograms
TL;DR: This paper presents a semi-automatic approach to this problem that works by visually segmenting the intensity-gradient 2D histogram of a volumetric dataset into an exploration hierarchy that provides a data-driven coarse-to-fine hierarchy for a user to interactively navigate the volume in a meaningful manner.
Journal ArticleDOI
Interactive Image Segmentation Based on Synthetic Graph Coordinates
Costas Panagiotakis,Harris Papadakis,Elias Grinias,Nikos Komodakis,Nikos Komodakis,Paraskevi Fragopoulou,Georgios Tziritas +6 more
TL;DR: This paper uses a Markov Random Field model or a flooding algorithm to get the image segmentation by minimizing a min-max Bayesian criterion and reduces the problem of graph clustering to the simpler problem of point clustering.
Journal ArticleDOI
A survey of semi- and weakly supervised semantic segmentation of images
Man Zhang,Man Zhang,Yong Zhou,Yong Zhou,Jiaqi Zhao,Jiaqi Zhao,Yiyun Man,Bing Liu,Bing Liu,Rui Yao,Rui Yao +10 more
TL;DR: This paper focuses on the core methods and reviews the semi- and weakly supervised semantic segmentation models in recent years, based on the commonly used models such as convolutional neural networks, fully Convolutional networks, generative adversarial networks.
Journal ArticleDOI
Perception-motivated interpolation of image sequences
TL;DR: It suffices to focus on exact edge correspondences, homogeneous regions and coherent motion to compute convincing results and a user study confirms the visual quality of the proposed image interpolation approach.
Journal ArticleDOI
Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs
TL;DR: This work defines a novel hierarchical POMDP-based approach for visual processing management and shows empirically that HiPPo and CP outperform the naive application of all visual operators on all ROIs and produces more robust plans than CP or the naive visual processing.
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.