• 한국정밀공학회지
• /
• 제23권9호
• /
• pp.200-207
• /
• 2006

In this paper a new approach which combines implicit surface scheme and NURBS surface interpolation method is proposed in order to generate a complete surface model from unorganized point cloud data. In the method a base surface was generated by creating smooth implicit surface from the input point cloud data through which the actual surface would pass. The implicit surface was defined by a combination of shape functions including quadratic polynomial function, cubic polynomial functions and radial basis function using adaptive domain decomposition method. In this paper voxel data which can be extracted easily from the base implicit surface were used in order to generate rectangular net with good quality using the normal projection and smoothing scheme. After generating the interior points and tangential vectors in each rectangular region considering the required accuracy, the NURBS surface were constructed by interpolating the rectangular array of points using boundary tangential vectors which assure C$^1$ continuity between rectangular patches. The validity and effectiveness of this new approach was demonstrated by performing numerical experiments for the various types of point cloud data.

• 한국정밀공학회지
• /
• 제13권4호
• /
• pp.34-42
• /
• 1996

Robot programming has been discussed in detail during the recent years. Numerous studies in particular presented relevance, solution concepts and implementation of off-line programming. In this paper a new user-friendly robot programming method is introduced, which permits the implicit description and programming of assembly process. On the functional level of programming, the assembly processes are described in terms of their operational functions. On the language level, the individual functions are then translated into commands for the robots.

• 한국CDE학회논문집
• /
• 제10권1호
• /
• pp.27-39
• /
• 2005

Implicit surfaces are geometric shapes which are defined by implicit functions and exist in three-dimensional space. Recently, implicit surfaces have received much attention in solid modeling applications because they are easy to represent the location of points and to use boolean operations. However, it is difficult to chart points on implicit surfaces for rendering. As efficient rendering method of implicit surfaces, the original Adaptively Sampled Distance Fields (ADFs) $method^{[1]}$ is to use sampled distance fields which subdivide the three dimensional space of implicit surfaces into many cells with high sampling rates in regions where the distance field contains fine detail and low sampling rates where the field varies smoothly. In this paper, in order to maintain the sharp features efficiently with small number of cells, an extended ADFs method is proposed, applying the Dual/Primal mesh optimization $method^{[2]}$ to the original ADFs method. The Dual/Primal mesh optimization method maintains sharp features, moving the vertices to tangent plane of implicit surfaces and reconstructing the vertices by applying a curvature-weighted factor. The proposed extended ADFs method is applied to several examples of implicit surfaces to evaluate the efficiency of the rendering performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권12호
• /
• pp.2374-2391
• /
• 2011

A variety of reconstruction methods has been developed to convert a set of scattered points generated from real models into explicit forms, such as polygonal meshes, parametric or implicit surfaces. In this paper, we present a method to construct multi-scale implicit surfaces from scattered points using multiscale kernels based on kernel and multi-resolution analysis theories. Our approach differs from other methods in that multi-scale reconstruction can be done without additional manipulation on input data, calculated functions support level of detail representation, and it can be naturally expanded for n-dimensional data. The method also works well with point-sets that are noisy or not uniformly distributed. We show features and performances of the proposed method via experimental results for various data sets.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.591-603
• /
• 2008

We employ the notion of implicit functions to prove a general common fixed point theorem in fuzzy metric spaces besides adopting the idea of R-weak commutativity of type (P) in fuzzy setting. In process, several previously known results are deduced as special cases to our main result.

• 한국정밀공학회지
• /
• 제24권11호
• /
• pp.144-153
• /
• 2007

In order to generate the input data for rapid prototyping, a new approach which is based on the implicit surface interpolation method is presented. In the method a surface is reconstructed by creating smooth implicit surface from unorganized cloud of points through which the surface should pass. In the method an implicit surface is defined by the adaptive local shape functions including quadratic polynomial function, cubic polynomial function and RBF(Radial Basis Function). By the reconstruction of a surface, various types of error in raw STL file including degenerated triangles, undesirable holes with complex shapes and overlaps between triangles can be eliminated automatically. In order to get the slicing data for rapid prototyping an efficient intersection algorithm between implicit surface and plane is developed. For the direct usage for rapid prototyping, a robust transformation algorithm for the generation of complete STL data of solid type is also suggested.

