Hugging Face Trending Papers

Recovering Black-Box Point Cloud Models from Pose Shifts via Derivative-Free Optimization

arXiv AI
Oct 27

Recovering Black-Box Point Cloud Models from Pose Shifts via Derivative-Free Optimization

The paper introduces CanDO, a test‑time canonicalization technique that restores performance of score‑only black‑box point cloud models when faced with pose shifts. CanDO searches for an input transformation that maximizes model confidence using derivative‑free optimization, requiring only forward queries. Experiments show that it recovers 76% of the oracle gap for azimuthal misorientation and 51% for arbitrary SO(3) rotations in object part segmentation tasks.

By Seonghwan Park, Min-Gyu Park
Hugging Face Trending Papers
Jun 23

REDI-Match: Rotation-Equivariant Distillation for Efficient and Robust Dense Matching

Vision Foundation Models (VFMs) have significantly advanced dense feature matching, yet severe in-plane rotation remains a critical challenge. Existing solutions face a fundamental dilemma: data-driven methods require inefficient parameter scaling to implicitly learn rotations, whereas strictly equivariant networks lack the semantic capacity of modern VFMs.

arXiv Computer Vision
Sep 18

GAPrompt++: Multi-Granular Geometry-Aware Point Cloud Prompt for 3D Vision Model

GAPrompt++ is a multi-granular geometry-aware prompting method designed to adapt pre-trained 3D vision models to downstream tasks efficiently. It introduces a Point Shift Prompter for multi-scale geometric feature extraction, a Keypoint Prompter for local geometric saliency, and a Prompt Propagation mechanism to embed these cues throughout the model hierarchy. Experiments demonstrate that GAPrompt++ outperforms other prompting-based PEFT methods and even surpasses full fine-tuning while using less than 2% trainable parameters, and the authors provide two new challenging benchmarks for future research.

By Zixiang Ai, Zhenyu Cui, Yufei Guo, Wenwen Qiang, Lei Chen, Jiwen Lu, Jiahuan Zhou
arXiv Computer Vision
Oct 16

SATOR: Backpropagation-Free 3D Test-Time Adaptation via Sample-Adaptive Token Routing

SATOR is a source‑free, backpropagation‑free framework for test‑time adaptation of 3D point cloud models. It eliminates the need for predefined purge‑size candidates by computing token abnormality scores from attention and geometric graphs, then using an Otsu‑based threshold to partition tokens into retained and pruned sets. A keep‑ratio‑calibrated routing step selects the pruned prediction only when its entropy, adjusted by the keep ratio, is lower than that of the original prediction, achieving state‑of‑the‑art accuracy on three 3D corruption benchmarks.

By Inseok Kong, Geunyoung Jung, Jiyoung Jung
arXiv Computer Vision
Sep 17

Position Anchor Tuning: Towards Efficient Adaptation of Pre-Trained Point Cloud Transformers

Position Anchor Tuning (PAT) is a parameter‑efficient fine‑tuning method for pre‑trained point cloud transformers that improves inference efficiency. PAT reduces the computational cost of multi‑head attention and feed‑forward networks by using token aggregation‑expansion pairs: a token aggregation module (TAM) selects representative tokens based on 3D position anchors, and a token expansion module (TEM) propagates the learned representations back to the full token set. Combined with base‑sharing low‑rank adaptation (BSLoRA) for the TAMs, PAT achieves performance comparable to state‑of‑the‑art methods while requiring fewer trainable parameters and lower computational overhead.

By Zheng Liu, Xin Gao, Jinchao Zhu, Gao Huang
arXiv Computer Vision
Oct 16

SpaceCache: Intermediate Feature Reuse for Efficient Semantic Segmentation on Point Cloud Streams

SpaceCache is a training‑free feature cache that reuses intermediate features from point‑cloud transformers across consecutive frames, allowing tokens of previously seen regions to skip transformer blocks and only compute new tokens. The method limits cache entry age and evicts low‑confidence entries to maintain reliability, and it operates once per encoder stage at negligible cost. Experiments on outdoor and indoor datasets (nuScenes, Waymo, ScanNet) with Utonia and LitePT‑B backbones show up to 1.65× speedup with less than 1‑point mIoU loss, outperforming token‑merging approaches.

By Dongheon Yang, Beomseok Kang, Jae-Joon Kim