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.

New regularization method and iteratively reweighted algorithm for sparse vector recovery

Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.

Low-Rank and Sparse Representation with Adaptive Neighborhood Regularization for Hyperspectral Image Classification

Low-Rank and Sparse Representation(LRSR)method has gained popularity in Hyperspectral Image(HSI)processing.However,existing LRSR models rarely exploited spectral-spatial classification of HSI.In this paper,we proposed a novel Low-Rank and Sparse Representation with Adaptive Neighborhood Regularization(LRSR-ANR)method for HSI classification.In the proposed method,we first represent the hyperspectral data via LRSR since it combines both sparsity and low-rankness to maintain global and local data structures simultaneously.The LRSR is optimized by using a mixed Gauss-Seidel and Jacobian Alternating Direction Method of Multipliers(M-ADMM),which converges faster than ADMM.Then to incorporate the spatial information,an ANR scheme is designed by combining Euclidean and Cosine distance metrics to reduce the mixed pixels within a neighborhood.Lastly,the predicted labels are determined by jointly considering the homogeneous pixels in the classification rule of the minimum reconstruction error.Experimental results based on three popular hyperspectral images demonstrate that the proposed method outperforms other related methods in terms of classification accuracy and generalization performance.

Graph Regularized Sparse Coding Method for Highly Undersampled MRI Reconstruction

The imaging speed is a bottleneck for magnetic resonance imaging( MRI) since it appears. To alleviate this difficulty,a novel graph regularized sparse coding method for highly undersampled MRI reconstruction( GSCMRI) was proposed. The graph regularized sparse coding showed the potential in maintaining the geometrical information of the data. In this study, it was incorporated with two-level Bregman iterative procedure that updated the data term in outer-level and learned dictionary in innerlevel. Moreover,the graph regularized sparse coding and simple dictionary updating stages derived by the inner minimization made the proposed algorithm converge in few iterations, meanwhile achieving superior reconstruction performance. Extensive experimental results have demonstrated GSCMRI can consistently recover both real-valued MR images and complex-valued MR data efficiently,and outperform the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.

Rare Bird Sparse Recognition via Part-Based Gist Feature Fusion and Regularized Intraclass Dictionary Learning

Rare bird has long been considered an important in the field of airport security,biological conservation,environmental monitoring,and so on.With the development and popularization of IOT-based video surveillance,all day and weather unattended bird monitoring becomes possible.However,the current mainstream bird recognition methods are mostly based on deep learning.These will be appropriate for big data applications,but the training sample size for rare bird is usually very short.Therefore,this paper presents a new sparse recognition model via improved part detection and our previous dictionary learning.There are two achievements in our work:(1)after the part localization with selective search,the gist feature of all bird image parts will be fused as data description;(2)the fused gist feature needs to be learned through our proposed intraclass dictionary learning with regularized K-singular value decomposition.According to above two innovations,the rare bird sparse recognition will be implemented by solving one l1-norm optimization.In the experiment with Caltech-UCSD Birds-200-2011 dataset,results show the proposed method can have better recognition performance than other SR methods for rare bird task with small sample size.

A multi-source image fusion algorithm based on gradient regularized convolution sparse representation

Image fusion based on the sparse representation(SR)has become the primary research direction of the transform domain method.However,the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image,resulting in limited image detail retention and a high registration misalignment sensitivity.In order to overcome these shortcomings and the noise existing in the image of the fusion process,this paper proposes a new signal decomposition model,namely the multi-source image fusion algorithm of the gradient regularization convolution SR(CSR).The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components.The sparse coefficient is obtained by the gradient regularization CSR model,and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image.The best low frequency component is obtained by using the fusion strategy of the extreme or the average value.The final fused image is obtained by adding two optimal components.Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.

Two-Level Bregman Method for MRI Reconstruction with Graph Regularized Sparse Coding

In this paper, a two-level Bregman method is presented with graph regularized sparse coding for highly undersampled magnetic resonance image reconstruction. The graph regularized sparse coding is incorporated with the two-level Bregman iterative procedure which enforces the sampled data constraints in the outer level and updates dictionary and sparse representation in the inner level. Graph regularized sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge with a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can consistently reconstruct both simulated MR images and real MR data efficiently, and outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.

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.

Sparse reconstruction for fluorescence molecular tomography via a fast iterative algorithm

