scispace - formally typeset
Open AccessJournal ArticleDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Convolutional Oriented Boundaries: From Image Segmentation to High-Level Tasks

TL;DR: Convolutional Oriented Boundaries (COB) as mentioned in this paper produces multiscale oriented contours and region hierarchies starting from generic image classification Convolutional Neural Networks (CNNs).
Journal ArticleDOI

Optimal Multiple Surface Segmentation With Shape and Context Priors

TL;DR: A novel approach to multi-object segmentation that incorporates both shape and context prior knowledge in a 3-D graph-theoretic framework to help overcome the stated challenges is reported.
Book ChapterDOI

Natural image segmentation with adaptive texture and boundary encoding

TL;DR: A novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL), based on observations that a homogeneously textured region of a natural image can be well modeled by a Gaussian distribution and the region boundary can be effectively coded by an adaptive chain code.
Proceedings ArticleDOI

Segment-tree based cost aggregation for stereo matching with enhanced segmentation advantage

TL;DR: Performance evaluation on 19 Middlebury data sets shows that the proposed method is comparable to previous state-of-the-art aggregation methods in disparity accuracy and processing speed.
Journal ArticleDOI

Image Segmentation Using Higher-Order Correlation Clustering.

TL;DR: The proposed higher-order correlation clustering (HO-CC) framework is formulated in a supervised manner for many high-level computer vision tasks to consider short- and long-range dependency among various regions of an image and also to incorporate wider selection of features.
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

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.
Related Papers (5)