Papers › ASSANet: An Anisotropic Separable Set Abstraction for Efficient Point Cloud...

ASSANet: An Anisotropic Separable Set Abstraction for Efficient Point Cloud Representation Learning

20 Oct 2021NeurIPS 2021 12arXiv:2110.10538archive 2025-07-28

Guocheng Qian, Hasan Abed Al Kader Hammoud, Guohao Li, Ali Thabet, Bernard Ghanem

Access to 3D point cloud representations has been widely facilitated by LiDAR sensors embedded in various mobile devices. This has led to an emerging need for fast and accurate point cloud processing techniques. In this paper, we revisit and dive deeper into PointNet++, one of the most influential yet under-explored networks, and develop faster and more accurate variants of the model. We first present a novel Separable Set Abstraction (SA) module that disentangles the vanilla SA module used in PointNet++ into two separate learning stages: (1) learning channel correlation and (2) learning spatial correlation. The Separable SA module is significantly faster than the vanilla version, yet it achieves comparable performance. We then introduce a new Anisotropic Reduction function into our Separable SA module and propose an Anisotropic Separable SA (ASSA) module that substantially increases the network's accuracy. We later replace the vanilla SA modules in PointNet++ with the proposed ASSA module, and denote the modified network as ASSANet. Extensive experiments on point cloud classification, semantic segmentation, and part segmentation show that ASSANet outperforms PointNet++ and other methods, achieving much higher accuracy and faster speeds. In particular, ASSANet outperforms PointNet++ by $7.4$ mIoU on S3DIS Area 5, while maintaining 1.6 × faster inference speed on a single NVIDIA 2080Ti GPU. Our scaled ASSANet variant achieves $66.8$ mIoU and outperforms KPConv, while being more than 54 × faster.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2110.10538")

Code

Syntology Ran 2 of 12 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

guochengqian/assanet officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 2 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
10unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from guochengqian/assanet. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Registry guochengqian/assanet/models/encoder/assanet_encoder.py official repository ran · metamorphic tier: deterministic MIT (permissive) · e91868506eb61fe9 · report
activation_str2dict_mapping guochengqian/assanet/models/encoder/assanet_encoder.py official repository ran · our draft was wrong MIT (permissive) · 1e49f35d5e2aef71 · report
ASSANetEncoder guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · ac7a3988e833c2c5 · report
ConvPool guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · 47fbaa4efa6f701b · report
LocalAggregation guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · ca7e43ff863d820c · report
PointnetSAModuleMSG guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · dff8b526ff3def5f · report
PreConv guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · 4b5f8b6a19d8f02b · report
_PointnetSAModuleBase guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · 898690285ec2068d · report
build_activation_layer guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · 0f7fe30e6ef07130 · report
build_conv guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · aa2b4144b6138f9f · report
build_from_cfg guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · 17095c6950af969e · report
build_grouper guochengqian/assanet/models/encoder/assanet_encoder.py official repository unverified MIT (permissive) · bccf5fbdfee61fcf · report

Tasks

3D Part Segmentation3D Point Cloud ClassificationPoint Cloud ClassificationRepresentation LearningSemantic Segmentation

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
3D Part Segmentation ShapeNet-Part ASSANet Instance Average IoU 86.1 #36 of 67 Archive leaderboard report
3D Point Cloud Classification ModelNet40 ASSANet Overall Accuracy 92.9 #81 of 111 Archive leaderboard report
Semantic Segmentation S3DIS Area5 ASSANet Number of params N/A #43 of 61 Archive leaderboard report
Semantic Segmentation S3DIS Area5 ASSANet mIoU 66.8 #43 of 61 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections