The Candidate Multi-Cut for Cell Segmentation
원문 초록
Two successful approaches for the segmentation of biomedical images are (1) the selection of segment candidates from a merge-tree, and (2) the clustering of small superpixels by solving a Multi-Cut problem. In this paper, we introduce a model that unifies both approaches. Our model, the Candidate Multi-Cut (CMC), allows joint selection and clustering of segment candidates from a merge-tree. This way, we overcome the respective limitations of the individual methods: (1) the space of possible segmentations is not constrained to candidates of a merge-tree, and (2) the decision for clustering can be made on candidates larger than superpixels, using features over larger contexts. We solve the optimization problem of selecting and clustering of candidates using an integer linear program. On datasets of 2D light microscopy of cell populations and 3D electron microscopy of neurons, we show that our method generalizes well and generates more accurate segmentations than merge-tree or Multi-Cut methods alone.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
HERCULES: Hierarchical Embedding-based Recursive Clustering Using LLMs for Efficient Summarization
MiCo: Multiple Instance Learning with Context-Aware Clustering for Whole Slide Image Analysis
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.