← 研踪 PaperTrailarXiv:2611.20879 · v1
Multi-Rate Flow Matching for Point Cloud Upsampling
首次提交 2026-11-16 18:51
版本更新 2026-11-16 18:51
雷达观测 2026-11-17 17:11
摘要
Flow-matching point-cloud upsamplers refine sparse inputs into dense point clouds by integrating a learned velocity field with a fixed temporal discretization. However, local reconstruction requirements vary substantially across a shape, while a shared solver budget applies the same temporal resolution everywhere. We propose Multi-Rate Flow Matching (MRFM), a patch-adaptive framework that selects an integration budget for each local patch at inference time while keeping the learned velocity field frozen. MRFM relaxes the discrete budget into a continuous variable, optimizes it online through differentiable soft rollouts using an input-derived geometric fidelity objective, and projects the result back to a discrete budget for the final solver rollout. Experiments on PU1K and PUGAN show strong reconstruction quality, while matched-budget permutation and multi-factor analyses demonstrate that the benefit depends on patch-specific allocation rather than on the step distribution alone. MRFM is accuracy-oriented and intentionally uses additional test-time optimization to obtain more suitable local temporal resolutions.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 18:51 · 最新观测版本
Multi-Rate Flow Matching for Point Cloud Upsampling
Flow-matching point-cloud upsamplers refine sparse inputs into dense point clouds by integrating a learned velocity field with a fixed temporal discretization. However, local reconstruction requirements vary substantially across a shape, while a shared solver budget applies the same temporal resolution everywhere. We propose Multi-Rate Flow Matching (MRFM), a patch-adaptive framework that selects an integration budget for each local patch at inference time while keeping the learned velocity field frozen. MRFM relaxes the discrete budget into a continuous variable, optimizes it online through differentiable soft rollouts using an input-derived geometric fidelity objective, and projects the result back to a discrete budget for the final solver rollout. Experiments on PU1K and PUGAN show strong reconstruction quality, while matched-budget permutation and multi-factor analyses demonstrate that the benefit depends on patch-specific allocation rather than on the step distribution alone. MRFM is accuracy-oriented and intentionally uses additional test-time optimization to obtain more suitable local temporal resolutions.
查看此版本解读 →查看此版本原文 ↗