论文标题
mops-net:矩阵优化驱动的网络面向fortask的3D点云降采样
MOPS-Net: A Matrix Optimization-driven Network forTask-Oriented 3D Point Cloud Downsampling
论文作者
论文摘要
本文探讨了以任务为导向的3D点云上的成采样的问题,该问题的目的是将点云下样本下采样,同时保持尽可能多地应用于下采样稀疏点的后续应用程序的性能。从矩阵优化的角度设计,我们提出了一种新型的基于可解释的深度学习方法的MOP-NET,该方法与现有的基于深度学习的方法从根本上不同。优化问题由于其离散和组合性质而具有挑战性。我们通过放松变量的二进制约束来应对挑战,并制定约束且可区分的矩阵优化问题。然后,我们设计一个深神网络,通过探索输入数据的局部和全局结构来模仿矩阵优化。 MOPS-NET可以通过任务网络进行端到端培训,并且是置换不变的,从而使其对输入变得强大。我们还扩展了MOPS-NET,以便一次性训练后的单个网络能够处理任意的下采样率。广泛的实验结果表明,MOPS-NET可以在各种任务(包括分类,重建和注册)的基于最新的深度学习方法上实现有利的性能。此外,我们在嘈杂的数据上验证了MOPS-NET的鲁棒性。
This paper explores the problem of task-oriented downsampling over 3D point clouds, which aims to downsample a point cloud while maintaining the performance of subsequent applications applied to the downsampled sparse points as much as possible. Designing from the perspective of matrix optimization, we propose MOPS-Net, a novel interpretable deep learning-based method, which is fundamentally different from the existing deep learning-based methods due to its interpretable feature. The optimization problem is challenging due to its discrete and combinatorial nature. We tackle the challenges by relaxing the binary constraint of the variables, and formulate a constrained and differentiable matrix optimization problem. We then design a deep neural network to mimic the matrix optimization by exploring both the local and global structures of the input data. MOPS-Net can be end-to-end trained with a task network and is permutation-invariant, making it robust to the input. We also extend MOPS-Net such that a single network after one-time training is capable of handling arbitrary downsampling ratios. Extensive experimental results show that MOPS-Net can achieve favorable performance against state-of-the-art deep learning-based methods over various tasks, including classification, reconstruction, and registration. Besides, we validate the robustness of MOPS-Net on noisy data.