• International Journal of Contents
• /
• 제12권3호
• /
• pp.12-16
• /
• 2016

Brain computer interfaces (BCI) usually have focused on classifying the explicitly-expressed intentions of humans. In contrast, implicit intentions should be considered to develop more intelligent systems. However, classifying implicit intention is more difficult than explicit intentions, and the difficulty severely increases for subject independent classification. In this paper, we address the subject independent classification of implicit intention based on electroencephalography (EEG) signals. Among many machine learning models, we use the support vector machine (SVM) with radial basis kernel functions to classify the EEG signals. The Fisher scores are evaluated after extracting the gamma, beta, alpha and theta band powers of the EEG signals from thirty electrodes. Since a more discriminant feature has a larger Fisher score value, the band powers of the EEG signals are presented to SVM based on the Fisher score. By training the SVM with 1-out of-9 validation, the best classification accuracy is approximately 65% with gamma and theta components.

• 한국전산유체공학회지
• /
• 제12권3호
• /
• pp.29-40
• /
• 2007

An implicit discontinuous Galerkin method for the two-dimensional Euler equations was developed on unstructured triangular meshes. The method can achieve high-order spatial accuracy by using hierachical basis functions based on Legendre polynomials. Numerical tests were conducted to estimate the convergence order of numerical solutions to the Ringleb flow and the supersonic vortex flow for which analytic solutions are available. Also, the flows around a 2-D circular cylinder and an NACA0012 airfoil were numerically simulated. The numerical results showed that the implicit discontinuous Galerkin methods couples with a high-order representation of curved solid boundaries can be an efficient method to obtain very accurate numerical solutions on unstructured meshes.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2007년도 춘계 학술대회논문집
• /
• pp.30-40
• /
• 2007

The implicit discontinuous Galerkin method for the two-dimensional Euler equations was developed on unstructured triangular meshes, which can achieve higher-order accuracy by wing hierachical basis functions based on Legendre polynomials. Numerical tests were conducted to estimate the convergence order of numerical solutions to the Ringleb flow and the supersonic vortex flow for which analytic solutions are available. And, the flows around a circle and a NACA0012 airfoil was also numerically simulated. Numerical results show that the implicit discontinuous Galerkin methods with higher-order representation of curved solid boundaries can be an efficient higher-order method to obtain very accurate numerical solutions on unstructured meshes.

• 한국멀티미디어학회논문지
• /
• 제7권1호
• /
• pp.44-53
• /
• 2004

본 논문은 복셀(voxel)로 표현된 임플리시트(implicit) 곡면에 새로운 앤티 앨리어싱 방법을 적용하여 저해상도에서도 양질의 이미지를 구현하는 것을 목적으로 한다. 임플리시트 곡면은 독창적인 3-D 모델링과 제어 방법을 만들며 과학 유사 분야와 의료영상 가시화 부분, 애니메이션 원형과 의료용 시뮬레이션, 대화식 모델링 같은 분야에 많이 이용되고 있다. 레이 트레이싱이나 텍스쳐 맵핑으로 표현된 임플리시트 곡면에서의 앤티 앨리어싱 방법은 일반적으로 stochastic 샘플링 방법이 많이 사용되고 있지만 이 방법은 복잡한 함수로 표현된 임플리시트 곡면에 더 많은 어렵고 복잡한 계산을 요구하며 이에 따라 처리시간과 비용이 많이 든다. 반면에 복셀로 표현되는 임플리시트 곡면은 고해상도를 사용하여 부드러운 이미지를 나타내고 있지만 시간이 많이 걸리는 문제점이 있다. 이러한 문제점을 극복하기 위하여 시프트(shifted) 더블 Z-버퍼 앤티 앨리어싱 방법를 제안하였다. 시프트(shifted) 더블 Z-버퍼를 이용한 앤티 앨리어싱 방법 외에 box 필터와 tent필터를 적용하여 앤티 앨리어싱 효과를 증가시킨 곡면 이미지를 구현하였다. 결론적으로, 시프트(shifted) 더블 Z-버퍼 앤티 앨리어싱 방법은 간단하고 효율적인 방법이며 여러 형태의 필터링 적용이 가능하고 멀티 Z-버퍼로의 확장성이 좋다.