A survey of loss functions for semantic segmentation
- URL: http://arxiv.org/abs/2006.14822v4
- Date: Thu, 3 Sep 2020 01:14:34 GMT
- Title: A survey of loss functions for semantic segmentation
- Abstract summary: In this paper, we have summarized some of the well-known loss functions widely used for Image.
We have also introduced a new log-cosh dice loss function and compared its performance on the NBFS-segmentation open-source data-set.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Image Segmentation has been an active field of research as it has a wide
range of applications, ranging from automated disease detection to self-driving
cars. In the past five years, various papers came up with different objective
loss functions used in different cases such as biased data, sparse
segmentation, etc. In this paper, we have summarized some of the well-known
loss functions widely used for Image Segmentation and listed out the cases
where their usage can help in fast and better convergence of a model.
Furthermore, we have also introduced a new log-cosh dice loss function and
compared its performance on the NBFS skull-segmentation open-source data-set
with widely used loss functions. We also showcased that certain loss functions
perform well across all data-sets and can be taken as a good baseline choice in
unknown data distribution scenarios. Our code is available at Github:
https://github.com/shruti-jadon/Semantic-Segmentation-Loss-Functions.
Related papers
- Next Generation Loss Function for Image Classification [0.0]
We experimentally challenge the well-known loss functions, including cross entropy (CE) loss, by utilizing the genetic programming (GP) approach.
One function, denoted as Next Generation Loss (NGL), clearly stood out showing same or better performance for all tested datasets.
arXiv Detail & Related papers (2024-04-19T15:26:36Z) - Robust T-Loss for Medical Image Segmentation [56.524774292536264]
This paper presents a new robust loss function, the T-Loss, for medical image segmentation.
The proposed loss is based on the negative log-likelihood of the Student-t distribution and can effectively handle outliers in the data.
Our experiments show that the T-Loss outperforms traditional loss functions in terms of dice scores on two public medical datasets.
arXiv Detail & Related papers (2023-06-01T14:49:40Z) - A Comprehensive Survey of Regression Based Loss Functions for Time
Series Forecasting [0.0]
We have summarized 14 well-known regression loss functions commonly used for time series forecasting.
Our code is available at GitHub: https://github.com/aryan-jadon/Regression-Loss-Functions-in-Time-Series-Forecasting-Tensorflow.
arXiv Detail & Related papers (2022-11-05T23:06:25Z) - Deep ensembles in bioimage segmentation [74.01883650587321]
In this work, we propose an ensemble of convolutional neural networks (CNNs)
In ensemble methods, many different models are trained and then used for classification, the ensemble aggregates the outputs of the single classifiers.
The proposed ensemble is implemented by combining different backbone networks using the DeepLabV3+ and HarDNet environment.
arXiv Detail & Related papers (2021-12-24T05:54:21Z) - CvS: Classification via Segmentation For Small Datasets [52.821178654631254]
This paper presents CvS, a cost-effective classifier for small datasets that derives the classification labels from predicting the segmentation maps.
We evaluate the effectiveness of our framework on diverse problems showing that CvS is able to achieve much higher classification results compared to previous methods when given only a handful of examples.
arXiv Detail & Related papers (2021-10-29T18:41:15Z) - SemSegLoss: A python package of loss functions for semantic segmentation [0.0]
SemSegLoss is a python package consisting of some of the well-known loss functions widely used for image segmentation.
It is developed with the intent to help researchers in the development of novel loss functions.
arXiv Detail & Related papers (2021-05-18T04:27:06Z) - Deep ensembles based on Stochastic Activation Selection for Polyp
Segmentation [82.61182037130406]
This work deals with medical image segmentation and in particular with accurate polyp detection and segmentation during colonoscopy examinations.
Basic architecture in image segmentation consists of an encoder and a decoder.
We compare some variant of the DeepLab architecture obtained by varying the decoder backbone.
arXiv Detail & Related papers (2021-04-02T02:07:37Z) - Loss Function Discovery for Object Detection via Convergence-Simulation
Driven Search [101.73248560009124]
We propose an effective convergence-simulation driven evolutionary search algorithm, CSE-Autoloss, for speeding up the search progress.
We conduct extensive evaluations of loss function search on popular detectors and validate the good generalization capability of searched losses.
Our experiments show that the best-discovered loss function combinations outperform default combinations by 1.1% and 0.8% in terms of mAP for two-stage and one-stage detectors.
arXiv Detail & Related papers (2021-02-09T08:34:52Z) - Class-Agnostic Segmentation Loss and Its Application to Salient Object
Detection and Segmentation [17.532822703595766]
We present a novel loss function, called class-agnostic segmentation (CAS) loss.
We show that the CAS loss function is sparse, bounded, and robust to class-imbalance.
We investigate the performance against the state-of-the-art methods in two settings of low and high-fidelity training data.
arXiv Detail & Related papers (2020-10-28T07:11:15Z) - Auto Seg-Loss: Searching Metric Surrogates for Semantic Segmentation [56.343646789922545]
We propose to automate the design of metric-specific loss functions by searching differentiable surrogate losses for each metric.
Experiments on PASCAL VOC and Cityscapes demonstrate that the searched surrogate losses outperform the manually designed loss functions consistently.
arXiv Detail & Related papers (2020-10-15T17:59:08Z) - All your loss are belong to Bayes [28.393499629583786]
Loss functions are a cornerstone of machine learning and the starting point of most algorithms.
We introduce a trick on squared Gaussian Processes to obtain a random process whose paths are compliant source functions.
Experimental results demonstrate substantial improvements over the state of the art.
arXiv Detail & Related papers (2020-06-08T14:31:21Z)
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.