• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.214-221
• /
• 2015

In this paper, we present robust estimation and detection algorithms for discrete-time switched linear systems whose output measurements are corrupted by noises. First, a mode estimation algorithm is proposed based on the minimum distance criterion. Then, state variables are also observed under the active mode estimate. Second, a detection algorithm is constructed to detect the mode switching of the switched system. With the boundedness of measurement noise, the proposed estimation algorithm returns the exact active mode and approximate state information of the switched system. In addition, the detection algorithm can detect the switching time within a pre-determined time interval after the actual switching occurred.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.475-478
• /
• 2005

본 논문에서는 자기구성 퍼지다항식 뉴럴 네트워크(SOFPNN)를 구성하고 있는 퍼지 다항식뉴론(FPM)의 구조와 파라미터를 유전자 알고리즘을 이용하여 최적화시킨 새로운 개념의 진화론적 최적 고급 자기구성 퍼지 다항식 뉴릴 네트워크를 소개한다. 기존의 자기구성 퍼지 다항식 뉴럴 네트워크에서 모델을 설계할 때에는 설계자의 주관적인 특징과 시행착오에 의해서 모델을 구축하였다. 이러한 설계자의 경험을 배제하고 객관적이고 효율적인 모델을 구축하기 위해서 본 논문에서는 FPH의 파라미터들을 최적화 알고리즘인 유전자 알고리즘을 이용하여 동조하였다. 즉, 모델을 구축하는데 기본이 되는 FPN의 각각의 파라미터들-입력변수의 수, 다항식 차수, 입력변수, 멤버쉽 함수의 수, 그리고 멤버쉽 함수의 정점-을 동조함으로써 기존의 모델에 비해서 구조적으로 그리고 파라미터적으로 최적화된 네트워크를 생성할 수 있다. 뿐만 아니라 주어진 데이터의 특성을 모델 구축에 반영하고자 멤버쉽 함수의 정점 역시 유전자 알고리즘으로 동조하였다. 실험적 예제를 통하여 제안된 모델의 성능을 확인한 결과 기존의 퍼지모델 및 신경망 모델에 비해서 아주 우수한 근사화 능력과 일반화 능력을 가짐을 알 수 있다.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.369-377
• /
• 2007

Histogram is one of tools that efficiently summarize data, and it is widely used for selectivity estimation and approximate query answering. Existing histogram construction algorithms are applicable to point data represented by a set of values. As often as point data, we can meet interval data such as daily temperature and daily stock prices. In this paper, we thus propose the histogram construction algorithms for interval data by extending several methods used in existing histogram construction algorithms. Our experiment results, using synthetic data, show our algorithms outperform naive extension of existing algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.123-130
• /
• 2004

In this paper, an advanced error tracking algorithm by using feedback channel was proposed for error resilient transmission. Using this proposed algorithm, the propagation of errors were reduced within the decoded data over bit error prone network. The addresses of corrupted blocks are reported to encoder by decoder. With negative acknowledgments of feedback channel, the encoder can precisely calculate negative acknowledgments and track the propagated errors by examining the backward motion dependency for proper pixel in the current encoding frame. The error-propagation effects can be terminated completely by INTRA refreshing the affected macro-blocks by using proposed error tracking algorithm. By utilizing the selective four-corner error tracking approximation, the error tracking computations of the proposed algorithm is less than that of the algorithm using full pixel without substantial degradation in video quality. The proposed algorithm can track errors rapidly and accurately.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.409-419
• /
• 2009

In this article, an explicit solution of the EM algorithm for the image deburring is presented. To obtain the restore image from the strictly iterative EM algorithm is quite time-consumed and impractical in particular when the underlying observed image is not small and the number of iterations required to converge is large. The explicit solution provides a quite reasonable restore image although it exploits the approximation in the outside of the valid area of image, and also allows to obtain the effective EM solutions without iteration process in real-time in practice by using the discrete finite Fourier transformation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.337-344
• /
• 2011

In this paper, a multiple-input and multiple-output (MIMO) spatial multiplexing (SM) relay system is studied in a bit error rate (BER) sense, where every node is deployed with multiple antennas. In order to efficiently use the limited power resource, it is essential to optimally allocate the power to nodes and antennas. In this context, the power allocation (PA) algorithm based on minimum BER (MBER) for a MIMO SM relay system is proposed, which is derived by direct minimization of the average BER, and divided into inter-node and inter-antenna PA algorithm. The proposed scheme outperforms the conventional equal power allocation (EPA) algorithm without extra power consumption.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.221-228
• /
• 2010

Since string operations were applied to computational biology, security and search for Internet, various data structures and algorithms for computing efficient string operations have been studied. The all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings. The matching algorithm is importantly used for fast approximation algorithm to find the shortest superstring, as well as for bio-informatics and data compressions. In this paper, we propose an algorithm to find all-pairs suffix-prefix matching using the suffix array, which takes O($k{\cdot}m$)�� time complexity. The suffix array algorithm is proven to be better than the suffix tree algorithm by showing it takes less time and memory through experiments.

• Journal of IKEEE
• /
• v.16 no.4
• /
• pp.356-363
• /
• 2012

Information technology improves convenience, safety, and performance of automobiles. Recently, a lot of algorithms are studied to provide safety and environment information for driving, and traffic sign recognition is one of them. It can provide important information for safety driving. In this paper, we propose a method for traffic sign detection and identification concentrating on reducing the computation time. First, potential traffic signs are segmented by color threshold, and a polygon approximation algorithm is used to detect appropriate polygons. The potential signs are compared with the template signs in the database using SURF and ORB feature matching method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1037-1043
• /
• 2006

This work presents an effective overlay multicast tree construction algorithm for synchronized real-time media multicast service over the Internet. The proposed algorithm is designed to minimize delay variance among group members to provide the synchronized service as well as average delay of group members in order to support the service in real-time. Basically, of orthogonal genetic algorithm is employed to obtain the near optimal tree with a low computational complexity since the given problem is NP-complete. Finally, experimental results are provided to show the superior performance of the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.221-227
• /
• 2019

It has long been known that weapon target assignment (WTA) problem is NP-hard. Nonetheless, an exact solution can be found using Brute-Force or branch-and bound method which utilize approximation. Many heuristic algorithms, genetic algorithm particle swarm optimization, etc., have been proposed which provide near-optimal solutions in polynomial time. This paper suggests polynomial time algorithm that can be obtain the optimal solution of WTA problem for the number of total weapons k, the number of weapon types m, and the number of targets n. This algorithm performs k times for O(mn) so the algorithm complexity is O(kmn). The proposed algorithm can be minimize the number of trials than brute-force method and can be obtain the optimal solution.