• Title/Summary/Keyword: sparse regularization

Search Result 27, Processing Time 0.025 seconds

L1-norm Regularization for State Vector Adaptation of Subspace Gaussian Mixture Model (L1-norm regularization을 통한 SGMM의 state vector 적응)

  • Goo, Jahyun;Kim, Younggwan;Kim, Hoirin
    • Phonetics and Speech Sciences
    • /
    • v.7 no.3
    • /
    • pp.131-138
    • /
    • 2015
  • In this paper, we propose L1-norm regularization for state vector adaptation of subspace Gaussian mixture model (SGMM). When you design a speaker adaptation system with GMM-HMM acoustic model, MAP is the most typical technique to be considered. However, in MAP adaptation procedure, large number of parameters should be updated simultaneously. We can adopt sparse adaptation such as L1-norm regularization or sparse MAP to cope with that, but the performance of sparse adaptation is not good as MAP adaptation. However, SGMM does not suffer a lot from sparse adaptation as GMM-HMM because each Gaussian mean vector in SGMM is defined as a weighted sum of basis vectors, which is much robust to the fluctuation of parameters. Since there are only a few adaptation techniques appropriate for SGMM, our proposed method could be powerful especially when the number of adaptation data is limited. Experimental results show that error reduction rate of the proposed method is better than the result of MAP adaptation of SGMM, even with small adaptation data.

Two regularization constant selection methods for recursive least squares algorithm with convex regularization and their performance comparison in the sparse acoustic communication channel estimation (볼록 규준화 RLS의 규준화 상수를 정하기 위한 두 가지 방법과 희소성 음향 통신 채널 추정 성능 비교)

  • Lim, Jun-Seok;Hong, Wooyoung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.5
    • /
    • pp.383-388
    • /
    • 2016
  • We develop two methods to select a constant in the RLS (Recursive Least Squares) with the convex regularization. The RLS with the convex regularization was proposed by Eksioglu and Tanc in order to estimate the sparse acoustic channel. However the algorithm uses the regularization constant which needs the information about the true channel response for the best performance. In this paper, we propose two methods to select the regularization constant which don't need the information about the true channel response. We show that the estimation performance using the proposed methods is comparable with the Eksioglu and Tanc's algorithm.

A hybrid-separate strategy for force identification of the nonlinear structure under impact excitation

  • Jinsong Yang;Jie Liu;Jingsong Xie
    • Structural Engineering and Mechanics
    • /
    • v.85 no.1
    • /
    • pp.119-133
    • /
    • 2023
  • Impact event is the key factor influencing the operational state of the mechanical equipment. Additionally, nonlinear factors existing in the complex mechanical equipment which are currently attracting more and more attention. Therefore, this paper proposes a novel hybrid-separate identification strategy to solve the force identification problem of the nonlinear structure under impact excitation. The 'hybrid' means that the identification strategy contains both l1-norm (sparse) and l2-norm regularization methods. The 'separate' means that the nonlinear response part only generated by nonlinear force needs to be separated from measured response. First, the state-of-the-art two-step iterative shrinkage/thresholding (TwIST) algorithm and sparse representation with the cubic B-spline function are developed to solve established normalized sparse regularization model to identify the accurate impact force and accurate peak value of the nonlinear force. Then, the identified impact force is substituted into the nonlinear response separation equation to obtain the nonlinear response part. Finally, a reduced transfer equation is established and solved by the classical Tikhonove regularization method to obtain the wave profile (variation trend) of the nonlinear force. Numerical and experimental identification results demonstrate that the novel hybrid-separate strategy can accurately and efficiently obtain the nonlinear force and impact force for the nonlinear structure.

Double 𝑙1 regularization for moving force identification using response spectrum-based weighted dictionary

  • Yuandong Lei;Bohao Xu;Ling Yu
    • Structural Engineering and Mechanics
    • /
    • v.91 no.2
    • /
    • pp.227-238
    • /
    • 2024
  • Sparse regularization methods have proven effective in addressing the ill-posed equations encountered in moving force identification (MFI). However, the complexity of vehicle loads is often ignored in existing studies aiming at enhancing MFI accuracy. To tackle this issue, a double 𝑙1 regularization method is proposed for MFI based on a response spectrum-based weighted dictionary in this study. Firstly, the relationship between vehicle-induced responses and moving vehicle loads (MVL) is established. The structural responses are then expanded in the frequency domain to obtain the prior knowledge related to MVL and to further construct a response spectrum-based weighted dictionary for MFI with a higher accuracy. Secondly, with the utilization of this weighted dictionary, a double 𝑙1 regularization framework is presented for identifying the static and dynamic components of MVL by the alternating direction method of multipliers (ADMM) method successively. To assess the performance of the proposed method, two different types of MVL, such as composed of trigonometric functions and driven from a 1/4 bridge-vehicle model, are adopted to conduct numerical simulations. Furthermore, a series of MFI experimental verifications are carried out in laboratory. The results shows that the proposed method's higher accuracy and strong robustness to noises compared with other traditional regularization methods.

