계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성

Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm

  • 최영규 (한국기술교육대학교 정보기술공학부) ;
  • 박은진 (한국기술교육대학교 전기전자공학과)
  • 발행 : 2009.12.15

초록

본 논문에서는 입력 볼륨 데이터와 출력 메쉬 데이터에서 모두 계층성을 지원하는 새로운 등밀도 표면의 재구성 방법을 제안한다. 제안된 방법은 먼저 입력 볼륨 데이터로부터 3차원 팽창 필터를 사용하여 볼륨 피라미드라 불리는 볼륨의 계층구조를 만든다. 볼륨 피라미드가 만들어진 후 해상도가 최저인 피라미드의 최상단 볼륨에서부터 셀경계표현 방법을 이용하여 조악한 초기 메쉬를 생성한다. 이러한 메쉬를 반복적으로 변형하여 O(3)-인접성 조건하에서 추출한 등밀도점을 잘 근사하도록 하는데, 이를 위해 SWIS (표면축소기반의 등밀도면 재구성법[6]) 알고리즘에서 사용되었던 표면 축소 단계와 평활화 단계를 사용한다. 또한 최종등밀도면의 정밀한 표면을 만들 수 있도록 메쉬를 반복적으로 분할(subdivision)한다. 제안된 방법은 생성되는 표면이 표면의 압축이나 점진적인 전송 등과 같은 다중 해상도 알고리즘에 활용될 수 있다는 장점이 있다.

In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

키워드

참고문헌

  1. E. Lum, B. Wilson and K. Ma, "High-Quality Lighting and Efficient Pre-Integration for Volume Rendering," Eurographics/IEEE Symposium on Visualization, pp.25-34, 2004.
  2. G. Herman and H. Liu, "Three-dimensional display of human organs from computed tomograms," Computer Graphic and Image Processing, vol.9, pp.1-21, 1979. https://doi.org/10.1016/0146-664X(79)90079-0
  3. W. Lorensen and H. Cline, "Marching cubes: a high resolution 3-d surface construction algorithm," Comput, Graph, vol.21, no.4, pp.163-169, 1987. https://doi.org/10.1145/37402.37422
  4. W. J. Schroeder, J. A. Zarge and W. E. Lorensen, "Decimation of triangle meshes," Proc. of the 19th annual conference on Computer graphics and interactive techniques table of contents, pp.65-70, 1992.
  5. S. J. Kim, C. H. Kim and D. Leven, "Surface simplication using a discrete curvature norm," Computers and Graphics, vol.26, pp.657-663, 2002. https://doi.org/10.1016/S0097-8493(02)00121-8
  6. U. Labsik, K. Hormann, M. Meister and G. Greiner, "Hierarchical Iso-Surface Extraction," Journal of Computing and Information Science in Engineering, vol.2, no.4, pp.323-329, 2002. https://doi.org/10.1115/1.1559893
  7. 박은진, 최영규, "Shrink-Wrapping 알고리즘을 이용한 단층영상으로부터의 표면 재구성", 정보과학회논문지, 34권 1호, pp.28-37, 2007년 2월.
  8. 최영규, 이의택, "의료영상 가시화를 위한 셀 경계 방식 체적 재구성 방법", 정보과학회논문지, 27권, 3호, pp.235-244, 2000년 3월.
  9. M. Dures, "Letters: Additional Reference to Marching Cubes," Computer Graphics, vol.22, no.2, pp.72-73, 1988.
  10. G. Nielson and B. Hamann, "The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes," Proc. IEEE Visual Computer, vol.11, pp.52-62, 1994. https://doi.org/10.1007/BF01900699
  11. B. natarajan, "On Generating Topologically Consistent Isosurfaces from Uniform Samples," The Visual Computer, vol.11, pp.52-62, 1994. https://doi.org/10.1007/BF01900699
  12. A. Lopes, and K. Brodlie, "Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing," IEEE Transaction on Visualization and Computer Graphics, vol.9, no.1, pp.16-29, January-March 2003. https://doi.org/10.1109/TVCG.2003.1175094
  13. T. Newman and H. Yi, "A survey of the marching cubes algorithm," Computers & Graphics, vol.30, Issure 5, pp.854-879, Oct. 2006. https://doi.org/10.1016/j.cag.2006.07.021
  14. M. Desbrun, M. Meyer, P. Schroder, and A. H. Barr, "Implicit fairing of irregular meshes using diffusion and curvature flow," ACM Computer Graphics (SIGGRAPH '99 Proceedings), pp.317-324, 1999.
  15. C. Loop, "Smooth Subdivision Surfaces Based on Triangles," M.S. Thesis, Department of Mathematics, University of Utah, August 1987.
  16. L. Kobbelt, "3-subdivision," 27th annual conference on Computer graphics and interactive techniques, pp.103-112, July 2000
  17. G. Li, and W. Ma, " method for constructing interpolatory subdivisions and blending subdivisions," Computer Graphics Forum, vol.26, no.2, pp.185-201, 2007. https://doi.org/10.1111/j.1467-8659.2007.01015.x