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
Learning to Cartoonize Using White-Box Cartoon Representations
Xinrui Wang,Jinze Yu +1 more
TL;DR: This paper proposes to separately identify three white-box representations from images: the surface representation that contains smooth surface of cartoon images, the structure representation that refers to the sparse color-blocks and flatten global content in the celluloid style workflow, and the texture representation that reflects high-frequency texture, contours and details in cartoon images.
Proceedings ArticleDOI
Modeling how people extract color themes from images
Sharon Lin,Pat Hanrahan +1 more
TL;DR: This work presents a method for extracting color themes from images using a regression model trained on themes created by people, and finds that themes extracted by Turk participants were similar to ones extracted by artists.
Journal ArticleDOI
CNN for saliency detection with low-level feature integration
TL;DR: A novel deep neural network framework embedded with low-level features (LCNN) for salient object detection in complex images proposed for complex images by utilising the advantage of convolutional neural networks to automatically learn the high- level features that capture the structured information and semantic context in the image.
Patent
Generating three-dimensional models from images
TL;DR: In this article, multi-view semantic segmentation is provided to recognize and segment images at the pixel level into semantically meaningful areas, and which can provide labels with a specific object class.
Journal ArticleDOI
Random Field Model for Integration of Local Information and Global Information
T. Toyoda,Osamu Hasegawa +1 more
TL;DR: This paper presents a proposal of a general framework that explicitly models local information and global information in a conditional random field and demonstrates good performance in image labeling of two datasets.
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.