• 한국지능시스템학회논문지
• /
• 제21권3호
• /
• pp.401-406
• /
• 2011

복잡해진 최적화문제를 전통적인 방법보다 효율적으로 해결하기위해 유전알고리즘이나 개미군집화, 하모니서치알고리즘과 같은 다양한 메타휴리스틱이 개발되었다. 그 중에서 하모니 서치알고리즘이 다른 메타휴리스틱알고리즘보다 좋은 결과를 보이고 있다. 하모니 서치 알고리즘은 음악을 작곡할 때 아름다운 소리를 내는 하모니를 찾는 과정을 모방했다. 성능은 하모니 메모리에서 선택하는 비율인 HMCR값과 하모니 메모리에서 선택된 값의 조정 비율을 결정하는 PAR값에 따라 달라지는 것으로 알려져 있다. 다르게 말하면 두 변수의 기반이 되는 하모니 메모리의 사용방법의 문제로 볼 수 있다. 본 논문은 설정한 기간 동안 더 좋은 최적해를 찾지 못할 경우 하모니 메모리의 일부를 좋은 하모니로 구성되게 수정하는 방법을 제안했다. 테스트 함수를 이용한 검증 실험결과에서 하모니 메모리를 수정할 경우 정확도 변화가 적어 신뢰성 있는 정확도를 보였으며, Iteration이 짧더라도 최적값에 근접한 값을 찾았다.

• 한국컴퓨터정보학회논문지
• /
• 제14권10호
• /
• pp.83-92
• /
• 2009

본 논문에서는 컬러 영상에서 관심객체를 분할하기 위해 컬러 분산 에너지를 이용하는 확장 스네이크 알고리즘을 제안한다. 기존 스네이크 알고리즘은 영상 내에 존재하는 다양한 에너지들을 정의하여 영상을 관심 객체와 배경으로 분할한다. 스네이크의 성능은 구성하는 에너지의 특성에 따라 주로 좌우된다. 능동 윤곽선 모델인 일반적인 스네이크 알고리즘은 적용이 쉽고 분석이 용이한 영상의 밝기 정보를 주요 에너지로 사용한다. 그러나 영상밝기의 미분연산이나 에지검출과 관련된 에너지는 잡음에 민감하고 배경이 복잡해지면 성능이 좋지 않은 단점을 가지고 있다. 제안하는 알고리즘은 분할 영역의 컬러 분산을 스네이크의 영상 에너지에 추가함으로써 복잡한 배경에서도 관심객체를 효율적으로 분할한다. 제안하는 확장 스네이크 알고리즘의 성능을 단순한 배경과 복잡한 배경을 갖는 컬러 영상에서 관심객체를 분할하는 다양한 실험을 통해서 입증하였다. 그 결과 정확도 면에서 약 12.42 %의 향상된 성능을 보였다.

• Structural Engineering and Mechanics
• /
• 제3권2호
• /
• pp.185-192
• /
• 1995

A numerical algorithm for plane stress and shell elasto-plasticity is presented in this paper. The proposed strain decomposition (SD) algorithm is an elastic predictor/plastic corrector algorithm, and in the context of operator splitting, is a return mapping algorithm. However, it differs significantly from other return mapping algorithms in that only the necessary response functions are used without invoking their gradients, and the stress increment is updated only at the end of the time step. This makes the proposed SD algorithm more suitable for materials with complex yield surfaces and will guard against error accumulation during the time step. Comparative analyses of structural systems using the proposed strain decomposition (SD) algorithm and the iterative radial return (IRR) algorithm are presented. The results demonstrate the accuracy and usefulness of the proposed algorithm.

• Journal of Information Processing Systems
• /
• 제18권3호
• /
• pp.293-301
• /
• 2022

Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.

• 한국전자파학회논문지
• /
• 제23권1호
• /
• pp.108-114
• /
• 2012

본 논문에서는 인체의 전자파 해석을 위해 유한 차분 시간 영역법(FDTD: Finite-Difference Time-Domain)에 적합한 분산 모델링을 제안한다. 주파수에 따라 전기적 특성이 변하는 인체의 분산 특성을 정확하고 효율적으로 모델링을 하기 위해 상대 유전율을 2차 복소수 분수 함수식(QCRF: Quadratic Complex Rational Function)으로 표현하였다. WLSM(Weight Least Square Method) 기반의 복소수 커브 피팅법을 적용하여 인체 조직에 대한 QCRF 계수들을 추출하였으며, QCRF 분산 모델을 FDTD에 적용하는 방법을 논의하였다. 본 논문에서 제안한 QCRF 기반의 인체 분산 모델이 Gabriel의 측정 데이터와 일치하며, FDTD 적용시 Cole-Cole 분산 모델보다 계산 효율이 뛰어남을 확인하였다. 단일 주파수와 광대역 주파수 신호를 입력원으로 한 모의 실험을 통하여 QCRF 기반의 FDTD 분산 알고리즘의 검증 및 분석을 마무리하였다.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제7권1호
• /
• pp.128-141
• /
• 2015

