EDBT 2026 Demo / reviewers in the wild / expert
Feng Luan
dblp:49/8213
· DBLP profile ↗
11ranked-venue papers
4as first author
10since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 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
3 papers |
3D vision · 57% Robot manipulation · 17% Motion planning and robot control · 13% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
3d reconstruction |
0.9 | 1 | 2025 | Transition-Aware Point Cloud Completion by a Progressive Refinement Generative Adversarial Network · IEEE Trans. Multim. 2025 |
Robotics › Robot manipulation
deformable object manipulation |
0.9 | 1 | 2025 | Learning Efficient Robotic Garment Manipulation with Standardization · ICML 2025 |
Machine learning › Generative modeling
generative adversarial network |
0.9 | 1 | 2025 | Transition-Aware Point Cloud Completion by a Progressive Refinement Generative Adversarial Network · IEEE Trans. Multim. 2025 |
Computer vision › 3D vision › point cloud analysis
point cloud classification |
0.9 | 1 | 2025 | Rotation Invariant Spatial Networks for Single-View Point Cloud Classification · IJCAI 2025 |
Computer vision › 3D vision › point cloud processing
point cloud completion |
0.9 | 1 | 2025 | Transition-Aware Point Cloud Completion by a Progressive Refinement Generative Adversarial Network · IEEE Trans. Multim. 2025 |
Computer vision › 3D vision › 3d generation
point cloud generation |
0.9 | 1 | 2025 | Transition-Aware Point Cloud Completion by a Progressive Refinement Generative Adversarial Network · IEEE Trans. Multim. 2025 |
Robotics › Motion planning and robot control
robot learning |
0.9 | 1 | 2025 | Learning Efficient Robotic Garment Manipulation with Standardization · ICML 2025 |
Computer vision › 3D vision › point cloud analysis › point cloud learning
rotation-invariant feature learning |
0.3 | 1 | 2025 | Rotation Invariant Spatial Networks for Single-View Point Cloud Classification · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
tetrahedron construction · 0.9self-attention · 0.9progressive refinement · 0.9multi-scale pooling · 0.9hybrid encoder · 0.9generative adversarial network · 0.9factorized reward · 0.9dual-arm policy · 0.9action mask · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Cascaded U-Net diffusion refiner for deformation prediction in hot strip rolling
Shanhong Cao, Xueqi Dong, Feng Luan |
Eng. Appl. Artif. Intell. | 5 |
| 2026 | Developing the robotic space-force boundary of physical interaction perception in an infant way
Yanmin Zhou, Chengjin Wang, Feng Luan, Xin Li 0093, Yongkang Jiang, Bin He 0003 |
Neurocomputing | 4 |
| 2025 | Learning Efficient Robotic Garment Manipulation with StandardizationabstractGarment manipulation is a significant challenge for robots due to the complex dynamics and potential self-occlusion of garments. Most existing methods of efficient garment unfolding overlook the crucial role of standardization of flattened garments, which could significantly simplify downstream tasks like folding, ironing, and packing. This paper presents APS-Net, a novel approach to garment manipulation that combines unfolding and standardization in a unified framework. APS-Net employs a dual-arm, multi-primitive policy with dynamic fling to quickly unfold crumpled garments and pick-and-place(p&p) for precise alignment. The purpose of garment standardization during unfolding involves not only maximizing surface coverage but also aligning the garment’s shape and orientation to predefined requirements. To guide effective robot learning, we introduce a novel factorized reward function for standardization, which incorporates garment coverage (Cov), keypoint distance (KD), and intersection-over-union (IoU) metrics. Additionally, we introduce a spatial action mask and an Action Optimized Module to improve unfolding efficiency by selecting actions and operation points effectively. In simulation, APS-Net outperforms state-of-the-art methods for long sleeves, achieving 3.9% better coverage, 5.2% higher IoU, and a 0.14 decrease in KD (7.09% relative reduction). Real-world folding tasks further demonstrate that standardization simplifies the folding process. Project page: https://hellohaia.github.io/APS/ Changshi Zhou, Feng Luan, Jiarui Hu 0005, Shaoqiang Meng, Zhipeng Wang 0006, Yanchao Dong, Yanmin Zhou, Bin He 0003 |
ICML | 2 |
| 2025 | Rotation Invariant Spatial Networks for Single-View Point Cloud ClassificationabstractPoint cloud classification is critical for three-dimensional scene understanding. However, in real-world scenarios, depth cameras often capture partial, single-view point clouds of objects with different poses, making their accurate classification a challenge. In this paper, we propose a novel point cloud classification network that captures the detailed spatial structure of objects by constructing tetrahedra, which is different from point-wise operations. Specifically, we propose a RISpaNet block to extract rotation-invariant features. A rotation-invariant property generation module is designed in RISpaNet for constructing rotation-invariant tetrahedron properties (RITPs). Meanwhile, a multi-scale pooling module and a hybrid encoder are used to process RITPs to generate integrated rotation-invariant features. Further, for single-view point clouds, a complete point cloud auxiliary branch and a part-whole correlation module are jointly employed to obtain complete point cloud features from partial point clouds. Experimental results show that this network performs better than other state-of-the-art methods, evaluated on four public datasets. We achieved an overall accuracy of 94.7% (+2.0%) on ModelNet40, 93.4% (+5.9%) on MVP, 94.7% (+6.3%) on PCN and 94.8% (+1.7%) on ScanObjectNN. Our project website is https://luxurylf.github.io/RISpaNet_project/. Feng Luan, Jiarui Hu 0005, Changshi Zhou, Zhipeng Wang 0006, Jiguang Yue, Yanmin Zhou, Bin He 0003 |
IJCAI | 1 |
| 2025 | Controllable Multimodal Landscapes: An Interpretable Surrogate Model for Combinatorial Spaces and Its Application to the k-Order Traveling Salesman ProblemabstractSurrogate models are widely employed to address optimization problems with high computational complexity. However, interpretable surrogate models for Combinatorial Optimization Problems (COPs) remain underexplored. In this paper, a novel surrogate model, termed the Controllable Multimodal Landscape (CML), is proposed for the k-order Traveling Salesman Problem (k-order TSP). The proposed method is inspired by the observation that a Traveling Salesman Problem (TSP) with cities arranged on a convex hull exhibits a unimodal landscape. For the k-order TSP, multiple local optima (or high-quality solutions) are collected, and convex hull TSPs are constructed based on them to generate multiple unimodal landscapes sharing the same search space. These unimodal landscapes are then combined to form a multimodal landscape that approximates the original landscape of the k-order TSP. Particle Swarm Optimization (PSO) is used to optimize the parameters of the CML. Experimental results demonstrate that the proposed CML surrogate model achieves higher accuracy than Random Forest (RF) in most test cases involving k-order TSP instances. Feng Luan, Jialong Shi, Jianyong Sun |
SMC | 1 |
| 2025 | Temporal online self-learning stochastic configuration networks: A study on strip deviation prediction
Han Gao 0020, Yumei Qin, Jianzhao Cao, Feng Luan |
Inf. Sci. | 6 |
| 2025 | SSFold: Learning to Fold Arbitrary Crumpled Cloth Using Graph Dynamics From Human DemonstrationabstractRobotic cloth manipulation poses significant challenges due to the fabric’s complex dynamics and the high dimensionality of configuration spaces. Previous approaches have focused on isolated smoothing or folding tasks and relied heavily on simulations, often struggling to bridge the sim-to-real gap. This gap arises as simulated cloth dynamics fail to capture real-world properties such as elasticity, friction, and occlusions, causing accuracy loss and limited generalization. To tackle these challenges, we propose a two-stream architecture with sequential and spatial pathways, unifying smoothing and folding tasks into a single adaptable policy model. The sequential stream determines pick-and-place positions, while the spatial stream, using a connectivity dynamics model, constructs a visibility graph from partial point cloud data, enabling the model to infer the cloth’s full configuration despite occlusions. To address the sim-to-real gap, we integrate real-world human demonstration data via a hand-tracking detection algorithm, enhancing real-world performance across diverse cloth configurations. Our method, validated on a UR5 robot across six distinct cloth folding tasks, consistently achieves desired folded states from arbitrary crumpled initial configurations, with success rates of 100.0%, 100.0%, 83.3%, 66.7%, 83.3%, and 66.7%. It outperforms state-of-the-art cloth manipulation techniques and generalizes to unseen fabrics with diverse colors, shapes, and stiffness. Project page: https://zcswdt.github.io/SSFold/. Changshi Zhou, Haichuan Xu, Jiarui Hu 0005, Feng Luan, Zhipeng Wang 0006, Yanchao Dong, Yanmin Zhou, Bin He 0003 |
IEEE Trans Autom. Sci. Eng. | 4 |
| 2025 | Transition-Aware Point Cloud Completion by a Progressive Refinement Generative Adversarial NetworkabstractThree-dimensional reconstruction can help robots and vehicles understand their surroundings for subsequent navigation and manipulation tasks. However, in the case of target occlusion, it is difficult for visual sensors to acquire complete information about objects. In this work, we propose a progressive refinement generative adversarial network (PR-GAN) to recover object shapes guided by transition-awareness. This method directly predicts the missing point cloud from the partial point cloud. Our PR-GAN contains a progressive generation module (PGM) and a discriminator. A self-attention-based encoder is proposed in PGM to capture contextual information between local and global features. To guide encoders in generating accurate point clouds, we further propose a progressive fusion module (PFM) that extracts transition information between point clouds of different scales. Moreover, a part-whole correlation module (PWCM) is designed to extract the transition-awareness between the partial and the whole point clouds to further preserve the details. With the above modules, we enhance the spatial logic perception capability of the network so that PR-GAN can fully extract point cloud features and predict the high-fidelity point cloud. Experimental results show that PR-GAN performs better compared to other methods, evaluated on three public datasets. The code is available at https://github.com/luxurylf/PR-GAN. Feng Luan, Jiarui Hu 0005, Zhipeng Wang 0006, Jiguang Yue, Yanmin Zhou, Bin He 0003 |
IEEE Trans. Multim. | 1 |
| 2024 | Fusion of theory and data-driven model in hot plate rolling: A case study of rolling force prediction
Zishuo Dong, Feng Luan, Lingming Meng, Jingguo Ding |
Expert Syst. Appl. | 3 |
| 2022 | Predicting hot-strip finish rolling thickness using stochastic configuration networks
Xu Li 0013, Yaodong He, Jingguo Ding, Feng Luan |
Inf. Sci. | 4 |
| 2011 | Using a multi-criteria decision making approach to evaluate format migration solutionsabstractMigration is a strategy used in preservation systems to make digital objects survive from the continuing evolution of technology. However, it is difficult for custodians to decide an objective migration solution, as heterogeneous data, many system requirements, and complex programs will affect the selection of the solutions. In this paper, we describe a multi-criteria decision making approach for the selection of migration solutions. The approach mainly uses the analytic hierarchy process (AHP) and the technique ordered preference by similarity to the ideal solution (TOPSIS). Finally, the viability of our approach is illustrated in a series of experiments to find the best migration solution for doc files. Feng Luan, Mads Nygård, Guttorm Sindre, Trond Aalberg |
MEDES | 1 |