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.

Guoquan Xu

dblp:299/9115 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2022
0000-0001-5097-3888ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d object detection
0.612022
Not All Points Are Equal: Learning Highly Efficient Point-based Detectors for 3D LiDAR Point Clouds · CVPR 2022
Computer vision › 3D vision › 3d object detection › point cloud object detection
LiDAR-based 3D object detection
0.612022
Not All Points Are Equal: Learning Highly Efficient Point-based Detectors for 3D LiDAR Point Clouds · CVPR 2022
Computer vision › 3D vision › point cloud analysis › point cloud learning
point-based network
0.212022
Not All Points Are Equal: Learning Highly Efficient Point-based Detectors for 3D LiDAR Point Clouds · CVPR 2022

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

instance-aware downsampling · 0.6contextual centroid perception · 0.6
YearPublicationVenuePosition
2022 Not All Points Are Equal: Learning Highly Efficient Point-based Detectors for 3D LiDAR Point Clouds
abstract
We study the problem of efficient object detection of 3D LiDAR point clouds. To reduce the memory and computational cost, existing point-based pipelines usually adopt task-agnostic random sampling or farthest point sampling to progressively downsample input point clouds, despite the fact that not all points are equally important to the task of object detection. In particular, the foreground points are inherently more important than background points for object detectors. Motivated by this, we propose a highly-efficient single-stage point-based 3D detector in this paper, termed IA-SSD. The key of our approach is to exploit two learnable, task-oriented, instance-aware downsampling strategies to hierarchically select the foreground points belonging to objects of interest. Additionally, we also introduce a contextual centroid perception module to further estimate precise instance centers. Finally, we build our IA-SSD following the encoder-only architecture for efficiency. Extensive experiments conducted on several large-scale detection benchmarks demonstrate the competitive performance of our IA-SSD. Thanks to the low memory footprint and a high degree of parallelism, it achieves a superior speed of 80+ frames-per-second on the KITTI dataset with a single RTX2080Ti GPU. The code is available at https://github.com/yifanzhang713/IA-SSD.
Yifan Zhang 0030, Qingyong Hu, Guoquan Xu, Yanxin Ma, Jianwei Wan, Yulan Guo
CVPR3
2022 Adaptive Channel Encoding Transformer for Point Cloud Analysis
Guoquan Xu, Hezhi Cao, Yifan Zhang 0030, Yanxin Ma, Jianwei Wan, Ke Xu 0013
ICANN (3)1
2022 Point cloud completion by dynamic transformer with adaptive neighbourhood feature fusion
abstract
Abstract Point cloud completion aims to reconstruct detailed structures from partial observations. However, previous methods often suffered from inaccurate neighbourhood feature extraction and rough reconstruction of complex structures, which is difficult to complete detailed semantic shapes. To solve this problem, we present a method that applies dynamic transformers with adaptive neighbourhood feature fusion operations to resume complete point clouds. Firstly, we propose an adaptive neighbourhood feature extraction module, which contains a learnable global neighbourhood selection strategy and a traditional local k‐nearest neighbour strategy to dynamically select neighbourhood points according to the shape of different objects. Secondly, we observed that traditional point generation methods based on folding‐series operations limit their capacity of generating complex and faithful shapes. Inspired by cell division, we regard the process of reconstructing as point splitting and propose a genetic hierarchical point generation module, which means current points can inherit shape features from previous points and generate more detailed structures of their own. Extensive experiments of point cloud completion are carried out on PCN and Completion3D datasets to verify the effectiveness of our method. The average category chamfer distances of our method are 7.17(×10 −3 ) in PCN and 7.96(×10 −4 ) in Completion3D, which has better completion performance than other methods.
Xinpu Liu, Guoquan Xu, Ke Xu 0013, Jianwei Wan, Yanxin Ma
IET Comput. Vis.2