Metraipolis › archive › dc_796a45867a41
BiCC: Bidirectional Connected-Component Loss for Instance-Aware Segmentation — arXiv:2609.30223
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30223
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:44:41.659Z
- SHA-256 of the archived text
620fa2013cff9a71e32cd1aff92cd986d20cefad5344c0c201ff58b736f92ac9- Stable URL of this page
https://metraipolis.com/documento/dc_796a45867a41
How to cite
BiCC: Bidirectional Connected-Component Loss for Instance-Aware Segmentation — arXiv:2609.30223 — arXiv (en), https://arxiv.org/abs/2609.30223 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_796a45867a41 (Metraipolis archive dc_796a45867a41, sha256 620fa2013cff9a71e32cd1aff92cd986d20cefad5344c0c201ff58b736f92ac9)
BibTeX
@misc{dc796a45867a41,
title = {BiCC: Bidirectional Connected-Component Loss for Instance-Aware Segmentation — arXiv:2609.30223},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30223},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_796a45867a41; sha256 620fa2013cff9a71e32cd1aff92cd986d20cefad5344c0c201ff58b736f92ac9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30223. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Common segmentation losses aggregate errors voxel-wise, so lesions influence the objective in proportion to their volume, giving small but clinically critical lesions disproportionately little weight. Instance-aware losses aim to address this mismatch by assigning each lesion its own term. However, blob loss and CC-DiceCE derive their regions solely from annotations, so false-positive components receive no instance-level term. This matters in computer-assisted review, where each false-positive component may require separate inspection, making precision and false-positive burden important alongside recall. We introduce the bidirectional connected-component loss (BiCC), which pairs annotation- and prediction-derived partitions to score predicted components on their own scale. By deriving instances from the predictions, this branch directly penalizes false-positive components regardless of their size. The balance parameter $\alpha$ allows control over the lesion-wise precision-recall trade-off. Across five datasets with five-fold cross-validation using nnU-Net, BiCC outperforms CC-DiceCE in lesion-wise F1 on four datasets and blob loss on all five. It significantly improves over DiceCE on three datasets and matches it on two; CC-DiceCE instead loses up to 0.363 precision by favoring recall. Code is available at this https URL . Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-25 in cs.CV). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2609.30223 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T06:09:29.914Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).