Image Segmentation by Size-Dependent Single Linkage Clustering of a Watershed Basin Graph

05/01/2015
by   Aleksandar Zlateski, et al.
0

We present a method for hierarchical image segmentation that defines a disaffinity graph on the image, over-segments it into watershed basins, defines a new graph on the basins, and then merges basins with a modified, size-dependent version of single linkage clustering. The quasilinear runtime of the method makes it suitable for segmenting large images. We illustrate the method on the challenging problem of segmenting 3D electron microscopic brain images.

READ FULL TEXT

page 6

page 7

research
09/30/2022

Learning to detect boundary information for brain image segmentation

MRI brain images are always of low contrast, which makes it difficult to...
research
06/13/2012

An efficient hierarchical graph based image segmentation

Hierarchical image segmentation provides region-oriented scalespace, i.e...
research
08/11/2022

Joint reconstruction-segmentation on graphs

Practical image segmentation tasks concern images which must be reconstr...
research
06/11/2020

Spectral Image Segmentation with Global Appearance Modeling

We introduce a new spectral method for image segmentation that incorpora...
research
06/21/2021

Large-scale image segmentation based on distributed clustering algorithms

Many approaches to 3D image segmentation are based on hierarchical clust...
research
01/23/2022

How to scale hyperparameters for quickshift image segmentation

Quickshift is a popular algorithm for image segmentation, used as a prep...
research
05/31/2014

Combined Approach for Image Segmentation

Many image segmentation techniques have been developed over the past two...

Please sign up or login with your details

Forgot password? Click here to reset