首页> 外文会议>Advances in Artificial Reality and Tele-Existence; Lecture Notes in Computer Science; 4282 >Kd-Tree Based OLS in Implicit Surface Reconstruction with Radial Basis Function
【24h】

Kd-Tree Based OLS in Implicit Surface Reconstruction with Radial Basis Function

机译:基于Kd-Tree的OLS径向基函数隐式曲面重构

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose a new method for surface reconstruction from scattered point set based on least square radial basis function (LSRBF) and orthogonal least square forward selection procedure. Firstly, the traditional RBF formulation is rewritten into least square formula. A implicit surface can be represented with fewer centers. Then, the orthogonal least square procedure is utilized to select significant centers from original point data set. The RBF coefficients can be solved from the triangular matrix from OLS selection through backward substitution method. So, this scheme can offer a fast surface reconstruction tool and can overcome the numerical ill-conditioning of coefficient matrix and over-fitting problem. Some examples are presented to show the effectiveness of our algorithm in 2D and 3D cases.
机译:本文提出了一种基于最小二乘径向基函数(LSRBF)和正交最小二乘正向选择程序的从散乱点集重构曲面的新方法。首先,将传统的RBF公式重写为最小二乘公式。隐式曲面可用更少的中心表示。然后,使用正交最小二乘法从原始点数据集中选择重要的中心。 RBF系数可以通过OLS选择的三角矩阵通过后向替换法求解。因此,该方案可以提供一种快速的曲面重建工具,并且可以克服系数矩阵的数值不适和过度拟合的问题。提出了一些示例以显示我们的算法在2D和3D情况下的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号