• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2007년도 추계학술발표대회
• /
• pp.211-214
• /
• 2007

최근 멀티미디어 데이터, 특히 UCC를 중심으로 동영상 데이터가 급증하고 있다. 그러나 현재 대부분의 검색 시스템은 키워드 기반의 동영상 데이터 검색만을 지원하고 있으며, 따라서 사용자가 원하는 동영상 데이터를 효율적으로 검색하지 못하는 실정이다. 동영상 데이터에 대한 효율적인 검색을 지원하기 위해서는, 동영상의 내용(이미지, 색, 모양 등)을 고차원의 특징 벡터 데이터로 표현하여 유사한 동영상을 검색하는 내용-기반 검색이 요구된다. 본 논문에서는 내용-기반 검색을 위해 제안된 기존의 고차원 벡터 데이터 색인 구조를 실험을 통하여 성능을 비교하며, 이를 통해 동영상 내용-기반 검색에 가장 효율적인 색인 기법을 제시한다. 아울러 보다 효율적인 내용-기반 검색을 위한, 근사 k-NN 질의 탐색 기법의 유용성을 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (A)
• /
• pp.143-147
• /
• 2006

자연 현상에서 나타나는 연기나 난류의 움직임을 사실적으로 시뮬레이션을 할 때 Navier-Stokes 방정식을 이용한다. 이 방정식을 이용한 구현은 방대한 연산량과 계산의 복잡성으로 인하여 실시간 시뮬레이션이 어렵다. 이 때문에 실시간 처리를 위하여 복잡한 수식을 근사화한다. 유체 시뮬레이션의 이류(advect) 과정에서 근사화를 위해 Semi-Lagrangian 방법을 이용할 때, 연기 시뮬레이션은 시간이 지남에 따라 밀도가 현저히 줄어들고 소규모의 소용돌이(small-scale vorticity) 현상이 급격히 감소하는 등의 수치적 소실이 발생한다. 본 논문에서는 이 문제를 해결하기 위해 이류항(advection term)을 계산할 때 새로운 수치적 방법을 제안한다. 본 논문에서는 이류항의 값을 구할 때, 현재 격자 주변의 값 중에서 다음 단계에 현재 격자의 위치로 오는 속도를 가진 격자를 찾아, 그 격자의 속도를 이류 속도 벡터로 활용한다. 이는 밀도와 소용돌이 현상의 수치적 소실을 줄여서 사실성을 높이고 실시간 처리도 가능하게 한다. 또한 본 논문에서는 GPU 구현을 통해 벡터 연산 등의 효율성을 높이며 시뮬레이션의 속도를 향상시킨다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제35권8호
• /
• pp.921-931
• /
• 2011

This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

• The Journal of the Acoustical Society of Korea
• /
• 제20권8호
• /
• pp.3-11
• /
• 2001

This paper describes an implementation of inverse filter using SVD in order to recover the input in multi-channel system. The matrix formulation in SISO system is extended to MIMO system. In time and frequency domain we investigates the inversion of minimum phase system and non-minimum phase system. To execute an effective inversion of non-minimum phase system, SVD is introduced. First of all we computes singular values of system matrix and then investigates the phase property of system. In case of overall system is non-minimum phase, system matrix has one (or more) very small singular value (s). The very small singular value (s) carries information about phase properties of system. Using this property, approximate inverse filter of overall system is founded. The numerical simulation shows potentials in use of the inverse filter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권1C호
• /
• pp.47-55
• /
• 2003

This paper proposes a composition method of mosaic image from the compressed MPEG-2 video stream, in which the displacement between successive frames according to the camera operation is estimated directly from the information involved in the stream. In the proposed method. the approximated optical flow is constructed from motion vectors of macro blocks, and it is used to determine the parameters of the displacements according to the camera operation associated with pan and tilt. The extracted parameters are used to determine the geometric transform of successive video frames in order to construct a mosaic image. The construction of mosaic uses several blending techniques including the one proposed by Nichols in which an analytic weight is used to determine pixel values. Through the experiment, the blending technique based on analytic weights was superior to the others such as averaging and median-based techniques. It provided more smooth changes in background and made use of instantaneous frame information to construct a mosaic. The mosaic in the paper puts the emphasis on the reduction of computation because it is constructed from the motion vectors included in the compressed video without decoding and recalculating exact optical flows. The constructed mosaic can be used in the retrieval of the compressed video as the representative frame of a shot.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제42권12호
• /
• pp.103-110
• /
• 2005

The performance of maximum likelihood(ML) detection for the given channel is analyzed in spatially multiplexed MIMO system. In order to obtain the vector symbol error rate, we define error vectors which represent the geometrical relation between lattice points. The properties of error vectors are analyzed to show that all lattice points in infinite lattice almost surely have four nearest neighbors after random channel transformation. Using this information and minimum distance obtained by the modified sphere decoding algorithm, we formulate the analytical performance of vector symbol error over the given channel. To verify the result, we simulate ML performance over various random channel which are classified into three categories: unitary channel, dense channel, and sparse channel. From the simulation results, it is verified that the derived analytical result gives a good approximation about the performance of ML detector over the all random MIMO channels.

• Journal of Korean Society of Steel Construction
• /
• 제12권1호통권44호
• /
• pp.45-54
• /
• 2000

Design-oriented approximate structural reanalysis models are compared and assessed, particularly with focus on the case of large changes of design variables. The effectiveness and reliability are demonstrated by means of numerical examples. The results of the study suggest the following conclusions relative to the potential of the procedures. (A) local approximation is only appropriate for the case of small changes in design : (B) global approximation is exact for the case of large changes in a small number of design variables, but inefficient : (C) local-global approximation is most effective and reliable for the case of large changes with a large number of design variables. These methods can improve the total efficiency when they are appropriately used to the design information for the redesign process of large scale structures.

• Journal of the Korea Computer Graphics Society
• /
• 제25권3호
• /
• pp.93-103
• /
• 2019

We introduce a geometric processing method for freeform surfaces based on high-precision torus patch approximation, a new spatial data structure for efficient geometric operations on freeform surfaces. A torus patch fits the freeform surface with flexibility: it can handle not only positive and negative curvature but also a zero curvature. It is possible to precisely approximate the surface regardless of the convexity/concavity of the surface. Unlike the traditional method, a torus patch easily bounds the surface normal, and the offset of the torus becomes a torus again, thus helps the acceleration of various geometric operations. We have shown that the torus patch's approximation accuracy of the freeform surface is high by measuring the upper bound of the two-sided Hausdorff distance between the freeform surface and set of torus patches. Using the method, it can be easily processed to detect an intersection curve between two freeform surfaces and find the offset surface of the freeform surface.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제16권3호
• /
• pp.303-308
• /
• 2006

To solve the rule explosion problem in multi input fuzzy logic system, a method of converting a given fuzzy system to 2 layered hierarchical fuzzy system is presented where the collection of the THEN-parts of the fuzzy rules of given fuzzy system is considered as vectors of fuzzy rule. At the 1 st layer, linearly independent fuzzy rule vectors generated from the given fuzzy logic system are used and, at the 2nd layer, linear combinations of these independent fuzzy rule vectors are used for fuzzy logic units at each layer. The resultant 2 layered hierarchical fuzzy system has not only equivalent approximation capability, but less number of fuzzy rules compared with the conventional fuzzy logic system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제39권1호
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.