arXiv Computer Vision

BridgeMatch: Conditional Transport Bridges in Matching Matrix Space for 3D Deformable Registration

BridgeMatch is a two‑stage generative solver that preserves the full soft matching matrix for 3D deformable registration. Stage I uses denoising diffusion to estimate a global matching matrix at a coarse resolution, then lifts it to high resolution while maintaining hierarchy and rank constraints. Stage II refines this lifted matrix via a conditional transport bridge, implemented with either a deterministic Flow Matching ODE or a stochastic Brownian‑bridge SDE, and demonstrates improved correspondence accuracy and registration performance on 4DMatch, 4DLoMatch, CAPE, and DeepDeform datasets, especially in low‑overlap scenarios.

arXiv Computer Vision
Sep 24

DMM-Align: Closed-Loop Optimization for 2D-3D Registration with Dual-Role Diffusion

DMM-Align introduces a closed‑loop framework for 2D‑3D registration that jointly refines correspondences, estimates pose, and learns representations using a shared differentiable geometric state. The method employs two diffusion processes: a geometry‑aware diffusion that improves the soft matching matrix for robust correspondence estimation, and a geometry‑conditioned diffusion teacher that feeds pose‑induced supervision back into feature learning. Experiments on 7‑Scenes and RGB‑D Scenes V2 show that DMM‑Align outperforms strong baselines, particularly in low‑overlap and heavily occluded scenarios, demonstrating the value of closed‑loop geometric feedback.

By Chongjian Wang, Junjie Gao
arXiv Computer Vision
Sep 14

Spectral Consistency-Guided Multiview Point Cloud Registration for Low-Overlap Scenes

The paper introduces GMPCR, a non‑learning spectral consistency‑guided framework for multiview point cloud registration in low‑overlap scenes. GMPCR refines initial correspondences into a second‑order compatibility structure, uses spectral analysis to filter unreliable matches and select informative scan pairs, and then applies maximal‑clique hypothesis generation for robust relative transformations. The resulting sparse pose graph is further refined with an adaptive history‑aware synchronization scheme, and a recovery mechanism allows previously down‑weighted edges to regain confidence, achieving high registration recalls on benchmark datasets while reducing computational cost.

By Tianyu Li, Yanghong Lin, Shudong Zhou, Kui Yang, Jingru Zhang, Li Fang, Wei Yao
arXiv Computer Vision
5d ago

FlowMoDE: Coarse-to-fine Flow Matching for Detail-aware Sim-to-Real Monocular Depth Estimation

FlowMoDE introduces a coarse‑to‑fine flow‑matching framework for monocular depth estimation that balances efficiency and detail reconstruction. The method first decodes coarse depth conditioned on diffused features from a pre‑trained semantic encoder, then refines fine structural patterns with expanded decoding layers. Trained only on a synthetic indoor dataset, FlowMoDE achieves a 14.1% lower relative error and a 9.9% lower Chamfer distance compared to state‑of‑the‑art methods across five real‑world indoor and outdoor datasets, and demonstrates strong generalization to realistic robotic scenes.

By Liangjing Shao, Wanhao Liu, Jinsong Lin, Zhiwei Fang, Hongliang Ren
arXiv Computer Vision
Aug 31

Physics-Guided Flow Matching for CT Image Reconstruction

The paper introduces a high‑resolution Rectified Flow Matching model trained on 256×256 chest CT images to serve as a generative prior for CT reconstruction. A two‑stage training strategy—initial strong anatomically informed augmentation followed by fine‑tuning—helps mitigate overfitting and improve structural fidelity. When evaluated on various CT inverse problems, Flow Matching‑based reconstruction methods outperform diffusion‑based algorithms in PSNR, SSIM, and perceptual quality while requiring fewer sampling steps.

By Davide Evangelista
arXiv Computer Vision
Aug 28

Test Time Adaptation Methods for Point Cloud Registration in Laparoscopic Surgery

The paper investigates test‑time adaptation (TTA) techniques for 3D point‑cloud registration in laparoscopic surgery, where synthetic training data must be adapted to noisy, sparse, and occluded real intraoperative reconstructions. It adapts three families of TTA methods—model, normalization, and input adaptation—to handle asymmetric shifts between preoperative meshes and intraoperative clouds, replacing classification‑based entropy objectives with correspondence‑based ones. Experiments on synthetic and real targets show that input adaptation consistently reduces registration error with low inference latency, making it the most promising approach for surgical applications.

