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

Hanqiu Jiang

dblp:401/8209 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial 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.

Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
scene flow estimation
0.912025
Floxels: Fast Unsupervised Voxel Based Scene Flow Estimation · CVPR 2025
Computer vision › 3D vision › scene flow estimation
self-supervised scene flow
0.912025
Floxels: Fast Unsupervised Voxel Based Scene Flow Estimation · CVPR 2025
Computer vision › 3D vision › 3d scene modeling › scene representation
voxel-based scene representation
0.312025
Floxels: Fast Unsupervised Voxel Based Scene Flow Estimation · CVPR 2025

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

voxel grid model · 0.9test-time optimization · 0.9multi-frame loss · 0.9
YearPublicationVenuePosition
2025 Floxels: Fast Unsupervised Voxel Based Scene Flow Estimation
abstract
Scene flow estimation is a foundational task for many robotic applications, including robust dynamic object detection, automatic labeling, and sensor synchronization. Two types of approaches to the problem have evolved: 1) Supervised and 2) optimization-based methods. Supervised methods are fast during inference and achieve high-quality results, however, they are limited by the need for large amounts of labeled training data and are susceptible to domain gaps. In contrast, unsupervised test-time optimization methods do not face the problem of domain gaps but usually suffer from substantial runtime, exhibit artifacts, or fail to converge to the right solution. In this work, we mitigate several limitations of existing optimization-based methods. To this end, we 1) introduce a simple voxel grid-based model that improves over the standard MLP-based formulation in multiple dimensions and 2) introduce a new multi-frame loss formulation. 3) We combine both contributions in our new method, termed Floxels. On the Argoverse 2 benchmark, Floxels is surpassed only by EulerFlow among unsupervised methods while achieving comparable performance at a fraction of the computational cost. Floxels achieves a massive speedup of more than ~60 – 140× over Euler-Flow, reducing the runtime from a day to 10× minutes per sequence. Over the faster but low-quality baseline, NSFP, Floxels achieves a speedup of ∼14×.
David T. Hoffmann, Syed Haseeb Raza, Hanqiu Jiang, Denis Tananaev, Steffen Klingenhoefer, Martin Meinke
CVPR3