Modeling dense range images through fast polygonal approximations

H. Pedrini
{"title":"Modeling dense range images through fast polygonal approximations","authors":"H. Pedrini","doi":"10.1109/ICIAP.2001.957050","DOIUrl":null,"url":null,"abstract":"A method for approximating range images by integrating triangular meshes and curvature information is presented. First, an adaptive filtering technique is applied to the original range image based on estimations of the surface curvature. This produces a collection of 3D points, which are triangulated in order to produce an initial mesh. The mesh is then refined through an efficient Delaunay triangulation algorithm. A new local error measure is used to select points to be inserted into the triangulation. Points tend to scatter in planar areas and to concentrate in high variation areas. The method allows representations to be retrieved at variables levels of accuracy, providing a natural way of multiresolution modeling. Some experimental results are presented to show that the proposed technique is effective to represent range images.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th International Conference on Image Analysis and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAP.2001.957050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

A method for approximating range images by integrating triangular meshes and curvature information is presented. First, an adaptive filtering technique is applied to the original range image based on estimations of the surface curvature. This produces a collection of 3D points, which are triangulated in order to produce an initial mesh. The mesh is then refined through an efficient Delaunay triangulation algorithm. A new local error measure is used to select points to be inserted into the triangulation. Points tend to scatter in planar areas and to concentrate in high variation areas. The method allows representations to be retrieved at variables levels of accuracy, providing a natural way of multiresolution modeling. Some experimental results are presented to show that the proposed technique is effective to represent range images.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过快速多边形近似建模密集范围图像
提出了一种结合三角形网格和曲率信息的距离图像逼近方法。首先,基于表面曲率估计对原始距离图像进行自适应滤波;这将生成一个3D点的集合,这些点将被三角化以生成初始网格。然后通过有效的Delaunay三角剖分算法对网格进行细化。采用一种新的局部误差度量来选择插入三角测量的点。点在平面区域趋向分散,在高变化区域趋向集中。该方法允许在变量精度级别上检索表示,从而提供了一种自然的多分辨率建模方法。实验结果表明,该方法可以有效地表示距离图像。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Circle detection based on orientation matching Towards teleconferencing by view synthesis and large-baseline stereo Learning and caricaturing the face space using self-organization and Hebbian learning for face processing Bayesian face recognition with deformable image models Using feature-vector based analysis, based on principal component analysis and independent component analysis, for analysing hyperspectral images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1