Fluorescence molecular tomography(FMT)is a fast-developing optical imaging modalitythat has great potential in early diagnosis of disease and drugs development.However,recon-struction algorithms have to address a highly ill-posed problem to fulfll 3D reconstruction inFMT.In this contribution,we propose an efficient iterative algorithm to solve the large-scalereconstruction problem,in which the sparsity of fluorescent targets is taken as useful a prioriinformation in designing the reconstruction algorithm.In the implementation,a fast sparseapproximation scheme combined with a stage-wise learning strategy enable the algorithm to dealwith the ill-posed inverse problem at reduced computational costs.We validate the proposed fastiterative method with numerical simulation on a digital mouse model.Experimental results demonstrate that our method is robust for different finite element meshes and different Poissonnoise levels.

Single color image super-resolution using sparse representation and color constraint

Color image super-resolution reconstruction based on the sparse representation model usually adopts the regularization norm(e.g.,L1 or L2).These methods have limited ability to keep image texture detail to some extent and are easy to cause the problem of blurring details and color artifacts in color reconstructed images.This paper presents a color super-resolution reconstruction method combining the L2/3 sparse regularization model with color channel constraints.The method converts the low-resolution color image from RGB to YCbCr.The L2/3 sparse regularization model is designed to reconstruct the brightness channel of the input low-resolution color image.Then the color channel-constraint method is adopted to remove artifacts of the reconstructed highresolution image.The method not only ensures the reconstruction quality of the color image details,but also improves the removal ability of color artifacts.The experimental results on natural images validate that our method has improved both subjective and objective evaluation.

Sparse Solutions of Mixed Complementarity Problems

In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.

Gregory Solid Construction for Polyhedral Volume Parameterization by Sparse Optimization

In isogeometric analysis,it is frequently required to handle the geometric models enclosed by four-sided or non-four-sided boundary patches,such as trimmed surfaces.In this paper,we develop a Gregory solid based method to parameterize those models.First,we extend the Gregory patch representation to the trivariate Gregory solid representation.Second,the trivariate Gregory solid representation is employed to interpolate the boundary patches of a geometric model,thus generating the polyhedral volume parametrization.To improve the regularity of the polyhedral volume parametrization,we formulate the construction of the trivariate Gregory solid as a sparse optimization problem,where the optimization objective function is a linear combination of some terms,including a sparse term aiming to reduce the negative Jacobian area of the Gregory solid.Then,the alternating direction method of multipliers(ADMM)is used to solve the sparse optimization problem.Lots of experimental examples illustrated in this paper demonstrate the effectiveness and efficiency of the developed method.

A Generalized Elastic Net Regularization with Smoothed <i>l</i>₀Penalty

This paper presents an accurate and efficient algorithm for solving the generalized elastic net regularization problem with smoothed l0 penalty for recovering sparse vector. Finding the optimal solution to the unconstrained l0 minimization problem in the recovery of compressive sensed signals is an NP-hard problem. We proposed an iterative algorithm to solve this problem. We then prove that the algorithm is convergent based on algebraic methods. The numerical result shows the efficiency and the accuracy of the algorithm.

Robust elastic impedance inversion using L1-norm misfit function and constraint regularization

The classical elastic impedance(EI) inversion method,however,is based on the L2-norm misfit function and considerably sensitive to outliers,assuming the noise of the seismic data to be the Guassian-distribution.So we have developed a more robust elastic impedance inversion based on the L1-norm misfit function,and the noise is assumed to be non-Gaussian.Meanwhile,some regularization methods including the sparse constraint regularization and elastic impedance point constraint regularization are incorporated to improve the ill-posed characteristics of the seismic inversion problem.Firstly,we create the Ll-norm misfit objective function of pre-stack inversion problem based on the Bayesian scheme within the sparse constraint regularization and elastic impedance point constraint regularization.And then,we obtain more robust elastic impedances of different angles which are less sensitive to outliers in seismic data by using the IRLS strategy.Finally,we extract the P-wave and S-wave velocity and density by using the more stable parameter extraction method.Tests on synthetic data show that the P-wave and S-wave velocity and density parameters are still estimated reasonable with moderate noise.A test on the real data set shows that compared to the results of the classical elastic impedance inversion method,the estimated results using the proposed method can get better lateral continuity and more distinct show of the gas,verifying the feasibility and stability of the method.

基于非凸与不可分离正则化算法的电容层析成像图像重建

