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

Pengdi Huang

dblp:170/9557 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0002-9926-4393ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 10 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 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.

Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
Speech recognition and synthesis · 44% Image recognition and object detection · 44% Deep learning architectures and training · 13%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › surface reconstruction
mesh reconstruction
0.812024
WindPoly: Polygonal Mesh Reconstruction via Winding Numbers · ECCV (47) 2024
Geometric modeling and processing › surface reconstruction › mesh reconstruction
polygonal mesh reconstruction
0.812024
WindPoly: Polygonal Mesh Reconstruction via Winding Numbers · ECCV (47) 2024
Computer vision › Image recognition and object detection › visual attention modeling
attention-based feature enhancement
0.712023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023
Natural language and speech › Speech recognition and synthesis › front-end processing
feature enhancement
0.712023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023
Geometric modeling and processing
geometric priors
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Geometric modeling and processing › computational geometry
hausdorff distance
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Geometric modeling and processing
point cloud processing
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Computational geometry › computational topology
winding number
0.212024
WindPoly: Polygonal Mesh Reconstruction via Winding Numbers · ECCV (47) 2024
Machine learning › Deep learning architectures and training
attention mechanism
0.212023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023

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

winding number computation · 1.5mesh optimization · 1.5attention mechanism · 0.7convolutional neural network · 0.5
YearPublicationVenuePosition
2024 WindPoly: Polygonal Mesh Reconstruction via Winding Numbers
Xin He 0031, Chenlei Lv, Pengdi Huang, Hui Huang 0004
ECCV (47)3
2023 On learning the right attention point for feature enhancement
Liqiang Lin, Pengdi Huang, Chi-Wing Fu, Kai Xu 0004, Hao (Richard) Zhang, Hui Huang 0004
Sci. China Inf. Sci.2
2022 Autonomous Outdoor Scanning via Online Topological and Geometric Path Optimization
abstract
Autonomous 3D acquisition of outdoor environments poses special challenges. Different from indoor scenes, where the room space is delineated by clear boundaries and separations (e.g., walls and furniture), an outdoor environment is spacious and unbounded (thinking of a campus). Therefore, unlike for indoor scenes where the scanning effort is mainly devoted to the discovery of boundary surfaces, scanning an open and unbounded area requires actively delimiting the extent of scanning region and dynamically planning a traverse path within that region. Thus, for outdoor scenes, we formulate the planning of an energy-efficient autonomous scanning through a discrete-continuous optimization of robot scanning paths. The discrete optimization computes a topological map, through solving an online traveling sales problem (Online TSP), which determines the scanning goals and paths on-the-fly. The dynamic goals are determined as a collection of visit sites with high reward of visibility-to-unknown. A visit graph is constructed via connecting the visit sites with edges weighted by traversing cost. This topological map evolves as the robot scans via deleting outdated sites that are either visited or become rewardless and inserting newly discovered ones. The continuous part optimizes the traverse paths geometrically between two neighboring visit sites via maximizing the information gain of scanning along the paths. The discrete and continuous processes alternate until the traverse cost of the current graph exceeds the remaining energy capacity of the robot. Our approach is evaluated with both synthetic and field tests, demonstrating its effectiveness and advantages over alternatives.
Pengdi Huang, Liqiang Lin, Kai Xu 0004, Hui Huang 0004
IEEE Trans. Intell. Transp. Syst.1
2021 Hausdorff point convolution with geometric priors
Liqiang Lin, Pengdi Huang, Fuyou Xue, Kai Xu 0004, Daniel Cohen-Or, Hui Huang 0004
Sci. China Inf. Sci.2
2018 Dection and Health Analysis of Individual Tree in Urban Environment with Multi-Sensor Platform
abstract
With the technology enhanced, 3D mobile light detection and ranging (LiDAR) can produce more accurate 3D information for the objects. Meanwhile, hyperspectral remote sensing has more number of wavelengths and provides a higher resolution spectrum of objects. This paper proposes a multi-sensor platform to provide these two data for health detection at the individual tree level in urban environments. We firstly locate and segment the suspected tree objects by ground removal and Euclidean distance clustering. Then we take use of spectrum to remove non-tree objects, e.g., buildings, light poles. After that, we use LiDAR data to compute the geometric parameters of each tree and hyperspectral data to analyze its health situation.
Yunhe Feng, Chenglu Wen, Pengdi Huang, Cheng Wang 0003, Jonathan Li 0001
IGARSS3
2017 An efficiently volumetric fusing method for structure-frome-motion and terrestrial point cloud
abstract
Airborne acquisition and ground-view 3D point cloud provide complementary 3D information at city scale. A complete but lacks ground-view details, while the latter is incomplete for higher floors and severe occlusion. In this paper, First, a volumetric fusion method based on graph cuts were applied for fusing of airborne and terrestrial 3D LiDAR data. Second, we propose a method of constraints based on the local centroid of point cloud to eliminate the gap of fusion boundary. Finally, the experiments show that the improved fusion algorithm implement blending effectively.
Wei Li 0151, Cheng Wang 0003, Dawei Zai, Pengdi Huang, Weiquan Liu, Jonathan Li 0001
IGARSS4
2017 Automated extraction of urban roadside trees from mobile laser scanning point clouds based on a voxel growing method
abstract
This paper presents a new method for extracting urban roadside trees automatically from mobile laser scanning point clouds. This method mainly includes three steps. First, ground point clouds are removed by voxel-based upward growing method. Second, Euclidean distance segment method is used to cluster non-ground point clouds into certain individual objects. Then crown seeds of the initial layer is found by comparing the number of points in each layer after using the voxel modeling algorithm. Crown seeds in other layers can thereafter be detected via the upward inter-sectional analysis. Third, a crown voxel growing algorithm is used to make the crown grow in horizontal. The experimental results show that the voxel models of the individual roadside trees can be automatically and effectively extracted with our method.
Zhenlong Xiao, Yiping Chen 0002, Pengdi Huang, Rongren Wu, Jonathan Li 0001
IGARSS4
2017 Traffic Sign Occlusion Detection Using Mobile Laser Scanning Point Clouds
abstract
For survey and maintenance of traffic signs, this paper presents a novel traffic sign occlusion detection method using 3-D point clouds and trajectory data acquired by a mobile laser scanning system. To produce a maintenance guide, our method aims to obtain the degree of occlusion by analyzing the spatial relationship between traffic signs, surroundings, and drivers on the road. First, a detection method considering both reflectance and geometric features is developed to capture traffic signs. Next, to simulate the driver's view, a trajectory-based method is proposed to determine driver's observation location and the corresponding observed traffic sign. Finally, to determine whether a traffic sign is in occlusion, a hidden point removal algorithm is adopted and carried out. Furthermore, we develop two indices to evaluate the degree of occlusion. The proposed method is tested using two point cloud data sets collected by an RIEGL VMX-450 system along a 23.68-km-long urban road. The obtained results illustrate the feasibility of the proposed occlusion detection method.
Pengdi Huang, Ming Cheng 0002, Yiping Chen 0002, Huan Luo 0001, Cheng Wang 0003, Jonathan Li 0001
IEEE Trans. Intell. Transp. Syst.1
2016 Automated segmentation of LiDAR point clouds for building rooftop extraction
abstract
LIDAR (Light Detection and Ranging) is an especially effective tool for acquiring geo-referenced point clouds of urban site. Accurate extraction of elevated features such as building rooftops is vitally important in various applications. However, it is still challenging to determine an accurate rooftop contour from the irregularly distributed LIDAR point clouds. In this paper an efficient LIDAR segmentation method is presented in order to achieve automated rooftop extraction. First, we apply a voxel-based upward growing algorithm that filters out the ground points from the raw point cloud scenes. Second, we employ a Euclidean based clustering method on non-ground points by making use of nearest neighbors. Then we introduce RANSAC (RANdom SAmple Consensus) technique to estimate primitive planes for fitting rooftop facets. Finally, we use concave hull and L0regularization to determine the rooftop contour. Accurate experimental results demonstrate the validity of our segmentation method for rooftop extraction.
Cheng Wang 0003, Jonathan Li 0001, Zongliang Zhang, Dawei Zai, Pengdi Huang, Chenglu Wen
IGARSS6
2016 3D road surface extraction from mobile laser scanning point clouds
abstract
This paper presents a new algorithm to directly extract 3D road boundaries from mobile laser scanning (MLS) point clouds. The algorithm includes two stages: 1) non-ground point removal by a voxel-based elevation filter, and 2) 3D road surface extraction by curb-line detection based on energy minimization and graph cuts. The proposed algorithm was tested on a dataset acquired by a RIEGL VMX-450 MLS system. The results fully demonstrate the effectiveness and superiority of the proposed algorithm.
Dawei Zai, Yulan Guo, Jonathan Li 0001, Huan Luo 0001, Yangbin Lin, Pengdi Huang, Cheng Wang 0003
IGARSS7
2015 Extraction of street trees from mobile laser scanning point clouds based on subdivided dimensional features
abstract
This paper proposes a method for automated extraction of street trees in a typical urban environment from 3D point cloud data acquired by the mobile laser scanning system. First, the algorithm utilizes the voxel-based method to remove the ground points from the scene. Second, the Euclidean distance clustering is adopted to cluster points into individual objects. The eigenvalues of neighborhood covariance matrix and the corresponding normalized centroid distance are computed for each point to obtain the subdivided dimensional features. Finally, the statistical component features and horizontal information are calculated for object detection. The experiment results show the feasibility of the proposed algorithm.
Pengdi Huang, Yiping Chen 0002, Jonathan Li 0001, Yongtao Yu, Cheng Wang 0003, Hongshan Nie
IGARSS1