Impact Force Localization and Reconstruction via ADMM-based Sparse Regularization Method

In practice,simultaneous impact localization and time history reconstruction can hardly be achieved,due to the illposed and under-determined problems induced by the constrained and harsh measuring conditions.Although l_(1) regularization can be used to obtain sparse solutions,it tends to underestimate solution amplitudes as a biased estimator.To address this issue,a novel impact force identification method with l_(p) regularization is proposed in this paper,using the alternating direction method of multipliers(ADMM).By decomposing the complex primal problem into sub-problems solvable in parallel via proximal operators,ADMM can address the challenge effectively.To mitigate the sensitivity to regularization parameters,an adaptive regularization parameter is derived based on the K-sparsity strategy.Then,an ADMM-based sparse regularization method is developed,which is capable of handling l_(p) regularization with arbitrary p values using adaptively-updated parameters.The effectiveness and performance of the proposed method are validated on an aircraft skin-like composite structure.Additionally,an investigation into the optimal p value for achieving high-accuracy solutions via l_(p) regularization is conducted.It turns out that l_(0.6)regularization consistently yields sparser and more accurate solutions for impact force identification compared to the classic l_(1) regularization method.The impact force identification method proposed in this paper can simultaneously reconstruct impact time history with high accuracy and accurately localize the impact using an under-determined sensor configuration.

Enhanced Differentiable Architecture Search Based on Asymptotic Regularization

In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.

Convergent Data-Driven Regularizations for CT Reconstruction

The reconstruction of images from their corresponding noisy Radon transform is a typical example of an ill-posed linear inverse problem as arising in the application of computerized tomography(CT).As the(naive)solution does not depend on the measured data continuously,regularization is needed to reestablish a continuous dependence.In this work,we investigate simple,but yet still provably convergent approaches to learning linear regularization methods from data.More specifically,we analyze two approaches:one generic linear regularization that learns how to manipulate the singular values of the linear operator in an extension of our previous work,and one tailored approach in the Fourier domain that is specific to CT-reconstruction.We prove that such approaches become convergent regularization methods as well as the fact that the reconstructions they provide are typically much smoother than the training data they were trained on.Finally,we compare the spectral as well as the Fourier-based approaches for CT-reconstruction numerically,discuss their advantages and disadvantages and investigate the effect of discretization errors at differentresolutions.

Trigonometric Regularization and Continuation Method Based Time-Optimal Control of Hypersonic Vehicles

Aiming at the time-optimal control problem of hypersonic vehicles(HSV)in ascending stage,a trigonometric regularization method(TRM)is introduced based on the indirect method of optimal control.This method avoids analyzing the switching function and distinguishing between singular control and bang-bang control,where the singular control problem is more complicated.While in bang-bang control,the costate variables are unsmooth due to the control jumping,resulting in difficulty in solving the two-point boundary value problem(TPBVP)induced by the indirect method.Aiming at the easy divergence when solving the TPBVP,the continuation method is introduced.This method uses the solution of the simplified problem as the initial value of the iteration.Then through solving a series of TPBVP,it approximates to the solution of the original complex problem.The calculation results show that through the above two methods,the time-optimal control problem of HSV in ascending stage under the complex model can be solved conveniently.

Composition Analysis and Identification of Ancient Glass Products Based on L1 Regularization Logistic Regression

In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluster analysis, hyper-parameter test and other models, and SPSS, Python and other tools were used to obtain the classification rules of glass products under different fluxes, sub classification under different chemical compositions, hyper-parameter K value test and rationality analysis. Research can provide theoretical support for the protection and restoration of ancient glass relics.

Low-Rank Multi-View Subspace Clustering Based on Sparse Regularization

Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.

Regularization by Multiple Dual Frames for Compressed Sensing Magnetic Resonance Imaging With Convergence Analysis

Plug-and-play priors are popular for solving illposed imaging inverse problems. Recent efforts indicate that the convergence guarantee of the imaging algorithms using plug-andplay priors relies on the assumption of bounded denoisers. However, the bounded properties of existing plugged Gaussian denoisers have not been proven explicitly. To bridge this gap, we detail a novel provable bounded denoiser termed as BMDual,which combines a trainable denoiser using dual tight frames and the well-known block-matching and 3D filtering(BM3D)denoiser. We incorporate multiple dual frames utilized by BMDual into a novel regularization model induced by a solver. The proposed regularization model is utilized for compressed sensing magnetic resonance imaging(CSMRI). We theoretically show the bound of the BMDual denoiser, the bounded gradient of the CSMRI data-fidelity function, and further demonstrate that the proposed CSMRI algorithm converges. Experimental results also demonstrate that the proposed algorithm has a good convergence behavior, and show the effectiveness of the proposed algorithm.

Echo State Network With Probabilistic Regularization for Time Series Prediction

