Pith. sign in

REVIEW 1 cited by

A Closer Look at Local Aggregation Operators in Point Cloud Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.01294 v1 pith:MZJNAYT5 submitted 2020-07-02 cs.CV cs.LG

classification cs.CVcs.LG
keywords operatorsnetworkaggregationlocalperformancearchitecturecloudpoint
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advances of network architecture for point cloud processing are mainly driven by new designs of local aggregation operators. However, the impact of these operators to network performance is not carefully investigated due to different overall network architecture and implementation details in each solution. Meanwhile, most of operators are only applied in shallow architectures. In this paper, we revisit the representative local aggregation operators and study their performance using the same deep residual architecture. Our investigation reveals that despite the different designs of these operators, all of these operators make surprisingly similar contributions to the network performance under the same network input and feature numbers and result in the state-of-the-art accuracy on standard benchmarks. This finding stimulate us to rethink the necessity of sophisticated design of local aggregation operator for point cloud processing. To this end, we propose a simple local aggregation operator without learnable weights, named Position Pooling (PosPool), which performs similarly or slightly better than existing sophisticated operators. In particular, a simple deep residual network with PosPool layers achieves outstanding performance on all benchmarks, which outperforms the previous state-of-the methods on the challenging PartNet datasets by a large margin (7.4 mIoU). The code is publicly available at https://github.com/zeliu98/CloserLook3D

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 20 citations worldwide. Full citation record

  1. Resolving Primitive-Sharing Ambiguity in Long-Tailed TLS-Based Industrial MEP Point Cloud Segmentation via Spatial Context Constraints

    cs.CV 2026-01 conditional novelty 4.0 of 10

    Adding an entropy-based boundary weighting term and a density normalization term to Class-Balanced loss improves rare MEP component segmentation on Industrial3D (55.74% mIoU, reducer 0 to 21.12% IoU) versus CB+Focal b...

Pith tools