TY - GEN
T1 - CONFIDENT SEMANTIC RANKING LOSS FOR PART PARSING
AU - Tan, Xin
AU - Xu, Jiachen
AU - Ye, Zhou
AU - Hao, Jinkun
AU - Ma, Lizhuang
N1 - Publisher Copyright:
© 2021 IEEE Computer Society. All rights reserved.
PY - 2021
Y1 - 2021
N2 - Part parsing is taken as a dense prediction task, assigning each pixel a semantic part label. Some previous methods tried to model the human-known relationships among different parts (inter-part). However, these methods are hard to be used for multi-object part parsing since the given relationships are highly dependent on human priors which require the special model to learn. In addition, pixels in the same part (intra-part) are always assumed equally important. In fact, even they belong to the same part, some pixels are quite uncertain for their predictions while some are with high confidence, but theoretically they are representing the same feature. In this paper, we study the inequality and uncertainty of intra-part and inter-part pixels and propose the confident-semantic-ranking (CO-Rank) loss function, which maximizes the similarities of different groups of pixels to alleviate the uncertainty and models the pixel relationships among intra-/inter-parts. In addition, previous feature maps lost some of part-level relationships due to simply using the global max/average pooling, hence, we propose a new Global Object Pooling layer (GOP) to encode the abundant global information while preserving the geometry details. The experimental results show that our proposed method achieves new state-of-the-art performance on multi-class part parsing benchmark Pascal-Part dataset.
AB - Part parsing is taken as a dense prediction task, assigning each pixel a semantic part label. Some previous methods tried to model the human-known relationships among different parts (inter-part). However, these methods are hard to be used for multi-object part parsing since the given relationships are highly dependent on human priors which require the special model to learn. In addition, pixels in the same part (intra-part) are always assumed equally important. In fact, even they belong to the same part, some pixels are quite uncertain for their predictions while some are with high confidence, but theoretically they are representing the same feature. In this paper, we study the inequality and uncertainty of intra-part and inter-part pixels and propose the confident-semantic-ranking (CO-Rank) loss function, which maximizes the similarities of different groups of pixels to alleviate the uncertainty and models the pixel relationships among intra-/inter-parts. In addition, previous feature maps lost some of part-level relationships due to simply using the global max/average pooling, hence, we propose a new Global Object Pooling layer (GOP) to encode the abundant global information while preserving the geometry details. The experimental results show that our proposed method achieves new state-of-the-art performance on multi-class part parsing benchmark Pascal-Part dataset.
KW - Part parsing
KW - global pooling
KW - loss function
KW - uncertainty
UR - https://www.scopus.com/pages/publications/85126477277
U2 - 10.1109/ICME51207.2021.9428332
DO - 10.1109/ICME51207.2021.9428332
M3 - 会议稿件
AN - SCOPUS:85126477277
T3 - Proceedings - IEEE International Conference on Multimedia and Expo
BT - 2021 IEEE International Conference on Multimedia and Expo, ICME 2021
PB - IEEE Computer Society
T2 - 2021 IEEE International Conference on Multimedia and Expo, ICME 2021
Y2 - 5 July 2021 through 9 July 2021
ER -