paper-with-me

홈 › Papers

Sampling Network Guided Cross-Entropy Method for Unsupervised Point Cloud Registration

2021-09-14 · ICCV 2021 10 · Haobo Jiang, Yaqi Shen, Jin Xie, Jun Li, Jianjun Qian, Jian Yang

In this paper, by modeling the point cloud registration task as a Markov decision process, we propose an end-to-end deep model embedded with the cross-entropy method (CEM) for unsupervised 3D registration. Our model consists of a sampling network module and a differentiable CEM module. In our sampling network module, given a pair of point clouds, the sampling network learns a prior sampling distribution over the transformation space. The learned sampling distribution can be used as a "good" initialization of the differentiable CEM module. In our differentiable CEM module, we first propose a maximum consensus criterion based alignment metric as the reward function for the point cloud registration task. Based on the reward function, for each state, we then construct a fused score function to evaluate the sampled transformations, where we weight the current and future rewards of the transformations. Particularly, the future rewards of the sampled transforms are obtained by performing the iterative closest point (ICP) algorithm on the transformed state. By selecting the top-k transformations with the highest scores, we iteratively update the sampling distribution. Furthermore, in order to make the CEM differentiable, we use the sparsemax function to replace the hard top-$k$ selection. Finally, we formulate a Geman-McClure estimator based loss to train our end-to-end registration model. Extensive experimental results demonstrate the good registration performance of our method on benchmark datasets.

📄 PDF Abstract BibTeX arXiv:2109.06619

Code (1)

jiang-hb/cemnet 공식 구현 pytorch

Tasks

Point Cloud Registration

Methods 이 논문이 사용한 방법론

Sparsemax Sparsemax is a type of activation/output function similar to the traditional softmax, but able to output sparse probabilities.…

Similar Papers 제목 키워드 기반

Sample Where You Struggle: Sharpening Base Model Reasoning via Entropy-Guided Power Sampling

2026-06-07 · Hong Guo, Nianhui Guo, Christoph Meinel, Haojin Yang arxiv

Sampling from the sequence-level power distribution $p^α$ elicits RL-level reasoning from base language models without any parameter updates, but the standard Metropolis--Hastings (MH), a Markov Chain Monte Carlo (MCMC) …

CLIPoint3D: Language-Grounded Few-Shot Unsupervised 3D Point Cloud Domain Adaptation

2026-02-23 · Mainak Singha, Sarthak Mehrotra, Paolo Casari, Subhasis Chaudhuri 외 arxiv

Recent vision-language models (VLMs) such as CLIP demonstrate impressive cross-modal reasoning, extending beyond images to 3D perception. Yet, these models remain fragile under domain shifts, especially when adapting fro…

parameter-efficient fine-tuningDomain AdaptationPoint Clouds

Gleo-Det: Deep Convolution Feature-Guided Detector with Local Entropy Optimization for Salient Points

2022-04-27 · Chao Li, Yanan You, Wenli Zhou

Feature detection is an important procedure for image matching, where unsupervised feature detection methods are the detection approaches that have been mostly studied recently, including the ones that are based on repea…

Q-Learning for Continuous Actions with Cross-Entropy Guided Policies

2019-03-25 · Riley Simmons-Edler, Ben Eisner, Eric Mitchell, Sebastian Seung 외

Off-Policy reinforcement learning (RL) is an important class of methods for many problem domains, such as robotics, where the cost of collecting data is high and on-policy methods are consequently intractable. Standard m…

Q-LearningReinforcement LearningReinforcement Learning (RL)

Entropy-Guided Data-Efficient Training for Multimodal Reasoning Reward Models

2026-02-02 · Shidong Yang, Tongwen Huang, Hao Wen, Yong Wang 외 arxiv

Multimodal reward models are crucial for aligning multimodal large language models with human preferences. Recent works have incorporated reasoning capabilities into these models, achieving promising results. However, tr…

Multimodal Reasoning