By Nina Bodelot, Soufiane Belharbi, Eric Granger
arXiv Computer Vision
Sep 21

XCalib Depth-Guided Geometric Optimization for Dense Thermal-Visible Video Registration

XCalib is an unsupervised dense registration framework that aligns thermal and visible video streams by optimizing virtual pinhole camera parameters and predicted monocular depth, thereby restricting spatial displacements to physically valid projection geometries. It introduces a novel registration paradigm using camera parameterization as an implicit regularizer, a robust Normalized Edges Correlation (NEC) metric for cross‑spectral alignment, and demonstrates superior temporal stability and alignment accuracy on public ADAS datasets compared to unconstrained dense flow baselines.

By Aurelien Godet, Gabriel Jobert, Mauro Dalla Mura
arXiv Computer Vision
Aug 31

Ex-Sim(3)-Reg: 2D-3D Correspondence Pruning via Extended Sim(3) Registration

The paper introduces Ex‑Sim(3)‑Reg, a fast and robust method for pruning 2D‑3D correspondences by reformulating the problem as an extended Sim(3) registration that explicitly accounts for depth noise. The authors provide a theoretical justification and demonstrate that their approach improves registration recall by up to 24.7% on several benchmark datasets, outperforming state‑of‑the‑art baselines. The code for the method is publicly available on GitHub.

By Pei An, Muyao Peng, Junfeng Ding, Jiaqi Yang, Liangliang Nan
arXiv Computer Vision
Oct 9

Learning Which Correspondences to Trust: Confidence-Weighted Event-Camera Localization in LiDAR Maps

The paper introduces CELL, a confidence-weighted event-camera localization method that learns per-correspondence confidence end-to-end using a differentiable probabilistic PnP. It reweights flow supervision, drives probabilistic correspondence selection at test time, and refines edge matching, while also proposing a partial-completion depth representation. Experiments on M3ED and DSEC show significant reductions in median translation and rotation errors compared to the LEAR baseline.

By Panagiotis Kiousis, Kuangyi Chen, Jun Zhang, Friedrich Fraundorfer
arXiv Computer Vision
Oct 16

ControlFlow3D: Distilling Multi-View Knowledge into Latent Flow Matching for Point Cloud Upsampling

ControlFlow3D is a framework that upsamples point clouds by distilling knowledge from pretrained foundation models into a lightweight generation network. It performs conditional flow matching in a latent space defined by a frozen 3D encoder, using unsupervised soft KMeans to cluster multi‑view image tokens and 3D latent tokens into shared prototypes that guide the flow trajectory. A Mamba‑based geometry decoder then maps latent features to dense coordinates with linear complexity, and the authors introduce ShapeNetPU, a 35K‑object multi‑modal benchmark 31 times larger than previous datasets.

By Yuang Liu, Zhi Zuo, Zhengkai Zhao, Lirui Zhang, Pan Gao, Hao Feng, Zhengzhe Liu
arXiv Computer Vision
Oct 12

MeshBind: Point-to-Mesh Binding for Non-Rigid Scene Flow Automatic Annotation

MeshBind introduces an automatic annotation pipeline that generates per-point scene flow for non‑rigid objects such as pedestrians by reconstructing articulated mesh models from six surround cameras and registering them to LiDAR data. The method employs a local‑frame binding technique that attaches each point to a mesh via a per‑triangle tangent‑normal frame, and a three‑layer flow registration pipeline that compensates ego‑vehicle motion, performs box binding, and applies mesh binding to produce full‑scene flow. MeshBind is implemented in the SF‑Studio tool, and the authors release the SUScape‑Flow Benchmark (SFB), a large‑scale dataset with 41k frames of per‑point non‑rigid pedestrian annotations and a comprehensive evaluation protocol, demonstrating that fine‑tuning on SFB reduces endpoint error by 2‑3× and equalizes non‑rigid and rigid EPE.

By Yinqi Chen, E Li, Shuaijun Wang, Weiyuan Peng, Meiying Zhang, Qi Hao