Multi-strategy structural damage detection based on included angle of vectors and sparse regularization

  • Liu, Huanlin;Yu, Ling;Luo, Ziwei;Chen, Zexiang
    • Structural Engineering and Mechanics
    • /
    • v.75 no.4
    • /
    • pp.415-424
    • /
    • 2020
  • Recently, many structural damage detection (SDD) methods have been proposed to monitor the safety of structures. As an important modal parameter, mode shape has been widely used in SDD, and the difference of vectors was adopted based on sensitivity analysis and mode shapes in the existing studies. However, amplitudes of mode shapes in different measured points are relative values. Therefore, the difference of mode shapes will be influenced by their amplitudes, and the SDD results may be inaccurate. Focus on this deficiency, a multi-strategy SDD method is proposed based on the included angle of vectors and sparse regularization in this study. Firstly, inspired by modal assurance criterion (MAC), a relationship between mode shapes and changes in damage coefficients is established based on the included angle of vectors. Then, frequencies are introduced for multi-strategy SDD by a weighted coefficient. Meanwhile, sparse regularization is applied to improve the ill-posedness of the SDD problem. As a result, a novel convex optimization problem is proposed for effective SDD. To evaluate the effectiveness of the proposed method, numerical simulations in a planar truss and experimental studies in a six-story aluminum alloy frame in laboratory are conducted. The identified results indicate that the proposed method can effectively reduce the influence of noises, and it has good ability in locating structural damages and quantifying damage degrees.

Anti-sparse representation for structural model updating using l norm regularization

  • Luo, Ziwei;Yu, Ling;Liu, Huanlin;Chen, Zexiang
    • Structural Engineering and Mechanics
    • /
    • v.75 no.4
    • /
    • pp.477-485
    • /
    • 2020
  • Finite element (FE) model based structural damage detection (SDD) methods play vital roles in effectively locating and quantifying structural damages. Among these methods, structural model updating should be conducted before SDD to obtain benchmark models of real structures. However, the characteristics of updating parameters are not reasonably considered in existing studies. Inspired by the l norm regularization, a novel anti-sparse representation method is proposed for structural model updating in this study. Based on sensitivity analysis, both frequencies and mode shapes are used to define an objective function at first. Then, by adding l norm penalty, an optimization problem is established for structural model updating. As a result, the optimization problem can be solved by the fast iterative shrinkage thresholding algorithm (FISTA). Moreover, comparative studies with classical regularization strategy, i.e. the l2 norm regularization method, are conducted as well. To intuitively illustrate the effectiveness of the proposed method, a 2-DOF spring-mass model is taken as an example in numerical simulations. The updating results show that the proposed method has a good robustness to measurement noises. Finally, to further verify the applicability of the proposed method, a six-storey aluminum alloy frame is designed and fabricated in laboratory. The added mass on each storey is taken as updating parameter. The updating results provide a good agreement with the true values, which indicates that the proposed method can effectively update the model parameters with a high accuracy.

Sparsity-constrained Extended Kalman Filter concept for damage localization and identification in mechanical structures

  • Ginsberg, Daniel;Fritzen, Claus-Peter;Loffeld, Otmar
    • Smart Structures and Systems
    • /
    • v.21 no.6
    • /
    • pp.741-749
    • /
    • 2018
  • Structural health monitoring (SHM) systems are necessary to achieve smart predictive maintenance and repair planning as well as they lead to a safe operation of mechanical structures. In the context of vibration-based SHM the measured structural responses are employed to draw conclusions about the structural integrity. This usually leads to a mathematically illposed inverse problem which needs regularization. The restriction of the solution set of this inverse problem by using prior information about the damage properties is advisable to obtain meaningful solutions. Compared to the undamaged state typically only a few local stiffness changes occur while the other areas remain unchanged. This change can be described by a sparse damage parameter vector. Such a sparse vector can be identified by employing $L_1$-regularization techniques. This paper presents a novel framework for damage parameter identification by combining sparse solution techniques with an Extended Kalman Filter. In order to ensure sparsity of the damage parameter vector the measurement equation is expanded by an additional nonlinear $L_1$-minimizing observation. This fictive measurement equation accomplishes stability of the Extended Kalman Filter and leads to a sparse estimation. For verification, a proof-of-concept example on a quadratic aluminum plate is presented.

Sparse-View CT Image Recovery Using Two-Step Iterative Shrinkage-Thresholding Algorithm

  • Chae, Byung Gyu;Lee, Sooyeul
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1251-1258
    • /
    • 2015
  • We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

A note on SVM estimators in RKHS for the deconvolution problem

  • Lee, Sungho
    • 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.

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.