Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yanmei Zou

dblp:287/4601 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0002-9102-8724ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
3D vision · 82% Deep learning architectures and training · 18%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
point cloud processing
1.822026
Efficient Point Cloud Processing With High-Dimensional Positional Encoding and Non-Local MLPs · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Improved MLP Point Cloud Processing with High-Dimensional Positional Encoding · AAAI 2024
Computer vision › 3D vision › point cloud analysis › point cloud learning
point cloud feature learning
1.012026
Efficient Point Cloud Processing With High-Dimensional Positional Encoding and Non-Local MLPs · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Computer vision › 3D vision › point cloud segmentation
point cloud semantic segmentation
1.012026
Efficient Point Cloud Processing With High-Dimensional Positional Encoding and Non-Local MLPs · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Computer vision › 3D vision › point cloud analysis
point cloud classification and segmentation
0.812024
Improved MLP Point Cloud Processing with High-Dimensional Positional Encoding · AAAI 2024
Machine learning › Deep learning architectures and training
positional encoding
0.812024
Improved MLP Point Cloud Processing with High-Dimensional Positional Encoding · AAAI 2024
Machine learning › Deep learning architectures and training › feedforward neural network
MLP-based architecture
0.212024
Improved MLP Point Cloud Processing with High-Dimensional Positional Encoding · AAAI 2024

Methods — techniques the papers use, named apart from their topics

positional encoding · 1.8multi-layer perceptron · 1.0abstraction and refinement · 0.8
YearPublicationVenuePosition
2026 Efficient Point Cloud Processing With High-Dimensional Positional Encoding and Non-Local MLPs
abstract
Multi-Layer Perceptron (MLP) models are the foundation of contemporary point cloud processing. However, their complex network architectures obscure the source of their strength and limit the application of these models. In this article, we develop a two-stage abstraction and refinement (ABS-REF) view for modular feature extraction in point cloud processing. This view elucidates that whereas the early models focused on ABS stages, the more recent techniques devise sophisticated REF stages to attain performance advantages. Then, we propose a High-dimensional Positional Encoding (HPE) module to explicitly utilize intrinsic positional information, extending the "positional encoding" concept from Transformer literature. HPE can be readily deployed in MLP-based architectures and is compatible with transformer-based methods. Within our ABS-REF view, we rethink local aggregation in MLP-based methods and propose replacing time-consuming local MLP operations, which are used to capture local relationships among neighbors. Instead, we use non-local MLPs for efficient non-local information updates, combined with the proposed HPE for effective local information representation. We leverage our modules to develop HPENets, a suite of MLP networks that follow the ABS-REF paradigm, incorporating a scalable HPE-based REF stage. Extensive experiments on seven public datasets across four different tasks show that HPENets deliver a strong balance between efficiency and effectiveness. Notably, HPENet surpasses PointNeXt, a strong MLP-based counterpart, by 1.1% mAcc, 4.0% mIoU, 1.8% mIoU and 0.2% Cls. mIoU, with only 50.0%, 21.5%, 23.1%, 44.4% of FLOPs on ScanObjectNN, S3DIS, ScanNet, and ShapeNetPart, respectively.
Yanmei Zou, Hongshan Yu, Yaonan Wang 0001, Zhengeng Yang, Xieyuanli Chen, Kailun Yang 0001, Naveed Akhtar
IEEE Trans. Pattern Anal. Mach. Intell.1
2024 Improved MLP Point Cloud Processing with High-Dimensional Positional Encoding
abstract
Multi-Layer Perceptron (MLP) models are the bedrock of contemporary point cloud processing. However, their complex network architectures obscure the source of their strength. We first develop an “abstraction and refinement” (ABS-REF) view for the neural modeling of point clouds. This view elucidates that whereas the early models focused on the ABS stage, the more recent techniques devise sophisticated REF stages to attain performance advantage in point cloud processing. We then borrow the concept of “positional encoding” from transformer literature, and propose a High-dimensional Positional Encoding (HPE) module, which can be readily deployed to MLP based architectures. We leverage our module to develop a suite of HPENet, which are MLP networks that follow ABS-REF paradigm, albeit with a sophisticated HPE based REF stage. The developed technique is extensively evaluated for 3D object classification, object part segmentation, semantic segmentation and object detection. We establish new state-of-the-art results of 87.6 mAcc on ScanObjectNN for object classification, and 85.5 class mIoU on ShapeNetPart for object part segmentation, and 72.7 and 78.7 mIoU on Area-5 and 6-fold experiments with S3DIS for semantic segmentation. The source code for this work is available at https://github.com/zouyanmei/HPENet.
Yanmei Zou, Hongshan Yu, Zhengeng Yang, Zechuan Li, Naveed Akhtar
AAAI1