• Journal of the Korea Computer Graphics Society
• /
• v.11 no.1
• /
• pp.31-39
• /
• 2005

음함수 표면을 이용한 모델링 방법은 부드러운 곡면을 나타내기에 적합하며 날카로운 부분을 표현하기 위해서는 CSG 연산을 적용한다. 기존의 방식을 이용해서 얻은 매쉬에서는 흔히 음함수의 표면과 상당한 오차를 가지는 매쉬 첨점(vertex)을 얻거나 겹쳐지는 삼각형 또는 날카로운 부분의 표현이 안 되는 점 등의 문제가 나타난다. 본 논문에서는 타원체의 특성을 이용해서 타원체 기반 음함수 표면을 정확하게 샘플링하고 동시에 날카로운 부분을 효과적으로 표현할 수 있는 매쉬를 얻기 위한 폴리곤화 방법을 제안한다. 이러한 목표를 위해 타원체의 투사 특성과 표면 법선 벡터의 연속 특성을 이용해서 음함수 표면 위에 정확하게 위치하는 첨점(vertex)의 위치를 찾고 날카로운 부분을 효과적으로 표현하기 위해 점진적인 방법으로 정확한 첨점(vertex) 위치를 찾는 방법을 제안한다. 지금까지 약점으로 지적되어 왔던 음함수 표면 모델링의 시각화 절차를 이 방법을 통해 개선함으로써 음함수 표면 모델링 기법이 제공하는 다른 장점들을 적극 활용할 수 있을 것으로 기대한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.2
• /
• pp.47-55
• /
• 2019

In this paper, we propose a method for vehicle plate detection using depth information which is not influenced by illumination. The 3D camera coordinates of pixels in each block are obtained by using the depth information. Factors of the plane in the block are calculated by 3D coordinates of pixels. After that, the plane similarity between adjacent blocks is calculated by comparing between factors of planes. The adjacent blocks are grouped if the plane similarity is high so that the plane areas are detected. The actual height and width of the plane area are calculated by using depth information and compared with the vehicle plate in order to detect the vehicle plate.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.307-317
• /
• 2002

In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.425-438
• /
• 2012

In this paper, We propose Augmented Reality (AR) System for the interaction between user's hand motion and virtual object motion based on computer vision. The previous AR system provides inconvenience to user because the users have to control the marker and the sensor like a tracker. We solved the problem through hand motion and provide the convenience to the user. Also the motion of virtual object using a physical phenomenon gives a reality. The proposed system obtains geometrical information by the marker and hand. The system environments like virtual space of moving virtual ball and bricks are made by using the geometrical information and user's hand motion is obtained from the hand's information with extracted feature point through the taping hand. And it registers a virtual plane stably by getting movement of the feature points. The movement of the virtual ball basically is parabolic motion with a parabolic equation. When the collision occurs either the planes or the bricks, we show movement of the virtual ball with ball position and normal vector of plane and the ball position is faulted. So we showed corrected ball position through experiment. and we proved that this system can replaced the marker system to compare to jitter of augmented virtual object and progress speed with it.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.562-568
• /
• 2016

Point cloud data can be expressed in a specific coordinate system of a data set with a large number of points, to represent any form that generally has different characteristics in the three-dimensional coordinate space. This paper is aimed at finding a cylindrical pipe in the point cloud of the three-dimensional coordinate system using RANSAC, which is faster than the conventional Hough Transform method. In this study, the proposed cylindrical pipe is estimated by combining the results of parameters based on two mathematical models. The two kinds of mathematical models include a sphere and line, searching the sphere center point and radius in the cylinder, and detecting the cylinder with straightening of center. This method can match cylindrical pipe with relative accuracy; furthermore, the process is rapid except for normal estimation and segmentation. Quick cylinders matching could benefit from laser scanning and reverse engineering construction sectors that require pipe real-time estimates.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.866-876
• /
• 1996

