arXiv Computer Vision

Closed-form Bayesian homography estimation from noisy point correspondences

The paper introduces a fast Bayesian method for estimating homographies from noisy point correspondences, providing a posterior distribution over the homography parameters. A closed‑form solution for the posterior mean in homogeneous coordinates is derived, complemented by an iterative Bayesian approach to address non‑linearities. Experiments on synthetic data and real image stitching show improved accuracy over DLT and supply uncertainty estimates for the homography.

arXiv Computer Vision
Sep 18

BINDER: A Latent Variable Model for Probabilistic Medical Image Registration

BINDER is a new probabilistic model for medical image registration that builds on mutual information and uses latent voxel‑wise correspondences to enable closed‑form iterative updates. The approach yields a demons‑like optimization algorithm that performs robustly on both monomodal and multimodal tasks, and a sampler that quantifies uncertainty in high‑dimensional 3D deformations. The authors provide the code on GitHub for public use.

By Stefano Cerri, Amirhossein Hassankhani, Ya\"el Balbastre, Koen Van Leemput
arXiv Machine Learning
Aug 28

Bayesian methods and Markov chain Monte Carlo algorithms for curve reconstruction and point cloud data analysis

The paper presents a fully Bayesian framework for reconstructing closed curves from point‑cloud data, treating observed points as noisy perturbations of latent locations constrained to lie on an underlying curve. A non‑parametric prior regularizes the curve, and posterior inference is performed with Markov chain Monte Carlo samplers designed for point‑cloud characteristics. Experiments on synthetic and real LiDAR datasets demonstrate accurate reconstructions and quantified uncertainty over the recovered curves.

By Asir Intesar Tushar, Ioannis Sgouralis
arXiv Computer Vision
Aug 26

Segmentation-Guided Homography Estimation for Long-Term Planar Tracking

The paper introduces SAM‑H, a planar object tracker that estimates 8‑degree‑of‑freedom homographies directly from segmentation mask contours using a training‑free pipeline. When applied to masks from SAM 2, SAM‑H achieves a new state‑of‑the‑art performance on the PlanarTrack benchmark, improving the p@5 metric by 18.4 percentage points. The authors also demonstrate that combining segmentation‑based and correspondence‑based homography estimation yields WOFTSAM, which surpasses all previous methods on both PlanarTrack and POT‑210, and provide precise re‑annotations of PlanarTrack initial poses for more accurate benchmarking.

By Jonas Serych, Jiri Matas
arXiv AI
Sep 17

On-the-Fly Homographies Calibration for Multi-Camera Tracking

The paper introduces an on-the-fly homography calibration system for multi-camera tracking that starts from coarse manual homographies and refines them using a centroid-based projection optimization (PO) on live detection metadata. PO continuously aligns ground-plane geometry without adding computational latency, enabling the system to adapt automatically to camera movements or environmental changes. The refined geometry feeds a bird's-eye-view tracker that fuses detections and unifies trajectories across zones while maintaining privacy safety and zero overhead.

By David Voihanski, Mor Sinai, Ben Zion Bobrovsky
Hugging Face Trending Papers
Jul 9

Track2Map: Online Deformable SLAM with Motion-Aware Pose Optimization in Robotic Surgery

Gaussian splatting is the current state-of-the-art for dense, deformable 3D anatomy reconstruction in robot-assisted minimally invasive surgery (RAMIS); however, most pipelines are offline and depend on accurate camera trajectory priors (often from robotic kinematics), limiting applicability when priors are missing or noisy. To address these limitations, we propose Track2Map, an online 3D Gaussian Splatting pipeline that jointly optimizes camera trajectory and 3D deformable scene representation directly from surgical video.

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