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

Abstract

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.

arXiv comment8 pages

References in corpus (1)

• Natural Scales in Geographical Patterns

Cited by in corpus (15)

• Large Scale Image Segmentation with Structured Loss based Deep Learning for Connectome Reconstruction
• Superhuman Accuracy on the SNEMI3D Connectomics Challenge
• The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning
• Deep Learning Convolutional Networks for Multiphoton Microscopy Vasculature Segmentation
• Flood-Filling Networks
• Recursive Training of 2D-3D Convolutional Networks for Neuronal Boundary Detection
• Anisotropic EM Segmentation by 3D Affinity Learning and Agglomeration
• Combinatorial Energy Learning for Image Segmentation
• Large-scale image segmentation based on distributed clustering algorithms
• Learning and Segmenting Dense Voxel Embeddings for 3D Neuron Reconstruction
• NucMM Dataset: 3D Neuronal Nuclei Instance Segmentation at Sub-Cubic Millimeter Scale
• Multi-stage Multi-recursive-input Fully Convolutional Networks for Neuronal Boundary Detection
• AxonEM Dataset: 3D Axon Instance Segmentation of Brain Cortical Regions
• Consistent Recurrent Neural Networks for 3D Neuron Segmentation
• Convolutional nets for reconstructing neural circuits from brain images acquired by serial section electron microscopy