• 공학교육연구
• /
• 제15권5호
• /
• pp.93-97
• /
• 2012

Most of ubiquitous computing devices such as stereo camera, ultrasonic sensor based MIT cricket system and other wireless sensor network devices are widely applied to the 2 Dimensional(2D) localization system in today. Because stereo camera cannot estimate the optimal location between moving node and beacon node in Wireless Personal Area Network(WPAN) under Non Line Of Sight(NLOS) environment, it is a great weakness point to the design of the 2D localization system in indoor environment. But the conventional 2D triangulation scheme that is adapted to the MIT cricket system cannot estimate the 3 Dimensional(3D) coordinate values for estimation of the optimal location of the moving node generally. Therefore, the 3D triangulation scheme based on the space segmentation in WPAN is suggested in this paper. The measuring data in the suggested scheme by computer simulation is compared with that of the geographic measuring data in the AutoCAD software system. The average error of coordinates values(x,y,z) of the moving node is calculated to 0.008m by the suggested scheme. From the results, it can be seen that the location correctness of the suggested scheme is very excellent for using the localization system in WPAN.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.215-222
• /
• 1997

This paper deals with the problem of generating a uniform tetrahedral mesh which fills a 3-D space with the tetrahedra which are close to the equilateral tetrahedra as possible. This problem is particularly interesting in finite element modeling where a fat triangulation minimizes the error of an analysis. Fat triangulation is defined as a scheme for generating an equilateral triangulation as possible in a given dimension. In finite element modeling, there are many algorithms for generating a mesh in 2-D and 3-D. One of the difficulties in generating a mesh in 3-D is that a 3-D object can not be filled with uniform equilateral tetrahedra only regardless of the shape of the boundary. Fat triangulation in 3-D has been proved to be the one which fills a 3-D space with the tetrahedra which are close to the equilateral as possible. Topological and geometrical properties of the fat triangulation and its application to meshing algorithm are investigated.

• 제어로봇시스템학회논문지
• /
• 제11권1호
• /
• pp.34-40
• /
• 2005

In this paper, we describe the modeling for the 3D robot laser scanning system consisting of a laser stripe projector, camera, and 5-DOF robot and propose its calibration method. Nonlinear radial distortion in the camera model is considered for improving the calibration accuracy. The 3D range data is calculated using the optical triangulation principle which uses the geometrical relationship between the camera and the laser stripe plane. For optimal estimation of the system model parameters, real-coded genetic algorithm is applied in the calibration process. Experimental results show that the constructed system is able to measure the 3D position within about 1mm error. The proposed scheme could be applied to the kinematically dissimilar robot system without losing the generality and has a potential for recognition for the unknown environment.

• 한국CDE학회논문집
• /
• 제1권3호
• /
• pp.224-233
• /
• 1996

An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

• 방송공학회논문지
• /
• 제11권4호
• /
• pp.471-482
• /
• 2006

본 논문은 깊이맵의 정보 분해(information decomposition)와 적응적 경계 평탄 필터링(adaptive edge smooth filtering)을 이용하여 다시점 영상을 생성하는 방법을 제안한다. 제안한 방법은 깊이맵의 경계 영역에 평탄 필터링을 수행한 후, 깊이맵을 네 가지 종류의 분해 영상, 즉, 규칙 메쉬 영상, 경계 영상, 특징점 영상, 계층의 수 영상으로 변환한다. 그런 다음, 네 가지의 분해 영상에 3차원 메쉬 표현법을 적용하여 3차원 장면을 생성하고, 3차원 공간에서 가상 카메라의 위치를 변경하여 생성한 3차원 장면으로부터 다시점 영상을 추출한다. 실험 결과는 제안한 방법이 rubber-sheet 문제를 최소화하여 다시점 영상을 성공적으로 생성할 수 있었고, 깊이맵의 정보 분해를 통해 실시간으로 3차원 장면을 렌더링할 수 있었음을 보여준다. 또한, 제안한 방법은 기존의 방법과 달리 깊이맵 정보를 보존하기 때문에, 깊이 키잉(depth keying)과 같이 깊이 정보를 이용하는 3차원 응용에 활용할 수 있다.