• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.399-402
• /
• 2000

In this paper, we present a regularized mixed norm multichannel image restoration algorithm. The problem of multichannel restoration using both within- and between- channel deterministic information is considered. For each channel a functional which combines the least mean squares (LMS), the least mean fourth(LMF), and a smoothing functional is proposed, We introduce a mixed norm parameter that controls the relative contribution between the LMS and the LMF, and a regularization parameter that defines the degree of smoothness of the solution, both updated at each iteration according to the noise characteristics of each channel. The novelty of the proposed algorithm is that no knowledge of the noise distribution for each channel is required, and the parameters mentioned above are adjusted based on the partially restored image.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.849-853
• /
• 2014

In micro-scale electromechanical systems, the power to perform accurate position sensing often greatly exceeds the power needed to generate motion. This paper explores the implications of sampling rate and amplifier noise density selection on the performance of a system identification algorithm using a capacitive sensing circuit. Specific performance objectives are to minimize or limit convergence rate and power consumption to identify the dynamics of a rotary micro-stage. A rearrangement of the conventional recursive least-squares identification algorithm is performed to make operating cost an explicit function of sensor design parameters. It is observed that there is a strong dependence of convergence rate and error on the sampling rate, while energy dependence is driven by error that may be tolerated in the final identified parameters.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.7
• /
• pp.974-988
• /
• 1995

In this paper, we propose a range image segmentation algorithm using robust regression. We derive a least $\kappa$th-order square (LKS) method by generalizing the least median of squares (LMedS) method and compare it with the conventional robust regressions. The LKS is robuster against outliers than the LMedS and shows performance similar to the residual consensus (RESC). The RESC uses the predetermined number of sorted residuals, whereas the LKS uses an adaptive parameter determined by given observations rather than the a priori knowledge. Computer simulation with synthetic and real range images shows that the proposed LKS algorithm gives better performance than the conventional ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Journal of Biomedical Engineering Research
• /
• v.41 no.1
• /
• pp.28-34
• /
• 2020

In this paper, we introduce motion artifact reduction algorithm for interleaved MRI using an advanced 3D approximation algorithm. The motion artifact framework of this paper is data corrected by post-processing with a new 3-D approximation algorithm which uses data structure for each voxel. In this study, we simulate and evaluate our algorithm using Shepp-Logan phantom and T1-MRI template for both scattered dataset and uniform dataset. We generated motion artifact using random generated motion parameters for the interleaved MRI. In simulation, we use image coregistration by SPM12 (https://www.fil.ion.ucl.ac.uk/spm/) to estimate the motion parameters. The motion artifact correction is done with using full dataset with estimated motion parameters, as well as use only one half of the full data which is the case when the half volume is corrupted by severe movement. We evaluate using numerical metrics and visualize error images.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3
• /
• pp.38-44
• /
• 1997

In this study, wer derived LMF-Sato, LMSF-Sato complex blind equalization algorithms for complex data. And then, the convergence rates, the convergence characteristics at the steady state and the stability of the proposed LMF and LMSF blind equalization algorithms are compared with those of LMS-Sato blind equalization algorithm. In simulations with 16-QAM data, LMF-Sato and LMSF-Sato algorithms showed better performance comparing with LMS-Sato algorithm generally. When the initial estimation errors of the weights of the equalizer are large, LMF-Sato algorithm showed ill characteristic in stability. However, LMSF-Sato algorithm has good covergence characteristics and preserves robustness.

• Journal of Biomedical Engineering Research
• /
• v.28 no.5
• /
• pp.665-675
• /
• 2007

The morphological change of ECG is the important diagnostic parameter to finding the malfunction of a heart. Generally ST segment deviation is concerned with myocardial abnormality. The aim of this study is to detect the change of ST in shape using a polynomial approximation method and the reference ST type. The developed algorithm consists of feature point detection, ST level detection and ST shape classification. The detection of QRS complex is accomplished using it's the morphological characteristics such as the steep slope and high amplitude. The developed algorithm detects the ST level change, and then classifies the ST shape type using the polynomial approximation. The algorithm finds the least squares curve for the data between S wave and T wave in ECG. This curve is used for the classification of the ST shapes. ST type is classified by comparing the slopes of the specified points between the reference ST set and the least square curve. Through the result from the developed algorithm, we can know when the ST level change occurs and what the ST shape type is.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1214-1222
• /
• 2006

In this paper, an efficient direction-r)f-arrival based adaptive beamforming algorithm for orthogonal frequency-division multiple-access smart antenna systems is proposed. The proposed algorithm provides a high performance by steering main beams to the directions of a desired signal, whereas steering nulls to the directions of the interference, using the estimated directions. The beamforming outputs obtained by steering the main beams to the distinct directions of resolvable multipath signals are combined in a maximal ratio manner to exploit angular diversity gain. The performance elf the proposed algorithm is finally evaluated in cellular mobile environments to verify its efficiency and is compared with that of least-squares beamforming algorithm, by taking the WiBro system as a target system.

• Proceedings of the KIPE Conference
• /
• 1998.07a
• /
• pp.384-387
• /
• 1998

This paper presents a newly developed speed sensorless drive using RLS(Recursive Least Squares) based on Neural Network Training Algorithm. The proposed algorithm based on the RLS has just the time-varying learning rate, while the well-known back-propagation (or generalized delta rule) algorithm based on gradient descent has a constant learning rate. The number of iterations required by the new algorithm to converge is less than that of the back-propagation algorithm. The RLS based on NN is used to adjust the motor speed so that the neural model output follows the desired trajectory. This mechanism forces the estimated speed to follow precisely the actual motor speed. In this paper, a flux estimation strategy using filter concept is discussed. The theoretical analysis and experimental results to verify the effectiveness of the proposed analysis and the proposed control strategy are described.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2139-2146
• /
• 2008

This paper presents a numerical algorithm for fault location estimation which used to data from both end of the transmission line. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the PMUs(Phasor Measurement Units) in the time-domain. This paper has separated from two part of with/without shunt capacitance(short/long distance). Most fault was arc one-ground fault which is 75% over [1]. so most study focused with it. In this paper, the numerical algorithm has calculated to distance for ground fault and line-line fault. In this paper, the algorithm is given with/without shunt capacitance using II parameter line model, simple impedance model and estimated using DFT(Discrete Fourier Transform) and the LES(Least Error Squares Method). To verify the validity of the proposed algorithm, the EMTP(Electro- Magnetic Transient Program) and MATLAB did used.