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

Tianwen Fu

dblp:272/1129 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-9536-8446ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021Artificial intelligence and machine learning · 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
Deep learning architectures and training · 37% 3D vision · 36% Efficient and distributed learning · 18%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › feature matching
local feature detection and description
0.912025
RDD: Robust Feature Detector and Descriptor using Deformable Transformer · CVPR 2025
Machine learning › Deep learning architectures and training
loss function design
0.612022
AutoLoss-Zero: Searching Loss Functions from Scratch for Generic Tasks · CVPR 2022
Machine learning › Deep learning architectures and training › loss function design
loss function learning
0.612022
AutoLoss-Zero: Searching Loss Functions from Scratch for Generic Tasks · CVPR 2022
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.612022
AutoLoss-Zero: Searching Loss Functions from Scratch for Generic Tasks · CVPR 2022
Robotics › Robot navigation and mapping
SLAM
0.312025
RDD: Robust Feature Detector and Descriptor using Deformable Transformer · CVPR 2025
Computer vision › 3D vision
structure from motion
0.312025
RDD: Robust Feature Detector and Descriptor using Deformable Transformer · CVPR 2025

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

deformable transformer · 0.9deformable self-attention · 0.9gradient-equivalence check · 0.6evolutionary algorithm · 0.6
YearPublicationVenuePosition
2025 RDD: Robust Feature Detector and Descriptor using Deformable Transformer
abstract
As a core step in structure-from-motion and SLAM, robust feature detection and description under challenging scenarios such as significant viewpoint changes remain unresolved despite their ubiquity. While recent works have identified the importance of local features in modeling geometric transformations, these methods fail to learn the visual cues present in long-range relationships. We present Robust Deformable Detector (RDD), a novel and robust keypoint detector/descriptor leveraging the deformable transformer, which captures global context and geometric invariance through deformable self-attention mechanisms. Specifically, we observed that deformable attention focuses on key locations, effectively reducing the search space complexity and modeling the geometric invariance. Furthermore, we collected an Air-to-Ground dataset for training in addition to the standard MegaDepth dataset. Our proposed method outperforms all state-of-the-art keypoint detection/description methods in sparse matching tasks and is also capable of semi-dense matching. To ensure comprehensive evaluation, we introduce two challenging benchmarks: one emphasizing large viewpoint and scale variations, and the other being an Air-to-Ground benchmark — an evaluation setting that has recently gaining popularity for 3D reconstruction across different altitudes. Project page: https://xtcpete.github.io/rdd/.
Gonglin Chen, Tianwen Fu, Haiwei Chen, Wenbin Teng, Hanyuan Xiao
CVPR2
2022 AutoLoss-Zero: Searching Loss Functions from Scratch for Generic Tasks
abstract
Significant progress has been achieved in automating the design of various components in deep networks. However, the automatic design of loss functions for generic tasks with various evaluation metrics remains under-investigated. Previous works on handcrafting loss functions heavily rely on human expertise, which limits their extensibility. Meanwhile, searching for loss functions is nontrivial due to the vast search space. Existing efforts mainly tackle the issue by employing task-specific heuristics on specific tasks and particular metrics. Such work cannot be extended to other tasks without arduous human effort. In this paper, we propose AutoLoss-Zero, which is a general framework for searching loss functions from scratch for generic tasks. Specifically, we design an elementary search space composed only of primitive mathematical operators to accommodate the heterogeneous tasks and evaluation metrics. A variant of the evolutionary algorithm is employed to discover loss functions in the elementary search space. A loss-rejection protocol and a gradient-equivalence-check strategy are developed so as to improve the search efficiency, which are applicable to generic tasks. Extensive experiments on various computer vision tasks demonstrate that our searched loss functions are on par with or superior to existing loss functions, which generalize well to different datasets and networks. Code shall be released.
Hao Li 0069, Tianwen Fu, Jifeng Dai, Hongsheng Li 0001, Gao Huang 0001, Xizhou Zhu
CVPR2
2020 Computational Design and Optimization of Non-Circular Gears
abstract
Abstract We study a general form of gears known as non‐circular gears that can transfer periodic motion with variable speed through their irregular shapes and eccentric rotation centers. To design functional non‐circular gears is nontrivial, since the gear pair must have compatible shape to keep in contact during motion, so the driver gear can push the follower to rotate via a bounded torque that the motor can exert. To address the challenge, we model the geometry, kinematics, and dynamics of non‐circular gears, formulate the design problem as a shape optimization, and identify necessary independent variables in the optimization search. Taking a pair of 2D shapes as inputs, our method optimizes them into gears by locating the rotation center on each shape, minimally modifying each shape to form the gear's boundary, and constructing appropriate teeth for gear meshing. Our optimized gears not only resemble the inputs but can also drive the motion with relatively small torque. We demonstrate our method's usability by generating a rich variety of non‐circular gears from various inputs and 3D printing several of them.
Hao Xu 0034, Tianwen Fu, Peng Song 0001, Chi-Wing Fu, Niloy J. Mitra
Comput. Graph. Forum2