Loading [MathJax]/extensions/MathMenu.js
A Pseudo Variance Algorithm for Semi-Supervised Semantic Segmentation | IEEE Journals & Magazine | IEEE Xplore

A Pseudo Variance Algorithm for Semi-Supervised Semantic Segmentation


The pseudo variance algorithm proposed in this work combines the top-1 confidence and top-2 confidence to better evaluate the quality of predictions, and incorporates a n...

Abstract:

The key aspect of semi-supervised semantic segmentation lies in the construction of pseudo-labels. The conventional approach involves selecting the prediction with the hi...Show More

Abstract:

The key aspect of semi-supervised semantic segmentation lies in the construction of pseudo-labels. The conventional approach involves selecting the prediction with the highest confidence as the pseudo-label. However, this method can introduce an issue where the class with the highest confidence may be an incorrect prediction, especially for categories with ambiguous features, while another high-confidence prediction may be correct. To address this concern, we propose an effective method for constructing pseudo-labels that integrates two high-confidence sources of information to mitigate the impact of erroneous predictions. Specifically, we devise a pseudo-variance function that combines the two highest confidences to better evaluate the quality of prediction results. Additionally, an adaptive coefficient is set to enable the method to adapt to various datasets. The pseudo variance algorithm is integrated into the training process by incorporating a novel loss function, which maps the prediction results to pseudo-labels associated with their confidences and subsequently re-adjusts the network parameters. Experimental results on different datasets demonstrate that our method outperforms previous approaches under similar conditions, showcasing superior performance.
The pseudo variance algorithm proposed in this work combines the top-1 confidence and top-2 confidence to better evaluate the quality of predictions, and incorporates a n...
Published in: IEEE Access ( Volume: 13)
Page(s): 34149 - 34159
Date of Publication: 14 February 2025
Electronic ISSN: 2169-3536

References

References is not available for this document.