• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.17-30
• /
• 2000

In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.297-305
• /
• 2008

Recently, kernel methods have attracted great interests in the areas of pattern classification, function approximation, and anomaly detection. The role of the kernel is particularly important in the methods such as SVM(support vector machine) and KPCA(kernel principal component analysis), for it can generalize the conventional linear machines to be capable of efficiently handling nonlinearities. This paper considers the problem of combining radar and rain gauge observations utilizing the regression approach based on the kernel-based gaussian process and support vector learning. The data-assimilation results of the considered methods are reported for the radar and rain gauge observations collected over the region covering parts of Gangwon, Kyungbuk, and Chungbuk provinces of Korea, along with performance comparison.

• Computational Structural Engineering
• /
• v.9 no.4
• /
• pp.141-154
• /
• 1996

Delaunay triangulation is a very powerful method of mesh generation for its versatility such as handling complex geometries, element density control, and local/global remeshing capability, The limit of generating simplex elements(3-node elements in 2-D) only is resolved by adding generation module of 6-node quadratic elements. Since proposed adjacency does not change from 3-node element mesh to 6-node mesh, generation module can utilize the original simplex element generator. Therefore, versatility of the Delaunay triangulation is preserved. A simple upsetting problem is employed to show the possibility of the algorithm.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.1
• /
• pp.1-7
• /
• 2006

본 논문에서는 다양체 (manifold) 구조와 스칼라 변위함수 (scalar displacement function)에 기반한 새로운 변위곡면 (displaced surface)의 표현 기법을 제안한다. 변위곡면은 제어메쉬 (control mesh)의 각 정점에서 변위된 국소적 패치들 (displaced local patches)을 블렌딩 (blending)함으로써 생성된다. 제안된 변위곡면은 점 군 (point cloud)의 형태로 주어진 기하학적 모델을 근사하기 위해서 사용된다. 점 군의 데이터로터 제어메쉬가 생성되고, 점 군의 점들이 제어메쉬의 국소적 패치들 (local patches)에 사영 (projection)되어 각 패치들로 부터의 스칼라 변위함수가 구해지고, 이러한 변위함수들을 최적화 하여 높은 정밀도를 갖는 최종적인 곡면을 생성된다. 점 군의 형태로 주어진 다양한 모델에 대한 실험 결과를 통해서 제안된 근사기법의 효율성과 정밀도가 입증된다. 본 논문에서 제안된 표현기법은 다 단계 (multi-level) 변위함수를 통해 다중해상도 표현 (multi-resolution representations)과 골격기반 형상변형 (skeleton-driven deformation)등과 같은 다양한 응용들에 효율적으로 사용된다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1551-1552
• /
• 2008

본 논문은 네트워크 기반 제어시스템(NCS: Networked Control Systems)에 모델매칭 제어기법을 적용한 효율적인 제어알고리즘을 제안한다. 비선형의 특징을 가지는 제어기 및 관측기의 시간지연을 Taylor 근사법으로 선형화하여 선형시스템 이론을 적용한 모델매칭 제어기를 설계하였다. 또한, 제어기의 차수를 우세극 기법과 극,영점 상쇄기법(Pole-Zero Cancelation)을 통해 저차화한 후 그 타당성을 검증하였다. 제안한 제어알고리즘의 컴퓨터 시뮬레이션을 실시하였으며 기존의 고차 모델매칭 제어기와 비교분석하여 타당성 및 신뢰성을 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.154-156
• /
• 2004

센서 네트웍, 유비쿼터스 컴퓨팅 환경으로 발전하면서 스트리밍 데이터와 같이 무한한 데이터의 처리에 대한 요구가 많이 커지고 있다. 스트리밍 데이터에 대한 질의 처리는 크게 실시간으로 처리가 요구되는 질의와 과거 데이터에 대한 동향 근사치 요청질의로 나누어질 수 있다. 기존의 스트리밍 데이터 처리에 대한 연구들은 실시간 질의 처리만을 고려하고 과거 데이터에 대한 질의에 대한 고려는 미약하다. 그리고 사용자가 과거의 데이터에 대한 동향 분석을 요청하는 질의, 또는 과거 어느 시점의 데이터에 대한 요청 혹은 근사치를 요구하는 질의에 대해서는 처리를 할 수 없는 한계점이 있다. 본 논문에서는 스트리밍 데이터 프로세서의 메모리의 범위를 넘어서서 삭제되는 과거 데이터를 디스크의 I/O처리 속도에 맞추기 위해서 로드 셰딩 기법을 적용해서 저장한 후에 개념 계층을 이용해서 사용자가 원하는 데이터만을 효과적으로 저장하는 기법을 제안한다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.151-158
• /
• 2004

In this paper, an inverse filtering technique for the digital filter model is proposed. This technique enables us to obtain a stable non-causal m inverse filter by transforming (approximating) it to a causal stable inverse system. In practice, a causal FIR approximation to this inverse filter is proposed. It can be shown that the impulse response of the inverse filter for all-pass systems is simply the mirror image of the impulse response for the system. Specially, due to this symmetric property of the impulse response of all-pass systems, the proposed technique is more useful for all-pass systems than other systems. In order to illustrate the proposed inverse filtering technique, four examples are presented. Two of them are for all-pass filters. The other two examples are for IIR and FIR filters. Also, computer simulations demonstrate that the proposed technique works very well.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• Journal of Broadcast Engineering
• /
• v.23 no.2
• /
• pp.302-315
• /
• 2018

Highly non-linear electro-optical transfer function of the Perceptual Quantizer was approximated by a truncated Taylor series, resulting in a closed form solution for luma adjustment. This previous solution is fast and quite suitable for the hardware implementation of luma adjustment, but the approximation error becomes relatively large in the range of 600~3,900 cd/m2 linear light. In order to reduce such approximation error, we propose a new linear model, for which a correction is performed on the position and the slope of line based on the scope of approximation. In order to verify the approximation capability of the proposed linear model, a comparative study on the luma adjustment schemes was conducted using various high dynamic range test video sequences. Via the comparative study, we identified a significant performance enhancement over the previous fast luma adjustment scheme, where a 4.65dB of adjusted luma t-PSNR gain was obtained for a test sequence having a large portion of saturated color pixels.