In this paper, we present a method for denoising and reconstruction of low-dimensional manifold in high-dimensional space. We suggest a multidimensional extension of the Locally Optimal Projection algorithm which was introduced by Lipman et al. in 2007 for surface reconstruction in 3D. The method bypasses the curse of dimensionality and avoids the need for carrying out dimensional reduction. It is based on a non-convex optimization problem, which leverages a generalization of the outlier robust L1-median to higher dimensions while generating noise-free quasi-uniformly distributed points reconstructing the unknown low-dimensional manifold. We develop a new algorithm and prove that it converges to a local stationary solution with a bounded linear rate of convergence in case the starting point is close enough to the local minimum. In addition, we show that its approximation order is $O(h^2)$, where $h$ is the representative distance between the given points. We demonstrate the effectiveness of our approach by considering different manifold topologies with various amounts of noise, including a case of a manifold of different co-dimensions at different locations.
翻译:在本文中,我们提出了一个在高维空间中分解和重建低维元的方法。我们建议采用Lipman等人于2007年为3D地面重建引进的局部最佳投影算法的多层面扩展。这种方法绕过维度的诅咒,避免了进行维度缩小的需要。它基于非碳化优化问题,它利用了将外部强力L1-中位元普遍化到更高维度,同时生成了无噪音的准统一分布点来重建未知的低维元。我们开发了一种新的算法,并证明它与当地固定的解决方案趋同,在起点接近当地最低线性时,具有界限线性趋同率。此外,我们还表明其近似值为$O(h)2美元,其中美元是给定点之间的代表距离。我们通过考虑具有不同噪音的不同多元性,包括不同地点不同共位数的情况,证明了我们的方法的有效性。