• 전기학회논문지
• /
• 제59권10호
• /
• pp.1874-1881
• /
• 2010

A recursive linear stochastic error compensation algorithm is newly proposed for target localization in sensor network which provides range difference of arrival(RDOA) measurements. Target localization with RDOA is a well-known nonlinear estimation problem. Since it can not solve with a closed-form solution, the numerical methods sensitive to initial guess are often used before. As an alternative solution, a pseudo-linear estimation scheme has been used but the auto-correlation of measurement noise still causes unacceptable estimation errors under low SNR conditions. To overcome these problems, a stochastic error compensation method is applied for the target localization problem under the assumption that a priori stochastic information of RDOA measurement noise is available. Apart from the existing methods, the proposed linear target localization scheme can recursively compute the target position estimate which converges to true position in probability. In addition, it is remarked that the suggested algorithm has a structural reconciliation with the existing one such as linear correction least squares(LCLS) estimator. Through the computer simulations, it is demonstrated that the proposed method shows better performance than the LCLS method and guarantees fast and reliable convergence characteristic compared to the nonlinear method.

• 제어로봇시스템학회논문지
• /
• 제17권10호
• /
• pp.1059-1066
• /
• 2011

This paper makes a close inquiry into ill-conditioning that may be occurred in wireless localization of the sensor nodes based on network signals in the wireless sensor network and provides the clue for solving the problem. In order to estimate the location of a node based on the range information calculated using the signal propagation time, LS (Least Squares) method is usually used. The LS method estimates the solution that makes the squared estimation error minimal. When a nonlinear function is used for the wireless localization, ILS (Iterative Least Squares) method is used. The ILS method process the LS method iteratively after linearizing the nonlinear function at the initial nominal point. This method, however, has a problem that the final solution may converge into a LM (Local Minimum) instead of a GM (Global Minimum) according to the deployment of the fixed nodes and the initial nominal point. The conditions that cause the problem are explained and an adaptive method is presented to solve it, in this paper. It can be expected that the stable location solution can be provided in implementation of the wireless localization methods based on the results of this paper.

• 대한산업공학회지
• /
• 제17권2호
• /
• pp.131-142
• /
• 1991

The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

• 한국정보통신학회논문지
• /
• 제11권12호
• /
• pp.2382-2390
• /
• 2007

본 논문에서는 비선형 앰프를 선형화 하는 다항식에 기반한 사전왜곡 알고리즘을 제안한다. 제안된 방식은 기존의 다항식 기반 방식과는 다르게 사후왜곡기의 도움 없이 직접 학습 방식으로 사전왜곡 계수를 추정한다. 먼저 앰프의 특성이 부분 선형으로 가정하여 알고리즘이 유도되고, 다음에 이 알고리즘을 앰프에 대한 어떠한 가정이 필요없는 구조로 변경한다. 제안된 사전왜곡기는 복소 계수를 가지는 다항식으로 구성되며 다항식의 계수는 RLS(recursive least squares)에 기반하여 찾게 된다. 컴퓨터 모의실험에 의하면 제안된 직접방식의 알고리즘이 기존의 간접 학습 방식에 비해 앰프의 초기 계수나 포화 영역에서 강인한 특성을 보인다.

• 약학회지
• /
• 제57권1호
• /
• pp.32-36
• /
• 2013

