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...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.展开更多
Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main ...Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main features of the problem are the strong nonuniform scale of the solution and large errors (up to 15%) in the input data. In both algorithms, the solution is represented as decomposition on special basic functions, which satisfy given a priori information on solution, and this idea allow us significantly to improve the quality of approximate solution and simplify solving the minimization problem. The theoretical details of the algorithms, as well as the results of numerical experiments for proving robustness of the algorithms, are presented.展开更多
A double optimal solution of an n-dimensional system of linear equations Ax=b has been derived in an affine m-dimensional Krylov subspace with m <<n.We further develop a double optimal iterative algorithm(DOIA),...A double optimal solution of an n-dimensional system of linear equations Ax=b has been derived in an affine m-dimensional Krylov subspace with m <<n.We further develop a double optimal iterative algorithm(DOIA),with the descent direction z being solved from the residual equation Az=r0 by using its double optimal solution,to solve ill-posed linear problem under large noise.The DOIA is proven to be absolutely convergent step-by-step with the square residual error ||r||^2=||b-Ax||^2 being reduced by a positive quantity ||Azk||^2 at each iteration step,which is found to be better than those algorithms based on the minimization of the square residual error in an m-dimensional Krylov subspace.In order to tackle the ill-posed linear problem under a large noise,we also propose a novel double optimal regularization algorithm(DORA)to solve it,which is an improvement of the Tikhonov regularization method.Some numerical tests reveal the high performance of DOIA and DORA against large noise.These methods are of use in the ill-posed problems of structural health-monitoring.展开更多
Electrical impedance tomography (EIT) is a technique for determining the electrical conductivity and permittivity distribution inside a medium from measurements made on its surface. The impedance distribution reconstr...Electrical impedance tomography (EIT) is a technique for determining the electrical conductivity and permittivity distribution inside a medium from measurements made on its surface. The impedance distribution reconstruction in EIT is a nonlinear inverse problem that requires the use of a regularization method. The generalized Tikhonov regularization methods are often used in solving inverse problems. However, for EIT image reconstruction, the generalized Tikhonov regularization methods may lose the boundary information due to its smoothing operation. In this paper, we propose an iterative Lavrentiev regularization and L-curve-based algorithm to reconstruct EIT images. The regularization parameter should be carefully chosen, but it is often heuristically selected in the conventional regularization-based reconstruction algorithms. So, an L-curve-based optimization algorithm is used for selecting the Lavrentiev regularization parameter. Numerical analysis and simulation results are performed to illustrate EIT image reconstruction. It is shown that choosing the appropriate regularization parameter plays an important role in reconstructing EIT images.展开更多
In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-of...In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-off is shown clearly and demonstrated with the paradigm of hybrid decoding. For regular LDPC code, the SNR-threshold performance and error-floor performance could be improved to the optimal level of ML decoding if the decoding complexity is progressively increased, usually corresponding to the near-ML decoding with progressively increased size of list. For irregular LDPC code, the SNR-threshold performance and error-floor performance could only be improved to a bottle-neck even with unlimited decoding complexity. However, with the technique of CRC-aided hybrid decoding, the ML performance could be greatly improved and approached with reasonable complexity thanks to the improved code-weight distribution from the concatenation of CRC and irregular LDPC code. Finally, CRC-aided 5GNR-LDPC code is evaluated and the capacity-approaching capability is shown.展开更多
Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presen...Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.展开更多
Seismic data regularization is an important preprocessing step in seismic signal processing. Traditional seismic acquisition methods follow the Shannon–Nyquist sampling theorem, whereas compressive sensing(CS) prov...Seismic data regularization is an important preprocessing step in seismic signal processing. Traditional seismic acquisition methods follow the Shannon–Nyquist sampling theorem, whereas compressive sensing(CS) provides a fundamentally new paradigm to overcome limitations in data acquisition. Besides the sparse representation of seismic signal in some transform domain and the 1-norm reconstruction algorithm, the seismic data regularization quality of CS-based techniques strongly depends on random undersampling schemes. For 2D seismic data, discrete uniform-based methods have been investigated, where some seismic traces are randomly sampled with an equal probability. However, in theory and practice, some seismic traces with different probability are required to be sampled for satisfying the assumptions in CS. Therefore, designing new undersampling schemes is imperative. We propose a Bernoulli-based random undersampling scheme and its jittered version to determine the regular traces that are randomly sampled with different probability, while both schemes comply with the Bernoulli process distribution. We performed experiments using the Fourier and curvelet transforms and the spectral projected gradient reconstruction algorithm for 1-norm(SPGL1), and ten different random seeds. According to the signal-to-noise ratio(SNR) between the original and reconstructed seismic data, the detailed experimental results from 2D numerical and physical simulation data show that the proposed novel schemes perform overall better than the discrete uniform schemes.展开更多
Bioluminescence tomography(BLT)is an important noninvasive optical molecular imaging modality in preclinical research.To improve the image quality,reconstruction algorithms have to deal with the inherent ill-posedness...Bioluminescence tomography(BLT)is an important noninvasive optical molecular imaging modality in preclinical research.To improve the image quality,reconstruction algorithms have to deal with the inherent ill-posedness of BLT inverse problem.The sparse characteristic of bioluminescent sources in spatial distribution has been widely explored in BLT and many L1-regularized methods have been investigated due to the sparsity-inducing properties of L1 norm.In this paper,we present a reconstruction method based on L_(1/2) regularization to enhance sparsity of BLT solution and solve the nonconvex L_(1/2) norm problem by converting it to a series of weighted L1 homotopy minimization problems with iteratively updated weights.To assess the performance of the proposed reconstruction algorithm,simulations on a heterogeneous mouse model are designed to compare it with three representative sparse reconstruction algorithms,including the weighted interior-point,L1 homotopy,and the Stagewise Orthogonal Matching Pursuit algorithm.Simulation results show that the proposed method yield stable reconstruction results under different noise levels.Quantitative comparison results demonstrate that the proposed algorithm outperforms the competitor algorithms in location accuracy,multiple-source resolving and image quality.展开更多
Theoretical results related to properties of a regularized recursive algorithm for estimation of a high dimensional vector of parameters are presented and proved. The recursive character of the procedure is proposed t...Theoretical results related to properties of a regularized recursive algorithm for estimation of a high dimensional vector of parameters are presented and proved. The recursive character of the procedure is proposed to overcome the difficulties with high dimension of the observation vector in computation of a statistical regularized estimator. As to deal with high dimension of the vector of unknown parameters, the regularization is introduced by specifying a priori non-negative covariance structure for the vector of estimated parameters. Numerical example with Monte-Carlo simulation for a low-dimensional system as well as the state/parameter estimation in a very high dimensional oceanic model is presented to demonstrate the efficiency of the proposed approach.展开更多
Tikhonov regularization is a powerful tool for solving linear discrete ill-posed problems.However,effective methods for dealing with large-scale ill-posed problems are still lacking.The Kaczmarz method is an effective...Tikhonov regularization is a powerful tool for solving linear discrete ill-posed problems.However,effective methods for dealing with large-scale ill-posed problems are still lacking.The Kaczmarz method is an effective iterative projection algorithm for solving large linear equations due to its simplicity.We propose a regularized randomized extended Kaczmarz(RREK)algorithm for solving large discrete ill-posed problems via combining the Tikhonov regularization and the randomized Kaczmarz method.The convergence of the algorithm is proved.Numerical experiments illustrate that the proposed algorithm has higher accuracy and better image restoration quality compared with the existing randomized extended Kaczmarz(REK)method.展开更多
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘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.
文摘Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main features of the problem are the strong nonuniform scale of the solution and large errors (up to 15%) in the input data. In both algorithms, the solution is represented as decomposition on special basic functions, which satisfy given a priori information on solution, and this idea allow us significantly to improve the quality of approximate solution and simplify solving the minimization problem. The theoretical details of the algorithms, as well as the results of numerical experiments for proving robustness of the algorithms, are presented.
文摘A double optimal solution of an n-dimensional system of linear equations Ax=b has been derived in an affine m-dimensional Krylov subspace with m <<n.We further develop a double optimal iterative algorithm(DOIA),with the descent direction z being solved from the residual equation Az=r0 by using its double optimal solution,to solve ill-posed linear problem under large noise.The DOIA is proven to be absolutely convergent step-by-step with the square residual error ||r||^2=||b-Ax||^2 being reduced by a positive quantity ||Azk||^2 at each iteration step,which is found to be better than those algorithms based on the minimization of the square residual error in an m-dimensional Krylov subspace.In order to tackle the ill-posed linear problem under a large noise,we also propose a novel double optimal regularization algorithm(DORA)to solve it,which is an improvement of the Tikhonov regularization method.Some numerical tests reveal the high performance of DOIA and DORA against large noise.These methods are of use in the ill-posed problems of structural health-monitoring.
文摘Electrical impedance tomography (EIT) is a technique for determining the electrical conductivity and permittivity distribution inside a medium from measurements made on its surface. The impedance distribution reconstruction in EIT is a nonlinear inverse problem that requires the use of a regularization method. The generalized Tikhonov regularization methods are often used in solving inverse problems. However, for EIT image reconstruction, the generalized Tikhonov regularization methods may lose the boundary information due to its smoothing operation. In this paper, we propose an iterative Lavrentiev regularization and L-curve-based algorithm to reconstruct EIT images. The regularization parameter should be carefully chosen, but it is often heuristically selected in the conventional regularization-based reconstruction algorithms. So, an L-curve-based optimization algorithm is used for selecting the Lavrentiev regularization parameter. Numerical analysis and simulation results are performed to illustrate EIT image reconstruction. It is shown that choosing the appropriate regularization parameter plays an important role in reconstructing EIT images.
文摘In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-off is shown clearly and demonstrated with the paradigm of hybrid decoding. For regular LDPC code, the SNR-threshold performance and error-floor performance could be improved to the optimal level of ML decoding if the decoding complexity is progressively increased, usually corresponding to the near-ML decoding with progressively increased size of list. For irregular LDPC code, the SNR-threshold performance and error-floor performance could only be improved to a bottle-neck even with unlimited decoding complexity. However, with the technique of CRC-aided hybrid decoding, the ML performance could be greatly improved and approached with reasonable complexity thanks to the improved code-weight distribution from the concatenation of CRC and irregular LDPC code. Finally, CRC-aided 5GNR-LDPC code is evaluated and the capacity-approaching capability is shown.
基金Supported by the National Natural Science Foundation of China (No. 61073079)the Fundamental Research Funds for the Central Universities (2011JBM216,2011YJS021)
文摘Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.
基金financially supported by The 2011 Prospective Research Project of SINOPEC(P11096)
文摘Seismic data regularization is an important preprocessing step in seismic signal processing. Traditional seismic acquisition methods follow the Shannon–Nyquist sampling theorem, whereas compressive sensing(CS) provides a fundamentally new paradigm to overcome limitations in data acquisition. Besides the sparse representation of seismic signal in some transform domain and the 1-norm reconstruction algorithm, the seismic data regularization quality of CS-based techniques strongly depends on random undersampling schemes. For 2D seismic data, discrete uniform-based methods have been investigated, where some seismic traces are randomly sampled with an equal probability. However, in theory and practice, some seismic traces with different probability are required to be sampled for satisfying the assumptions in CS. Therefore, designing new undersampling schemes is imperative. We propose a Bernoulli-based random undersampling scheme and its jittered version to determine the regular traces that are randomly sampled with different probability, while both schemes comply with the Bernoulli process distribution. We performed experiments using the Fourier and curvelet transforms and the spectral projected gradient reconstruction algorithm for 1-norm(SPGL1), and ten different random seeds. According to the signal-to-noise ratio(SNR) between the original and reconstructed seismic data, the detailed experimental results from 2D numerical and physical simulation data show that the proposed novel schemes perform overall better than the discrete uniform schemes.
基金supported by the National Natural Science Foundation of China(No.61401264,11574192)the Natural Science Research Plan Program in Shaanxi Province of China(No.2015JM6322)the Fundamental Research Funds for the Central Universities(No.GK201603025).
文摘Bioluminescence tomography(BLT)is an important noninvasive optical molecular imaging modality in preclinical research.To improve the image quality,reconstruction algorithms have to deal with the inherent ill-posedness of BLT inverse problem.The sparse characteristic of bioluminescent sources in spatial distribution has been widely explored in BLT and many L1-regularized methods have been investigated due to the sparsity-inducing properties of L1 norm.In this paper,we present a reconstruction method based on L_(1/2) regularization to enhance sparsity of BLT solution and solve the nonconvex L_(1/2) norm problem by converting it to a series of weighted L1 homotopy minimization problems with iteratively updated weights.To assess the performance of the proposed reconstruction algorithm,simulations on a heterogeneous mouse model are designed to compare it with three representative sparse reconstruction algorithms,including the weighted interior-point,L1 homotopy,and the Stagewise Orthogonal Matching Pursuit algorithm.Simulation results show that the proposed method yield stable reconstruction results under different noise levels.Quantitative comparison results demonstrate that the proposed algorithm outperforms the competitor algorithms in location accuracy,multiple-source resolving and image quality.
文摘Theoretical results related to properties of a regularized recursive algorithm for estimation of a high dimensional vector of parameters are presented and proved. The recursive character of the procedure is proposed to overcome the difficulties with high dimension of the observation vector in computation of a statistical regularized estimator. As to deal with high dimension of the vector of unknown parameters, the regularization is introduced by specifying a priori non-negative covariance structure for the vector of estimated parameters. Numerical example with Monte-Carlo simulation for a low-dimensional system as well as the state/parameter estimation in a very high dimensional oceanic model is presented to demonstrate the efficiency of the proposed approach.
基金supported by the National Natural Science Foundations of China(Nos.11571171,62073161,and 61473148)。
文摘Tikhonov regularization is a powerful tool for solving linear discrete ill-posed problems.However,effective methods for dealing with large-scale ill-posed problems are still lacking.The Kaczmarz method is an effective iterative projection algorithm for solving large linear equations due to its simplicity.We propose a regularized randomized extended Kaczmarz(RREK)algorithm for solving large discrete ill-posed problems via combining the Tikhonov regularization and the randomized Kaczmarz method.The convergence of the algorithm is proved.Numerical experiments illustrate that the proposed algorithm has higher accuracy and better image restoration quality compared with the existing randomized extended Kaczmarz(REK)method.