In this paper, we extend the alternate Broyden's method to the multiple version fbi solving lincar leastsquarc systems with multiple right-hand sides. We show that the method possesses property of a finite tcrmina...In this paper, we extend the alternate Broyden's method to the multiple version fbi solving lincar leastsquarc systems with multiple right-hand sides. We show that the method possesses property of a finite tcrmination.Some numerical cxperiments are gi von to inustrate the effectiveness of the method.展开更多
A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inne...A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
A novel algorithm, i.e. the fast alternating direction method of multipliers （ADMM）, is applied to solve the classical total-variation （ TV ）-based model for image reconstruction. First, the TV-based model is refo...A novel algorithm, i.e. the fast alternating direction method of multipliers （ADMM）, is applied to solve the classical total-variation （ TV ）-based model for image reconstruction. First, the TV-based model is reformulated as a linear equality constrained problem where the objective function is separable. Then, by introducing the augmented Lagrangian function, the two variables are alternatively minimized by the Gauss-Seidel idea. Finally, the dual variable is updated. Because the approach makes full use of the special structure of the problem and decomposes the original problem into several low-dimensional sub-problems, the per iteration computational complexity of the approach is dominated by two fast Fourier transforms. Elementary experimental results indicate that the proposed approach is more stable and efficient compared with some state-of-the-art algorithms.展开更多
Linear scan computed tomography （LCT） is of great benefit to online industrial scanning and security inspection due to its characteristics of straight-line source trajectory and high scanning speed. However, in prac...Linear scan computed tomography （LCT） is of great benefit to online industrial scanning and security inspection due to its characteristics of straight-line source trajectory and high scanning speed. However, in practical applications of LCT, there are challenges to image reconstruction due to limited-angle and insufficient data. In this paper, a new reconstruction algorithm based on total-variation （TV） minimization is developed to reconstruct images from limited-angle and insufficient data in LCT. The main idea of our approach is to reformulate a TV problem as a linear equality constrained problem where the objective function is separable, and then minimize its augmented Lagrangian function by using alternating direction method （ADM） to solve subproblems. The proposed method is robust and efficient in the task of reconstruction by showing the convergence of ADM. The numerical simulations and real data reconstructions show that the proposed reconstruction method brings reasonable performance and outperforms some previous ones when applied to an LCT imaging problem.展开更多
Electrical capacitance tomography(ECT)has been applied to two-phase flow measurement in recent years.Image reconstruction algorithms play an important role in the successful applications of ECT.To solve the ill-posed ...Electrical capacitance tomography(ECT)has been applied to two-phase flow measurement in recent years.Image reconstruction algorithms play an important role in the successful applications of ECT.To solve the ill-posed and nonlinear inverse problem of ECT image reconstruction,a new ECT image reconstruction method based on fast linearized alternating direction method of multipliers(FLADMM)is proposed in this paper.On the basis of theoretical analysis of compressed sensing(CS),the data acquisition of ECT is regarded as a linear measurement process of permittivity distribution signal of pipe section.A new measurement matrix is designed and L1 regularization method is used to convert ECT inverse problem to a convex relaxation problem which contains prior knowledge.A new fast alternating direction method of multipliers which contained linearized idea is employed to minimize the objective function.Simulation data and experimental results indicate that compared with other methods,the quality and speed of reconstructed images are markedly improved.Also,the dynamic experimental results indicate that the proposed algorithm can ful fill the real-time requirement of ECT systems in the application.展开更多
In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functio...In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functions. Under the assumption that the augmented Lagrangian function satisfies the Kurdyka-Lojasiewicz inequality, we prove that the sequence generated by the GADMM converges to a critical point of the augmented Lagrangian function when the penalty parameter in the augmented Lagrangian function is sufficiently large. Moreover, we also present some sufficient conditions guaranteeing the sublinear and linear rate of convergence of the algorithm.展开更多
The task of dividing corrupted-data into their respective subspaces can be well illustrated,both theoretically and numerically,by recovering low-rank and sparse-column components of a given matrix.Generally,it can be ...The task of dividing corrupted-data into their respective subspaces can be well illustrated,both theoretically and numerically,by recovering low-rank and sparse-column components of a given matrix.Generally,it can be characterized as a matrix and a 2,1-norm involved convex minimization problem.However,solving the resulting problem is full of challenges due to the non-smoothness of the objective function.One of the earliest solvers is an 3-block alternating direction method of multipliers(ADMM)which updates each variable in a Gauss-Seidel manner.In this paper,we present three variants of ADMM for the 3-block separable minimization problem.More preciously,whenever one variable is derived,the resulting problems can be regarded as a convex minimization with 2 blocks,and can be solved immediately using the standard ADMM.If the inner iteration loops only once,the iterative scheme reduces to the ADMM with updates in a Gauss-Seidel manner.If the solution from the inner iteration is assumed to be exact,the convergence can be deduced easily in the literature.The performance comparisons with a couple of recently designed solvers illustrate that the proposed methods are effective and competitive.展开更多
Since the connection of small-scale wind farms to distribution networks,power grid voltage stability has been reduced with increasing wind penetration in recent years,owing to the variable reactive power consumption o...Since the connection of small-scale wind farms to distribution networks,power grid voltage stability has been reduced with increasing wind penetration in recent years,owing to the variable reactive power consumption of wind generators.In this study,a two-stage reactive power optimization method based on the alternating direction method of multipliers(ADMM)algorithm is proposed for achieving optimal reactive power dispatch in wind farm-integrated distribution systems.Unlike existing optimal reactive power control methods,the proposed method enables distributed reactive power flow optimization with a two-stage optimization structure.Furthermore,under the partition concept,the consensus protocol is not needed to solve the optimization problems.In this method,the influence of the wake effect of each wind turbine is also considered in the control design.Simulation results for a mid-voltage distribution system based on MATLAB verified the effectiveness of the proposed method.展开更多
The stress analysis of surrounding rock for two random geometry tunnels is studied in this paper by using Schwarz’s alternating method. The simple and effective alternating algorithm is found, in which the surplus su...The stress analysis of surrounding rock for two random geometry tunnels is studied in this paper by using Schwarz’s alternating method. The simple and effective alternating algorithm is found, in which the surplus surface force is approximated by Fourier series, thus the iteration derivation can be conducted according to the precision required, finally, the stress results with high precision are obtained.展开更多
The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a t...The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a two-block separable convex minimization problem with linear equality constraints.This algorithm is obtained by making use of the inertial Douglas-Rachford splitting algorithm to the corresponding dual of the primal problem.We study the convergence analysis of the proposed algorithm in infinite-dimensional Hilbert spaces.Furthermore,we apply the proposed algorithm on the robust principal component analysis problem and also compare it with other state-of-the-art algorithms.Numerical results demonstrate the advantage of the proposed algorithm.展开更多
This paper presents alternating direction finite volume element methods for three-dimensional parabolic partial differential equations and gives four computational schemes, one is analogous to Douglas finite differenc...This paper presents alternating direction finite volume element methods for three-dimensional parabolic partial differential equations and gives four computational schemes, one is analogous to Douglas finite difference scheme with second-order splitting error, the other two schemes have third-order splitting error, and the last one is an extended LOD scheme. The L2 norm and H1 semi-norm error estimates are obtained for the first scheme and second one, respectively. Finally, two numerical examples are provided to illustrate the efficiency and accuracy of the methods.展开更多
In recent years, it has shown that a generalized thresholding algorithm is useful for inverse problems with sparsity constraints. The generalized thresholding minimizes the non-convex p-norm based function with p <...In recent years, it has shown that a generalized thresholding algorithm is useful for inverse problems with sparsity constraints. The generalized thresholding minimizes the non-convex p-norm based function with p < 1, and it penalizes small coefficients over a wider range meanwhile applies less bias to the larger coefficients.In this work, on the basis of two-level Bregman method with dictionary updating(TBMDU), we use the modified thresholding to minimize the non-convex function and propose the generalized TBMDU(GTBMDU) algorithm.The experimental results on magnetic resonance(MR) image simulations and real MR data, under a variety of sampling trajectories and acceleration factors, consistently demonstrate that the proposed algorithm can efficiently reconstruct the MR images and present advantages over the previous soft thresholding approaches.展开更多
In this paper,two classes of Riesz space fractional partial differential equations including space-fractional and space-time-fractional ones are considered.These two models can be regarded as the generalization of the...In this paper,two classes of Riesz space fractional partial differential equations including space-fractional and space-time-fractional ones are considered.These two models can be regarded as the generalization of the classical wave equation in two space dimensions.Combining with the Crank-Nicolson method in temporal direction,efficient alternating direction implicit Galerkin finite element methods for solving these two fractional models are developed,respectively.The corresponding stability and convergence analysis of the numerical methods are discussed.Numerical results are provided to verify the theoretical analysis.展开更多
In this paper,we propose a shear high-order gradient(SHOG)operator by combining the shear operator and high-order gradient(HOG)operator.Compared with the HOG operator,the proposed SHOG operator can incorporate more di...In this paper,we propose a shear high-order gradient(SHOG)operator by combining the shear operator and high-order gradient(HOG)operator.Compared with the HOG operator,the proposed SHOG operator can incorporate more directionality and detect more abundant edge information.Based on the SHOG operator,we extend the total variation(TV)norm to shear high-order total variation(SHOTV),and then propose a SHOTV deblurring model.We also study some properties of the SHOG operator,and show that the SHOG matrices are Block Circulant with Circulant Blocks(BCCB)when the shear angle isπ/4.The proposed model is solved efficiently by the alternating direction method of multipliers(ADMM).Experimental results demonstrate that the proposed method outperforms some state-of-the-art non-blind deblurring methods in both objective and perceptual quality.展开更多
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) ...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.展开更多
Regularization methods have been substantially applied in image restoration due to the ill-posedness of the image restoration problem.Different assumptions or priors on images are applied in the construction of image ...Regularization methods have been substantially applied in image restoration due to the ill-posedness of the image restoration problem.Different assumptions or priors on images are applied in the construction of image regularization methods.In recent years,matrix low-rank approximation has been successfully introduced in the image denoising problem and significant denoising effects have been achieved.Low-rank matrix minimization is an NP-hard problem and it is often replaced with the matrix’s weighted nuclear norm minimization(WNNM).The assumption that an image contains an extensive amount of self-similarity is the basis for the construction of the matrix low-rank approximation-based image denoising method.In this paper,we develop a model for image restoration using the sum of block matching matrices’weighted nuclear norm to be the regularization term in the cost function.An alternating iterative algorithm is designed to solve the proposed model and the convergence analyses of the algorithm are also presented.Numerical experiments show that the proposed method can recover the images much better than the existing regularization methods in terms of both recovered quantities and visual qualities.展开更多
This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merel...This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.展开更多
Tensor robust principal component analysis（TRPCA） problem aims to separate a low-rank tensor and a sparse tensor from their sum. This problem has recently attracted considerable research attention due to its wide ra...Tensor robust principal component analysis（TRPCA） problem aims to separate a low-rank tensor and a sparse tensor from their sum. This problem has recently attracted considerable research attention due to its wide range of potential applications in computer vision and pattern recognition. In this paper, we propose a new model to deal with the TRPCA problem by an alternation minimization algorithm along with two adaptive rankadjusting strategies. For the underlying low-rank tensor, we simultaneously perform low-rank matrix factorizations to its all-mode matricizations; while for the underlying sparse tensor,a soft-threshold shrinkage scheme is applied. Our method can be used to deal with the separation between either an exact or an approximate low-rank tensor and a sparse one. We established the subsequence convergence of our algorithm in the sense that any limit point of the iterates satisfies the KKT conditions. When the iteration stops, the output will be modified by applying a high-order SVD approach to achieve an exactly low-rank final result as the accurate rank has been calculated. The numerical experiments demonstrate that our method could achieve better results than the compared methods.展开更多
In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algor...In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.展开更多
Iodine is an element that is essential for the synthesis of thyroid hormones.Adequate intake of dietary iodine has been recognized as a critical factor for maintaining health.It is a well-known fact that iodine defici...Iodine is an element that is essential for the synthesis of thyroid hormones.Adequate intake of dietary iodine has been recognized as a critical factor for maintaining health.It is a well-known fact that iodine deficiency can impede the production of thyroid hormones in both the mother and fetus,which increases the risk of brain damage in the fetal stage.展开更多
文摘In this paper, we extend the alternate Broyden's method to the multiple version fbi solving lincar leastsquarc systems with multiple right-hand sides. We show that the method possesses property of a finite tcrmination.Some numerical cxperiments are gi von to inustrate the effectiveness of the method.
基金The National Natural Science Foundation of China (No.61362001,61102043,61262084,20132BAB211030,20122BAB211015)the Basic Research Program of Shenzhen(No.JC201104220219A)
文摘A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
基金The Scientific Research Foundation of Nanjing University of Posts and Telecommunications(No.NY210049)
文摘A novel algorithm, i.e. the fast alternating direction method of multipliers （ADMM）, is applied to solve the classical total-variation （ TV ）-based model for image reconstruction. First, the TV-based model is reformulated as a linear equality constrained problem where the objective function is separable. Then, by introducing the augmented Lagrangian function, the two variables are alternatively minimized by the Gauss-Seidel idea. Finally, the dual variable is updated. Because the approach makes full use of the special structure of the problem and decomposes the original problem into several low-dimensional sub-problems, the per iteration computational complexity of the approach is dominated by two fast Fourier transforms. Elementary experimental results indicate that the proposed approach is more stable and efficient compared with some state-of-the-art algorithms.
基金the National High Technology Research and Development Program of China(Grant No.2012AA011603)
文摘Linear scan computed tomography （LCT） is of great benefit to online industrial scanning and security inspection due to its characteristics of straight-line source trajectory and high scanning speed. However, in practical applications of LCT, there are challenges to image reconstruction due to limited-angle and insufficient data. In this paper, a new reconstruction algorithm based on total-variation （TV） minimization is developed to reconstruct images from limited-angle and insufficient data in LCT. The main idea of our approach is to reformulate a TV problem as a linear equality constrained problem where the objective function is separable, and then minimize its augmented Lagrangian function by using alternating direction method （ADM） to solve subproblems. The proposed method is robust and efficient in the task of reconstruction by showing the convergence of ADM. The numerical simulations and real data reconstructions show that the proposed reconstruction method brings reasonable performance and outperforms some previous ones when applied to an LCT imaging problem.
基金Supported by the National Natural Science Foundation of China(61203021)the Key Science and Technology Program of Liaoning Province(2011216011)+1 种基金the Natural Science Foundation of Liaoning Province(2013020024)the Program for Liaoning Excellent Talents in Universities(LJQ2015061)
文摘Electrical capacitance tomography(ECT)has been applied to two-phase flow measurement in recent years.Image reconstruction algorithms play an important role in the successful applications of ECT.To solve the ill-posed and nonlinear inverse problem of ECT image reconstruction,a new ECT image reconstruction method based on fast linearized alternating direction method of multipliers(FLADMM)is proposed in this paper.On the basis of theoretical analysis of compressed sensing(CS),the data acquisition of ECT is regarded as a linear measurement process of permittivity distribution signal of pipe section.A new measurement matrix is designed and L1 regularization method is used to convert ECT inverse problem to a convex relaxation problem which contains prior knowledge.A new fast alternating direction method of multipliers which contained linearized idea is employed to minimize the objective function.Simulation data and experimental results indicate that compared with other methods,the quality and speed of reconstructed images are markedly improved.Also,the dynamic experimental results indicate that the proposed algorithm can ful fill the real-time requirement of ECT systems in the application.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1157117811801455)the Fundamental Research Funds of China West Normal University(Grant No.17E084)
文摘In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functions. Under the assumption that the augmented Lagrangian function satisfies the Kurdyka-Lojasiewicz inequality, we prove that the sequence generated by the GADMM converges to a critical point of the augmented Lagrangian function when the penalty parameter in the augmented Lagrangian function is sufficiently large. Moreover, we also present some sufficient conditions guaranteeing the sublinear and linear rate of convergence of the algorithm.
基金Supported by the National Natural Science Foundation of China(Grant No.11971149,11871381)Natural Science Foundation of Henan Province for Youth(Grant No.202300410146)。
文摘The task of dividing corrupted-data into their respective subspaces can be well illustrated,both theoretically and numerically,by recovering low-rank and sparse-column components of a given matrix.Generally,it can be characterized as a matrix and a 2,1-norm involved convex minimization problem.However,solving the resulting problem is full of challenges due to the non-smoothness of the objective function.One of the earliest solvers is an 3-block alternating direction method of multipliers(ADMM)which updates each variable in a Gauss-Seidel manner.In this paper,we present three variants of ADMM for the 3-block separable minimization problem.More preciously,whenever one variable is derived,the resulting problems can be regarded as a convex minimization with 2 blocks,and can be solved immediately using the standard ADMM.If the inner iteration loops only once,the iterative scheme reduces to the ADMM with updates in a Gauss-Seidel manner.If the solution from the inner iteration is assumed to be exact,the convergence can be deduced easily in the literature.The performance comparisons with a couple of recently designed solvers illustrate that the proposed methods are effective and competitive.
基金support of The National Key Research and Development Program of China(Basic Research Class)(No.2017YFB0903000)the National Natural Science Foundation of China(No.U1909201)。
文摘Since the connection of small-scale wind farms to distribution networks,power grid voltage stability has been reduced with increasing wind penetration in recent years,owing to the variable reactive power consumption of wind generators.In this study,a two-stage reactive power optimization method based on the alternating direction method of multipliers(ADMM)algorithm is proposed for achieving optimal reactive power dispatch in wind farm-integrated distribution systems.Unlike existing optimal reactive power control methods,the proposed method enables distributed reactive power flow optimization with a two-stage optimization structure.Furthermore,under the partition concept,the consensus protocol is not needed to solve the optimization problems.In this method,the influence of the wake effect of each wind turbine is also considered in the control design.Simulation results for a mid-voltage distribution system based on MATLAB verified the effectiveness of the proposed method.
文摘The stress analysis of surrounding rock for two random geometry tunnels is studied in this paper by using Schwarz’s alternating method. The simple and effective alternating algorithm is found, in which the surplus surface force is approximated by Fourier series, thus the iteration derivation can be conducted according to the precision required, finally, the stress results with high precision are obtained.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12061045,12061046,11661056,11771198,11771347,91730306,41390454,11401293)the China Postdoctoral Science Foundation(Grant No.2015M571989)the Jiangxi Province Postdoctoral Science Foundation(Grant No.2015KY51)。
文摘The alternating direction method of multipliers(ADMM)is a widely used method for solving many convex minimization models arising in signal and image processing.In this paper,we propose an inertial ADMM for solving a two-block separable convex minimization problem with linear equality constraints.This algorithm is obtained by making use of the inertial Douglas-Rachford splitting algorithm to the corresponding dual of the primal problem.We study the convergence analysis of the proposed algorithm in infinite-dimensional Hilbert spaces.Furthermore,we apply the proposed algorithm on the robust principal component analysis problem and also compare it with other state-of-the-art algorithms.Numerical results demonstrate the advantage of the proposed algorithm.
文摘This paper presents alternating direction finite volume element methods for three-dimensional parabolic partial differential equations and gives four computational schemes, one is analogous to Douglas finite difference scheme with second-order splitting error, the other two schemes have third-order splitting error, and the last one is an extended LOD scheme. The L2 norm and H1 semi-norm error estimates are obtained for the first scheme and second one, respectively. Finally, two numerical examples are provided to illustrate the efficiency and accuracy of the methods.
基金the National Natural Science Foundation of China(Nos.6136200161365013 and 51165033)+3 种基金the Natural Science Foundation of Jiangxi Province(Nos.20132BAB211030 and 20122BAB211015)the Technology Foundation of Department of Education in Jiangxi Province(Nos.GJJ 13061 and GJJ14196)the National Postdoctoral Research Funds(No.2014M551867)the Jiangxi Advanced Projects for Postdoctoral Research Funds(No.2014KY02)
文摘In recent years, it has shown that a generalized thresholding algorithm is useful for inverse problems with sparsity constraints. The generalized thresholding minimizes the non-convex p-norm based function with p < 1, and it penalizes small coefficients over a wider range meanwhile applies less bias to the larger coefficients.In this work, on the basis of two-level Bregman method with dictionary updating(TBMDU), we use the modified thresholding to minimize the non-convex function and propose the generalized TBMDU(GTBMDU) algorithm.The experimental results on magnetic resonance(MR) image simulations and real MR data, under a variety of sampling trajectories and acceleration factors, consistently demonstrate that the proposed algorithm can efficiently reconstruct the MR images and present advantages over the previous soft thresholding approaches.
基金supported by the Guangxi Natural Science Foundation[grant numbers 2018GXNSFBA281020,2018GXNSFAA138121]the Doctoral Starting up Foundation of Guilin University of Technology[grant number GLUTQD2016044].
文摘In this paper,two classes of Riesz space fractional partial differential equations including space-fractional and space-time-fractional ones are considered.These two models can be regarded as the generalization of the classical wave equation in two space dimensions.Combining with the Crank-Nicolson method in temporal direction,efficient alternating direction implicit Galerkin finite element methods for solving these two fractional models are developed,respectively.The corresponding stability and convergence analysis of the numerical methods are discussed.Numerical results are provided to verify the theoretical analysis.
基金Supported by the National Natural Science Foundation of China(61701004)Outstanding Young Talents Support Program of Anhui Province(gxyq2021178)+1 种基金Open Fund of Key Laboratory of Anhui Higher Education Institutes(CS2021-07)Program of University Mathematics Teaching Research and Development Center(CMC20200301)。
文摘In this paper,we propose a shear high-order gradient(SHOG)operator by combining the shear operator and high-order gradient(HOG)operator.Compared with the HOG operator,the proposed SHOG operator can incorporate more directionality and detect more abundant edge information.Based on the SHOG operator,we extend the total variation(TV)norm to shear high-order total variation(SHOTV),and then propose a SHOTV deblurring model.We also study some properties of the SHOG operator,and show that the SHOG matrices are Block Circulant with Circulant Blocks(BCCB)when the shear angle isπ/4.The proposed model is solved efficiently by the alternating direction method of multipliers(ADMM).Experimental results demonstrate that the proposed method outperforms some state-of-the-art non-blind deblurring methods in both objective and perceptual quality.
基金National Natural Science Foundations of China(Nos.61362001,61102043,61262084)Technology Foundations of Department of Education of Jiangxi Province,China(Nos.GJJ12006,GJJ14196)Natural Science Foundations of Jiangxi Province,China(Nos.20132BAB211030,20122BAB211015)
文摘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.
基金This work is supported by the National Natural Science Foundation of China nos.11971215 and 11571156,MOE-LCSMSchool of Mathematics and Statistics,Hunan Normal University,Changsha,Hunan 410081,China.
文摘Regularization methods have been substantially applied in image restoration due to the ill-posedness of the image restoration problem.Different assumptions or priors on images are applied in the construction of image regularization methods.In recent years,matrix low-rank approximation has been successfully introduced in the image denoising problem and significant denoising effects have been achieved.Low-rank matrix minimization is an NP-hard problem and it is often replaced with the matrix’s weighted nuclear norm minimization(WNNM).The assumption that an image contains an extensive amount of self-similarity is the basis for the construction of the matrix low-rank approximation-based image denoising method.In this paper,we develop a model for image restoration using the sum of block matching matrices’weighted nuclear norm to be the regularization term in the cost function.An alternating iterative algorithm is designed to solve the proposed model and the convergence analyses of the algorithm are also presented.Numerical experiments show that the proposed method can recover the images much better than the existing regularization methods in terms of both recovered quantities and visual qualities.
基金the National Natural Science Foundation of China(61833012,61773162,61590924)the Natural Science Foundation of Shanghai(18ZR1420000)。
文摘This paper investigates the distributed model predictive control(MPC)problem of linear systems where the network topology is changeable by the way of inserting new subsystems,disconnecting existing subsystems,or merely modifying the couplings between different subsystems.To equip live systems with a quick response ability when modifying network topology,while keeping a satisfactory dynamic performance,a novel reconfiguration control scheme based on the alternating direction method of multipliers(ADMM)is presented.In this scheme,the local controllers directly influenced by the structure realignment are redesigned in the reconfiguration control.Meanwhile,by employing the powerful ADMM algorithm,the iterative formulas for solving the reconfigured optimization problem are obtained,which significantly accelerate the computation speed and ensure a timely output of the reconfigured optimal control response.Ultimately,the presented reconfiguration scheme is applied to the level control of a benchmark four-tank plant to illustrate its effectiveness and main characteristics.
基金Supported by the National Natural Science Foundation of China(Grant Nos.6157209961320106008+2 种基金91230103)National Science and Technology Major Project(Grant Nos.2013ZX040050212014ZX04001011)
文摘Tensor robust principal component analysis（TRPCA） problem aims to separate a low-rank tensor and a sparse tensor from their sum. This problem has recently attracted considerable research attention due to its wide range of potential applications in computer vision and pattern recognition. In this paper, we propose a new model to deal with the TRPCA problem by an alternation minimization algorithm along with two adaptive rankadjusting strategies. For the underlying low-rank tensor, we simultaneously perform low-rank matrix factorizations to its all-mode matricizations; while for the underlying sparse tensor,a soft-threshold shrinkage scheme is applied. Our method can be used to deal with the separation between either an exact or an approximate low-rank tensor and a sparse one. We established the subsequence convergence of our algorithm in the sense that any limit point of the iterates satisfies the KKT conditions. When the iteration stops, the output will be modified by applying a high-order SVD approach to achieve an exactly low-rank final result as the accurate rank has been calculated. The numerical experiments demonstrate that our method could achieve better results than the compared methods.
文摘In this paper, a distributed algorithm is proposed to solve a kind of multi-objective optimization problem based on the alternating direction method of multipliers. Compared with the centralized algorithms, this algorithm does not need a central node. Therefore, it has the characteristics of low communication burden and high privacy. In addition, numerical experiments are provided to validate the effectiveness of the proposed algorithm.
基金sponsored by the Young Scholar Scientific Research Foundation of the National Institute of Nutrition and Health of China CDC[Grant No:NINH2016001]
文摘Iodine is an element that is essential for the synthesis of thyroid hormones.Adequate intake of dietary iodine has been recognized as a critical factor for maintaining health.It is a well-known fact that iodine deficiency can impede the production of thyroid hormones in both the mother and fetus,which increases the risk of brain damage in the fetal stage.
