2021
DOI: 10.1016/j.neucom.2020.10.086
|View full text |Cite
|
Sign up to set email alerts
|

PointVGG: Graph convolutional network with progressive aggregating features on point clouds

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…Experimental results show that PointNGCNN achieves good performance in the 3D recognition and segmentation tasks. Li et al [82] proposed point convolution (P conv ) and point pooling (P pool ) for 3D points based on the graph structure and designed a novel point cloud feature learning network, PointVGG. Among them, P conv learns the geometric information between the center point and its neighboring points.…”
Section: Gcn-based Methodsmentioning
confidence: 99%
“…Experimental results show that PointNGCNN achieves good performance in the 3D recognition and segmentation tasks. Li et al [82] proposed point convolution (P conv ) and point pooling (P pool ) for 3D points based on the graph structure and designed a novel point cloud feature learning network, PointVGG. Among them, P conv learns the geometric information between the center point and its neighboring points.…”
Section: Gcn-based Methodsmentioning
confidence: 99%
“…To ensure representativeness in the analysis, it is assumed that the number of channels in the input and output feature maps remains consistent. In traditional convolution operations, as illustrated in Figure 4a, assume that the dimensions of the input feature map are height h, width w, and number of channels c. FLOPs can be calculated using the following formula to quantify the computational complexity of the convolution operation [23]. This approach provides a basis for further analysis and optimization of the convolutional neural network structure, thereby reducing the consumption of computational resources while ensuring network performance.…”
Section: Pconvmentioning
confidence: 99%
“…Aggregating the neighborhood features of points onto a point inspired us to construct local neighborhood graphs and gather the graph features to the central point. To further capture additional local geometric information, PointVGG [21] defines operations of convolution and pooling, i.e., Pconv and Ppool, respectively. The Pconv could pay attention to the relations between neighbors, and the Ppool makes the network abstract the underlying shape information.…”
Section: Direct Representation Of Original Point Cloudsmentioning
confidence: 99%