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
The Replica Dataset: A Digital Replica of Indoor Spaces.
Julian Straub,Thomas Whelan,Lingni Ma,Yufan Chen,Erik Wijmans,Simon Green,Jakob Engel,Raul Mur-Artal,Carl Yuheng Ren,Shobhit Verma,Anton Clarkson,Yan Mingfei,Brian Budge,Yajie Yan,Xiaqing Pan,June Yon,Yuyang Zou,Kimberly Leon,Nigel Carter,Jesus Briales,Tyler Gillingham,Elias Mueggler,Luis Pesqueira,Manolis Savva,Dhruv Batra,Hauke Strasdat,Renzo De Nardi,Michael Goesele,Steven Lovegrove,Richard Newcombe +29 more
TL;DR: Replica, a dataset of 18 highly photo-realistic 3D indoor scene reconstructions at room and building scale, is introduced to enable machine learning (ML) research that relies on visually, geometrically, and semantically realistic generative models of the world.
Journal ArticleDOI
Simultaneous extraction of roads and buildings in remote sensing imagery with convolutional neural networks
TL;DR: This work proposes a single patch-based Convolutional Neural Network architecture for extraction of roads and buildings from high-resolution remote sensing data and demonstrates the validity and superior performance of the proposed network architecture for extracting Roads and buildings in urban areas.
Proceedings ArticleDOI
Segmentation using superpixels: A bipartite graph partitioning approach
TL;DR: A novel segmentation framework based on bipartite graph partitioning is proposed, which is able to aggregate multi-layer superpixels in a principled and very effective manner and leads to a highly efficient, linear-time spectral algorithm.
Proceedings ArticleDOI
Maximally Stable Colour Regions for Recognition and Matching
TL;DR: A novel colour-based affine co-variant region detector based on a Poisson image noise model that performs better than the commonly used Euclidean distance and extends the state of the art in feature repeatability tests.
Journal ArticleDOI
Spatial aggregation of holistically-nested convolutional neural networks for automated pancreas localization and segmentation.
TL;DR: This work localizes the pancreas from the entire 3D CT scan, providing a reliable bounding box for the more refined segmentation step, and introduces a fully deep‐learning approach, based on an efficient application of holistically‐nested convolutional networks (HNNs) on the three orthogonal axial, sagittal, and coronal views.
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.