Leveraging Cycle-Consistent Anchor Points for Self-Supervised RGB-D Registration
Siddharth Tourani, Jayaram Reddy, Sarvesh Thakur, K Madhava Krishna, Muhammad Haris Khan, N Dinesh Reddy
TL;DR
The paper addresses the challenge of self-supervised RGB-D registration with unlabeled data by leveraging cycle-consistent anchor points that are easily identifiable across views to impose spatial coherence on correspondences. It introduces a pixel-level matching pipeline that incorporates an anchor-point distance embedding, a self-attention mechanism, and a RANSAC-free pose refinement that combines a GRU-based updater with transformation synchronization in $SE(3)$. Training uses a registration loss and cycle-consistency losses to regularize anchor points, while test-time operation relies on Kabsch without the GRU or synchronization. Empirically, the method achieves state-of-the-art performance among self-supervised RGB-D registration approaches on ScanNet and 3DMatch and can improve other registration pipelines when integrated, highlighting its practical value for robust scene understanding from RGB-D data.
Abstract
With the rise in consumer depth cameras, a wealth of unlabeled RGB-D data has become available. This prompts the question of how to utilize this data for geometric reasoning of scenes. While many RGB-D registration meth- ods rely on geometric and feature-based similarity, we take a different approach. We use cycle-consistent keypoints as salient points to enforce spatial coherence constraints during matching, improving correspondence accuracy. Additionally, we introduce a novel pose block that combines a GRU recurrent unit with transformation synchronization, blending historical and multi-view data. Our approach surpasses previous self- supervised registration methods on ScanNet and 3DMatch, even outperforming some older supervised methods. We also integrate our components into existing methods, showing their effectiveness.
