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.

Yidan Lu

dblp:217/1680 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Computer networks · 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
3 papers
3D vision · 66% Representation and self-supervised learning · 18% Vision and language · 16%
Computer graphics and multimedia
2 papers
Multimedia analysis and retrieval · 54% Geometric modeling and processing · 46%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › geometric deep learning
3d representation learning
1.012026
Hyperbolic Hierarchical Alignment Reasoning Network for Text-3D Retrieval · AAAI 2026
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
hyperbolic representation learning
1.012026
Hyperbolic Hierarchical Alignment Reasoning Network for Text-3D Retrieval · AAAI 2026
Multimedia analysis and retrieval
cross-modal retrieval
1.012026
Hyperbolic Hierarchical Alignment Reasoning Network for Text-3D Retrieval · AAAI 2026
Computer vision › 3D vision
3d reconstruction
0.912025
Digging into Intrinsic Contextual Information for High-fidelity 3D Point Cloud Completion · AAAI 2025
Computer vision › 3D vision › point cloud processing › point cloud restoration
point cloud refinement
0.912025
Digging into Intrinsic Contextual Information for High-fidelity 3D Point Cloud Completion · AAAI 2025
Computer vision › 3D vision › point cloud analysis › point cloud learning
point cloud representation learning
0.912025
Riemann-based Multi-scale Attention Reasoning Network for Text-3D Retrieval · AAAI 2025
Geometric modeling and processing › shape modeling › shape completion
point cloud completion
0.912025
Digging into Intrinsic Contextual Information for High-fidelity 3D Point Cloud Completion · AAAI 2025

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

hyperbolic geometry · 2.0hierarchical ordering loss · 2.0contrastive learning · 2.0similarity modeling · 1.7mixed sampling · 1.7diffusion model · 1.7riemannian attention · 0.9multi-scale attention · 0.9
YearPublicationVenuePosition
2026 Hyperbolic Hierarchical Alignment Reasoning Network for Text-3D Retrieval
abstract
With the daily influx of 3D data on the internet, text-3D retrieval has gained increasing attention. However, current methods face two major challenges: Hierarchy Representation Collapse (HRC) and Redundancy-Induced Saliency Dilution (RISD). HRC compresses abstract-to-specific and whole-to-part hierarchies in Euclidean embeddings, while RISD averages noisy fragments, obscuring critical semantic cues and diminishing the model’s ability to distinguish hard negatives. To address these challenges, we introduce the Hyperbolic Hierarchical Alignment Reasoning Network (H2ARN) for text-3D retrieval. H2ARN embeds both text and 3D data in a Lorentz-model hyperbolic space, where exponential volume growth inherently preserves hierarchical distances. A hierarchical ordering loss constructs a shrinking entailment cone around each text vector, ensuring that the matched 3D instance falls within the cone, while an instance-level contrastive loss jointly enforces separation from non-matching samples. To tackle RISD, we propose a contribution-aware hyperbolic aggregation module that leverages Lorentzian distance to assess the relevance of each local feature and applies contribution-weighted aggregation guided by hyperbolic geometry, enhancing discriminative regions while suppressing redundancy without additional supervision. We also release the expanded T3DR-HIT v2 benchmark, which contains 8,935 text-to-3D pairs, 2.6 times the original size, covering both fine-grained cultural artefacts and complex indoor scenes.
Wenrui Li 0001, Yidan Lu, Yeyu Chai, Rui Zhao 0010, Hengyu Man, Xiaopeng Fan 0001
AAAI2
2025 Digging into Intrinsic Contextual Information for High-fidelity 3D Point Cloud Completion
abstract
The common occurrence of occlusion-induced incompleteness in point clouds has made point cloud completion (PCC) a highly-concerned task in the field of geometric processing. Existing PCC methods typically produce complete point clouds from partial point clouds in a coarse-to-fine paradigm, with the coarse stage generating entire shapes and the fine stage improving texture details. Though diffusion models have demonstrated effectiveness in the coarse stage, the fine stage still faces challenges in producing high-fidelity results due to the ill-posed nature of PCC. The intrinsic contextual information for texture details in partial point clouds is the key to solving the challenge. In this paper, we propose a high-fidelity PCC method that digs into both short and long-range contextual information from the partial point cloud in the fine stage. Specifically, after generating the coarse point cloud via a diffusion-based coarse generator, a mixed sampling module introduces short-range contextual information from partial point clouds into the fine stage. A surface freezing module safeguards points from noise-free partial point clouds against disruption. As for the long-range contextual information, we design a similarity modeling module to derive similarity with rigid transformation invariance between points, conducting effective matching of geometric manifold features globally. In this way, the high-quality components present in the partial point cloud serve as valuable references to refine the coarse point cloud with high fidelity. Extensive experiments have demonstrated the superiority of the proposed method over SOTA competitors.
Jisheng Chu, Wenrui Li 0001, Kanglin Ning, Yidan Lu, Xiaopeng Fan 0001
AAAI5
2025 Riemann-based Multi-scale Attention Reasoning Network for Text-3D Retrieval
abstract
Due to the challenges in acquiring paired Text-3D data and the inherent irregularity of 3D data structures, combined representation learning of 3D point clouds and text remains unexplored. In this paper, we propose a novel Riemann-based Multi-scale Attention Reasoning Network (RMARN) for text-3D retrieval. Specifically, the extracted text and point cloud features are refined by their respective Adaptive Feature Refiner (AFR). Furthermore, we introduce the innovative Riemann Local Similarity (RLS) module and the Global Pooling Similarity (GPS) module. However, as 3D point cloud data and text data often possess complex geometric structures in high-dimensional space, the proposed RLS employs a novel Riemann Attention Mechanism to reflect the intrinsic geometric relationships of the data. Without explicitly defining the manifold, RMARN learns the manifold parameters to better represent the distances between text-point cloud samples. To address the challenges of lacking paired text-3D data, we have created the large-scale Text-3D Retrieval dataset T3DR-HIT, which comprises over 3,380 pairs of text and point cloud data. T3DR-HIT contains coarse-grained indoor 3D scenes and fine-grained Chinese artifact scenes, consisting of 1,380 and over 2,000 text-3D pairs, respectively. Experiments on our custom datasets demonstrate the superior performance of the proposed method.
Wenrui Li 0001, Wei Han 0002, Yandu Chen, Yeyu Chai, Yidan Lu, Xiaopeng Fan 0001
AAAI5
2023 Thermostatically Controlled Loads in the Power System Under Cyberattacks
abstract
More and more thermostatic loads in power systems are transformed into thermostatically controlled loads (TCLs) through the heterogeneous Internet of Things (IoT) devices. The proportion of TCLs exposed to the Internet has also further increased. Considering TCLs’ response characteristics and the network security vulnerability of their associated IoT devices, it is possible to form a new threat to power systems, manipulation of demand (MAD) attacks. In this article, we reveal a potential attack scenario of this threat in the electricity market and propose a highly concealable and destructive cross-domain MAD attack strategy based on compromised TCLs, causing a tremendous economic loss for the power retailer (PR) and end-use consumers (EUCs). Finally, the effectiveness of the proposed MAD attack strategy is verified by simulation cases, highlighting the endanger of large-scale compromised TCLs in power systems and the importance of their associated IoT devices’ network security.
Xuan Liu 0003, Yidan Lu, Zongchao Yu
IEEE Internet Things J.3