使用水平集方法的快速表面重建

Hongkai Zhao, S. Osher, Ronald Fedkiw
{"title":"使用水平集方法的快速表面重建","authors":"Hongkai Zhao, S. Osher, Ronald Fedkiw","doi":"10.1109/VLSM.2001.938900","DOIUrl":null,"url":null,"abstract":"We describe new formulations and develop fast algorithms for implicit surface reconstruction based on variational and partial differential equation (PDE) methods. In particular we use the level set method and fast sweeping and tagging methods to reconstruct surfaces from a scattered data set. The data set might consist of points, curves and/or surface patches. A weighted minimal surface-like model is constructed and its variational level set formulation is implemented with optimal efficiency. The reconstructed surface is smoother than piecewise linear and has a natural scaling in the regularization that allows varying flexibility according to the local sampling density. As is usual with the level set method we can handle complicated topology and deformations, as well as noisy or highly nonuniform data sets easily. The method is based on a simple rectangular grid, although adaptive and triangular grids are also possible. Some consequences, such as hole filling capability, are demonstrated, as well as the viability and convergence of our new fast tagging algorithm.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"472","resultStr":"{\"title\":\"Fast surface reconstruction using the level set method\",\"authors\":\"Hongkai Zhao, S. Osher, Ronald Fedkiw\",\"doi\":\"10.1109/VLSM.2001.938900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe new formulations and develop fast algorithms for implicit surface reconstruction based on variational and partial differential equation (PDE) methods. In particular we use the level set method and fast sweeping and tagging methods to reconstruct surfaces from a scattered data set. The data set might consist of points, curves and/or surface patches. A weighted minimal surface-like model is constructed and its variational level set formulation is implemented with optimal efficiency. The reconstructed surface is smoother than piecewise linear and has a natural scaling in the regularization that allows varying flexibility according to the local sampling density. As is usual with the level set method we can handle complicated topology and deformations, as well as noisy or highly nonuniform data sets easily. The method is based on a simple rectangular grid, although adaptive and triangular grids are also possible. Some consequences, such as hole filling capability, are demonstrated, as well as the viability and convergence of our new fast tagging algorithm.\",\"PeriodicalId\":445975,\"journal\":{\"name\":\"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"472\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VLSM.2001.938900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLSM.2001.938900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 472

摘要

我们描述了基于变分和偏微分方程(PDE)方法的隐式表面重构的新公式和快速算法。特别地,我们使用水平集方法和快速扫描和标记方法从分散的数据集重建表面。数据集可能由点、曲线和/或表面斑块组成。构造了一个加权最小类曲面模型,并以最优效率实现了该模型的变分水平集公式。重建的表面比分段线性更光滑,并且在正则化中具有自然尺度,允许根据局部采样密度变化灵活性。与通常的水平集方法一样,我们可以很容易地处理复杂的拓扑和变形,以及有噪声或高度不均匀的数据集。该方法是基于一个简单的矩形网格,尽管自适应和三角形网格也是可能的。一些结果,如孔填充能力,以及我们的新的快速标记算法的可行性和收敛性进行了演示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast surface reconstruction using the level set method
We describe new formulations and develop fast algorithms for implicit surface reconstruction based on variational and partial differential equation (PDE) methods. In particular we use the level set method and fast sweeping and tagging methods to reconstruct surfaces from a scattered data set. The data set might consist of points, curves and/or surface patches. A weighted minimal surface-like model is constructed and its variational level set formulation is implemented with optimal efficiency. The reconstructed surface is smoother than piecewise linear and has a natural scaling in the regularization that allows varying flexibility according to the local sampling density. As is usual with the level set method we can handle complicated topology and deformations, as well as noisy or highly nonuniform data sets easily. The method is based on a simple rectangular grid, although adaptive and triangular grids are also possible. Some consequences, such as hole filling capability, are demonstrated, as well as the viability and convergence of our new fast tagging algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信