• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.396-400
• /
• 2004

In this study, we have proposed the tracking system of single moving object. The tracking system was estimated motion using differential image, and than track the moving object by controlled Pan/Tilt device of camera. Proposed tracking system is devided into image acquisition and preprocessing phase, motion estimation phase and object tracking phase. To estimation the motion, differential image method was used. In the binary differential image, decision of threshold value was used adaptive method. And in grouping the object area, block_based recursive labeling algorithm was used. As a result of experiment, motion of moving object can be estimated. The result of tracking, object was not lost and object was tracked correctly.

• Journal of the Korean Society for information Management
• /
• v.18 no.2
• /
• pp.105-124
• /
• 2001

The purpose of this study is to develop a Korean word analysis system, which can improve performance of IRS, based on various methods of word analysis. In this study we focused on maximizing the speed of Korean word analysis, modulizing each functional system and analyzing Korean morpheme precisely. The system, developed in this study, implemented optimal algorithm to increase the speed of word analysis and to verify speed and performance of each subsystem. In addition, the numeral analysis processing was achieved to reduce a system burden by avoiding recursive analysis of compound nouns, based on numeral pattern recognition.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.75-80
• /
• 2023

We show the design of fast invertible block transforms that can replace the DCT in future wireless and portable computing application. This is called binDCT. In binDCT, both the forward and the inverse transforms can be implemented using only binary shift and addition operation. And the binDCT inherits all desirable DCT characteristics such as high coding gain, no DC leakage, symmetric basis functions, and recursive construction. The binDCT also inherits all lifting properties such as fast implementations, invertible integer-to-integer mapping, in-place computation. Thus, this method has advantage of fast implementation for complex DCT calculations. In this paper, we present computation costs and performance analysis between DCT and binDCT using Shapiro's EZW.

• The KIPS Transactions:PartD
• /
• v.18D no.6
• /
• pp.443-450
• /
• 2011

Model-based Component development methodologies consider the whole system as an component and develop physical components through recursive decomposition and refinements of components in a top-down manner. We developed a model translator that can be used to formally verify interaction consistency among components, especially the interaction behavior between before- and after- refinements of components. This translator can be used to identify potential problems in the refinement process so that problems can be addressed from the early stage of development. This paper introduces our translation approach and the organization of the translator. The translator has been applied to two case studies to show its usefulness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2365-2371
• /
• 1998

Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2328-2339
• /
• 1994

The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2731-2736
• /
• 2009

In this paper, a new implementation method of OFDM (orthogonal frequency division multiplexing) system with an orthogonal basis matrix is developed mathematically. The basis matrix is based on the Haar basis but has an appropriate form for modulation of multiple subchannel signals of OFDM. It is verified that the new basis matrix can be expanded with a simple recursive algorithm. The order of synthesis matrix in the transmitter is increased by the factor of two with every expansion. Demodulation in the receiver is carried out by its inverse matrix, which can be generated recursively with the orthogonal basis matrix. It is shown that perfect reconstruction of original signals is possibly achieved in the proposed OFDMsystem.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.227-238
• /
• 2008

As the internet users rise up rapidly, DNS information forgery can cause severe socio-economic damages. However, most studies on DNS information security reached the breaking point in applying to actual circumstances because of the limit of existing DNS system version, the increasement of management burden and etc. The paper proposes the real-time method for detecting cache poisoning of DNS system independent of analysing the DNS forgery types in the current DNS service environment. It also proposes the method of enhancing the reliability for the cache information of Recursive DNS system by post-verifying the cache information of the DNS system.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.485-492
• /
• 2003

This paper presents a new modified input buffered switch, which called a grouped input buffered (GIB) switch, to eliminate the influence of HOL blocking when using multiple input buffers in ATM switches. The GIB switch consists of grouped sub switches per a network stage. The switch gives extra paths and buffered switching elements between groups for transferring the blocked cells. As the result, the proposed model can reduce the effect by the HOL blocking and thereafter it enhances the performance of the switch. The simulation results show that the proposed scheme has good performance in comparison with previous works by using the parameters such as throughput, cell loss, delay and system power.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1480-1483
• /
• 2015

최근의 대용량 DEM 데이터는 실시간 렌더링을 하기엔 많은 양의 폴리곤을 필요로 한다. 사진 트리는 이러한 DEM 데이터를 실시간에 렌더링 하기 위해 지형 메쉬를 간략화하는데 널리 사용되는 자료구조이다. 트리구조는 재귀 연산 및 포인터 연산과 같이 GPU 에서 제공하지 않는 기능을 필요로 하기 때문에 일반적으로 CPU 상에서 구현되어 사용된다. GPU 에서 사진 트리 삼각화 기법을 사용하기 위해서 기존의 연구에서는 정점 프리미티브와 스트림 출력 단계를 이용하였다. 하지만 이 방법은 매 프레임 루트 노드부터 리프 노드까지 탐색을 하며 지형 메쉬를 새로 생성 해야하기 때문에 불필요한 연산이 많다. 제안하는 방법은 핑퐁 버퍼를 이용하여 이전 프레임에서 사용한 지형 메쉬를 다음 프레임에서 재활용하여 기존 GPU 기반 사진 트리 삼각화 기법을 가속화한다. 기존 방법이 매 프레임 사각형 패치를 세분화 하면서 지형 메쉬를 생성하는 대신 제안하는 방법은 이전 프레임에서 사용한 메쉬의 각 패치들을 병합하거나 세분화하는 방법을 사용한다. 따라서 본 방법은 GPU 기반 사진 트리 삼각화의 재귀 호출을 제거하여 연산량을 줄이고 매 프레임 CPU-GPU 간의 데이터 전송량도 효율적으로 줄여 기존의 방법을 효율적으로 가속화 한다.