• Title/Summary/Keyword: Regularization method

Search Result 299, Processing Time 0.027 seconds

A Resampling Method for Small Sample Size Problems in Face Recognition using LDA (LDA를 이용한 얼굴인식에서의 Small Sample Size문제 해결을 위한 Resampling 방법)

  • Oh, Jae-Hyun;Kwak, Jo-Jun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.78-88
    • /
    • 2009
  • In many face recognition problems, the number of available images is limited compared to the dimension of the input space which is usually equal to the number of pixels. This problem is called as the 'small sample size' problem and regularization methods are typically used to solve this problem in feature extraction methods such as LDA. By using regularization methods, the modified within class matrix becomes nonsingu1ar and LDA can be performed in its original form. However, in the process of adding a scaled version of the identity matrix to the original within scatter matrix, the scale factor should be set heuristically and the performance of the recognition system depends on highly the value of the scalar factor. By using the proposed resampling method, we can generate a set of images similar to but slightly different from the original image. With the increased number of images, the small sample size problem is alleviated and the classification performance increases. Unlike regularization method, the resampling method does not suffer from the heuristic setting of the parameter producing better performance.

MSET PERFORMANCE OPTIMIZATION THROUGH REGULARIZATION

  • HINES J. WESLEY;USYNIN ALEXANDER
    • Nuclear Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.177-184
    • /
    • 2005
  • The Multivariate State Estimation Technique (MSET) is being used in Nuclear Power Plants for sensor and equipment condition monitoring. This paper presents the use of regularization methods for optimizing MSET's predictive performance. The techniques are applied to a simulated data set and a data set obtained from a nuclear power plant currently implementing empirical, on-line, equipment condition monitoring techniques. The results show that regularization greatly enhances the predictive performance. Additionally, the selection of prototype vectors is investigated and a local modeling method is presented that can be applied when computational speed is desired.

An optimal regularization for structural parameter estimation from modal response

  • Pothisiri, Thanyawat
    • Structural Engineering and Mechanics
    • /
    • v.22 no.4
    • /
    • pp.401-418
    • /
    • 2006
  • Solutions to the problems of structural parameter estimation from modal response using leastsquares minimization of force or displacement residuals are generally sensitive to noise in the response measurements. The sensitivity of the parameter estimates is governed by the physical characteristics of the structure and certain features of the noisy measurements. It has been shown that the regularization method can be used to reduce effects of the measurement noise on the estimation error through adding a regularization function to the parameter estimation objective function. In this paper, we adopt the regularization function as the Euclidean norm of the difference between the values of the currently estimated parameters and the a priori parameter estimates. The effect of the regularization function on the outcome of parameter estimation is determined by a regularization factor. Based on a singular value decomposition of the sensitivity matrix of the structural response, it is shown that the optimal regularization factor is obtained by using the maximum singular value of the sensitivity matrix. This selection exhibits the condition where the effect of the a priori estimates on the solutions to the parameter estimation problem is minimal. The performance of the proposed algorithm is investigated in comparison with certain algorithms selected from the literature by using a numerical example.

A Study on Regularization Methods to Evaluate the Sediment Trapping Efficiency of Vegetative Filter Strips (식생여과대 유사 저감 효율 산정을 위한 정규화 방안)

  • Bae, JooHyun;Han, Jeongho;Yang, Jae E;Kim, Jonggun;Lim, Kyoung Jae;Jang, Won Seok
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.61 no.6
    • /
    • pp.9-19
    • /
    • 2019
  • Vegetative Filter Strip (VFS) is the best management practice which has been widely used to mitigate water pollutants from agricultural fields by alleviating runoff and sediment. This study was conducted to improve an equation for estimating sediment trapping efficiency of VFS using several different regularization methods (i.e., ordinary least squares analysis, LASSO, ridge regression analysis and elastic net). The four different regularization methods were employed to develop the sediment trapping efficiency equation of VFS. Each regularization method indicated high accuracy in estimating the sediment trapping efficiency of VFS. Among the four regularization methods, the ridge method showed the most accurate results according to $R^2$, RMSE and MAPE which were 0.94, 7.31% and 14.63%, respectively. The equation developed in this study can be applied in watershed-scale hydrological models in order to estimate the sediment trapping efficiency of VFS in agricultural fields for an effective watershed management in Korea.

