kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Leveraging Point Annotations in Segmentation Learning with Boundary Loss
KTH, School of Engineering Sciences in Chemistry, Biotechnology and Health (CBH), Biomedical Engineering and Health Systems, Medical Imaging. Uppsala Univ, Dept Informat Technol, Uppsala, Sweden.ORCID iD: 0000-0003-3147-5626
Erasmus MC, Dept Radiol & Nucl Med, Rotterdam, Netherlands.
Uppsala Univ, Dept Informat Technol, Uppsala, Sweden.
Antaros Med, Mölndal, Sweden; Uppsala Univ, Dept Surg Sci, Uppsala, Sweden.
Show others and affiliations
2025 (English)In: Pattern Recognition, ICPR 2024, PT XIII / [ed] Antonacopoulos, A Chaudhuri, S Chellappa, R Liu, CL Bhattacharya, S Pal, U, Springer Nature , 2025, Vol. 15313, p. 194-210Conference paper, Published paper (Refereed)
Abstract [en]

This paper investigates the combination of intensity-based distance maps with boundary loss for point-supervised semantic segmentation. By design, the boundary loss imposes a stronger penalty on the errors the farther away from the object boundary they occur. Hence it is inappropriate for cases of weak supervision where the ground truth label is much smaller than the actual object and a certain amount of false positives (w.r.t. the weak ground truth) is actually desirable. Using intensity-aware distances instead may alleviate this drawback, allowing for a certain amount of false positives with similar intensities without a significant increase to the training loss. This formulation is potentially more attractive than existing CRF-based regularizers, due to its simplicity and computational efficiency. We perform experiments on two multi-class datasets; ACDC (heart segmentation) and POEM (whole-body abdominal organ segmentation). Results are encouraging and show that this supervision strategy has great potential. On ACDC it outperforms the CRF-loss based approach, and on POEM data it performs on par with it. The code is made openly available.

Place, publisher, year, edition, pages
Springer Nature , 2025. Vol. 15313, p. 194-210
Series
Lecture Notes in Computer Science, ISSN 0302-9743
Keywords [en]
Segmentation, Point supervision, Boundary loss, Minimum barrier distance
National Category
Computer graphics and computer vision
Identifiers
URN: urn:nbn:se:kth:diva-375090DOI: 10.1007/978-3-031-78201-5_13ISI: 001565047500013Scopus ID: 2-s2.0-85211791848OAI: oai:DiVA.org:kth-375090DiVA, id: diva2:2027585
Conference
27th International Conference on Pattern Recognition-ICPR-Annual, DEC 01-05, 2024, Kolkata, INDIA
Note

Part of ISBN 978-3-031-78200-8; 978-3-031-78201-5

QC 20260113

Available from: 2026-01-13 Created: 2026-01-13 Last updated: 2026-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Breznik, Eva

Search in DiVA

By author/editor
Breznik, Eva
By organisation
Medical Imaging
Computer graphics and computer vision

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 37 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf