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

Wenxin Shao

dblp:298/5246 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
Autonomous driving · 39% Motion planning and robot control · 22% Generative modeling · 22%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative model
0.812024
Solving Motion Planning Tasks with a Scalable Generative Model · ECCV (42) 2024
Robotics › Motion planning and robot control
motion planning
0.812024
Solving Motion Planning Tasks with a Scalable Generative Model · ECCV (42) 2024
Robotics › Autonomous driving
planning for self-driving vehicles
0.812024
Solving Motion Planning Tasks with a Scalable Generative Model · ECCV (42) 2024
Computer vision › 3D vision
3d object detection
0.612022
AFDetV2: Rethinking the Necessity of the Second Stage for Object Detection from Point Clouds · AAAI 2022
Robotics › Autonomous driving
perception
0.612022
AFDetV2: Rethinking the Necessity of the Second Stage for Object Detection from Point Clouds · AAAI 2022

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

scalable generative model · 0.8self-calibrated convolution · 0.6keypoint auxiliary supervision · 0.6iou prediction · 0.6
YearPublicationVenuePosition
2024 Solving Motion Planning Tasks with a Scalable Generative Model
Yihan Hu 0001, Siqi Chai, Zhening Yang, Jingyu Qian, Wenxin Shao, Haichao Zhang 0001, Wei Xu 0017
ECCV (42)6
2022 AFDetV2: Rethinking the Necessity of the Second Stage for Object Detection from Point Clouds
abstract
There have been two streams in the 3D detection from point clouds: single-stage methods and two-stage methods. While the former is more computationally efficient, the latter usually provides better detection accuracy. By carefully examining the two-stage approaches, we have found that if appropriately designed, the first stage can produce accurate box regression. In this scenario, the second stage mainly rescores the boxes such that the boxes with better localization get selected. From this observation, we have devised a single-stage anchor-free network that can fulfill these requirements. This network, named AFDetV2, extends the previous work by incorporating a self-calibrated convolution block in the backbone, a keypoint auxiliary supervision, and an IoU prediction branch in the multi-task head. We take a simple product of the predicted IoU score with the classification heatmap to form the final classification confidence. The enhanced backbone strengthens the box localization capability, and the rescoring approach effectively joins the object presence confidence and the box regression accuracy. As a result, the detection accuracy is drastically boosted in the single-stage. To evaluate our approach, we have conducted extensive experiments on the Waymo Open Dataset and the nuScenes Dataset. We have observed that our AFDetV2 achieves the state-of-the-art results on these two datasets, superior to all the prior arts, including both the single-stage and the two-stage 3D detectors. AFDetV2 won the 1st place in the Real-Time 3D Detection of the Waymo Open Dataset Challenge 2021. In addition, a variant of our model AFDetV2-Base was entitled the "Most Efficient Model" by the Challenge Sponsor, showing a superior computational efficiency. To demonstrate the generality of this single-stage method, we have also applied it to the first stage of the two-stage networks. Without exception, the results show that with the strengthened backbone and the rescoring approach, the second stage refinement is no longer needed.
Yihan Hu 0001, Zhuangzhuang Ding, Runzhou Ge, Wenxin Shao
AAAI4