• Journal of Electrical Engineering and Technology
• /
• v.7 no.4
• /
• pp.606-614
• /
• 2012

A practical recursive linear robust estimation scheme is proposed for target localization in the sensor network which provides range difference of arrival (RDOA) measurements. In order to radically solve the known practical difficulties such as sensitivity for initial guess and heavy computational burden caused by intrinsic nonlinearity of the RDOA based target localization problem, an uncertain linear measurement model is newly derived. In the suggested problem setting, the target localization performance of the conventional linear estimation schemes might be severely degraded under the low SNR condition and be affected by the target position in the sensor network. This motivates us to devise a new sensor network localization algorithm within the framework of the recently developed robust least squares estimation theory. Provided that the statistical information regarding RDOA measurements are available, the estimate of the proposition method shows the convergence in probability to the true target position. Through the computer simulations, the omnidirectional target localization performance and consistency of the proposed algorithm are compared to those of the existing ones. It is shown that the proposed method is more reliable than the total least squares method and the linear correction least squares method.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.215-219
• /
• 2015

Cells in a culture process transform with time and produce many overlapping cells in their vicinity. We are interested in a separation algorithm for images of overlapping cells taken using a fluorescence optical microscope system during a cell culture process. In this study, all cells are assumed to have an ellipse-like shape. For an ellipse fitting-based method, an improved least squares method is used by decomposing the design matrix into quadratic and linear parts for the separation of overlapping cells. Through various experiments, the improved least squares method (numerically stable direct least squares fitting [NSDLSF]) is compared with the conventional least squares method (direct least squares fitting [DLSF]). The results reveal that NSDLSF has a successful separation ratio with an average accuracy of 95% for two overlapping cells, an average accuracy of 91% for three overlapping cells, and about 82% accuracy for four overlapping cells.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.9
• /
• pp.1456-1467
• /
• 1990

The time domain adaptive noise canceller (time domain ANC) with the adaptive compensator and its algorithm, so called compensated least mean squares(CLMS) algorithm, had been introduced to improve the performance of ANC[1]. In this paper the time domain ANC with the adaptive compensator is transformed into the frequency domain ANC with the adaptive ocmpensator. An compensated frequency-domain least mean squares(CFLMS) algorithm that can adapt the proposed frequency domain ANC is presented.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.47-51
• /
• 2005

Using satellite images, an optimal solution to water motion has been presented in this study. Since temperature patterns are suitable tracers in water motion, Sea Surface Temperature (SST) images of Caspian Sea taken by MODIS sensor on board Terra satellite have been used in this study. Two daily SST images with 24 hours time interval are used as input data. Computation of templates correspondence between pairs of images is crucial within motion algorithms using non-rigid body objects. Image matching methods have been applied to estimate water body motion within the two SST images. The least squares matching technique, as a flexible technique for most data matching problems, offers an optimal spatial solution for the motion estimation. The algorithm allows for simultaneous local radiometric correction and local geometrical image orientation estimation. Actually, the correspondence between the two image templates is modeled both geometrically and radiometrically. Geometric component of the model includes six geometric transformation parameters and radiometric component of the model includes two radiometric transformation parameters. Using the algorithm, the parameters are automatically corrected, optimized and assessed iteratively by the least squares algorithm. The method used in this study, has presented more efficient and robust solution compared to the traditional motion estimation schemes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1189-1191
• /
• 2005

This paper introduces the least-squares order-recursive lattice (LSORL) Laguerre smoother that has order-recursive smoothing structure based on the Laguerre signal representation. The LSORL Laguerre smoother gives excellent performance for a channel equalization problem with smaller order of tap-weights than its counterpart algorithm based on the transversal filter structure. Simulation results show that the LSORL Laguerre smoother gives better performance than the LSORL transversal smoother.

• IE interfaces
• /
• v.23 no.3
• /
• pp.229-238
• /
• 2010

Virtual metrology (VM), a critical component of semiconductor manufacturing, is an efficient way of assessing the quality of wafers not actually measured. This is done based on a model between equipment sensor data (obtained for all wafers) and the quality characteristics of wafers actually measured. This paper considers principal component regression (PCR), partial least squares regression (PLSR), kernel PCR (KPCR), and kernel PLSR (KPLSR) as VM models. For each regression model, two cases are considered. One utilizes all explanatory variables in developing a model, and the other selects significant variables using the genetic algorithm (GA). The prediction performances of 8 regression models are compared for the short- and long-term etch process data. It is found among others that the GA-KPLSR model performs best for both types of data. Especially, its prediction ability is within the requirement for the short-term data implying that it can be used to implement VM for real etch processes.

• Structural Engineering and Mechanics
• /
• v.36 no.2
• /
• pp.225-241
• /
• 2010

In this study, a hybrid search algorithm combining genetic programming with orthogonal least squares (GP/OLS) is utilized to generate prediction models for compressive strength of high performance concrete (HPC) mixes. The GP/OLS models are developed based on a comprehensive database containing 1133 experimental test results obtained from previously published papers. A multiple least squares regression (LSR) analysis is performed to benchmark the GP/OLS models. A subsequent parametric study is carried out to verify the validity of the models. The results indicate that the proposed models are effectively capable of evaluating the compressive strength of HPC mixes. The derived formulas are very simple, straightforward and provide an analysis tool accessible to practicing engineers.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.860-875
• /
• 2005

A new meshfree method for the analysis of elasto-plastic deformations is presented. The method is based on the proposed first-order least-squares formulation, to which the moving least-squares approximation is applied. The least-squares formulation for the classical elasto-plasticity and its extension to an incrementally objective formulation for finite deformations are proposed. In the formulation, the equilibrium equation and flow rule are enforced in least-squares sense, while the hardening law and loading/unloading condition are enforced exactly at each integration point. The closest point projection method for the integration of rate-form constitutive equation is inherently involved in the formulation, and thus the radial-return mapping algorithm is not performed explicitly. Also the penalty schemes for the enforcement of the boundary and frictional contact conditions are devised. The main benefit of the proposed method is that any structure of cells is not used during the whole process of analysis. Through some numerical examples of metal forming processes, the validity and effectiveness of the method are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.521-526
• /
• 2009

In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.37-49
• /
• 2004

We are interested in the problem of fitting a sphere to a set of data points in the three dimensional Euclidean space. In Spath [6] a descent algorithm already have been given to find the sphere of best fit in least squares sense of minimizing the orthogonal distances to the given data points. In this paper we present another new algorithm which computes a parametric represented sphere in order to minimize the sum of the squares of the distances to the given points. For any choice of initial approximations our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.