Not All Pixels are Equal: Learning Pixel Hardness for Semantic Segmentation.
Saved in:
| Title: | Not All Pixels are Equal: Learning Pixel Hardness for Semantic Segmentation. |
|---|---|
| Authors: | Xiao, Xin1 (AUTHOR) xinxiao@whu.edu.cn, Zhou, Daiguo2 (AUTHOR) zhoudaiguo@xiaomi.com, Hu, Jiagao2 (AUTHOR) hujiagao@xiaomi.com, Hu, Yi3 (AUTHOR) huyi@whmit.cn, Xu, Yongchao1 (AUTHOR) yongchao.xu@whu.edu.cn |
| Source: | International Journal of Computer Vision. Jul2025, Vol. 133 Issue 7, p4669-4689. 21p. |
| Subjects: | Direct costing, Source code, Values (Ethics), Hardness, Whistles |
| Abstract: | Semantic segmentation has witnessed great progress. Despite the impressive overall results, the segmentation performance in some hard areas (e.g., small objects or thin parts) is still not promising. A straightforward solution is hard sample mining. Yet, most existing hard pixel mining strategies for semantic segmentation often rely on pixel's loss value, which tends to decrease during training. Intuitively, the pixel hardness for segmentation mainly depends on image structure and is expected to be stable. In this paper, we propose to learn pixel hardness for semantic segmentation by leveraging hardness information contained in global and historical loss values. More precisely, we add a gradient-independent branch for learning a hardness level (HL) map by maximizing hardness-weighted segmentation loss, which is minimized for the segmentation head. This encourages large hardness values in difficult areas, leading to appropriate and stable HL map. Despite its simplicity, the proposed method can be applied to most segmentation methods with no and marginal extra cost during inference and training, respectively. Without bells and whistles, the proposed method achieves consistent improvement (1.37% mIoU on average) over most popular semantic segmentation methods on the Cityscapes dataset, and demonstrates good generalization ability across domains. The source codes are available at this link. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Computer Vision is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Semantic segmentation has witnessed great progress. Despite the impressive overall results, the segmentation performance in some hard areas (e.g., small objects or thin parts) is still not promising. A straightforward solution is hard sample mining. Yet, most existing hard pixel mining strategies for semantic segmentation often rely on pixel's loss value, which tends to decrease during training. Intuitively, the pixel hardness for segmentation mainly depends on image structure and is expected to be stable. In this paper, we propose to learn pixel hardness for semantic segmentation by leveraging hardness information contained in global and historical loss values. More precisely, we add a gradient-independent branch for learning a hardness level (HL) map by maximizing hardness-weighted segmentation loss, which is minimized for the segmentation head. This encourages large hardness values in difficult areas, leading to appropriate and stable HL map. Despite its simplicity, the proposed method can be applied to most segmentation methods with no and marginal extra cost during inference and training, respectively. Without bells and whistles, the proposed method achieves consistent improvement (1.37% mIoU on average) over most popular semantic segmentation methods on the Cityscapes dataset, and demonstrates good generalization ability across domains. The source codes are available at this link. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09205691 |
| DOI: | 10.1007/s11263-025-02416-4 |
