Region-wise Loss for Biomedical Image Segmentation

• URL: http://arxiv.org/abs/2108.01405v1
• Date: Tue, 3 Aug 2021 10:38:21 GMT
• Title: Region-wise Loss for Biomedical Image Segmentation
• Authors: Juan Miguel Valverde, Jussi Tohka
• Abstract summary: Region-wise loss is versatile and can account for class imbalance and pixel importance. We show that certain loss functions, such as Active Contour and Boundary loss, can be reformulated similarly with appropriate RW maps. We empirically show that our rectified RW maps are stable to optimize.
• Score: 0.6091702876917281
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We propose Region-wise (RW) loss for biomedical image segmentation. Region-wise loss is versatile, can simultaneously account for class imbalance and pixel importance, and it can be easily implemented as the pixel-wise multiplication between the softmax output and a RW map. We show that, under the proposed Region-wise loss framework, certain loss functions, such as Active Contour and Boundary loss, can be reformulated similarly with appropriate RW maps, thus revealing their underlying similarities and a new perspective to understand these loss functions. We investigate the observed optimization instability caused by certain RW maps, such as Boundary loss distance maps, and we introduce a mathematically-grounded principle to avoid such instability. This principle provides excellent adaptability to any dataset and practically ensures convergence without extra regularization terms or optimization tricks. Following this principle, we propose a simple version of boundary distance maps called rectified RW maps that, as we demonstrate in our experiments, achieve state-of-the-art performance with similar or better Dice coefficients and Hausdorff distances than Dice, Focal, and Boundary losses in three distinct segmentation tasks. We quantify the optimization instability provided by Boundary loss distance maps, and we empirically show that our rectified RW maps are stable to optimize. The code to run all our experiments is publicly available at: https://github.com/jmlipman/RegionWiseLoss.

Related papers

• Convolution-based Probability Gradient Loss for Semantic Segmentation [0.0]
  We introduce a novel Convolution-based Probability Gradient (CPG) loss for semantic segmentation. It employs convolution kernels similar to the Sobel operator, capable of computing the gradient of pixel intensity in an image. We conduct qualitative and quantitative analyses to evaluate the impact of the CPG loss on three well-established networks.
  arXiv  Detail & Related papers  (2024-04-10T03:20:33Z)
• Boundary Difference Over Union Loss For Medical Image Segmentation [30.75832534753879]
  We have developed a simple and effective loss called the Boundary Difference over Union Loss (Boundary DoU Loss) to guide boundary region segmentation. Our loss only relies on region calculation, making it easy to implement and training stable without needing any additional losses.
  arXiv  Detail & Related papers  (2023-08-01T01:27:34Z)
• OT-Net: A Reusable Neural Optimal Transport Solver [26.153287448650126]
  A novel reusable neural OT solver OT-Net is presented. OT-Net learns Brenier's height representation via the neural network to obtain its potential. It then gained the OT map by computing the gradient of the potential.
  arXiv  Detail & Related papers  (2023-06-14T04:11:38Z)
• Unpaired Image Super-Resolution with Optimal Transport Maps [128.1189695209663]
  Real-world image super-resolution (SR) tasks often do not have paired datasets limiting the application of supervised techniques. We propose an algorithm for unpaired SR which learns an unbiased OT map for the perceptual transport cost. Our algorithm provides nearly state-of-the-art performance on the large-scale unpaired AIM-19 dataset.
  arXiv  Detail & Related papers  (2022-02-02T16:21:20Z)
• Generative Modeling with Optimal Transport Maps [83.59805931374197]
  Optimal Transport (OT) has become a powerful tool for large-scale generative modeling tasks. We show that the OT map itself can be used as a generative model, providing comparable performance.
  arXiv  Detail & Related papers  (2021-10-06T18:17:02Z)
• Feature Space Targeted Attacks by Statistic Alignment [74.40447383387574]
  Feature space targeted attacks perturb images by modulating their intermediate feature maps. The current choice of pixel-wise Euclidean Distance to measure the discrepancy is questionable because it unreasonably imposes a spatial-consistency constraint on the source and target features. We propose two novel approaches called Pair-wise Alignment Attack and Global-wise Alignment Attack, which attempt to measure similarities between feature maps by high-order statistics.
  arXiv  Detail & Related papers  (2021-05-25T03:46:39Z)
• iGOS++: Integrated Gradient Optimized Saliency by Bilateral Perturbations [31.72311989250957]
  Saliency maps are widely-used local explanation tools. We present iGOS++, a framework to generate saliency maps optimized for altering the output of the black-box system.
  arXiv  Detail & Related papers  (2020-12-31T18:04:12Z)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• Image Fine-grained Inpainting [89.17316318927621]
  We present a one-stage model that utilizes dense combinations of dilated convolutions to obtain larger and more effective receptive fields. To better train this efficient generator, except for frequently-used VGG feature matching loss, we design a novel self-guided regression loss. We also employ a discriminator with local and global branches to ensure local-global contents consistency.
  arXiv  Detail & Related papers  (2020-02-07T03:45:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.