A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with...A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.展开更多
Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the O...Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.展开更多
Orthogonal multi-matching pursuit（OMMP）is a natural extension of orthogonal matching pursuit（OMP）in the sense that N（N≥1）indices are selected per iteration instead of 1.In this paper,the theoretical performance...Orthogonal multi-matching pursuit（OMMP）is a natural extension of orthogonal matching pursuit（OMP）in the sense that N（N≥1）indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property（RIP）is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N＋1＋√K/NθKN-N＋1,N〈1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.展开更多
This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation p...This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.展开更多
This paper establishes a high order condition on the restricted isometry property adapted to a frame D （D-RIF） for the signal recovery. It is shown that if the measurementmatrix A satisfies the D-RIP condition δtk ...This paper establishes a high order condition on the restricted isometry property adapted to a frame D （D-RIF） for the signal recovery. It is shown that if the measurementmatrix A satisfies the D-RIP condition δtk 〈t-1/t for t 〉 1, then all signals f which aresparse in terms of a tight frame D can be recovered stably or exactly via the l1-analysis model based on y= Af ＋ z in 12 and Dantzig selector bounded noise setting.展开更多
Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for a...Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.展开更多
文摘A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.
基金supported by National Natural Science Foundation of China(Grant Nos.11271060,U0935004,U1135003,11071031,11290143 and 11101096)the Scientific Research Foundation for the Returned Overseas Chinese Scholars,State Education Ministry,National Engineering Research Center of Digital Lifethe Guangdong Natural Science Foundation(Grant No.S2012010010376)
文摘Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.
基金supported by the Science Foundation of Guangdong University of Finance & Economics(Grant No.13GJPY11002)National Natural Science Foundation of China(Grant Nos.11071031,11271060,11290143,U0935004 and U1135003)+1 种基金the Guangdong Natural Science Foundation(Grant No.S2012010010376)the Guangdong University and Colleges Technology Innovation Projects(Grant No.2012KJCX0048)
文摘Orthogonal multi-matching pursuit（OMMP）is a natural extension of orthogonal matching pursuit（OMP）in the sense that N（N≥1）indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property（RIP）is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N＋1＋√K/NθKN-N＋1,N〈1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.
基金supported by the National Natural Science Foundation of China(11871109)NSAF(U1830107)the Science Challenge Project(TZ2018001)
文摘This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.
基金supported by National Natural Science Foundation of China(11271050 and 11371183)
文摘This paper establishes a high order condition on the restricted isometry property adapted to a frame D （D-RIF） for the signal recovery. It is shown that if the measurementmatrix A satisfies the D-RIP condition δtk 〈t-1/t for t 〉 1, then all signals f which aresparse in terms of a tight frame D can be recovered stably or exactly via the l1-analysis model based on y= Af ＋ z in 12 and Dantzig selector bounded noise setting.
文摘Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.