Recent decades have witnessed a trend that the echo state network(ESN)is widely utilized in field of time series prediction due to its powerful computational abilities.However,most of the existing research on ESN is conducted under the assumption that data is free of noise or polluted by the Gaussian noise,which lacks robustness or even fails to solve real-world tasks.This work handles this issue by proposing a probabilistic regularized ESN(PRESN)with robustness guaranteed.Specifically,we design a novel objective function for minimizing both the mean and variance of modeling error,and then a scheme is derived for getting output weights of the PRESN.Furthermore,generalization performance,robustness,and unbiased estimation abilities of the PRESN are revealed by theoretical analyses.Finally,experiments on a benchmark dataset and two real-world datasets are conducted to verify the performance of the proposed PRESN.The source code is publicly available at https://github.com/LongJinlab/probabilistic-regularized-echo-state-network.

An improved four-dimensional variation source term inversion model with observation error regularization

Aiming at the Four-Dimensional Variation source term inversion algorithm proposed earlier,the observation error regularization factor is introduced to improve the prediction accuracy of the diffusion model,and an improved Four-Dimensional Variation source term inversion algorithm with observation error regularization(OER-4DVAR STI model)is formed.Firstly,by constructing the inversion process and basic model of OER-4DVAR STI model,its basic principle and logical structure are studied.Secondly,the observation error regularization factor estimation method based on Bayesian optimization is proposed,and the error factor is separated and optimized by two parameters:error statistical time and deviation degree.Finally,the scientific,feasible and advanced nature of the OER-4DVAR STI model are verified by numerical simulation and tracer test data.The experimental results show that OER-4DVAR STI model can better reverse calculate the hazard source term information under the conditions of high atmospheric stability and flat underlying surface.Compared with the previous inversion algorithm,the source intensity estimation accuracy of OER-4DVAR STI model is improved by about 46.97%,and the source location estimation accuracy is improved by about 26.72%.

Brain Functional Networks with Dynamic Hypergraph Manifold Regularization for Classification of End-Stage Renal Disease Associated with Mild Cognitive Impairment

The structure and function of brain networks have been altered in patients with end-stage renal disease(ESRD).Manifold regularization(MR)only considers the pairing relationship between two brain regions and cannot represent functional interactions or higher-order relationships between multiple brain regions.To solve this issue,we developed a method to construct a dynamic brain functional network(DBFN)based on dynamic hypergraph MR(DHMR)and applied it to the classification of ESRD associated with mild cognitive impairment(ESRDaMCI).The construction of DBFN with Pearson’s correlation(PC)was transformed into an optimization model.Node convolution and hyperedge convolution superposition were adopted to dynamically modify the hypergraph structure,and then got the dynamic hypergraph to form the manifold regular terms of the dynamic hypergraph.The DHMR and L_(1) norm regularization were introduced into the PC-based optimization model to obtain the final DHMR-based DBFN(DDBFN).Experiment results demonstrated the validity of the DDBFN method by comparing the classification results with several related brain functional network construction methods.Our work not only improves better classification performance but also reveals the discriminative regions of ESRDaMCI,providing a reference for clinical research and auxiliary diagnosis of concomitant cognitive impairments.

Diverse Deep Matrix Factorization With Hypergraph Regularization for Multi-View Data Representation

Deep matrix factorization(DMF)has been demonstrated to be a powerful tool to take in the complex hierarchical information of multi-view data(MDR).However,existing multiview DMF methods mainly explore the consistency of multi-view data,while neglecting the diversity among different views as well as the high-order relationships of data,resulting in the loss of valuable complementary information.In this paper,we design a hypergraph regularized diverse deep matrix factorization(HDDMF)model for multi-view data representation,to jointly utilize multi-view diversity and a high-order manifold in a multilayer factorization framework.A novel diversity enhancement term is designed to exploit the structural complementarity between different views of data.Hypergraph regularization is utilized to preserve the high-order geometry structure of data in each view.An efficient iterative optimization algorithm is developed to solve the proposed model with theoretical convergence analysis.Experimental results on five real-world data sets demonstrate that the proposed method significantly outperforms stateof-the-art multi-view learning approaches.

Regularization Methods to Approximate Solutions of Variational Inequalities

In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y0, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.

Comparisons between Isotropic and Anisotropic TV Regularizations in Inverse Acoustic Scattering

This article compares the isotropic and anisotropic TV regularizations used in inverse acoustic scattering. It is observed that compared with the traditional Tikhonov regularization, isotropic and anisotropic TV regularizations perform better in the sense of edge preserving. While anisotropic TV regularization will cause distortions along axes. To minimize the energy function with isotropic and anisotropic regularization terms, we use split Bregman scheme. We do several 2D numerical experiments to validate the above arguments.

A Hybrid Regularization-Based Multi-Frame Super-Resolution Using Bayesian Framework

