• 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.

• Smart Structures and Systems
• /
• v.15 no.4
• /
• pp.1103-1120
• /
• 2015

A self-sensing magnetorheological (MR) damper with embedded piezoelectric force sensor has recently been devised to facilitate real-time close-looped control of structural vibration in a simple and reliable manner. The development and characterization of the self-sensing MR damper are presented based on experimental work, which demonstrates its reliable force sensing and controllable damping capabilities. With the use of experimental data acquired under harmonic loading, a nonparametric dynamic model is formulated to portray the nonlinear behaviors of the self-sensing MR damper based on NARX modeling and neural network techniques. The Bayesian regularization is adopted in the network training procedure to eschew overfitting problem and enhance generalization. Verification results indicate that the developed NARX network model accurately describes the forward dynamics of the self-sensing MR damper and has superior prediction performance and generalization capability over a Bouc-Wen parametric model.

• Communications for Statistical Applications and Methods
• /
• v.23 no.1
• /
• pp.71-83
• /
• 2016

In this paper we discuss a deconvolution density estimator obtained using the support vector machines (SVM) and Tikhonov's regularization method solving ill-posed problems in reproducing kernel Hilbert space (RKHS). A remarkable property of SVM is that the SVM leads to sparse solutions, but the support vector deconvolution density estimator does not preserve sparsity as well as we expected. Thus, in section 3, we propose another support vector deconvolution estimator (method II) which leads to a very sparse solution. The performance of the deconvolution density estimators based on the support vector method is compared with the classical kernel deconvolution density estimator for important cases of Gaussian and Laplacian measurement error by means of a simulation study. In the case of Gaussian error, the proposed support vector deconvolution estimator shows the same performance as the classical kernel deconvolution density estimator.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.8 s.239
• /
• pp.903-910
• /
• 2005

Inverse radiation problems are solved for estimating the boundary conditions such as temperature distribution and wall emissivity in axisymmetric absorbing, emitting and scattering medium, given the measured incident radiative heat fluxes. Various regularization methods, such as hybrid genetic algorithm, conjugate-gradient method and finite-difference Newton method, were adopted to solve the inverse problem, while discussing their features in terms of estimation accuracy and computational efficiency. Additionally, we propose a new combined approach that adopts the hybrid genetic algorithm as an initial value selector and uses the finite-difference Newton method as an optimization procedure.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.972-981
• /
• 1990

Many researchers have been interested in whether complex computational problems can be solved by the neural net or not. Especially, problems of early vision are integrated by Tikhonov's regularization theory. Regularization technique can be realized in resistive net. In this paper, we suggest the resistive net with upper and lower thresholder to be able to compute shape from shading and to solve its discontinuous problem. We simulate three algorithms-Horn's algorithm, resistive net and up-low thrwsholding net -with respect to three cases-fully boundary, boundary losing partly and noisy image. As being able to cope with crease and discontinuous parts, we get the good 3D shape from shading.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1903-1906
• /
• 2003

This paper proposes an adaptive regularized noise smoothing algorithm for range image using the area decreasing flow method, which can preserve meaningful edges during the smoothing process. Although the area decreasing flow method can easily smooth Gaussian noise, it has two problems; ⅰ) it is not easy to remove impulsive noise from observed range data, and ⅱ) it is also difficult to remove noise near edge when the adaptive regularization is used. In the paper, therefore, the second smoothness constraint is addtionally incorporated into the existing regularization algorithm, which minimizes the difference between the median filtered data and the estimated data. As a result, the Proposed algorithm can effectively remove the noise of dense range data with edge preserving.

• Smart Structures and Systems
• /
• v.18 no.5
• /
• pp.839-864
• /
• 2016

This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference between the recorded acceleration of a real damaged structure and a hypothetical damaged one. This is performed by updating physical parameters (module of elasticity in this study) in each step using iterative process of modified nonlinear conjugate gradient (M-NCG) and modified Broyden-Fletcher-Goldfarb-Shanno algorithm (M-BFGS) separately. These algorithms are based on sensitivity analysis and provide a solution for nonlinear damage detection problem. Three illustrative test examples are considered to assess the performance of the proposed method. Finally, it is demonstrated that the proposed method is satisfactory for detecting the location and ratio of structural damage in presence of noise.

• Journal of applied mathematics & informatics
• /
• v.38 no.5_6
• /
• pp.519-532
• /
• 2020

In this paper, we first propose a new total variation-based regularization model for image restoration. We next propose a fixed-point-like method for solving the new image restoration model, and then we provide convergence analysis for the fixed-point-like method. To evaluate the feasibility and efficiency of the fixed-point-like method for the new proposed total variation-based regularization model, we provide numerical experiments for several test problems.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1557-1571
• /
• 2017

The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.87-100
• /
• 2002

Poorly-posed problems in the balanced discriminant analysis was considered. We restrict consideration to the case of observations and the number of variables are the same and small. When these problems exist, we do not use a maximum likelihood estimates(MLE) to estimate covariance matrices. Instead of MLE, an alternative estimate for the covariance matrices are proposed. This alternative method make good use of two regularization parameters, $\lambda$} and $\gamma$. A new test rule for the discriminant function is suggested and examined via limited hut informative simulation study. From the simulation study, it is shown that the suggested test rule gives better test result than other previously suggested method in terms of error rate criterion.