{"title":"从横截面轮廓面恢复的代数解","authors":"G Cong , 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":"{\"title\":\"An Algebraic Solution to Surface Recovery from Cross-Sectional Contours\",\"authors\":\"G Cong , 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}","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}
An Algebraic Solution to Surface Recovery from Cross-Sectional Contours
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.