• 자원환경지질
• /
• 제28권4호
• /
• pp.425-431
• /
• 1995

Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.317-320
• /
• 2001

Blind adaptive channel identification of communication channels is a problem of important current theoretical and practical concerns. Recently proposed solutions for this problem exploit the diversity induced by antenna array or time oversampling leading to the so-called, second order statistics techniques. And adaptive blind channel identification techniques based on a off-line least-squares approach have been proposed. In this paper, a new approach is proposed that is based on eigenvalue decomposition. And the eigenvector corresponding to the minimum eigenvalue of the covariance matrix of the received signals contains the channel impulse response. And we present a adaptive algorithm to solve this problem. The performance of the proposed technique is evaluated over real measured channel and is compared to existing algorithms.

• 전자공학회논문지B
• /
• 제30B권5호
• /
• pp.52-61
• /
• 1993

This paper deals with adaptive control method of a robot manipulator with one-flexible link. ARMA model is used as a prediction and estimation model, and adaptive control scheme consists of parameter estimation part and adaptive controller. Parameter estimation part estimates ARMA model's coefficients by using recursive least-squares(RLS) algorithm and generates the predicted output. Variable forgetting factor (VFF) is introduced to achieve an efficient estimation, and adaptive controller consists of reference model, error dynamics model and minimum prediction error controller. An optimal input is obtained by minimizing input torque, it's successive input change and the error between the predicted output and the reference output.

• Journal of Mechanical Science and Technology
• /
• 제16권4호
• /
• pp.454-467
• /
• 2002

It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. Toidentifythelocation and depth of a crack in a structure, a method is presented in this paper which uses neuro-fuzzy-evolutionary technique, that is, Adaptive-Network-based Fuzzy Inference System (ANFIS) solved via hybrid learning algorithm (the back-propagation gradient descent and the least-squares method) and Continuous Evolutionary Algorithms (CEAs) solving sir ale objective optimization problems with a continuous function and continuous search space efficiently are unified. With this ANFIS and CEAs, it is possible to formulate the inverse problem. ANFIS is used to obtain the input(the location and depth of a crack) - output(the structural Eigenfrequencies) relation of the structural system. CEAs are used to identify the crack location and depth by minimizing the difference from the measured frequencies. We have tried this new idea on beam structures and the results are promising.

• 한국지능시스템학회논문지
• /
• 제9권6호
• /
• pp.571-576
• /
• 1999

We consider a class of auto-associative memories namely N-Cubes (Neural-network Cubes) in which 2-D gray-level images and hidden sinusoidal 1-D wavelets are stored in cubical memories. First we develop a learning procedure based upon the least-squares algorithm, Therefore each 2-D training image is mapped into the associated 1-D waveform in the training phase. Second we show how the recall procedure minimizes errors among the orthogonal basis functions in the hidden layer. As a 2-D images ould be retrieved in the recall phase. Simulation results confirm the efficiency and the noise-free properties of N-Cubes.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.525-525
• /
• 2000

In this paper, we present recursive algorithms for state space model identification using subspace extraction via Schur complement. It is shown that an estimate of the extended observability matrix can be obtained by subspace extraction via Schur complement. A relationship between the least squares residual and the Schur complement matrix obtained from input-output data is shown, and the recursive algorithms for the subspace-based state-space model identification (4SID) methods are developed. We also proposed the above algorithm for an instrumental variable (IV) based 4SID method. Finally, a numerical example of the application of the algorithms is illustrated.

• 응용통계연구
• /
• 제25권1호
• /
• pp.225-237
• /
• 2012

This study proposes a quantification algorithm for a PLS method with several sets of variables. We called the quantification method for PLS with more than 2 sets of data a generalization. The basis of the quantification for PLS method is singular value decomposition. To derive the form of singular value decomposition in the data with more than 2 sets more easily, we used the constraint, $a^ta+b^tb+c^tc=3$ not $a^ta=1$, $b^tb=1$, and $c^tc=1$, for instance, in the case of 3 data sets. However, to prove that there is no difference, we showed it by the use of 2 data sets case because it is very complicate to prove with 3 data sets. The keys of the study are how to form the singular value decomposition and how to get the coordinates for the plots of variables and observations.

• 한국정밀공학회지
• /
• 제15권8호
• /
• pp.71-80
• /
• 1998

A computer aided system has been developed for the focal length measurement/compensation in camera manufacture. Signal data proportional to light intensity is obtained and sampled very rapidly from the line CCD. Based on the measured signal, the MTF performance is calculated, where the MTF is the ratio of magnitude of the output image to the input image. In order to find the optimum MTF performance, an effcient algorithm has been implemented using the least squares technique. The developed system has been applied to a practical camera manufacturing process, and demonstrated high productivity with high precision.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• pp.296-300
• /
• 1996

This paper presents 3D position estimation algorithm with the images of 2D vision sensors which issues Red Laser Slit light and recieves the line images. Since the sensor usually measures 2D position of corner(or edge) of a body and the measured point is not fixed in the body, the additional information of the corner(or edge) is used. That is, corner(or edge) line is straight and fixed in the body. For the body which moves in a plane, the Transformation matrix between the body coordinate and the reference coordinate is analytically found. For the 3D motion body, linearization technique and least mean squares method are used.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1990년도 하계학술대회 논문집
• /
• pp.60-63
• /
• 1990

This note presents a direct adaptive pole assignment control for general discrete, linear, time-invariant, nonmimum phase system.Controller parameters are estimated from the recursive least-squares algorithm, and some additional auxiliary parameters are obtained from aset of recursive equations based on a certain polynomial identity which is derived from the pole assignment equation and the Bezout identity. This scheme increase the numerical stability of the auxiliary parameters, and guarantees local convergence without any extra conditions for the external input. The effectiveness of the proposed scheme is demonstrated by the computer simulation.