| Autor: |
Du, Zijin, Liang, Jianqing, Liang, Jiye, Yao, Kaixuan, Cao, Feilong |
| Zdroj: |
IEEE Transactions on Pattern Analysis and Machine Intelligence; December 2024, Vol. 46 Issue: 12 p7940-7955, 16p |
| Abstrakt: |
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\%$1%-10% labeled points, the proposed method has a significant improvement in segmentation performance. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
