• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2252-2258
• /
• 2013

In this paper, parallel orthogonal matching pursuit (POMP) is proposed to supplement the simultaneous orthogonal matching pursuit (S-OMP) which has been widely used as a greedy algorithm for sparse signal recovery for multiple measurement vector (MMV) problem. The process of POMP is simple but effective: (1) multiple indexes maximally correlated with the observation vector are chosen at the first iteration, (2) the conventional S-OMP process is carried out in parallel for each selected index, (3) the index set which yields the minimum residual is selected for reconstructing the original sparse signal. Empirical simulations show that POMP for MMV outperforms than the conventional S-OMP both in terms of exact recovery ratio (ERR) and mean-squared error (MSE).

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.1
• /
• pp.82-88
• /
• 2002

In this paper, we proposed a audio indexing method that is used wavelet transform for audio data retrieval. It is difficult for audio data to make a efficient audio data index because of its own particular properties, such as requirement of large storage, real time to transfer and wide bandwidth. An audio data in del using wavelet transform make it possible to index and retrieval by using the particular wavelet transform properties. Our proposed indexing method doesn't separate data to several blocks. Therefore we use both high-pass and low-pass parts of last level coefficient of wavelet transform. Audio data indexing is made by applying the string matching algorithm to high-pass part and zero-crossing histogram to low-pass part. These are transformed to the continued strings, Through this method, we described a retrieval efficiency. The retrieval method is done by comparing the database index string to the query string and then data of minimum values is chosen to the result. Our simulation decided proper comparative coefficient and made known changing of retrieval efficiency versus audio data length. The results show that the proposed method improves retrieval efficiency compared to conventional method.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1303-1313
• /
• 2015

MapReduce provides high levels of system scalability and fault tolerance for large-size data processing. A MapReduce-based k-nearest-neighbor(k-NN) join algorithm seeks to produce the k nearest-neighbors of each point of a dataset from another dataset. The algorithm has been considered important in bigdata analysis. However, the existing k-NN join query-processing algorithm suffers from a high index-construction cost that makes it unsuitable for the processing of bigdata. To solve the corresponding problems, we propose a new grid-based, k-NN join query-processing algorithm. Our algorithm retrieves only the neighboring data from a query cell and sends them to each MapReduce task, making it possible to improve the overhead data transmission and computation. Our performance analysis shows that our algorithm outperforms the existing scheme by up to seven-fold in terms of the query-processing time, while also achieving high extent of query-result accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1035-1041
• /
• 2004

Currently users are tend to use multimedia data types in their applications. Main features of multimedia data types are large amount of data compared to conventional data types. In this reason, it's hard to load data into main memory and to search. That is the cause of occur disk input and output frequently, and decrease the system performance. In this paper, we describe to have fast and efficient access to multimedia data using index technique. Index method presented by paper consists of two parts : one is index file part for keywords and the other is posting file part for the list of file names. Of course, we use keyword. But user is not charge of memory for the keywords. Users just use natural language to insert, delete and search data what he or she wants. Internally, System makes keywords from natural language to get access to multimedia data. It provides convenience to users. Using this study to develop one's application for multimedia, one may have a chance for advanced performance of a system and getting a result speedily.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.423-436
• /
• 2006

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribing users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered only to the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a novel scalable filtering system called FiST(Filtering by Sequencing Twigs) that transforms twig patterns expressed in XPath and XML documents into sequences using Prufer's method. As a consequence, instead of matching linear paths of twig patterns individually and merging the matches during post-processing, FiST performs holistic matching of twig patterns with incoming documents. FiST organizes the sequences into a dynamic hash based index for efficient filtering. We demonstrate that our holistic matching approach yields lower filtering cost and good scalability under various situations.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.341-351
• /
• 2004

With the popularity of digital audio contents, querying and retrieving audio contents efficiently from database has become essential. In this paper, we propose a new index scheme for retrieving audio contents efficiently using audio portions that have been queried frequently. This scheme is based on the observation that users have a tendency to memorize and query a small number of audio portions. Detecting and indexing such portions enables fast retrieval and shows better performance than sequential search-based audio retrieval. Moreover, this scheme is independent of underlying retrieval system, which means this scheme can work together with any other audio retrieval system. We have implemented a prototype system and showed its performance gain through experiments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.2
• /
• pp.73-83
• /
• 2007

