arXiv:2510.15800cs.CV2025-10ICCV

提出高效点云序列非刚性配准网络,解决噪声与长序列误差累积问题。

ERNet: Efficient Non-Rigid Registration Network for Point Sequences

  • 分两阶段预测变形图:先粗略估计每帧节点,再滑动窗口优化轨迹
  • 在DeformingThings4D和D-FAUST上优于当前最佳方法,速度提升4倍以上
  • 适用于有噪声或部分输入的动态3D形状跟踪,尤其适合实时应用

将物体形状配准到经历非刚性形变的点云序列是一项长期挑战。主要难点在于:(i) 由于配准目标函数非凸,在噪声或不完整输入下易陷入局部极小值,影响形变估计的准确性和鲁棒性;(ii) 长序列中误差累积导致追踪失败。为此,我们提出一种可扩展的数据驱动方法ERNet,一个基于大规模形变数据集训练的高效前馈模型,能处理噪声和部分输入,并有效利用时序信息实现精准一致的序列配准。其核心设计是通过两阶段流程预测一系列变形图:先估计每帧粗粒度图节点以实现鲁棒初始化,再以滑动窗口方式优化其时间轨迹。大量实验表明,该方法在DeformingThings4D和D-FAUST数据集上均超越现有最先进水平,且相比最优基线速度提升超过4倍,显著提升效率。

原文摘要 · Abstract (English)

Registering an object shape to a sequence of point clouds undergoing non-rigid deformation is a long-standing challenge. The key difficulties stem from two factors: (i) the presence of local minima due to the non-convexity of registration objectives, especially under noisy or partial inputs, which hinders accurate and robust deformation estimation, and (ii) error accumulation over long sequences, leading to tracking failures. To address these challenges, we introduce to adopt a scalable data-driven approach and propose ERNet, an efficient feed-forward model trained on large deformation datasets. It is designed to handle noisy and partial inputs while effectively leveraging temporal information for accurate and consistent sequential registration. The key to our design is predicting a sequence of deformation graphs through a two-stage pipeline, which first estimates frame-wise coarse graph nodes for robust initialization, before refining their trajectories over time in a sliding-window fashion. Extensive experiments show that our proposed approach (i) outperforms previous state-of-the-art on both the DeformingThings4D and D-FAUST datasets, and (ii) achieves more than 4x speedup compared to the previous best, offering significant efficiency improvement.

点云配准非刚性变形时序建模高效算法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。