Independent Component Analysis (ICA), one of the blind source separation methods, can be applied for extracting unknown source signals only from received signals. This is accomplished by finding statistical independence of signal mixtures and has been successfully applied to myriad fields such as medical science, image processing, and numerous others. Nevertheless, there are inherent problems that have been reported when using this technique: instability and invalid ordering of separated signals, particularly when using a conventional ICA technique in vibratory source signal identification of complex structures. In this study, a simple iterative algorithm of the conventional ICA has been proposed to mitigate these problems. The proposed method to extract more stable source signals having valid order includes an iterative and reordering process of extracted mixing matrix to reconstruct finally converged source signals, referring to the magnitudes of correlation coefficients between the intermediately separated signals and the signals measured on or nearby sources. In order to review the problems of the conventional ICA technique and to validate the proposed method, numerical analyses have been carried out for a virtual response model and a 30 m class submarine model. Moreover, in order to investigate applicability of the proposed method to real problem of complex structure, an experiment has been carried out for a scaled submarine mockup. The results show that the proposed method could resolve the inherent problems of a conventional ICA technique.

• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.

• 대한전자공학회논문지SP
• /
• 제39권2호
• /
• pp.39-49
• /
• 2002

본 논문에서는 움직임 색상(Moving Color) 개념을 바탕으로 물체의 색상 정보와 움직임 정보의 효율적인 결합을 통해서 추적을 수행하는 MAWUPC(Motion Adaptive Weighted Unmatched Pixel Count)알고리즘을 제안하고, 이를 이용하여 일반적인 배경을 가지는 영상시퀀스에서 얼굴과 손을 추적하는 방법을 제안한다. MAWUPC 알고리즘은 색상 정보와 움직임 정보의 효과적인 결합을 수행하는 움직임 색상 개념에 관한 기존 연구인 AWUPC 알고리즘을 개선한 것으로, 추적하고자 하는 물체의 색상 정보를 이용한 색상 변환(Color Transform)과 움직임 검출을 위한 UPC(Unmatched Pixel Count) 연산, 그리고 움직임 정보를 추출하는 이산 칼만 필터(Discrete Kalman Filter)의 효과적인 결합으로 이루어진다. 제안하는 알고리즘은 일반적으로 물체들의 추적 과정에서 발생되는 가장 큰 문제인 유사한 색상을 가진 추적하고자 하는 물체들간의 겹침 문제와 물체의 추적에서 방해가 되는 복잡한 배경 문제를 해결할 수 있는 장점이 있다. 논문에서는 제안하는 알고리즘이 복잡한 배경 내에서 한 대의 카메라를 사용하여 획득된 컬러 영상을 대상으로 움직임이 있는 얼굴과 손의 추적에서 자주 발생되는 심각한 문제인 얼굴과 손, 손과 손의 겹침 문제를 잘 해결할 수 있다는 것을 실험을 통해 보인다.

• International Journal of Control, Automation, and Systems
• /
• 제1권1호
• /
• pp.101-110
• /
• 2003

This paper introduces an identification method for nonlinear models in the form of rule-based Fuzzy-Neural Networks (FNN). In this study, the development of the rule-based fuzzy neural networks focuses on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The FNN modeling and identification environment realizes parameter identification through synergistic usage of clustering techniques, genetic optimization and a complex search method. We use a HCM (Hard C-Means) clustering algorithm to determine initial apexes of the membership functions of the information granules used in this fuzzy model. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are then adjusted using the identification algorithm of a GA hybrid scheme. The proposed GA hybrid scheme effectively combines the GA with the improved com-plex method to guarantee both global optimization and local convergence. An aggregate objective function (performance index) with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. According to the selection and adjustment of the weighting factor of this objective function, we reveal how to design a model having sound approximation and generalization abilities. The proposed model is experimented with using several time series data (gas furnace, sewage treatment process, and NOx emission process data from gas turbine power plants).

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• pp.439-448
• /
• 2000

A multi-level design synthesis (MLDA) algorithm for efficiently optimizing orthotropic steel deck bridges is proposed in the paper, because it is usually very difficult to optimize orthotropic steel deck bridges using a conventional single-level (CSL) algorithn since the bridges have a large number of members and show complex structural behaviors. In the proposed MLDS algorithms a coordination method is introduced to divide the bridges into main girders and orthotropic steel decks and decomposition method is also used to reduce the number of design variables of the decks for system level optimization. For efficient optimization of the bridges the MLDS algorithm incorporates the crucial approximation techliques such as constraints deletion and stress reanalysis. The constraint deletion technique for deflection is found to be very useful for the optimization problem of the bridges, since a deflection constraint is usually inactive in the design. Considering the complex system of the bridges, the proposed the efficient stress reanalysis technique may prove to be a very effective method, since it does not require expensive design sensitivity analyses. The applicability and robustness of the MLDS algorithm is demonstrated using various numerical examples and compared with other algorithm presently available so far.