• The Journal of the Acoustical Society of Korea
• /
• v.29 no.5
• /
• pp.339-346
• /
• 2010

For the implementation of the crosstalk canceller, the filters with large length are needed, which is because that the length of the filters greatly depends on the length of the head-related impulse responses. In order to reduce the length of the crosstalk cancellation filters, many methods such as frequency warping, common acoustical pole and zero (CAPZ) modeling have been researched. In this paper, we propose a new method combining these two methods. To accomplish this, we design the filters using the CAPZ modeling on the warped domain, and then, we implement the filters using the poles and zeros de-warped to the linear domain. The proposed method provides improved channel separation performance through the frequency warping and significant reduction of the complexity through the CAPZ modeling. These are confirmed through various computer simulations.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.173-184
• /
• 2002

This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.643-654
• /
• 2001

This paper discusses an effective processing of similarity search that supports time warping in large sequence database. Time warping enables finding sequences with similar patterns even when they are of different length, Previous methods fail to employ multi-dimensional indexes without false dismissal since the time warping distance does not satisfy the triangular inequality. They have to scan all the database, thus suffer from serious performance degradation in large database. Another method that hires the suffix tree also shows poor performance due to the large tree size. In this paper we propose a new novel method for similarity search that supports time warping Our primary goal is to innovate on search performance in large database without false dismissal. to attain this goal ,we devise a new distance function $D_{tw-Ib}$ consistently underestimates the time warping distance and also satisfies the triangular inequality, $D_{tw-Ib}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping, For efficient processing, we employ a distance function, We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments . The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data and up to 720 times with very large synthetic data.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.512-519
• /
• 2002

본 연구에서는 임의의 형상의 다중세포 단면을 갖는 복합재료 블레이드에 대한 유한요소 구조해석을 수행하였다. 보 해석 모델은 구조연성 효과와 단면 벽의 두께, 횡 전단변형, 비틀림과 연관된 워핑 및 워핑구속효과 등을 고려하고 있다. 블레이드 힘-변위 관계식은 Reissner의 반복족에너지 함수를 이용한 혼합이론을 적용하여 유도하였다. 이 관계식은 굽힘 및 전단에 대해서는 Timoshenko 보의 형태로 그리고 비틀림 변형은 Vlasov 이론으로 근사하고 있다. 결과적인 [7×7] 구조강성 행렬은 전단변형 및 전단강성계수들을 특이한 가정에 의존하지 않고도 해석적으로 기술하고 있다. 본 정식화 과정을 통해서 구한 보 이론을 이중세포로 구성된 에어포일 형상의 복합재료 블레이드에 적용하였으며, 기존의 실험 연구 및 다차원 유한요소해석 결과들과 비교 연구를 수행하여 본 해석모델의 타당성을 보이고자 하였다.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.5
• /
• pp.1-10
• /
• 2015

This study proposes a method of developing authoring tool that can easily and intuitively generate diverse digital leaves that compose virtual landscape. The main system of the proposed authoring tool consists of deformation method for the contour of leaf blade based on image warping, procedural modeling of leaf vein and visualization method based on mathematical model that expresses the color and brightness of leaves. First, the proposed authoring tool receives leaf input image and searches for contour information on the leaf blades. It then designs leaf blade deformation method that can generate diverse shapes of leaf blades in an intuitive structure using feature-based image warping. Based on the computed leaf blade contour, the system implements the generalized procedural modeling method suitable for the authoring tool that generates natural vein patterns appropriate for the leaf blade shape. Finally, the system applies visualization function that can express color and brightness of leaves and their changes over time using a mathematical model based on convolution sums of divisor functions. This paper provides texture support function so that the digital leaves that were generated using the proposed authoring tool can be used in a variety of three-dimensional digital contents field.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.29-37
• /
• 2014

Since multi-view video exists a number of camera color image and depth image, it has a huge of data. Thus, a new compression technique is indispensable for reducing this data. Recently, the effective compression encoding technique for multi-view video that used in layered depth image concepts is a remarkable. This method uses several view point of depth information and warping function, synthesizes multi-view color and depth image, becomes one data structure. In this paper we use actual distance for solving overlap in layered depth image that reduce required data for reconstructing in color-based transform. In experimental results, we confirmed high compression performance and good quality of reconstructed image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.715-718
• /
• 2006

아바타를 이용한 얼굴 애니메이션은 가상 현실이나 엔터테인먼트와 같은 분야에서 많이 적용된다. 얼굴 애니메이션을 생성하는 방법에는 크게 3 차원 모델을 직접 변형시키는 기하학적인 변형 방법과 2 차원 이미지의 워핑이나 모핑방법을 이용한 이미지 변형 방법이 있다. 기하학적인 변형 방법 중 3 차원 모델을 변형시키기 위한 방법으로 RBF(Radial Basis Function)을 이용하는 방법이 있다. RBF 함수를 이용하여 모델의 부드러운 변형을 만들 수 있다. 이 방법은 모델의 임의의 한 점을 이동하게 되면 영향을 받는 정점들을 좀 더 자연스럽게 이동시킴으로써 자연스러운 애니메이션을 생성할 수 있다. 본 연구에서는 RBF 를 이용하여 3 차원 얼굴 메쉬 모델의 기하학적 변형을 통해 모델의 얼굴 표정을 생성하는 방법에 대해 제안하고자 한다. 얼굴 모델 변형을 위해 얼굴의 특징인 눈, 입, 턱 부분에 특징점을 정하고 각 특징점에 따라 영향을 받는 영역을 정하기 위해 얼굴 모델을 지역적으로 클러스터링한다. 각 특징점에 따라 영향을 받는 영역에 대해 클러스터링을 적용하고 RBF 를 이용하여 자연스러운 얼굴 표정을 생성하는 방법을 제안한다.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.133-140
• /
• 2005

Crosstalk canceller in stereo channel audio reproduction system has the purpose to deliver desired signals exactly at the listener's ear. Generally. it has a Poor performance in low frequency bands. Frequency-warped Otters are used to provide improved performance in crosstalk canceller for these problems. However. such filters are more complex to implement than conventional filters. This paper presents an efficient method for low-order IIR approximation of frequency warped crosstalk cancellation filters using Pole-zero dewarping. The method preserves the advantages of frequency warping, but has a computational complexity that is similar to the conventional method. This Paper also presents a series of experiments that validate the method of crosstalk canceller.