TY - JOUR
T1 - Eigenloss: Combined PCA-Based Loss Function for Polyp Segmentation
T2 - Combined PCA-based loss function for polyp segmentation
AU - Sánchez-Peralta, Luisa F.
AU - Picón, Artzai
AU - Antequera-Barroso, Juan Antonio
AU - Ortega-Morán, Juan Francisco
AU - Sánchez-Margallo, Francisco M.
AU - Pagador, J. Blas
N1 - Publisher Copyright:
© 2020 by the authors.
PY - 2020/8
Y1 - 2020/8
N2 - Colorectal cancer is one of the leading cancer death causes worldwide, but its early diagnosis highly improves the survival rates. The success of deep learning has also benefited this clinical field. When training a deep learning model, it is optimized based on the selected loss function. In this work, we consider two networks (U-Net and LinkNet) and two backbones (VGG-16 and Densnet121). We analyzed the influence of seven loss functions and used a principal component analysis (PCA) to determine whether the PCA-based decomposition allows for the defining of the coefficients of a non-redundant primal loss function that can outperform the individual loss functions and different linear combinations. The eigenloss is defined as a linear combination of the individual losses using the elements of the eigenvector as coefficients. Empirical results show that the proposed eigenloss improves the general performance of individual loss functions and outperforms other linear combinations when Linknet is used, showing potential for its application in polyp segmentation problems.
AB - Colorectal cancer is one of the leading cancer death causes worldwide, but its early diagnosis highly improves the survival rates. The success of deep learning has also benefited this clinical field. When training a deep learning model, it is optimized based on the selected loss function. In this work, we consider two networks (U-Net and LinkNet) and two backbones (VGG-16 and Densnet121). We analyzed the influence of seven loss functions and used a principal component analysis (PCA) to determine whether the PCA-based decomposition allows for the defining of the coefficients of a non-redundant primal loss function that can outperform the individual loss functions and different linear combinations. The eigenloss is defined as a linear combination of the individual losses using the elements of the eigenvector as coefficients. Empirical results show that the proposed eigenloss improves the general performance of individual loss functions and outperforms other linear combinations when Linknet is used, showing potential for its application in polyp segmentation problems.
KW - Deep learning
KW - Loss functions
KW - Principal component analysis
KW - Polyp segmentation
KW - Deep learning
KW - Loss functions
KW - Principal component analysis
KW - Polyp segmentation
UR - http://www.scopus.com/inward/record.url?scp=85089736346&partnerID=8YFLogxK
U2 - 10.3390/math8081316
DO - 10.3390/math8081316
M3 - Article
SN - 2227-7390
VL - 8
SP - 1316
JO - Mathematics
JF - Mathematics
IS - 8
M1 - 1316
ER -