• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.109-114
• /
• 1987

In this thesis, we work on the curve recognition with real time processing and the Robot tracking method on recognized curve. Image information of segment curve is supplied to computer to run to a Robot so that it is a feedback system. Image coordinate frame to world coordinate transformation represents in this paper and curve matching algorithm subscribes by two method, first transformation matching algorithm, second image coordinate matching algorithm. Also Robot running time to computer image processing time relationships finally includes.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.173-176
• /
• 2002

This paper describes an implementation of fast face detection algorithm. This algorithm can robustly detect human faces with unknown sizes and positions in complex backgrounds. This paper provides a powerful face detection algorithm using skin color segmenting. Skin Color is modeled by a Gaussian distribution in the HSI color space among different persons within the same race, Oriental. The main feature of the Algorithm is achieved face detection robust to illumination changes and a simple adaptive thresholding technique for skin color segmentation is employed to achieve robust face detection.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.703-705
• /
• 1998

In this paper, we have suggested the method of genetic algorithm to solve the trajectory optimization. The given nonlinear method is so complex and modeling is not easy. Also, we have suggested the nonlinear programming combined with genetic algorithm. The proposed algorithm gives simple and time-reducing method in solving nonlinear dynamic systems.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.111-117
• /
• 2007

This paper presents a novel approach to speech enhancement based on a complex Laplacian probability density function (pdf). With a use of goodness-of-fit (GOF) test we show that the complex Laplacian pdf is more suitable to describe the conventional Gaussian pdf. The likelihood ratio (LR) is applied to derive the speech absence probability in the speech enhancement algorithm. The performance of the proposed algorithm is evaluated by the objective test and yields better results compared with the conventional Gaussian pdf-based scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.5
• /
• pp.214-219
• /
• 2007

This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The $2^n$(N-point) type IMDCT is the most powerful among many IMDCT algorithms, however it includes IFFT that requires many calculation cycles. The IFFT used in $2^n$(N-point) type IMDCT employ the bit-reverse data arrangement of inputs and N/4-point complex IFFT to reduce the calculation cycles. We devised a new data arrangement method of IFFT input and $N/4^{n+1}$-type IFFT and thus we can reduce multiplication cycles, addition cycles, and ROM size.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.18-26
• /
• 1993

This paper presents a multiplier free technique for the complex DFT by rotations and additions based on the complex approximation of the ring of algebraic integers. Speeding-up the computation time and reducing the dynamic range growth has been achieved by the elimination of multiplication. Moreover the DFT of no twiddle factor quantization errors is possible. Numerical examples are given to prove the algorithm and the applicable size of the DFT is 16 has been concluded.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.19-26
• /
• 2010

The criterionmaximizing cross-correntropy (MCC) of two different random variables has yielded superior performance comparing to mean squared error criterion. In this paper we present a complex-valued blind equalizer algorithm for QAM and complex channel environments based on cross-correntropy criterion which uses, as two variables, equalizer output PDF and Parzen PDF estimate of a self-generated symbol set. Simulation results show significantly enhanced performance of symbol-point concentration with no phase rotation in complex-channel communication.

• Journal of Biomedical Engineering Research
• /
• v.21 no.2
• /
• pp.165-174
• /
• 2000

본 논문에서는 M 채널 필터 뱅크를 이용하여 심전도 자동 진단 시스템에서 매우 중요한 파라미터로 사용되는 QRS complex 검출을 실시하였다. 제안된 알고리즘에서는 심전도 신호를 M개의 균일한 주파수 대역으로 분할(decomposition)하고, 분할된 서브밴드(subband) 신호들 중에서 QRS complex의 에너지 분포가 가장 많이 존재하는 5∼25Hz 영역의 서브밴드 신호들을 선택하여 feature를 계산함으로써 QRS complex 검출을 실시하였다. 제안된 알고리즘의 성능 비교를 위하여 MIT-BIH arrhythmia database를 사용하였으며, sensitivity는 99.82%, positive predictivity는 99.82, 평균 검출율은 99.67%로 기존의 알고리즘에 비해 높은 검출 성능을 나타내었다. 또한 polyphase representation을 이용하여 M 채널 필터 뱅크를 구현한 결과 연산 시간이 단추되어 실시간 검출이 가능함을 확인하였다.

• Journal of Korea Multimedia Society
• /
• v.22 no.1
• /
• pp.18-26
• /
• 2019

In this paper we propose how to detect circular objects in the gray scale image and segment them using the discrete Morse theory, which makes it possible to analyze the topology of a digital image, when it is transformed into the data structure of some combinatorial complex. It is possible to get meaningful information about how many connected components and topologically circular shapes are in the image by computing the persistent homology of the filtration using the Morse complex. We obtain a Morse complex by modeling an image as a cubical cellular complex. Each cell in the Morse complex is the critical point at which the topological structure changes in the filtration consisting of the level sets of the image. In this paper, we implement the proposed algorithm of segmenting the circularly shaped objects with a long persistence of homology as well as computing persistent homology along the filtration of the input image and displaying in the form of a persistence diagram.