Pith. sign in

REVIEW 1 cited by

3D Segmentation with Exponential Logarithmic Loss for Highly Unbalanced Object Sizes

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 1809.00076 v2 pith:MLGS3WB5 submitted 2018-08-31 cs.CV

classification cs.CV
keywords segmentationlosssizeslabelsnetworksobjectonlypropose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the introduction of fully convolutional neural networks, deep learning has raised the benchmark for medical image segmentation on both speed and accuracy, and different networks have been proposed for 2D and 3D segmentation with promising results. Nevertheless, most networks only handle relatively small numbers of labels (<10), and there are very limited works on handling highly unbalanced object sizes especially in 3D segmentation. In this paper, we propose a network architecture and the corresponding loss function which improve segmentation of very small structures. By combining skip connections and deep supervision with respect to the computational feasibility of 3D segmentation, we propose a fast converging and computationally efficient network architecture for accurate segmentation. Furthermore, inspired by the concept of focal loss, we propose an exponential logarithmic loss which balances the labels not only by their relative sizes but also by their segmentation difficulties. We achieve an average Dice coefficient of 82% on brain segmentation with 20 labels, with the ratio of the smallest to largest object sizes as 0.14%. Less than 100 epochs are required to reach such accuracy, and segmenting a 128x128x128 volume only takes around 0.4 s.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A Comprehensive Review of Adversarial Attacks on Machine Learning

    cs.CR 2024-12 reject novelty 2.0 of 10

    A review with small ART-based experiments showing adversarial attacks fool an object detector and a bone-fracture classifier, and that preprocessing defenses largely fail while defensive distillation appears stronger.

Pith tools