Papers › DualMLP: a two-stream fusion model for 3D point cloud classification

DualMLP: a two-stream fusion model for 3D point cloud classification

10 Oct 2023The Visual Computer 2023 10archive 2025-07-28

Sneha Paul, Zachary Patterson, Nizar Bouguila

In this paper, we present DualMLP, a novel 3D model that introduces the idea of a two-stream network for existing 3D models to handle the trade-off between the number of points and the computational overhead. Existing works on point clouds use a small subset of points sampled from the entire 3D object as input. Although increasing the number of input points can enhance scene understanding, it also incurs a higher computational cost for existing networks. To tackle this challenge, we propose a novel architecture called DualMLP, which effectively mitigates the linear increase in computational expense as the number of input points grows. While we evaluate this concept on PointMLP and demonstrate its effectiveness, the idea can be applied to other existing models with minimal adjustments. DualMLP consists of two branches: DenseNet and SparseNet. The SparseNet, a relatively larger network, samples a small number of points from the complete point cloud, while the DenseNet, a lightweight network, takes in a larger number of points as input. Extensive experiments on the ScanObjectNN and ModelNet40 datasets demonstrate the effectiveness of the proposed model, achieving a 1.00% and 0.81% improvement over PointMLP for ScanObjectNN and ModelNet40 while being computationally efficient than the original PointMLP. To ensure the reproducibility of our experimental results, the code for this work is publicly available at https://github.com/snehaputul/DualMLP.

Code

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

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Results from the paper archive 2025-07-28

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

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