Browse

Implicit Surface Reconstruction from Scattered Point Data on Octree and Feature Detection on the Implicit Surface
팔진트리상에서 산재한 점군으로부터의 음함수 곡면 재구성과 음함수 곡면의 특징 탐지

DC Field Value Language
dc.contributor.advisor강명주-
dc.contributor.author박창수-
dc.date.accessioned2017-07-14T00:40:04Z-
dc.date.available2017-07-14T00:40:04Z-
dc.date.issued2013-02-
dc.identifier.other000000009507-
dc.identifier.urihttps://hdl.handle.net/10371/121262-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 수리과학부, 2013. 2. 강명주.-
dc.description.abstractIn this thesis, we are concerned with reverse engineering process using implicit surface represented by level set. We consider two methods. One is to reconstruct implicit surface from scattered point data on octree and the other detects features such as edges and corners on the implicit surface.

Our surface reconstruction method is based on the level set method using octree i.e. a kind of adaptive grid. We start with the surface reconstruction model proposed in Ye's where they considered the surface reconstruction process as an elliptic problem while most previous methods employed the time marching process from an initial surface to point cloud. However, as far as their method is implemented on uniform grid, it exposes inefficiency such as the high cost of memory. We improved it by adapting octree data structure to our problem and by introducing a new redistancing algorithm which is different from the existing one.

We also address feature detection from 3D CT image which is a form of implicit surface. While laser scanner is accurate and has little noise, it can't examine the inside of object. So, CT scanner is recently becoming popular for non-destructive inspection of mechanical part. But for reverse engineering, we should transform 3D image data into B-spline surface data in order to use it on CAD software, that is, change from implicit surface to parametric surface. In that process, we need feature detection for parametrization of surface. But it has more artifacts such as noise and blur than laser scanner. Consequently, preprocess for reducing artifacts is required. We apply some existing denoising algorithms to CT image data and then extract edges and corners with our feature detection method.
-
dc.description.tableofcontents1. Introduction
2. Surface Reconstruction Method from Scattered Point Data on Octree
2.1 Previous work
2.1.1 History
2.1.2 Fast sweeping method
2.1.3 Basic finite difference methods on octree
2.1.4 Biconjugate gradient stabilized(BICGSTAB)
algorithm
2.2 Mathematical models
2.3 Numerical method
2.3.1 Tree generation and splitting condition
2.3.2 Distance function
2.3.3 Initial guess of signed distance function
2.3.4 Numerical discretization of model (2.2.6) on
octree
2.4 Results
2.4.1 Five-leafed clover
2.4.2 Bunny, Dragon, Happy buddha
3 Feature Detection on Implicit Surface
3.1 Related work and background
3.1.1 Segmentation with the level set method
3.1.2 Signed distance function
3.1.3 Nonlocal means filtering
3.2 Corner and sharp edge detection
3.2.1 Corner detection
3.2.2 Sharp edge detection
3.2.3 False feature removal
3.3 Results
4 Conclusion and Further Work
-
dc.formatapplication/pdf-
dc.format.extent2963196 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectlevel set method-
dc.subjectsurface reconstruction-
dc.subjectimplicit surface-
dc.subjectpartial differential equation-
dc.subjectoctree-
dc.subjectfeature detection-
dc.subjectreverse engineering-
dc.subject.ddc510-
dc.titleImplicit Surface Reconstruction from Scattered Point Data on Octree and Feature Detection on the Implicit Surface-
dc.title.alternative팔진트리상에서 산재한 점군으로부터의 음함수 곡면 재구성과 음함수 곡면의 특징 탐지-
dc.typeThesis-
dc.contributor.AlternativeAuthorPark, Changsoo-
dc.description.degreeDoctor-
dc.citation.pages66-
dc.contributor.affiliation자연과학대학 수리과학부-
dc.date.awarded2013-02-
Appears in Collections:
College of Natural Sciences (자연과학대학)Dept. of Mathematical Sciences (수리과학부)Theses (Ph.D. / Sc.D._수리과학부)
Files in This Item:
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse