• Communications of the Korean Mathematical Society
• /
• v.13 no.4
• /
• pp.875-888
• /
• 1998

The use of the zeros of Chebyshev polynomial of the first kind $T_{4n＋4(x}$ ) and second kind $U_{2n＋1}$ (x) for Gauss-Chebyshev quad-rature and collocation of singular integral equations of Cauchy type yields computationally accurate solutions over other combinations of $T_{n}$ /(x) and $U_{m}$(x) as in [8]. We show that the coefficient matrix of the overdetermined system has the generalized inverse. We estimate the residual error using the norm of the generalized inverse.e.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.10
• /
• pp.978-982
• /
• 2007

This paper presents the velocity estimation of a mobile robot using a regular polygonal array of optical mice that are installed at the bottom of a mobile robot. First, the basic principle of the proposed velocity estimation method is explained. Second, the velocity kinematics from a mobile robot to an array of optical mice is derived as an overdetermined linear system. Third, for a given set of optical mouse readings, the mobile robot velocity is estimated based on the least squares solution to the obtained system. Finally, simulation results are given to demonstrate the validity of the proposed velocity estimation method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.16-21
• /
• 2004

This paper presents an approximation method for simplifying a high-order transfer function to a low-order transfer function. A model reduction is based on minimizing the error function weighted by the numerator polynomial of reduced systems. The proposed methods provide better low frequency fit and a computer aided algorithm that estimates the coefficients vector for the numerator and denominator polynomial on the simplified systems from an overdetermined linear system constructed by frequency responses of the original systems. Two examples are given to illustrate the feasibilities of the suggested schemes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.8
• /
• pp.649-654
• /
• 2002

The essential philosophy of the QFT(Quantitative Feedback Theory) is that a suitable controller can be found by loop shaping a nominal loop transfer function such that the frequency response of this function does not violate the QFT bounds. The loop shaping synthesis involves the identification of a structure and its specialization by means of the parameter optimization. This paper presents an optimization algorithm to estimate the controller parameters from the frequency transfer function synthesis using the TLS(Total Least Squares) in the QFT loop shaping procedure. The proposed method identifies the parameter vector of the robust controller from an overdetermined linear system developed from rearranging the two dimensional system matrices and output vectors obtained from the QFT bounds. The feasibility of the suggested algorithm is illustrated with an example.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.713-721
• /
• 2008

This paper presents the robust velocity estimation of an omnidirectional mobile robot using a polygonal array of optical mice that are installed at the bottom of the mobile robot. First, the velocity kinematics from a mobile robot to an array of optical mice is derived as an overdetermined linear system. The least squares velocity estimate of a mobile robot is then obtained, which becomes the same as the simple average for a regular polygonal arrangement of optical mice. Next, several practical issues that need be addressed for the use of the least squares mobile robot velocity estimation using optical mice are investigated, which include measurement noises, partial malfunctions, and imperfect installation. Finally, experimental results with different number of optical mice and under different floor surface conditions are given to demonstrate the validity and performance of the proposed least squares mobile robot velocity estimation method.

• Journal of the Korean Mathematical Society
• /
• v.54 no.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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.56-68
• /
• 1994

The objective of camera calibration is to determine the internal optical characteristics of camera and the three-dimensional position and orientation of camera with respect to the real world. Calibration procedure for computer vision should be automatical, accurate and applicable to general purpose cameras and lenses. In this paper, we present camera calibration method which meets the above requirements. The algorithm is based on the two-stage method which takes into account lens distortion in the second stage. In this paper, the overdetermined nonlinear system is established in terms of the constraints to all directions and our calibration algorithm is proposed which is constructed by using Marquardt iterations and our calibration algorithm is proposed which is constructed by using Marquardt iteration method in solving nonlinear equations. Experimental results indicate that lens distortion should be taken into consideration for the calibration of the general-purpose lens. With 24 calibration points acquired out of 512$\times$512 image, the proposed algorithm came up with average error of less than 1 pixel and showed a higher accuracy over the conventional two-stage method.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.151-164
• /
• 2005

The regularized structured total least norm (RSTLN) method finds an approximate solution x and error matrix E to the overdetermined linear system (H + E)x $\approx$ b, preserving structure of H. A new separation scheme by parts of variables for the regularized structured total least norm on blind deconvolution problem is suggested. A method combining the regularized structured total least norm method with a separation by parts of variables can be obtain a better approximated solution and a smaller residual. Computational results for the practical problem with Block Toeplitz with Toeplitz Block structure show the new method ensures more efficiency on image restoration.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.145-146
• /
• 2007

This paper presents the sensitivity analysis of the leasst qsuares velocity estimation of an omnidirectional mobile robot using a regular polygonal array of optical mice. First, the velocity kinematics from a mobile robot to an array of optical mice is derived as an overdetermined linear system. Then, for a given set of optical mouse readings, the least squares velocity estimation of a mobile robot is obtained as the simple average. Finally, the sensitivity analysis of the proposed least squares velocity estimation to imprecise installation is made.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4
• /
• pp.93-97
• /
• 1996

The Total Least Squares(TLS) method is an unbiased estimator for solving overdetermined sets of linear equations Ax${\simeq}$b when errors occur in all data. However, as well as Least Squares(LS) method it doesn't show robustness while the errors have a heavy tailed probability density function. In this paper we proposed a robust method of TLS (Robust TLS, ROTLS) based on the characteristics of TLS solution. And the ROTLS is verified by applying it to system identification problems.