【24h】

Polygonal Approximation of Point Sets

机译:点集的多边形近似

获取原文

摘要

Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge pixels/voxels in digital images. Polygonal approximation of edge pixels can also be interpreted as grouping of edge pixels to parts of object contours. The presented approach is described in the statistical framework of Expectation Maximization (EM) and in cognitively motivated geometric framework. We use local support estimation motivated by human visual perception to evaluate support in data points of EM components after each EM step. Consequently, we are able to recognize a locally optimal solution that is not globally optimal, and modify the number of model components and their parameters.
机译:我们的兴趣领域是点集的多边形(和多面体)近似。既不知道数据点的顺序,也不是所需的线段数量(表面贴片)的数量。特别地,点组可以通过安装在移动机器人上的激光范围扫描仪获得,或者在数字图像中作为边缘像素/体素给出。边缘像素的多边形近似也可以被解释为边缘像素的分组到对象轮廓的一部分。所提出的方法是在期望最大化(EM)和认知动机的几何框架中的统计框架中描述。我们使用人类视觉感知的本地支持估计来评估每个EM步骤后的EM组件的数据点中的支持。因此,我们能够识别不全局最佳的局部最佳解决方案,并修改模型组件的数量及其参数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号