Signomial Classification Method with 0-regularization (L0-정규화를 이용한 Signomial 분류 기법)

  • Lee, Kyung-Sik
    • IE interfaces
    • /
    • v.24 no.2
    • /
    • pp.151-155
    • /
    • 2011
  • In this study, we propose a signomial classification method with 0-regularization (0-)which seeks a sparse signomial function by solving a mixed-integer program to minimize the weighted sum of the 0-norm of the coefficient vector of the resulting function and the $L_1$-norm of loss caused by the function. $SC_0$ gives an explicit description of the resulting function with a small number of terms in the original input space, which can be used for prediction purposes as well as interpretation purposes. We present a practical implementation of $SC_0$ based on the mixed-integer programming and the column generation procedure previously proposed for the signomial classification method with $SL_1$-regularization. Computational study shows that $SC_0$ gives competitive performance compared to other widely used learning methods for classification.

Image Reconstruction Using Iterative Regularization Scheme Based on Residual Error in Electrical Impedance Tomography (전기 임피던스 단층촬영법에서 잔류오차 기반의 반복적 조정기법을 이용한 영상 복원)

  • Kang, Suk-In;Kim, Kyung-Youn
    • Journal of IKEEE
    • /
    • v.18 no.2
    • /
    • pp.272-281
    • /
    • 2014
  • In electrical impedance tomography (EIT), modified Newton Raphson (mNR) method is widely used inverse algorithm for static image reconstruction due to its convergence speed and estimation accuracy. The unknown conductivity distribution is estimated iteratively by minimizing a cost functional such that the residual error namely the difference in measured and calculated voltages is reduced. Although, mNR method has good estimation performance, EIT inverse problem still suffers from ill-conditioned and ill-posedness nature. To mitigate the ill-posedness, generally, regularization methods are adopted. The inverse solution is highly dependent on the choice of regularization parameter. In most cases, the regularization parameter has a constant value and is chosen based on experience or trail and error approach. In situations, when the internal distribution changes or with high measurement noise, the solution does not get converged with the use of constant regularization parameter. Therefore, in this paper, in order to improve the image reconstruction performance, we propose a new scheme to determine the regularization parameter. The regularization parameter is computed based on residual error and updated every iteration. The proposed scheme is tested with numerical simulations and laboratory phantom experiments. The results show an improved reconstruction performance when using the proposed regularization scheme as compared to constant regularization scheme.

An Extension of Possibilistic Fuzzy C-means using Regularization (Regularization을 이용한 Possibilistic Fuzzy C-means의 확장)

  • Heo, Gyeong-Yong;NamKoong, Young-Hwan;Kim, Seong-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.43-50
    • /
    • 2010
  • Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.

Finite Element Model Updating of Framed Structures Using Constrained Optimization (구속조건을 가진 최적화기법을 이용한 골조구조물의 유한요소모델 개선기법)

  • Yu, Eun-Jong;Kim, Ho-Geun
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.11a
    • /
    • pp.446-451
    • /
    • 2007
  • An Improved finite element model updating method to address the numerical difficulty associated with ill-conditioning and rank-deficiency. These difficulties frequently occur in model updating problems, when the identification of a larger number of physical parameters is attempted than that warranted by the information content of the experimental data. Based on the standard Bounded Variables Least-squares (BVLS) method, which incorporates the usual upper/lower-bound constraints, the proposed method is equipped with new constraints based on the correlation coefficients between the sensitivity vectors of updating parameters. The effectiveness of the proposed method is investigated through the numerical simulation of a simple framed structure by comparing the results of the proposed method with those obtained via pure BVLS and the regularization method. The comparison indicated that the proposed method and the regularization method yield approximate solutions with similar accuracy.

  • PDF

Iterative Image Restoration using Adaptive Directional Regularization (적응적인 방향성 정칙화 연산자를 이용한 반복 영상복원)

  • Kim, Yong-Hun;Shin, Hyoun-Jin;Yi, Tai-Hong
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.10
    • /
    • pp.862-867
    • /
    • 2006
  • To restore image degraded by blur and additive noise in the optical and electrical system, a regularized iterative restoration is used. A regularization operator is usually applied to all over the image without considering the local characteristics of image in conventional method. As a result, ringing artifacts appear in edge regions and the noise is amplified in flat regions. To solve these problems we propose an adaptive regularization iterative restoration considering the characteristic of edge and flat regions using directional regularization operator. Experimental results show that the proposed method suppresses the noise amplification in flat regions, and restores the edge more sharply in edge regions.