🤖 AI Summary
This work addresses the challenge of confusion in 3D shape retrieval caused by visually similar yet geometrically distinct objects. The authors propose a lightweight, query-adaptive reranking method that dynamically modulates the contribution of geometric information at test time without retraining the backbone network. By extracting dual-modality features—appearance and geometry—and measuring their cross-modal inconsistency, the method employs a linear routing strategy to incorporate geometric cues only when they aid discrimination, thereby avoiding performance degradation in cases of well-aligned modalities. Evaluated on three open-set 3D retrieval benchmarks, the approach improves mAP@10 by 2.00 points on the primary benchmark, reduces geometric false positives by 10.8%, and demonstrates enhanced zero-shot generalization capability.
📝 Abstract
Large pretrained vision models have substantially improved appearance-based 3D shape retrieval, but they still confuse shapes that look similar while differing in geometry. Although geometry-aware features can reduce these errors, naive fusion of geometry and appearance may hurt retrieval when the two modalities are already well aligned. We propose GATE-3D, a lightweight query-adaptive reranking method that incorporates geometry without retraining the retrieval backbone. For each query, GATE-3D predicts how much a geometry-aware score should adjust the appearance-based ranking using features that capture disagreement between the two modalities. This selective design lets geometry contribute where it helps and stay silent where it would hurt. Experiments on three open-set 3D retrieval benchmarks show that GATE-3D improves over appearance-only retrieval and is more robust than always-on fusion. On the primary benchmark, it improves mAP@10 by 2.00 points over appearance-only retrieval (p=0.041); it also improves leave-one-category-out generalization and reduces geometric false positives by 10.8%. GATE-3D achieves competitive zero-shot results against DAC-based baselines. We further find that simple linear routing is more effective than a small MLP in the low-data regime, suggesting that cross-modal disagreement features matter more than model capacity for adaptive routing.