An Algebraic Solution to Surface Recovery from Cross-Sectional Contours

G Cong , B Parvin
{"title":"An Algebraic Solution to Surface Recovery from Cross-Sectional Contours","authors":"G Cong ,&nbsp;B Parvin","doi":"10.1006/gmip.1999.0499","DOIUrl":null,"url":null,"abstract":"<div><p>A new approach for reconstruction of 3D surfaces from 2D cross-sectional contours is presented. By using the so-called “equal importance criterion,” we reconstruct the surface based on the assumption that every point in the region contributes equally to the surface reconstruction process. In this context, the problem is formulated in terms of a partial differential equation, and we show that the solution for dense contours (contours in close proximity) can be efficiently derived from the distance transform. In the case of sparse contours, we add a regularization term to ensure smoothness in surface recovery. The approach is also generalized to other types of cross-sectional contours, where the spine may not be a straight line. The proposed technique allows for surface recovery at any desired resolution. The main advantages of our method is that inherent problems due to correspondence, tiling, and branching are avoided. In contrast to existing implicit methods, we find an optimal field function and develop an interpolation method that does not generate any artificial surfaces. We will demonstrate that the computed high-resolution surface is well represented for subsequent geometric analysis. We present results on both synthetic and real data.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 4","pages":"Pages 222-243"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0499","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077316999904999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

A new approach for reconstruction of 3D surfaces from 2D cross-sectional contours is presented. By using the so-called “equal importance criterion,” we reconstruct the surface based on the assumption that every point in the region contributes equally to the surface reconstruction process. In this context, the problem is formulated in terms of a partial differential equation, and we show that the solution for dense contours (contours in close proximity) can be efficiently derived from the distance transform. In the case of sparse contours, we add a regularization term to ensure smoothness in surface recovery. The approach is also generalized to other types of cross-sectional contours, where the spine may not be a straight line. The proposed technique allows for surface recovery at any desired resolution. The main advantages of our method is that inherent problems due to correspondence, tiling, and branching are avoided. In contrast to existing implicit methods, we find an optimal field function and develop an interpolation method that does not generate any artificial surfaces. We will demonstrate that the computed high-resolution surface is well represented for subsequent geometric analysis. We present results on both synthetic and real data.

从横截面轮廓面恢复的代数解
提出了一种从二维截面轮廓重构三维曲面的新方法。通过使用所谓的“同等重要准则”,我们基于区域中每个点对表面重建过程的贡献相等的假设来重建表面。在这种情况下,这个问题是用偏微分方程来表示的,我们证明了密集轮廓(接近的轮廓)的解可以有效地从距离变换中得到。在稀疏轮廓的情况下,我们增加了正则化项以保证表面恢复的平滑性。该方法也可以推广到其他类型的横截面轮廓,其中脊柱可能不是一条直线。所提出的技术允许在任何期望的分辨率下进行表面回收。我们的方法的主要优点是避免了由于对应、平铺和分支而产生的固有问题。与现有的隐式插值方法相比,我们找到了一个最优的场函数,并开发了一种不产生任何人工曲面的插值方法。我们将证明计算的高分辨率表面很好地表示了随后的几何分析。我们给出了合成数据和实际数据的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信