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
Proceedings ArticleDOI

Sketch Tokens: A Learned Mid-level Representation for Contour and Object Detection

TL;DR: This work proposes a novel approach to both learning and detecting local contour-based representations for mid-level features called sketch tokens, which achieve large improvements in detection accuracy for the bottom-up tasks of pedestrian and object detection as measured on INRIA and PASCAL, respectively.
Journal ArticleDOI

Efficient Multilevel Brain Tumor Segmentation With Integrated Bayesian Model Classification

TL;DR: In this paper, a Bayesian formulation for incorporating soft model assignments into the calculation of affinities is presented. And the resulting soft model assignment is integrated into the multilevel segmentation by weighted aggregation algorithm, and applied to the task of detecting and segmenting brain tumor and edema in multichannel magnetic resonance (MR) volumes.
Journal ArticleDOI

Robust Nucleus/Cell Detection and Segmentation in Digital Pathology and Microscopy Images: A Comprehensive Review

TL;DR: A comprehensive summary of the recent state-of-the-art nucleus/cell segmentation approaches on different types of microscopy images including bright-field, phase-contrast, differential interference contrast, fluorescence, and electron microscopies is provided.
Journal ArticleDOI

Background Prior-Based Salient Object Detection via Deep Reconstruction Residual

TL;DR: A novel framework for saliency detection is proposed by first modeling the background and then separating salient objects from the background by developing stacked denoising autoencoders with deep learning architectures to model the background.
Journal ArticleDOI

Recent Advances in Deep Learning for Object Detection

TL;DR: A comprehensive survey of recent advances in visual object detection with deep learning can be found in this article, where the authors systematically analyze the existing object detection frameworks and organize the survey into three major parts: detection components, learning strategies, and applications and benchmarks.
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)