搅拌器内两相混合是化工生产中常见的现象,电容层析成像(ECT)技术主要对两相分布进行可视化重构,以达到监测的目的。受稀疏贝叶斯学习的启发,提出了一种非凸与不可分离正则化(NNR)算法重建ECT图像。在稀疏先验的基础上引入矩阵低秩特性,采用最大后验估计在潜在空间中提出一个新的优化问题,利用对偶变量将潜在空间的目标函数映射到原始空间进行迭代求解,用来恢复同时稀疏与低秩的矩阵。与凸近似L1范数相比,NNR算法可获得更准确的重建图像,同时比非凸可分离方法更容易收敛到全局最优解。为验证NNR算法的重建效果,通过数值仿真与静态实验的方法分别与其他5种算法进行重建对比。结果表明:NNR算法可以有效减少重建伪影,提升中心物体的重建质量,为搅拌器内两相分布提供了高质量的重建算法。

基于稀疏正则化的加权叠加集成多标签分类

为了充分挖掘成对标签的相关性以及分类器权重与分类器选择之间的关系,提出一种基于稀疏正则化的加权叠加集成多标签分类方法。提出一个稀疏正则化的加权叠加集成模型,以便于多标签分类器的选择和集成成员的构建。利用分类器权值和标签相关性来提高分类性能。进一步提出基于加速近端梯度和块坐标下降技术的优化算法来有效地获得最优解。在多个数据集上的实验结果表明,该方法能够有效实现较高精度的多标签分类。

基于重加权L1的ATpV正则化叠前反演方法

地震叠前反演能够准确获取地下储层介质的各类参数,是油气的勘探与开发中重要技术之一。然而,地震反演是典型的病态问题,为了克服此问题,通常使用正则化约束目标函数,来减轻反演问题的病态性。但是正则化约束忽略了地层边界的振幅信息,使用重加权方法可以很好地克服这一问题,更好地恢复稀疏性。提出了一种基于重加权L1的ATpV正则化叠前三参数反演方法(ATpV-L1方法),首次将重加权L1方法与ATpV方法结合,并引入到叠前反演中。采用交替方向乘子算法(ADMM)建立反演框架,对目标函数进行分块优化,有效提高了收敛速度。首先,介绍ATpV-L1方法,建立了基于ATpV-L1的叠前反演目标函数;然后,应用理论模拟数据对比新方法和ATpV方法反演结果,验证了方法的效果;最后,使用实际数据进行实验分析,进一步验证了ATpV-L1方法的反演精度及可行性。实验结果表明,提出的ATpV-L1方法可以有效恢复反演结果的稀疏性,提高反演精度。

基于视觉传达技术的激光光斑图像超分辨率重建方法

激光光斑图像在成像过程中易受到成像条件和成像方式的限制,导致激光光斑图像的分辨率比较低,难以满足实际需求。为此,提出基于视觉传达技术的激光光斑图像超分辨率重建方法。采用视觉传达技术采集激光光斑图像,并使用双树复小波阈值方法对激光光斑图像去噪处理,通过改进稠密神经网络提取激光光斑图像特征,基于奇异值分解方法降低字典中原子的数目,改进稀疏表达正则化方法,实现激光光斑图像的超分辨率重建。实验结果表明,所提方法的低分辨率图像重建结果与原始图像更加接近,重建图像的结构相似度均在0.9以上,证明该方法的重建效果好、更适合实际应用。

基于有约束L_(1/2)范数稀疏正则化的声源识别方法

基于等效源法(equivalent source method,ESM)的近场声全息(near field acoustic holography,NAH)是一种有效的声源识别技术。然而,针对空间稀疏分布的声源识别问题,传统基于L_(2)范数以及基于L_(1)范数的ESM方法分别存在声源幅值被低估与算法稳定性差等问题。因此,提出了基于有约束L_(1/2)范数稀疏正则化的声源识别方法,该方法具有强稀疏性与强抗干扰的优势,可以解决传统方法的声源识别精度低的问题。通过数值模拟试验以及普通室内的实测实验,验证了方法的有效性。

高斯线性模型正则估计的Cramér-Rao下界

该文针对正则化高斯模型中参数估计的Cramér-Rao下界(CRB)开展研究,提出了一种新型CRB.在线性高斯模型的设计矩阵单位正交的假设下,给出L_1类正则估计的方差及CRB的显式表达,并进行数值计算.进一步地,推导了正则估计的CRB取等条件:在线性高斯模型中,取得CRB的估计均为线性估计量;在正则项可微的假设下,仅二次多项式正则项可令估计取得CRB.最后,针对带稀疏特征的估计提出sparse CRB,将其与现有的CRB比较,从理论和实践两方面说明了其优势.