To improve the accuracy and effectiveness of continuous-time(CT) system identification, this paper introduces a novel method that incorporates the nuclear norm minimization(NNM) with the generalized Poisson moment fun...To improve the accuracy and effectiveness of continuous-time(CT) system identification, this paper introduces a novel method that incorporates the nuclear norm minimization(NNM) with the generalized Poisson moment functional(GPMF)based subspace method. The GPMF algorithm provides a simple linear mapping for subspace identification without the timederivatives of the input and output measurements to avoid amplification of measurement noise, and the NNM is a heuristic convex relaxation of the rank minimization. The Hankel matrix with minimized nuclear norm is used to determine the model order and to avoid the over-parameterization in subspace identification method(SIM). Furthermore, the algorithm to solve the NNM problem in CT case is also deduced with alternating direction methods of multipliers(ADMM). Lastly, two numerical examples are presented to evaluate the performance of the proposed method and to show the advantages of the proposed method over the existing methods.展开更多
The nuclear norm convex relaxation method is proposed to force the rank constraint in the identification of the continuous-time( CT) Hammerstein system. The CT Hammerstein system is composed of a linear time invariant...The nuclear norm convex relaxation method is proposed to force the rank constraint in the identification of the continuous-time( CT) Hammerstein system. The CT Hammerstein system is composed of a linear time invariant( LTI) system and a static nonlinear function( the linear part is followed by the nonlinear part). The nonlinear function is approximated by the pseudospectral basis functions, which have a better performance than Hinge functions and Radial Basis functions. After the approximation on the nonlinear function, the CT Hammerstein system has been transformed into a multiple-input single-output( MISO) linear model system with the differential pre-filters. However, the coefficients of static nonlinearity and the numerators of the linear transfer function are coupled together to challenge the parameters identification of the Hammerstein system. This problem is solved by replacing the one-rank constraint of the regularization optimization with the nuclear norm convex relaxation. Finally, a numerical example is given to verify the accuracy and the efficiency of the method.展开更多
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.展开更多
As synthetic aperture radar(SAR) has been widely used nearly in every field, SAR image de-noising became a very important research field. A new SAR image de-noising method based on texture strength and weighted nuclea...As synthetic aperture radar(SAR) has been widely used nearly in every field, SAR image de-noising became a very important research field. A new SAR image de-noising method based on texture strength and weighted nuclear norm minimization(WNNM) is proposed. To implement blind de-noising, the accurate estimation of noise variance is very important. So far, it is still a challenge to estimate SAR image noise level accurately because of the rich texture. Principal component analysis(PCA) and the low rank patches selected by image texture strength are used to estimate the noise level. With the help of noise level, WNNM can be expected to SAR image de-noising. Experimental results show that the proposed method outperforms many excellent de-noising algorithms such as Bayes least squares-Gaussian scale mixtures(BLS-GSM) method, non-local means(NLM) filtering in terms of both quantitative measure and visual perception quality.展开更多
In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minim...In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many applications.However,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise assumption.In this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from WNNM.We apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this model.We exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse noise.Numerical results show that our method can effectively remove impulse noise.展开更多
Robust principal component analysis(PCA) is widely used in many applications, such as image processing, data mining and bioinformatics. The existing methods for solving the robust PCA are mostly based on nuclear norm ...Robust principal component analysis(PCA) is widely used in many applications, such as image processing, data mining and bioinformatics. The existing methods for solving the robust PCA are mostly based on nuclear norm minimization. Those methods simultaneously minimize all the singular values, and thus the rank cannot be well approximated in practice. We extend the idea of truncated nuclear norm regularization(TNNR) to the robust PCA and consider truncated nuclear norm minimization(TNNM) instead of nuclear norm minimization(NNM). This method only minimizes the smallest N-r singular values to preserve the low-rank components, where N is the number of singular values and r is the matrix rank. Moreover, we propose an effective way to determine r via the shrinkage operator. Then we develop an effective iterative algorithm based on the alternating direction method to solve this optimization problem. Experimental results demonstrate the efficiency and accuracy of the TNNM method. Moreover, this method is much more robust in terms of the rank of the reconstructed matrix and the sparsity of the error.展开更多
Face hallucination via patch-pairs leaning based methods has been wildly used in the past several years. Some position-patch based face hallucination methods have been proposed to improve the representation power of i...Face hallucination via patch-pairs leaning based methods has been wildly used in the past several years. Some position-patch based face hallucination methods have been proposed to improve the representation power of image patch and obtain the optimal regressive weighted vector. The rationale behind the position-patch based face hallucination is the fact that human face is always highly structured and consequently positioned and it plays an increasingly important role in the reconstruction. However, in the existing position-patch based methods,the probe image patch is usually represented as a linear combination of the corresponding patches of some training images, and the reconstruction residual is usually measured using the vector norm such as 1-norm and 2-norm.Since the vector norms neglect two-dimensional structures inside the residual, the final reconstruction performance is not very satisfactory. To cope with this problem, we present a weighted nuclear-norm constrained sparse coding(WNCSC) model for position-patch based face hallucination. In addition, an efficient algorithm for the WNCSC is developed using the alternating direction method of multipliers(ADMM) and the method of augmented Lagrange multipliers(ALM). The advantages of the proposed model are twofold: in order to fully make use of low-rank structure information of the reconstruction residual, the weighted nuclear norm is applied to measure the residual matrix, which is able to alleviate the bias between input patches and training data, and it is more robust than the Euclidean distance(2-norm); the more flexible selection method for rank components can determine the optimal combination weights and adaptively choose the relevant and nearest hallucinated neighbors. Finally, experimental results prove that the proposed method outperforms the related state-of-the-art methods in both quantitative and visual comparisons.展开更多
Low rank matrix recovery is a new topic drawing the attention of many researchers which addresses the problem of recovering an unknown low rank matrix from few linear measurements. The matrix Dantzig selector and the ...Low rank matrix recovery is a new topic drawing the attention of many researchers which addresses the problem of recovering an unknown low rank matrix from few linear measurements. The matrix Dantzig selector and the matrix Lasso are two important algorithms based on nuclear norm minimization. In this paper,we first prove some decay properties of restricted isometry constants, then we discuss the recovery errors of these two algorithms and give a new bound of restricted isometry constant to guarantee stable recovery, which improves the results of [11].展开更多
阵元失效下多输入多输出(Multiple-Input Multiple-Output,MIMO)雷达虚拟阵列协方差矩阵出现大批整行整列元素缺失,破坏原有内在完整结构,导致波达方向(Direction of Arrival,DOA)估计性能下降。为此,提出一种联合核范数和SCAD(Smoothly...阵元失效下多输入多输出(Multiple-Input Multiple-Output,MIMO)雷达虚拟阵列协方差矩阵出现大批整行整列元素缺失,破坏原有内在完整结构,导致波达方向(Direction of Arrival,DOA)估计性能下降。为此,提出一种联合核范数和SCAD(Smoothly Clipped Absolute Deviation)惩罚的完整协方差矩阵重构方法,以利于阵元失效下MIMO雷达DOA的有效估计。首先对待恢复的协方差矩阵建立核范数和SCAD惩罚双先验约束模型,并利用等正弦空间稀疏化方式划分粗网格空间,在可容忍的模型误差内能大大降低运算复杂度;然后利用ALM-ADMM(Augmented Lagrange Multipliers-Alternating Direction Method of Multipliers)算法对双先验约束模型进行求解,从而恢复协方差矩阵中大量整行整列的缺失数据;最后通过RD-ESPRIT(Reduced Dimensional ESPRIT)算法进行目标DOA估计。仿真结果验证该方法能快速恢复虚拟协方差矩阵中的缺失数据,从而有效提高阵元失效下MIMO雷达的DOA估计性能。展开更多
文摘To improve the accuracy and effectiveness of continuous-time(CT) system identification, this paper introduces a novel method that incorporates the nuclear norm minimization(NNM) with the generalized Poisson moment functional(GPMF)based subspace method. The GPMF algorithm provides a simple linear mapping for subspace identification without the timederivatives of the input and output measurements to avoid amplification of measurement noise, and the NNM is a heuristic convex relaxation of the rank minimization. The Hankel matrix with minimized nuclear norm is used to determine the model order and to avoid the over-parameterization in subspace identification method(SIM). Furthermore, the algorithm to solve the NNM problem in CT case is also deduced with alternating direction methods of multipliers(ADMM). Lastly, two numerical examples are presented to evaluate the performance of the proposed method and to show the advantages of the proposed method over the existing methods.
文摘The nuclear norm convex relaxation method is proposed to force the rank constraint in the identification of the continuous-time( CT) Hammerstein system. The CT Hammerstein system is composed of a linear time invariant( LTI) system and a static nonlinear function( the linear part is followed by the nonlinear part). The nonlinear function is approximated by the pseudospectral basis functions, which have a better performance than Hinge functions and Radial Basis functions. After the approximation on the nonlinear function, the CT Hammerstein system has been transformed into a multiple-input single-output( MISO) linear model system with the differential pre-filters. However, the coefficients of static nonlinearity and the numerators of the linear transfer function are coupled together to challenge the parameters identification of the Hammerstein system. This problem is solved by replacing the one-rank constraint of the regularization optimization with the nuclear norm convex relaxation. Finally, a numerical example is given to verify the accuracy and the efficiency of the method.
基金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.
基金supported by the National Natural Science Foundation of China(6140130861572063)+7 种基金the Natural Science Foundation of Hebei Province(F2016201142F2016201187)the Natural Social Foundation of Hebei Province(HB15TQ015)the Science Research Project of Hebei Province(QN2016085ZC2016040)the Science and Technology Support Project of Hebei Province(15210409)the Natural Science Foundation of Hebei University(2014-303)the National Comprehensive Ability Promotion Project of Western and Central China
文摘As synthetic aperture radar(SAR) has been widely used nearly in every field, SAR image de-noising became a very important research field. A new SAR image de-noising method based on texture strength and weighted nuclear norm minimization(WNNM) is proposed. To implement blind de-noising, the accurate estimation of noise variance is very important. So far, it is still a challenge to estimate SAR image noise level accurately because of the rich texture. Principal component analysis(PCA) and the low rank patches selected by image texture strength are used to estimate the noise level. With the help of noise level, WNNM can be expected to SAR image de-noising. Experimental results show that the proposed method outperforms many excellent de-noising algorithms such as Bayes least squares-Gaussian scale mixtures(BLS-GSM) method, non-local means(NLM) filtering in terms of both quantitative measure and visual perception quality.
基金supported by the National Natural Science Foundation of China under grants U21A20455,61972265,11871348 and 11701388by the Natural Science Foundation of Guangdong Province of China under grant 2020B1515310008by the Educational Commission of Guangdong Province of China under grant 2019KZDZX1007.
文摘In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research interest.By assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many applications.However,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise assumption.In this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from WNNM.We apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this model.We exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse noise.Numerical results show that our method can effectively remove impulse noise.
基金the Doctoral Program of Higher Education of China(No.20120032110034)
文摘Robust principal component analysis(PCA) is widely used in many applications, such as image processing, data mining and bioinformatics. The existing methods for solving the robust PCA are mostly based on nuclear norm minimization. Those methods simultaneously minimize all the singular values, and thus the rank cannot be well approximated in practice. We extend the idea of truncated nuclear norm regularization(TNNR) to the robust PCA and consider truncated nuclear norm minimization(TNNM) instead of nuclear norm minimization(NNM). This method only minimizes the smallest N-r singular values to preserve the low-rank components, where N is the number of singular values and r is the matrix rank. Moreover, we propose an effective way to determine r via the shrinkage operator. Then we develop an effective iterative algorithm based on the alternating direction method to solve this optimization problem. Experimental results demonstrate the efficiency and accuracy of the TNNM method. Moreover, this method is much more robust in terms of the rank of the reconstructed matrix and the sparsity of the error.
基金the National Natural Science Foundation of China(Nos.61702269,61171165,11431015 and 61571230)the Natural Science Foundation of Jiangsu Province(No.BK20171074)+1 种基金the Natural Science Foundation of Guangxi Province(No.2014GXNSFAA118360)the National Scientific Equipment Developing Project of China(No.2012YQ050250)
文摘Face hallucination via patch-pairs leaning based methods has been wildly used in the past several years. Some position-patch based face hallucination methods have been proposed to improve the representation power of image patch and obtain the optimal regressive weighted vector. The rationale behind the position-patch based face hallucination is the fact that human face is always highly structured and consequently positioned and it plays an increasingly important role in the reconstruction. However, in the existing position-patch based methods,the probe image patch is usually represented as a linear combination of the corresponding patches of some training images, and the reconstruction residual is usually measured using the vector norm such as 1-norm and 2-norm.Since the vector norms neglect two-dimensional structures inside the residual, the final reconstruction performance is not very satisfactory. To cope with this problem, we present a weighted nuclear-norm constrained sparse coding(WNCSC) model for position-patch based face hallucination. In addition, an efficient algorithm for the WNCSC is developed using the alternating direction method of multipliers(ADMM) and the method of augmented Lagrange multipliers(ALM). The advantages of the proposed model are twofold: in order to fully make use of low-rank structure information of the reconstruction residual, the weighted nuclear norm is applied to measure the residual matrix, which is able to alleviate the bias between input patches and training data, and it is more robust than the Euclidean distance(2-norm); the more flexible selection method for rank components can determine the optimal combination weights and adaptively choose the relevant and nearest hallucinated neighbors. Finally, experimental results prove that the proposed method outperforms the related state-of-the-art methods in both quantitative and visual comparisons.
基金Supported by the National Natural Science Foundation of China(No.11171299)
文摘Low rank matrix recovery is a new topic drawing the attention of many researchers which addresses the problem of recovering an unknown low rank matrix from few linear measurements. The matrix Dantzig selector and the matrix Lasso are two important algorithms based on nuclear norm minimization. In this paper,we first prove some decay properties of restricted isometry constants, then we discuss the recovery errors of these two algorithms and give a new bound of restricted isometry constant to guarantee stable recovery, which improves the results of [11].
文摘阵元失效下多输入多输出(Multiple-Input Multiple-Output,MIMO)雷达虚拟阵列协方差矩阵出现大批整行整列元素缺失,破坏原有内在完整结构,导致波达方向(Direction of Arrival,DOA)估计性能下降。为此,提出一种联合核范数和SCAD(Smoothly Clipped Absolute Deviation)惩罚的完整协方差矩阵重构方法,以利于阵元失效下MIMO雷达DOA的有效估计。首先对待恢复的协方差矩阵建立核范数和SCAD惩罚双先验约束模型,并利用等正弦空间稀疏化方式划分粗网格空间,在可容忍的模型误差内能大大降低运算复杂度;然后利用ALM-ADMM(Augmented Lagrange Multipliers-Alternating Direction Method of Multipliers)算法对双先验约束模型进行求解,从而恢复协方差矩阵中大量整行整列的缺失数据;最后通过RD-ESPRIT(Reduced Dimensional ESPRIT)算法进行目标DOA估计。仿真结果验证该方法能快速恢复虚拟协方差矩阵中的缺失数据,从而有效提高阵元失效下MIMO雷达的DOA估计性能。
