mlsanityData to 14 Oct 2026

Single-shot Star-convex Polygon-based Instance Segmentation for Spatially-correlated Biomedical Objects

arXiv 2504.12078 ↗First posted 16 Apr 2025cs.CV q-bio.QMcited by 2

Not on the map. Why?

Abstract (arXiv)

Biomedical images often contain objects known to be spatially correlated or nested due to their inherent properties, leading to semantic relations. Examples include cell nuclei being nested within eukaryotic cells and colonies growing exclusively within their culture dishes. While these semantic relations bear key importance, detection tasks are often formulated independently, requiring multi-shot analysis pipelines. Importantly, spatial correlation could constitute a fundamental prior facilitating learning of more meaningful representations for tasks like instance segmentation. This knowledge has, thus far, not been utilised by the biomedical computer vision community. We argue that the instance segmentation of two or more categories of objects can be achieved in parallel. We achieve this via two architectures HydraStarDist (HSD) and the novel (HSD-WBR) based on the widely-used StarDist (SD), to take advantage of the star-convexity of our target objects. HSD and HSD-WBR are constructed to be capable of incorporating their interactions as constraints into account. HSD implicitly incorporates spatial correlation priors based on object interaction through a joint encoder. HSD-WBR further enforces the prior in a regularisation layer with the penalty we proposed named Within Boundary Regularisation Penalty (WBR). Both architectures achieve nested instance segmentation in a single shot. We demonstrate their competitiveness based on IoUR and AP and superiority in a new, task-relevant criteria, Joint TP rate (JTPR) compared to their baseline SD and Cellpose. Our approach can be further modified to capture partial-inclusion/-exclusion in multi-object interactions in fluorescent or brightfield microscopy or digital imaging. Finally, our strategy suggests gains by making this learning single-shot and computationally efficient.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 41 references that are in the map. First posted on arXiv 16 Apr 2025.

Builds on

11 of 41 references.

References · 11

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
  3. 2020The Computational Limits of Deep Learningcited by 193
  4. 2018Cell Detection with Star-convex Polygonscited by 183
  5. 2018Understanding Humans in Crowded Scenes: Deep Nested Adversarial Learning and A New Benchmark for Multi-Human Parsingcited by 60
  6. 2015Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Surveycited by 45
  7. 2024Lightweight Deep Learning for Resource-Constrained Environments: A Surveycited by 38
  8. 2021Robust and Decomposable Average Precision for Image Retrievalcited by 19
  9. 2015Optimizing Star-Convex Functionscited by 9
  10. 2019A Delay Metric for Video Object Detection: What Average Precision Fails to Tellcited by 9
  11. 2023SortedAP: Rethinking evaluation metrics for instance segmentationcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.