• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.511-520
• /
• 2009

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.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.413-422
• /
• 2007

This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.69-74
• /
• 2004

In this paper, we propose a novel method for improving defect-detection performance based on reconstruction of line-scan camera images using both the projection profiles and color space transform. The proposed method consists of RGB region segmentation, representative value reconstruction using the tracing system, and Y image reconstruction using color-space transformation. Through experiments it is demonstrated that the performance using the reconstructed image is better than that using aerial image for LCD surface inspection.

• Journal of Biomedical Engineering Research
• /
• v.18 no.4
• /
• pp.365-373
• /
• 1997

In this paper, a new method of the 3D(dimensional) image reconstruction is proposed to build up the 3D image from 2D images using digital image processing techniques and computer graphics. First, the new feature extraction algorithm that doesn't need various input parameters and is not affected by threshold is adopted This new algorithm extracts feature points by eliminating some undesirable points on the ground of the connectivity. Second, as the cast function to reconstruct surfaces using extracted feature points, the minimum distance measure between two plane images has been adopted According to this measure, the surface formation algorithm doesn't need complex calculation and takes the form of triangle or trapezoid To investigate usefulness, this approach has been applied to a head CT image and compared with other methods. Experimental comparisons show that the suggested algorithm yields better performance on feature extraction than others. In contrast with the other methods, the complex calculation for surface formation in the proposed algorithm is not necessary.

• Journal of Biomedical Engineering Research
• /
• v.21 no.3 s.61
• /
• pp.225-231
• /
• 2000

The Delaunay triangulation. which is one of the surface rendering methods. have been evaluated as a good algorithm which can solve the geometrical connection problems and make high quality images. However this method also have the problem that is the 'non-solid' connection between slices. In this paper, we proposed a new method for the Delaunay triangulation for the surface rendering from 2D medical images in the PC environment. The proposed method was designed to eliminate 'non-solid' tetrahedra. which had no correspondence to the geometric closeness, and used elimination algorithm with modified External Voronoi Skeleton path. This method enabled us to eliminate 'non-solid' tetrahedra without affecting other regions. Thus we could effectively reconstruct the complex shaped objects which were compactly connected with tetrahedra.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.418-425
• /
• 2005

3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.510-514
• /
• 2006

역경계요소법에 기초한 근접음장 음향홀로그래피는 근접 음장에서의 음압 측정과 음향경계요소법을 이용한 전달함수를 이용하여 소음원의 특성을 재구성하고, 임의 형상의을 갖는 소음원을 재구성 할 수 있는 강점이 있지만, 음압 측정에 많은 마이크로폰이 필요로 한다. 많은 실험 비용을 줄이기 위해, 본 연구에서는 마이크로폰이 고정된 상태에서 반사체를 추가하여 음장을 변화시키고, 이 상태에서 측정된 음압을 음원 재구성의 추가 정보로 이용하는 방법이 제안되고, 적용예제로서 모터의 표면 속도를 재구성 하였다. 직육면체 강체 반사체를 이용하여, 각 마이크로폰 위치에서 2 배수의 음압을 얻어, 이를 재구성에 이용하였다. 또한 수치유효랭크를 이용하여 재구성에 사용된 모우드의 개수를 계산하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.895-897
• /
• 2004

3차원 모델 재구성 방법 중 하나는 평행한 2차원 영상위의 외곽선들을 이용하여 본래의 기하정보를 복원하는 것이다. 표면 재구성 과정은 크게 대응관계 결정, 타일화, 분기처리로 이루어진다. 단순한 외곽선의 쌍인 경우에는 간단한 방법으로 기하정보를 생성할 수 있으나, 하나의 외곽선이 인접 슬라이스의 여러 외곽선으로 분기되는 경우는 처리가 쉽지 않다. 본 논문에서는 분기가 있는 복잡한 외곽선의 쌍으로부터 본래의 형상을 재구성하는 알고리즘을 제안한다. 먼저 외곽선의 각 정점에 대응하는 인접 외곽선의 최단거리 정점들을 찾아서 기본영역을 타일화 하고 남은 부분(클레프트)들은 대응하는 잔여 정점들의 중점을 찾아 타일화 한다. 이렇게 함으로써 여러 개로 분기된 외곽선을 본래의 형상으로 재구성 할 수 있으며 이를 실험을 통하여 확인하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.9
• /
• pp.791-799
• /
• 2016

This paper presents the design of reconfigurable frequency selective surfaces for X-band bandpass operation with improved isolation. The proposed reconfigurable FSS is composed of a four-legged loaded element, a inductive stub and a bias grid. The PIN diode is located between the four-legged loaded element and the stub, which can control the frequency response of reconfigurable FSS by ON/OFF state. By adjusting the length of the stub, the desired bandpass frequency and the improved isolation between ON and OFF state can be obtained. For validation of simulated results, we have carried out transmission characteristic measurements using rectangular waveguide of WR-90. The measured results are in good agreements with the simulated results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.715-717
• /
• 2003

2차원 의료 영상으로부터 3차원 모델을 재구성 하면 여러 의학 분야에 효과적으로 활용할 수 있다. 컬러 영상이나 MRI의 영상은 표면을 자동으로 식별하기 어렵기 때문에 구역화한 결과로 나오는 외곽선으로부터 표면을 재구성해야한다. 표면 재구성을 위한 기존의 삼각형화 알고리즘은 모델이 복잡할 경우 수행속도가 저하되는 단점이 있다. 본 논문에서는 정합되는 부분과 나머지 부분을 따로 처리하는 기존 방법 대신에, 알맞은 위치에 연결간선들만 결정하여 연결한 후, 그 사이의 정점들을 연결하는 간단한 삼각형화 알고리즘으로 속도를 향상시키는 방법을 제안한다.