Graph Regulation Network for Point Cloud Segmentation

In point cloud, some regions typically exist nodes from multiple categories, i.e., these regions have both homophilic and heterophilic nodes. However, most existing methods ignore the heterophily of edges during the aggregation of the neighborhood node features, which inevitably mixes unnecessary in...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - PP(2024) vom: 13. Mai
1. Verfasser: Du, Zijin (VerfasserIn)
Weitere Verfasser: Liang, Jianqing, Liang, Jiye, Yao, Kaixuan, Cao, Feilong
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2024
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM372280420
003 DE-627
005 20240514233109.0
007 cr uuu---uuuuu
008 240514s2024 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2024.3400402  |2 doi 
028 5 2 |a pubmed24n1407.xml 
035 |a (DE-627)NLM372280420 
035 |a (NLM)38739517 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Du, Zijin  |e verfasserin  |4 aut 
245 1 0 |a Graph Regulation Network for Point Cloud Segmentation 
264 1 |c 2024 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 13.05.2024 
500 |a published: Print-Electronic 
500 |a Citation Status Publisher 
520 |a In point cloud, some regions typically exist nodes from multiple categories, i.e., these regions have both homophilic and heterophilic nodes. However, most existing methods ignore the heterophily of edges during the aggregation of the neighborhood node features, which inevitably mixes unnecessary information of heterophilic nodes and leads to blurred boundaries of segmentation. To address this problem, we model the point cloud as a homophilic-heterophilic graph and propose a graph regulation network (GRN) to produce finer segmentation boundaries. The proposed method can adaptively adjust the propagation mechanism with the degree of neighborhood homophily. Moreover, we build a prototype feature extraction module, which is utilised to mine the homophily features of nodes from the global prototype space. Theoretically, we prove that our convolution operation can constrain the similarity of representations between nodes based on their degree of homophily. Extensive experiments on fully and weakly supervised point cloud semantic segmentation tasks demonstrate that our method achieves satisfactory performance. Especially in the case of weak supervision, that is, each sample has only 1%-10% labeled points, the proposed method has a significant improvement in segmentation performance 
650 4 |a Journal Article 
700 1 |a Liang, Jianqing  |e verfasserin  |4 aut 
700 1 |a Liang, Jiye  |e verfasserin  |4 aut 
700 1 |a Yao, Kaixuan  |e verfasserin  |4 aut 
700 1 |a Cao, Feilong  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g PP(2024) vom: 13. Mai  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:PP  |g year:2024  |g day:13  |g month:05 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2024.3400402  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d PP  |j 2024  |b 13  |c 05