Image Segmentation by Size-Dependent Single Linkage Clustering of a Watershed Basin Graph
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringImage SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Linkage between piecewise constant Mumford-Shah model and ROF model and its virtue in image segmentation
The piecewise constant Mumford-Shah (PCMS) model and the Rudin-Osher-Fatemi (ROF) model are two important variational models in image segmentation and image restoration, respectively. In this paper, we explore a linkage …
Image RestorationImage SegmentationmodelSegmentation+2Drivers, Receivers, and Dynamic Linkages: The Directed Structure of SDG Interdependence, 2000--2024
Governments with limited fiscal and administrative capacity need to know which Sustainable Development Goals (SDGs) propagate progress through the goal system and how quickly. We map the directed interdependence structur…
Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm
The time needed to apply a hierarchical clustering algorithm is most often dominated by the number of computations of a pairwise dissimilarity measure. Such a constraint, for larger data sets, puts at a disadvantage the …
ClusteringRevisiting the probabilistic method of record linkage
In theory, the probabilistic linkage method provides two distinct advantages over non-probabilistic methods, including minimal rates of linkage error and accurate measures of these rates for data users. However, implemen…
BlockingSolving Multi-Structured Problems by Introducing Linkage Kernels into GOMEA
Model-Based Evolutionary Algorithms (MBEAs) can be highly scalable by virtue of linkage (or variable interaction) learning. This requires, however, that the linkage model can capture the exploitable structure of a proble…
Evolutionary Algorithms