Pith. sign in

REVIEW 3 cited by

Distance Map Loss Penalty Term for Semantic Segmentation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.03679 v1 pith:4FCZV5GE submitted 2019-08-10 eess.IV cs.CVcs.LG

classification eess.IVcs.CVcs.LG
keywords segmentationlosspenaltyshapetermdistancesemanticbiomarkers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Convolutional neural networks for semantic segmentation suffer from low performance at object boundaries. In medical imaging, accurate representation of tissue surfaces and volumes is important for tracking of disease biomarkers such as tissue morphology and shape features. In this work, we propose a novel distance map derived loss penalty term for semantic segmentation. We propose to use distance maps, derived from ground truth masks, to create a penalty term, guiding the network's focus towards hard-to-segment boundary regions. We investigate the effects of this penalizing factor against cross-entropy, Dice, and focal loss, among others, evaluating performance on a 3D MRI bone segmentation task from the publicly available Osteoarthritis Initiative dataset. We observe a significant improvement in the quality of segmentation, with better shape preservation at bone boundaries and areas affected by partial volume. We ultimately aim to use our loss penalty term to improve the extraction of shape biomarkers and derive metrics to quantitatively evaluate the preservation of shape.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Critical edge sets in vertex-critical graphs

    math.CO 2025-08 unverdicted novelty 8.0 of 10

    Erdős's 1985 growth question for critical edge sets in k-vertex-critical graphs is answered affirmatively for every k > 4 via f_k(n) = Ω(n^(1/3)), and a first upper bound f_k(n) = O(n/(log n)^Ω(1)) is given for all k ≥ 4.

  2. Learning Pore-scale Multi-phase Flow from Experimental Data with Graph Neural Network

    physics.flu-dyn 2024-11 conditional novelty 6.0 of 10

    LSE-MGN, a graph neural network with long- and short-edge message passing, predicts pore-scale gas/liquid evolution from experimental micro-CT data with roughly 9 to 10 percent surface-area error over short autoregres...

  3. A Novel Shape Guided Transformer Network for Instance Segmentation in Remote Sensing Images

    cs.CV 2024-12 conditional novelty 4.0 of 10

    A shape-guided transformer with row and column global attention reaches state-of-the-art instance segmentation accuracy on three remote sensing datasets.

Pith tools