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

Rongkun Xue

dblp:361/3878 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0004-6488-5343ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 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
1 paper
Learning paradigms · 50% Generative modeling · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model
score-based generative model
0.912025
Pretrained Reversible Generation as Unsupervised Visual Representation Learning · ICCV 2025
Machine learning › Learning paradigms › unsupervised learning
unsupervised visual representation learning
0.912025
Pretrained Reversible Generation as Unsupervised Visual Representation Learning · ICCV 2025

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

score matching · 0.9generative model · 0.9flow matching · 0.9
YearPublicationVenuePosition
2025 Pretrained Reversible Generation as Unsupervised Visual Representation Learning
abstract
Recent generative models based on score matching and flow matching have significantly advanced generation tasks, but their potential in discriminative tasks remains underexplored. Previous approaches, such as generative classifiers, have not fully leveraged the capabilities of these models for discriminative tasks due to their intricate designs. We propose Pretrained Reversible Generation (PRG), which extracts unsupervised representations by reversing the generative process of a pretrained continuous generation model. PRG effectively reuses unsupervised generative models, leveraging their high capacity to serve as robust and generalizable feature extractors for downstream tasks. This framework enables the flexible selection of feature hierarchies tailored to specific downstream tasks. Our method consistently outperforms prior approaches across multiple benchmarks, achieving state-of-the-art performance among generative model based methods, including 78% top-1 accuracy on ImageNet at a resolution of 64*64. Extensive ablation studies, including out-of-distribution evaluations, further validate the effectiveness of our approach.PRG is available at https://github.com/opendilab/PRG.
Rongkun Xue, Jinouwen Zhang, Yazhe Niu, Dazhong Shen, Bingqi Ma, Yu Liu 0015
ICCV1
2024 Motion Dynamic RRT based Fluid Field - PPO for Dynamic TF/TA Routing Planning
abstract
Existing local dynamic route planning algorithms, when directly applied to terrain following/terrain avoidance, or dynamic obstacle avoidance for large and medium-sized fixed-wing aircraft, fail to simultaneously meet the requirements of real-time performance, long-distance planning, and the dynamic constraints of large and medium-sized aircraft. To deal with this issue, this paper proposes the Motion Dynamic RRT based Fluid Field - PPO for dynamic TF/TA routing planning. Firstly, the action and state spaces of the proximal policy gradient algorithm are redesigned using disturbance flow fields and artificial potential field algorithms, establishing an aircraft dynamics model, and designing a state transition process based on this model. Additionally, a reward function is designed to encourage strategies for obstacle avoidance, terrain following, terrain avoidance, and safe flight. Experimental results on real DEM data demonstrate that our algorithm can complete long-distance flight tasks through collision-free trajectory planning that complies with dynamic constraints, without the need for prior global planning.
Rongkun Xue, Jing Yang 0014
IV1
2023 Motion Dynamics RRT Algorithm for Optimal TF /TA Routing Planning
abstract
The existing route planning algorithms are directly applied to the remote$\text{TF}/\text{TA}$route planning of large and medium-sized fixed wing aircraft, and cannot simultaneously meet the requirements of efficiency, route consistency, and optimality. To deal with the problem, a motion dynamics RRT*algorithm is proposed. Firstly, the characteristic of ellipses is utilized to effectively reduce the planning space in order to improve search efficiency; Next, in order to reduce the randomness of the RRT algorithm, a motion dynamics model of the aircraft is established and the state transition mode of nodes based on this model is designed; Finally, a cost function was designed to penalize the detour distance, climb altitude, and unsafe flight path. The experimental results on real DEM data show that the proposed algorithm can simultaneously meet the requirements of high efficiency, route consistency, and optimality for long-distance TF/TA route planning of large and medium-sized fixed wing aircraft.
Zhaozi Zu, Zhongjun Qu, Wenbo Suo, Guanjie Chen, Mingrui Han, Rongkun Xue
IECON6