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
Salient Object Detection via Structured Matrix Decomposition
TL;DR: A novel structured matrix decomposition model with two structural regularizations that captures the image structure and enforces patches from the same object to have similar saliency values, and a Laplacian regularization that enlarges the gaps between salient objects and the background in feature space is proposed.
Proceedings ArticleDOI
Paper Doll Parsing: Retrieving Similar Styles to Parse Clothing Items
TL;DR: This paper tackles the clothing parsing problem using a retrieval based approach that combines parsing from: pre-trained global clothing models, local clothing models learned on the fly from retrieved examples, and transferred parse masks (paper doll item transfer) from retrieved example.
Journal ArticleDOI
SalientShape: group saliency in image collections
TL;DR: This work introduces group saliency to achieve superior unsupervised salient object segmentation by extracting salient objects (in collections of pre-filtered images) that maximize between-image similarities and within-image distinctness.
Proceedings ArticleDOI
SceneNN: A Scene Meshes Dataset with aNNotations
TL;DR: This paper introduces SceneNN, an RGB-D scene dataset consisting of 100 scenes that is used as a benchmark to evaluate the state-of-the-art methods on relevant research problems such as intrinsic decomposition and shape completion.
The MediaMill TRECVID 2006 semantic video search engine
Cees G. M. Snoek,J.C. van Gemert,Theo Gevers,Bouke Huurnink,Dennis C. Koelma,M. van Liempt,O. de Rooij,K.E.A. van de Sande,Frank J. Seinstra,Arnold W. M. Smeulders,Andrew Thean,Cor J. Veenman,Marcel Worring +12 more
TL;DR: The MediaMill Challenge 2006 as discussed by the authors divided the generic video indexing problem into a visual-only, textual only, early fusion, late fusion, and combined analysis experiment and the MediaMill team participated in two tasks: concept detection and search.
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.