• 전력전자학회논문지
• /
• 제11권2호
• /
• pp.159-163
• /
• 2006

선형 서보 응용분야에서 속도제어기를 정밀하게 조정하기 위해서는 부하 및 가동자의 질량을 항상 정확하게 알고 있어야 한다. 본 논문에서는 선형 영구자석 동기전동기의 가동부 질량을 추정하기 위하여 상수추정 알고리즘으로 최소자승법을 적용한 질량 추정방법을 제안하였다. 먼저 최소자승법을 적용하기 위한 기계적인 동전 시스템에 대한 DARMA(deterministic autoregressive moving average)모델을 유도하고, 유도된 DARMA모델에 최소자승법을 적용한 시뮬레이션 덴 실험 결과를 제시하여 제안한 방법으로 질량을 정밀하게 추정할 수 있음을 보였다.

• Journal of Electrical Engineering and Technology
• /
• 제13권6호
• /
• pp.2344-2353
• /
• 2018

A coupled recursive total least squares (CRTLS) algorithm is proposed for parameter estimation of permanent magnet synchronous machines (PMSMs). TLS considers the errors of both input variables and output ones, and thus achieves more accurate estimates than standard least squares method does. The proposed algorithm consists of two recursive total least squares (RTLS) algorithms for the d-axis subsystem and q-axis subsystem respectively. The incremental singular value decomposition (SVD) for the RTLS obtained by an approximate calculation with less computation. The performance of the CRTLS is demonstrated by simulation and experimental results.

• 대한수학회지
• /
• 제54권2호
• /
• pp.613-626
• /
• 2017

For the overdetermined linear system, when both the data matrix and the observed data are contaminated by noise, Total Least Squares method is an appropriate approach. Since an ill-conditioned data matrix with noise causes a large perturbation in the solution, some kind of regularization technique is required to filter out such noise. In this paper, we consider a Dual regularized Total Least Squares problem. Unlike the Tikhonov regularization which constrains the size of the solution, a Dual regularized Total Least Squares problem considers two constraints; one constrains the size of the error in the data matrix, the other constrains the size of the error in the observed data. Our method derives two nonlinear equations to construct the iterative method. However, since the Jacobian matrix of two nonlinear equations is not guaranteed to be nonsingular, we adopt a trust-region based iteration method to obtain the solution.

• ETRI Journal
• /
• 제42권6호
• /
• pp.922-931
• /
• 2020

A hierarchical iterative algorithm for the canonical polyadic decomposition (CPD) of tensors is proposed by improving the traditional conjugate gradient least squares (CGLS) method. Methods based on algebraic operations are investigated with the objective of estimating the direction of arrival (DoA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors. The proposed algorithm adopts a hierarchical iterative strategy, which enables the algorithm to obtain a fast recovery for the highly collinear factor matrix. Moreover, considering the same accuracy threshold, the proposed algorithm can achieve faster convergence compared with the alternating least squares (ALS) algorithm wherein the highly collinear factor matrix is absent. The results reveal that the proposed algorithm can achieve better performance under the condition of fewer snapshots, compared with the ALS-based algorithm and the algorithm based on generalized eigenvalue decomposition (GEVD). Furthermore, with regard to an array with a small number of sensors, the observed advantage in estimating the DoA and polarization parameters of the signal is notable.

• 한국전자파학회논문지
• /
• 제22권3호
• /
• pp.312-319
• /
• 2011

본 논문에서는 디지털 전치 왜곡 선형화기를 위한 새로운 선형화 알고리즘을 제안하였다. 제안된 알고리즘은 DFP(Davidon-Fletcher-Powell) method를 활용하였다. 또한, 기존의 알고리즘보다 빠른 수렴 속도를 가지며, 가중치 갱신 step-size를 초기 설정값 없이 매 루틴마다 최적의 값을 갱신한다. 전력증폭기 모델링에는 전력 증폭기의 기억 효과를 모델링할 수 있는 memory polynomial 모델을 사용하였고, 선형화기의 전체적인 구성은 간접 학습 구조를 따랐다. 제안된 알고리즘의 성능 검증을 위해 기존의 LMS(Least Mean-Squares), RLS(Recursive Least squares) 알고리즘과 비교하였다.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.1-12
• /
• 2009

Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.

• Journal of the Korean Data and Information Science Society
• /
• 제15권2호
• /
• pp.507-513
• /
• 2004

Least-squares support vector machine (LS-SVM) has been very successful in pattern recognition and function estimation problems for crisp data. In this paper, we propose LS-SVM approach to evaluating fuzzy regression model with multiple crisp inputs and a Gaussian fuzzy output. The proposed algorithm here is model-free method in the sense that we do not need assume the underlying model function. Experimental result is then presented which indicate the performance of this algorithm.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.159-161
• /
• 2003

Fitting the projected wire-frame model to the detected edge pixels on images by using least-squares approach, called Least-squares Model-image Fitting (LSMIF), is the key of the Model-based Building Extraction (MBBE). It is implemented by iteratively adjusting the model parameters to minimize the squares sum of distances from the extracted edge pixels to the projected wire-frame. This paper describes a series of experiments and studies on various factors affect the fitting results, including the edge detectors, the weighting rules, the initial value of parameters, and the number of overlapped images. The experimental result is not only helpful to clarify the influences of each factor, but is also able to enhance the robustness of the LSMIF algorithm.

• Communications for Statistical Applications and Methods
• /
• 제13권2호
• /
• pp.233-241
• /
• 2006

Classical principal component analysis (PCA) can be formulated as finding the linear subspace that best accommodates multidimensional data points in the sense that the sum of squared residual distances is minimized. As alternatives to such LS (least squares) fitting approach, we produce LMS (least median of squares) and LTS (least trimmed squares)-type PCA by minimizing the median of squared residual distances and the trimmed sum of squares, in a similar fashion to Rousseeuw (1984)'s alternative approaches to LS linear regression. Proposed methods adopt the data-driven optimization algorithm of Croux and Ruiz-Gazen (1996, 2005) that is conceptually simple and computationally practical. Numerical examples are given.

• 한국음향학회지
• /
• 제29권2호
• /
• pp.97-101
• /
• 2010

일반적으로 시스템 인식 방법은 입출력에 잡음이 없거나, 출력에만 잡음이 있는 경우를 주 대상으로 한다. 본 논문은 입력 및 출력이 모두 잡음으로 오염되었을 뿐만 아니라 입력에 비해서 출력에 같거나 더 많은 양의 잡음이 개입된 환경에 노출된 Finite Impulse Response 형태의 시스템을 인식하는 새로운 방법을 제안한다. 이를 위해서 입출력의 잡음 수준이 같을 때 최적인 완전최소자승 기법과 출력에만 잡음이 있을 때 최적인 최소자승 기법을 서로 볼록 결합 (convex combination)하여 앞에서 언급한 것과 같은 좀 더 일반화된 잡음 환경에서도 향상된 결과가 나오도록 하였다. 또 제안한 방법이 다양한 잡음 환경에서 응용 가능함을 모의 실험을 통해서 확인하였다.