In network intrusion prevention, attack packets are detected and filtered out based on their attack signatures. Pattern matching is extensively used to find attack signatures and the most time-consuming execution part of Network Intrusion Prevention Systems(NIPS). Pattern matching is usually accelerated by hardware and should be performed at wire speed in NIPS. However, that alone is not good enough. First, pattern matching hardware should be able to generate sufficient pattern match information including the pattern index number and the location of the match found at wire speed. Second, it should support pattern grouping to reduce unnecessary pattern matches. Third, it should always have a constant worst-case performance even if the number of patterns is increased. Finally it should be able to update patterns in a few minutes or seconds without stopping its operations, We propose a system architecture to meet the above requirement. The system architecture can process multiple pattern characters in parallel and employs a pipeline architecture to achieve high speed. Using Xilinx FPGA simulation, we show that the new system stales well to achieve a high speed oner 10Gbps and satisfies all of the above requirements.

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

본 논문은 관상동맥의 구조와 그 움직임을 사실적으로 표현하기 위한 매개변수적 모델링기법을 제안한다. 매개변수적 기법으로 생성된 모델은 메쉬 정점의 인덱스만으로 모델간 매칭을 위한 대응점을 찾을 수 있으므로, 시간대별로 달라지는 정점의 위치를 쉽게 추적함으로써 모델의 움직임을 표현할 수 있다. 그러나 이러한 기법으로 생성된 모델은 분리, 접합 등의 변형 조작이 어렵고, 트리형태 객체에 적용하기 힘든 단점이 있다. 본 논문에서는 이를 극복하기 위해 분할된 혈관영역의 골격데이타에서 찾아낸 분기점을 중심으로 Generalized Cylinder를 이용하여 실린더 형태의 각 혈관세그먼트를 모델링 한 후, 분기영역을 3 개의 하프파이프(half pipe)와 2 개의 삼각형 패치로 연결하여 모델링하였다. 완성된 모델은 다시점 관상동맥데이터에 적용하였고, 각 시점에서 구해진 정점의 위치를 선형보간함으로써 부드러운 혈관의 움직임을 나타내었다.

• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.783-786
• /
• 2002

최근 비디오 데이터의 급격한 증가에 따라 원하는 동영상 정보를 검색하고자 할 때 막대한 시간과 노력의 낭비가 생긴다. 비디오 데이터의 효율적인 관리와 검색을 위해서는 동영상 데이터의 색인이 필요하다. 일반적으로 비디오 색인을 하기 위한 시작점은 장면전환 검출이 된다. 본 논문에서는 장면 전환을 검출한 후, 검출된 장면들 간의 변화를 참조하여 계층적 구조로 설정하여 동영상의 인덱스를 생성하는 방법을 소개한다. 컷으로 검출된 장면들을 비교하는데에는 전역적인 방법과 Bipartite 매칭을 이용한 국부적인 방법이 비교되었다. 컷 사이의 비교에 국부적인 방법을 사용함으로써 씬이 잘못 구분되는 오류를 줄일 수 있었다.

• Annual Conference of KIPS
• /
• 2000.10b
• /
• pp.899-902
• /
• 2000

지문인식 분야는 크게 분류(classification)와 정합 (matching)으로 나누어져 연구되어왔다. 분류는 일반적으로 와상문, 궁상문, 솟은궁상문, 오른쪽제상문, 왼쪽제상문 등의 5종류로 분류되며, 지문이 어떤 분류에 속하는지 구별하여 특정인의 지문 형태를 결정하여 주는 작업으로 대형 데이터베이스에서 인덱스로 사용되어 검색시간 단축과 매칭의 정확도를 높여준다. 본 논문에서는 지문 분류에서 품질이 나쁜 이미지는 분류를 위한 특이점 (핵 과 삼각점)의 검술이 어려운 점을 감안하여 방향성과 주파수 선택력이 강한 Gabor 필터의 특징을 이용한 지문 분류 방법으로 지문 분류의 정확성을 향상시킬 수 있는 방안을 제시하고 실험을 통하여 이를 증명한다.