The purpose of this study was to determine the influence of assay error for improved pharmacokinetic modeling and simulation of vancomycin on the Bayesian and nonlinear least squares regression analysis in 24 Korean gastric cancer patients. Vancomycin 1.0 g was administered intravenously over 1 hr every 12 hr. Three specimens were collected at 72 hr after the first dose from all patients at the following times, at 0.5 hr before regularly scheduled infusion, at 0.5 hr and 2 hr after the end of 1 hr infusion. Serum vancomycin levels were analyzed by fluorescence polarization immunoassay technique with TDX-FLX. The standard deviation (SD) of the assay over its working range had been determined at the serum vancomycin concentrations of 0, 20, 40, 60, 80 and $120{\mu}g/ml$ in quadruplicate. The polynomial equation of vancomycin assay error was found to be SD $({\mu}g/ml)=0.0224+0.0540C+0.00173C^2$ ($R^2=0.935$). There were differences in the influence of weight with vancomycin assay error on pharmacokinetic parameters of vancomycin using the nonlinear least squares regression analysis but there were no differences on the Bayesian analysis. This polynomial equation can be used to improve the precision of fitting of pharmacokinetic models to optimize the process of model simulation both for population and for individualized pharmacokinetic models. The result suggests the improvement of dosage regimens for the better and safer care of patients receiving vancomycin.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.609-617
• /
• 2006

A new fuzzy c-regression algorithm for switching regression analysis is presented, which combines fuzzy c-means clustering and least squares support vector machine. This algorithm can detect outliers in switching regression models while yielding the simultaneous estimates of the associated parameters together with a fuzzy c-partitions of data. It can be employed for the model-free nonlinear regression which does not assume the underlying form of the regression function. We illustrate the new approach with some numerical examples that show how it can be used to fit switching regression models to almost all types of mixed data.

• 한국항공운항학회지
• /
• 제18권3호
• /
• pp.21-26
• /
• 2010

This paper deals with the precise parameter estimation of an air vehicle without a priori information. First, Recursive Least Squares technique, which is an equation error method and does not require any a priori information, is applied and then the extended Kalman filter is used to tune parameters more precisely. To show the performance, a nonlinear longitudinal missile model is simulated and the parameters are estimated. The results show that this consecutive application of the techniques gives a very good estimation performance.

• Journal of the Korean Data and Information Science Society
• /
• 제24권2호
• /
• pp.391-399
• /
• 2013

Partially linear regression is capable of providing more complete description of the linear and nonlinear relationships among random variables. In support vector regression (SVR) the hyper-parameters are known to affect the performance of regression. In this paper we propose an iterative reweighted least squares (IRWLS) procedure to solve the quadratic problem of partially linear support vector regression with a modified loss function, which enables us to use the generalized approximate cross validation function to select the hyper-parameters. Experimental results are then presented which illustrate the performance of the partially linear SVR using IRWLS procedure.

• Journal of information and communication convergence engineering
• /
• 제16권1호
• /
• pp.17-22
• /
• 2018

In massive multiple-input multiple-output (MIMO) systems, linear channel estimation algorithms are widely applied owing to their simple structures. However, they may cause pilot contamination, which affects the subsequent data detection performance. Therefore, herein, for an uplink multicell massive multiuser MIMO system, we consider using an alternating projection (AP) for channel estimation to eliminate the effect of pilot contamination and improve the performance of data detection in terms of the bit error rates as well. Even though the AP is nonlinear, it iteratively searches the best solution in only one dimension, and the computational complexity is thus modest. We have analyzed the mean square error with respect to the signal-to-interference ratios for both the cooperative and non-cooperative multicell scenarios. From the simulation results, we observed that the channel estimation results via the AP benefit the following signal detection more than that via the least squares for both the cooperative and non-cooperative multicell scenarios.

• Industrial Engineering and Management Systems
• /
• 제14권3호
• /
• pp.312-317
• /
• 2015

The dynamic system approach in time series has been used in many real problems. Based on Taken's embedding theorem, we can build the predictive function where input is the time delay coordinates vector which consists of the lagged values of the observed series and output is the future values of the observed series. Although the time delay coordinates vector from multivariate time series brings more information than the one from univariate time series, it can exhibit statistical redundancy which disturbs the performance of the prediction function. We apply dimension reduction techniques to solve this problem and analyze the effect of this approach for prediction. Our experiment uses delayed Lorenz series; least squares support vector regression approximates the predictive function. The result shows that linearly preserving projection improves the prediction performance.