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 ...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.展开更多
In this article, the authors consider the weighted bounds for the singular integral operator defined by ■where ? is homogeneous of degree zero and has vanishing moment of order one, and A is a function on Rnsuch that...In this article, the authors consider the weighted bounds for the singular integral operator defined by ■where ? is homogeneous of degree zero and has vanishing moment of order one, and A is a function on Rnsuch that ?A ∈ BMO(R^n). By sparse domination, the authors obtain some quantitative weighted bounds for TAwhen ? satisfies regularity condition of Lr-Dini type for some r ∈(1, ∞).展开更多
功能超网络广泛地应用于脑疾病诊断和分类研究中,而现有的关于超网络创建的研究缺乏解释分组效应的能力或者仅考虑到脑区间组级的信息,这样构建的脑功能超网络会丢失一些有用的连接或包含一些虚假的信息,因此,考虑到脑区间的组结构问题...功能超网络广泛地应用于脑疾病诊断和分类研究中,而现有的关于超网络创建的研究缺乏解释分组效应的能力或者仅考虑到脑区间组级的信息,这样构建的脑功能超网络会丢失一些有用的连接或包含一些虚假的信息,因此,考虑到脑区间的组结构问题,引入sparse group Lasso(sgLasso)方法进一步改善超网络的创建。首先,利用sgLasso方法进行超网络创建;然后,引入两组超网络特有的属性指标进行特征提取以及特征选择,这些指标分别是基于单一节点的聚类系数和基于一对节点的聚类系数;最后,将特征选择后得到的两组有显著差异的特征通过多核学习进行特征融合和分类。实验结果表明,所提方法经过多特征融合取得了87.88%的分类准确率。该结果表明为了改善脑功能超网络的创建,需要考虑到组信息,但不能逼迫使用整组信息,可以适当地对组结构进行扩展。展开更多
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 high...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.展开更多
The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can b...The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.展开更多
基金Supported by National Natural Science Foundation of China (Grant Nos.52305127,52075414)China Postdoctoral Science Foundation (Grant No.2021M702595)。
文摘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.
基金supported by Teacher Research Capacity Promotion Program of Beijing Normal University ZhuhaiNNSF of China under Grant#11461065supported by the NNSF of China under grant#11871108
文摘In this article, the authors consider the weighted bounds for the singular integral operator defined by ■where ? is homogeneous of degree zero and has vanishing moment of order one, and A is a function on Rnsuch that ?A ∈ BMO(R^n). By sparse domination, the authors obtain some quantitative weighted bounds for TAwhen ? satisfies regularity condition of Lr-Dini type for some r ∈(1, ∞).
文摘功能超网络广泛地应用于脑疾病诊断和分类研究中,而现有的关于超网络创建的研究缺乏解释分组效应的能力或者仅考虑到脑区间组级的信息,这样构建的脑功能超网络会丢失一些有用的连接或包含一些虚假的信息,因此,考虑到脑区间的组结构问题,引入sparse group Lasso(sgLasso)方法进一步改善超网络的创建。首先,利用sgLasso方法进行超网络创建;然后,引入两组超网络特有的属性指标进行特征提取以及特征选择,这些指标分别是基于单一节点的聚类系数和基于一对节点的聚类系数;最后,将特征选择后得到的两组有显著差异的特征通过多核学习进行特征融合和分类。实验结果表明,所提方法经过多特征融合取得了87.88%的分类准确率。该结果表明为了改善脑功能超网络的创建,需要考虑到组信息,但不能逼迫使用整组信息,可以适当地对组结构进行扩展。
基金supported by the National Natural Science Foundation of China(Grant No.61372046)the Research Fund for the Doctoral Program ofHigher Education of China(New Teachers)(Grant No.20116101120018)+4 种基金the China Postdoctoral Sci-ence_Foundation_Funded Project(Grant_Nos.2011M501467 and 2012T50814)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China(Grant No.2011JQ1006)the Fund amental Research Funds for the Central Universities(Grant No.GK201302007)Science and Technology Plan Program in Shaanxi Province of China(Grant Nos.2012 KJXX-29 and 2013K12-20-12)the Scienceand Technology Plan Program in Xi'an of China(Grant No.CXY 1348(2)).
文摘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.
基金supported by the National Natural Science Foundation of China(No.61271014)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20124301110003)the Graduated Students Innovation Fund of Hunan Province(No.CX2012B238)
文摘The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.
