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

Bhuvan Jhamb

dblp:410/2023 · 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 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d reconstruction
0.912025
UFM: A Simple Path towards Unified Dense Correspondence with Flow · NeurIPS 2025
Computer vision › 3D vision › correspondence estimation
dense correspondence
0.912025
UFM: A Simple Path towards Unified Dense Correspondence with Flow · NeurIPS 2025
Computer vision › 3D vision › motion estimation
optical flow
0.912025
UFM: A Simple Path towards Unified Dense Correspondence with Flow · NeurIPS 2025
Computer vision › 3D vision › feature matching › local feature matching
wide-baseline matching
0.912025
UFM: A Simple Path towards Unified Dense Correspondence with Flow · NeurIPS 2025

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

transformer · 0.9flow regression · 0.9
YearPublicationVenuePosition
2025 UFM: A Simple Path towards Unified Dense Correspondence with Flow
abstract
Dense image correspondence is central to many applications, such as visual odometry, 3D reconstruction, object association, and re-identification. Historically, dense correspondence has been tackled separately for wide-baseline scenarios and optical flow estimation, despite the common goal of matching content between two images. In this paper, we develop a Unified Flow \& Matching model (UFM), which is trained on unified data for pixels that are co-visible in both source and target images. UFM uses a simple, generic transformer architecture that directly regresses the $(u,v)$ flow. It is easier to train and more accurate for large flows compared to the typical coarse-to-fine cost volumes in prior work. UFM is 28\% more accurate than state-of-the-art flow methods (Unimatch), while also having 62\% less error and 6.7x faster than dense wide-baseline matchers (RoMa). UFM is the first to demonstrate that unified training can outperform specialized approaches across both domains. This result enables fast, general-purpose correspondence and opens new directions for multi-modal, long-range, and real-time correspondence tasks.
Nikhil Varma Keetha, Chenwei Lyu, Bhuvan Jhamb, Yuheng Qiu, Jay Karhade, Shreyas Jha, Yaoyu Hu, Deva Ramanan, Sebastian A. Scherer
NeurIPS4