The prime purpose for the image reconstruction of a multi-frame super-resolution is to reconstruct a higher-resolution image through incorporating the knowledge obtained from a series of relevant low-resolution images,which is useful in numerousfields.Nevertheless,super-resolution image reconstruction methods are usually damaged by undesirable restorative artifacts,which include blurring distortion,noises,and stair-casing effects.Consequently,it is always challenging to achieve balancing between image smoothness and preservation of the edges inside the image.In this research work,we seek to increase the effectiveness of multi-frame super-resolution image reconstruction by increasing the visual information and improving the automated machine perception,which improves human analysis and interpretation processes.Accordingly,we propose a new approach to the image reconstruction of multi-frame super-resolution,so that it is created through the use of the regularization framework.In the proposed approach,the bilateral edge preserving and bilateral total variation regularizations are employed to approximate a high-resolution image generated from a sequence of corresponding images with low-resolution to protect significant features of an image,including sharp image edges and texture details while preventing artifacts.The experimental results of the synthesized image demonstrate that the new proposed approach has improved efficacy both visually and numerically more than other approaches.

3D density inversion of gravity gradient data using the extrapolated Tikhonov regularization

We use the extrapolated Tikhonov regularization to deal with the ill-posed problem of 3D density inversion of gravity gradient data. The use of regularization parameters in the proposed method reduces the deviations between calculated and observed data. We also use the depth weighting function based on the eigenvector of gravity gradient tensor to eliminate undesired effects owing to the fast attenuation of the position function. Model data suggest that the extrapolated Tikhonov regularization in conjunction with the depth weighting function can effectively recover the 3D distribution of density anomalies. We conduct density inversion of gravity gradient data from the Australia Kauring test site and compare the inversion results with the published research results. The proposed inversion method can be used to obtain the 3D density distribution of underground anomalies.

Numerical estimation of choice of the regularization parameter for NMR T2 inversion

Nuclear Magnetic inversion is the basis of NMR Resonance （NMR） T2 logging interpretation. The regularization parameter selection of the penalty term directly influences the NMR T2 inversion result. We implemented both norm smoothing and curvature smoothing methods for NMR T2 inversion, and compared the inversion results with respect to the optimal regular- ization parameters （（Xopt） which were selected by the dis- crepancy principle （DP）, generalized cross-validation （GCV）, S-curve, L-curve, and the slope of L-curve methods, respectively. The numerical results indicate that the DP method can lead to an oscillating or oversmoothed solution which is caused by an inaccurately estimated noise level. The （Xopt selected by the L-curve method is occa- sionally small or large which causes an undersmoothed or oversmoothed T2 distribution. The inversion results from GCV, S-curve and the slope of L-curve methods show satisfying inversion results. The slope of the L-curve method with less computation is more suitable for NMR T2 inversion. The inverted T2 distribution from norm smoothing is better than that from curvature smoothing when the noise level is high.

Iterative regularization method for image denoising with adaptive scale parameter

In order to decrease the sensitivity of the constant scale parameter, adaptively optimize the scale parameter in the iteration regularization model （IRM） and attain a desirable level of applicability for image denoising, a novel IRM with the adaptive scale parameter is proposed. First, the classic regularization item is modified and the equation of the adaptive scale parameter is deduced. Then, the initial value of the varying scale parameter is obtained by the trend of the number of iterations and the scale parameter sequence vectors. Finally, the novel iterative regularization method is used for image denoising. Numerical experiments show that compared with the IRM with the constant scale parameter, the proposed method with the varying scale parameter can not only reduce the number of iterations when the scale parameter becomes smaller, but also efficiently remove noise when the scale parameter becomes bigger and well preserve the details of images.

Efficient multiuser detector based on box-constrained dichotomous coordinate descent and regularization

The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.

A Preconditioned Fractional Tikhonov Regularization Method for Large Discrete Ill-posed Problems

The generalized Tikhonov regularization method is one of the most classical methods for the solution of linear systems of equations that arise from the discretization of linear ill-posed problems.However,the approximate solution obtained by the Tikhonov regularization method in general form may lack many details of the exact solution.Combining the fractional Tikhonov method with the preconditioned technique,and using the discrepancy principle for determining the regularization parameter,we present a preconditioned projected fractional Tikhonov regularization method for solving discrete ill-posed problems.Numerical experiments illustrate that the proposed algorithm has higher accuracy compared with the existing classical regularization methods.

Regularization and Choice of the Parameter for the Third Kind Nonlinear Volterra-Stieltjes Integral Equation Solutions

The article is considering the third kind of nonlinear Volterra-Stieltjes integral equations with the solution by Lavrentyev regularizing operator. A uniqueness theorem was proved, and a regularization parameter was chosen. This can be used in further development of the theory of the integral equations in non-standard problems, classes in the numerical solution of third kind Volterra-Stieltjes integral equations, and when solving specific problems that lead to equations of the third kind.