Existing cell instance segmentation pipelines typically combine deterministic predictions with post-processing, which imposes limited explicit constraints on the global structure of instance masks. In this work, we propose a multi-task image-to-image Schrödinger Bridge framework that formulates instance segmentation as a distribution-based image-to-image generation problem. Boundary-aware supervision is integrated through a reverse distance map, and deterministic inference is employed to produce stable predictions. Experimental results on the PanNuke dataset demonstrate that the proposed method achieves competitive or superior performance without relying on SAM pre-training or additional post-processing. Additional results on the MoNuSeg dataset show robustness under limited training data. These findings indicate that Schrödinger Bridge-based image-to-image generation provides an effective framework for cell instance segmentation.
Figures & tables
Fig. 1: Conceptual illustration of distribution-based instance mask modeling. For a given input image, multiple candidate instance masks may exist, while only a subset corresponds to morphologically plausible cell instances.
Fig. 2: Overview of the proposed Multi-Task Image-to-Image SB framework.
Method
bPQ ↑
F1 ↑
Recall ↑
Precision ↑
U-Net
0.5799
0.7930
0.7989
0.7874
U-Net+R
0.5837
0.7942
0.7972
0.7908
CellViT
0.6149
0.8037
0.8328
0.7984
CellViT+proc
0.6221
0.7946
0.7847
0.8357
Ours
0.6362
0.8106
0.8011
0.8458
TABLE I: Quantitative comparison on the PanNuke dataset under the large-scale training setting.
Method
bPQ ↑
F1 ↑
Recall ↑
Precision ↑
Single-Task Mask
0.5044
0.6815
0.6790
0.7304
Single-Task RVdist
0.5903
0.7756
0.7460
0.8373
Multi-Task
0.6341
0.8100
0.8017
0.8448
TABLE II: Ablation study on the PanNuke dataset under the large-scale training setting.
Fig. 3: Qualitative cell instance segmentation results on the PanNuke dataset.
Fig. 4: Transformation process at time step.
Method
bPQ ↑
F1 ↑
Recall ↑
Precision ↑
U-Net
0.5066
0.8051
0.8426
0.7707
U-Net+R
0.5335
0.8098
0.8541
0.7698
CellViT
0.5842
0.8468
0.8891
0.8142
CellViT+proc
0.6066
0.8444
0.8506
0.8449
Ours
0.6017
0.8563
0.8689
0.8493
TABLE III: Quantitative comparison on the MoNuSeg dataset under the limited training data setting.
Fig. 5: Joint distributions of cell size and circularity for the ground truth (GT), the proposed method, and CellViT variants on the PanNuke dataset. The proposed method produces a distribution closer to the GT, suppressing morphologically atypical cell instances.
Accurate delineation of individual cells in microscopy videos is essential for studying cellular dynamics, yet separating touching or overlapping instances remains a persistent challenge. Although foundation-model for segmentation such as SAM have broadened the accessibility of image segmentation, they still struggle to separate nearby cell instances in dense microscopy scenes without extensive prompting. We propose a prompt-free, boundary-aware instance segmentation framework that predicts signed distance functions (SDFs) instead of binary masks, enabling smooth and geometry-consistent modeling of cell contours. A learned sigmoid mapping converts SDFs into probability maps, yielding sharp boundary localization and robust separation of adjacent instances. Training is guided by a unified Modified Hausdorff Distance (MHD) loss that integrates region- and boundary-based terms. Evaluations on both public and private high-throughput microscopy datasets demonstrate improved boundary accuracy and instance-level performance compared to recent SAM-based and foundation-model approaches. Source code is available at: https://github.com/ThomasMendelson/BAISeg.git
Thomas Mendelson, Joshua Francois, Galit Lahav +1
The School of Electrical and Computer Engineering, Ben-Gurion University of the Negev · Department of Systems Biology, Harvard Medical School
Identifying and representing object instances such as cells or nuclei is a common task in microscopy image analysis. Established machine learning workflows typically use supervised detection or segmentation followed by feature extraction or classification, which requires manual annotations and treats instance segmentation and cell representation as separate stages. We describe a new unsupervised method for cell instance segmentation and phenotypic classification from unlabeled microscopy images. Our method is based on reconstructing each image using a coarse-to-fine routing pyramid that associates pixels with spatially sparse latent sources. The resulting pixel-to-latent associations yield instance masks, while the source latents encode cell morphology. We demonstrate competitive performance in instance segmentation across diverse cell morphologies and imaging modalities, as well as generative modeling of cellular phenotypes under perturbations. Source code and checkpoints are available at https://github.com/weigertlab/routing-pyramids.
Ziwen Liu, Martin Weigert
Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI), Technische Universität Dresden, Germany
Cell instance segmentation models trained on cell-specific datasets suffer severe performance drops on out-of-distribution cell types, while interactive foundation models overcome this through per-instance prompting at a cost that is prohibitively expensive for histopathology images containing hundreds to thousands of densely packed instances. We introduce Group Prompting, a new paradigm that shifts interactive segmentation from per-instance O(N) to per-type O(T), where a single click per cell type suffices to segment all instances of that type. Our key observation is that the frozen image encoder of the Segment Anything Model (SAM) already clusters same-type cells in its feature space before any prompt is given, and that this clustering holds across staining modalities without any training. Exploiting this property, we propose Chain-of-Prompts (CoP), a training-free framework that recursively expands a single user click by (1) identifying reliable same-type locations through non-parametric gating of multi-scale encoder features, and (2) selecting the most spatially distant reliable point as the next prompt to maximize coverage. On eleven benchmarks, CoP generalizes to both unseen cell types and unseen imaging modalities without any adaptation: with one click per type it retains over 90% of per-instance performance on three cell-type-annotated datasets while surpassing fully-supervised methods, and with one click per image it retains over 95% on eight datasets spanning both H&E and non-H&E imaging. Project Page: https://shjo-april.github.io/Chain-of-Prompts/
Sanghyun Jo, Seo Jin Lee, Seohyung Hong +4
1OGQ, Korea · 2Seoul National University, Korea · 3LG CNS, Korea