Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Zlateski, Aleksandar, Seung, H. Sebastian
Institutions: Massachusetts Institute of Technology, Princeton University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1507090658