A feature extraction method for the objects that have a circular cross section is proposed.To implement a robust recognition system which can effectively deal with various types of 2-dimensional image and 3-dimensional image, both 2- dimensional information and 3-dimensional information should be collectively extracted and combined for the optimum. For this, this paper presents a feature extraction method for 3-dimensional objects, particularly for the objects with a circular cross section which most objects in the real world are known to have. Firstly, the Z gradient is proposed to extract the shape information from those objects. Using this information, normal vectors are derived from the surface patches. The intersection points between the vectors are applied to the geometric feature extraction.Also, for more accurate recognition, a feature extraction method for between surface regions is proposed.Finally, the extraction method of function information is investigated for the final recognition process.The usefulness of the proposed method is proved through the experimentation.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.298-308
• /
• 2000

We present an efficient algorithm for finding the sequence of extreme vortices of a moving regular convex polyhedron of with respect to a fixed plane H.. The algorithm utilizes the spherical Voronoi diagram that results from the outward unit normal vectors nF$_{i}$ 's of faces of P. It is well-known that the Voronoi diagram of n sites in the plane can be computed in 0(nlogn) time, and this bound is optimal. However. exploiting the convexity of P, we are able to construct the spherical Voronoi diagram of nF$_{i}$ ,'s in O(n) time. Using the spherical Voronoi diagram, we show that an extreme vertex problem can be transformed to a spherical point location problem. The extreme vertex problem can be solved in O(logn) time after O(n) time and space preprocessing. Moreover, the sequence of extreme vertices of a moving regular convex polyhedron with respect to H can be found in (equation omitted) time, where m$^{j}$ $_{k}$ (1$\leq$j$\leq$s) is the number of edges of a spherical Voronoi region sreg(equation omitted) such that (equation omitted) gives one or more extreme vertices.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.21-28
• /
• 2001

As a result of the recent explosive growth of scientific data, extremely large volume datasets have become increasingly commonplace. While several texture-based volume rendering algorithms have been proposed, most of them focused on volumes smaller than the hardware's available texture memory. This paper presents a new parallel volume rendering scheme for very large static and time-varying data on a multipipe system architecture. Our scheme subdivides large volumes dynamically into smaller bricks, and assigns them adaptively to graphics pipes to minimize the costs of texture swapping. With the new method, Phong shaded images can be easily created by computing the gradients on the fly and using the color matrix feature of OpenGL. We report experimental results on an SGI Onyx2 for the various large datasets.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.339-349
• /
• 2008

We present a novel method to estimate the light source direction and relight a face texture image of a single 3D model under arbitrary unknown illumination conditions. We create a virtual irradiance sphere to detect the light source direction from a given illuminated texture image using both normal vector mapping and weighted bilinear interpolation. We then induce a relighting equation with estimated ambient and diffuse coefficients. We provide the result of a series of experiments on light source estimation, relighting and face recognition to show the efficiency and accuracy of the proposed method in restoring the shading and shadows areas of a face texture image. Our approach for face relighting can be used for not only illuminant invariant face recognition applications but also reducing visual load and Improving visual performance in tasks using 3D displays.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.419-429
• /
• 2016

Generating a 3D surface model from coronary artery segmentation helps to not only improve the rendering efficiency but also the diagnostic accuracy by providing physiological informations such as fractional flow reserve using computational fluid dynamics (CFD). This paper proposes a method to generate a triangular surface mesh using vessel structure information acquired with coronary artery segmentation. The marching cube algorithm is a typical method for generating a triangular surface mesh from a segmentation result as bit mask. But it is difficult for methods based on marching cube algorithm to express the lumen of thin, small and winding vessels because the algorithm only works in a three-dimensional (3D) discrete space. The proposed method generates a more accurate triangular surface mesh for each singular vessel using vessel centerlines, normal vectors and lumen diameters estimated during the process of coronary artery segmentation as the input. Then, the meshes that are overlapped due to branching are processed by mesh merging and merged into a coronary mesh.