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.展开更多
We will prove that for 1<p<∞and 0<λ<n,the central Morrey norm of the truncated centered Hardy-Littlewood maximal operator Mcγequals that of the centered Hardy-Littlewood maximal operator for all 0<γ...We will prove that for 1<p<∞and 0<λ<n,the central Morrey norm of the truncated centered Hardy-Littlewood maximal operator Mcγequals that of the centered Hardy-Littlewood maximal operator for all 0<γ<+∞.When p=1 and 0<λ<n,it turns out that the weak central Morrey norm of the truncated centered Hardy-Littlewood maximal operator Mcγequals that of the centered Hardy-Littlewood maximal operator for all 0<λ<+∞.Moreover,the same results are true for the truncated uncentered Hardy-Littlewood maximal operator.Our work extends the previous results of Lebesgue spaces to Morrey spaces.展开更多
与均匀阵列相比,稀疏阵列可以使天线阵列成本降低,减少数据处理,同时带来更大的阵列孔径提高信号解析能力,在信号处理中有着广泛的应用。但是由于其排布的不规则性,计算量较大,二维面阵合成协方差矩阵存在空洞,对角度估计的准确性造成...与均匀阵列相比,稀疏阵列可以使天线阵列成本降低,减少数据处理,同时带来更大的阵列孔径提高信号解析能力,在信号处理中有着广泛的应用。但是由于其排布的不规则性,计算量较大,二维面阵合成协方差矩阵存在空洞,对角度估计的准确性造成负面影响,增强了系统对噪声的敏感度。为了克服这些问题,本文提出了一种新的角度估计方法,采用截断核范数以降低噪声的影响,并通过ℓ_(p)范数优化提升信号的稀疏表示,利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)算法构造子问题恢复出完整的阵列信号。随后采用子阵划分技术和基于最小二乘的传播算子模型(Propagator Method,PM)对恢复的信号处理,精确估计信号源的方位和俯仰角。仿真结果表明,所提出的角度估计算法在角度精度和时间复杂度方面具有优越性。展开更多
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.展开更多
针对过完备字典直接对图像进行稀疏表示不能很好地剔除高频噪声的影响,压缩感知后图像重构质量不高的问题,提出了基于截断核范数低秩分解的自适应字典学习算法。该算法首先利用截断核范数正则化低秩分解模型对图像矩阵低秩分解得到低秩...针对过完备字典直接对图像进行稀疏表示不能很好地剔除高频噪声的影响,压缩感知后图像重构质量不高的问题,提出了基于截断核范数低秩分解的自适应字典学习算法。该算法首先利用截断核范数正则化低秩分解模型对图像矩阵低秩分解得到低秩部分和稀疏部分,其中低秩部分保留了图像的主要信息,稀疏部分主要包含高频噪声及部分物体轮廓信息;然后对图像低秩部分进行分块,依据图像块纹理复杂度对图像块进行分类;最后使用K奇异值分解(K⁃single value decomposition,K⁃SVD)字典学习算法,针对不同类别训练出多个不同大小的过完备字典。仿真结果表明,本文所提算法能够对图像进行较好的稀疏表示,并在很好地保持图像块特征一致性的同时显著提升图像重构质量。展开更多
视频前背景分离的主要目的是从视频中提取感兴趣目标,但是由于噪声、光照变化等的影响使其仍是计算机视觉等领域最具有挑战性的任务之一。截断核范数(truncated nuclear norm,TNN)算法是一种经典的鲁棒主成分分析(robust principal comp...视频前背景分离的主要目的是从视频中提取感兴趣目标,但是由于噪声、光照变化等的影响使其仍是计算机视觉等领域最具有挑战性的任务之一。截断核范数(truncated nuclear norm,TNN)算法是一种经典的鲁棒主成分分析(robust principal component analysis,RPCA)算法,被广泛地应用于视频前背景分离。但是,该算法中的截断核范数对传统鲁棒主成分分析中的秩函数逼近度不高,导致其稳定性不强,对一些复杂场景下的视频前背景分离精度不高。针对该问题,本文提出了一种改进的截断核范数(improved truncated nuclear norm,ITNN)算法。该算法首先采用非凸γ范数替代TNN模型中的核范数,并分析了相对于核范数而言,非凸γ范数对秩函数具有更高的逼近度,同时提出了该算法所对应的模型;其次,为了求解提出的模型,本文引入了广义交替方向乘子法(generalized alternating direction method of multipliers,GADMM)对该模型进行求解;最后,将提出的ITNN算法应用于多个公共视频的前背景分离实验中,并通过展示提取不同视频的前景效果,从视觉角度验证了ITNN算法的有效性。同时,计算提出算法和对比算法提取的视频前景的F-measure值,从量化的角度进一步验证了ITNN算法的有效性。另外,实验还记录了各算法的视频前背景分离的运行时间,验证了ITNN算法的效率。总之,本文通过实验验证了提出的ITNN算法在视频前背景分离中的有效性和优越性。展开更多
基金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.
基金the National Natural Science Foundation of China(Grant No.11871452)the Project of Henan Provincial Department of Education(No.18A110028)the Nanhu Scholar Program for Young Scholars of XYNU.
文摘We will prove that for 1<p<∞and 0<λ<n,the central Morrey norm of the truncated centered Hardy-Littlewood maximal operator Mcγequals that of the centered Hardy-Littlewood maximal operator for all 0<γ<+∞.When p=1 and 0<λ<n,it turns out that the weak central Morrey norm of the truncated centered Hardy-Littlewood maximal operator Mcγequals that of the centered Hardy-Littlewood maximal operator for all 0<λ<+∞.Moreover,the same results are true for the truncated uncentered Hardy-Littlewood maximal operator.Our work extends the previous results of Lebesgue spaces to Morrey spaces.
文摘与均匀阵列相比,稀疏阵列可以使天线阵列成本降低,减少数据处理,同时带来更大的阵列孔径提高信号解析能力,在信号处理中有着广泛的应用。但是由于其排布的不规则性,计算量较大,二维面阵合成协方差矩阵存在空洞,对角度估计的准确性造成负面影响,增强了系统对噪声的敏感度。为了克服这些问题,本文提出了一种新的角度估计方法,采用截断核范数以降低噪声的影响,并通过ℓ_(p)范数优化提升信号的稀疏表示,利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)算法构造子问题恢复出完整的阵列信号。随后采用子阵划分技术和基于最小二乘的传播算子模型(Propagator Method,PM)对恢复的信号处理,精确估计信号源的方位和俯仰角。仿真结果表明,所提出的角度估计算法在角度精度和时间复杂度方面具有优越性。
基金Supported by the National Natural Science Foundation of China(11871452,12071052the Natural Science Foundation of Henan(202300410338)the Nanhu Scholar Program for Young Scholars of XYNU。
基金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.
文摘针对过完备字典直接对图像进行稀疏表示不能很好地剔除高频噪声的影响,压缩感知后图像重构质量不高的问题,提出了基于截断核范数低秩分解的自适应字典学习算法。该算法首先利用截断核范数正则化低秩分解模型对图像矩阵低秩分解得到低秩部分和稀疏部分,其中低秩部分保留了图像的主要信息,稀疏部分主要包含高频噪声及部分物体轮廓信息;然后对图像低秩部分进行分块,依据图像块纹理复杂度对图像块进行分类;最后使用K奇异值分解(K⁃single value decomposition,K⁃SVD)字典学习算法,针对不同类别训练出多个不同大小的过完备字典。仿真结果表明,本文所提算法能够对图像进行较好的稀疏表示,并在很好地保持图像块特征一致性的同时显著提升图像重构质量。
文摘视频前背景分离的主要目的是从视频中提取感兴趣目标,但是由于噪声、光照变化等的影响使其仍是计算机视觉等领域最具有挑战性的任务之一。截断核范数(truncated nuclear norm,TNN)算法是一种经典的鲁棒主成分分析(robust principal component analysis,RPCA)算法,被广泛地应用于视频前背景分离。但是,该算法中的截断核范数对传统鲁棒主成分分析中的秩函数逼近度不高,导致其稳定性不强,对一些复杂场景下的视频前背景分离精度不高。针对该问题,本文提出了一种改进的截断核范数(improved truncated nuclear norm,ITNN)算法。该算法首先采用非凸γ范数替代TNN模型中的核范数,并分析了相对于核范数而言,非凸γ范数对秩函数具有更高的逼近度,同时提出了该算法所对应的模型;其次,为了求解提出的模型,本文引入了广义交替方向乘子法(generalized alternating direction method of multipliers,GADMM)对该模型进行求解;最后,将提出的ITNN算法应用于多个公共视频的前背景分离实验中,并通过展示提取不同视频的前景效果,从视觉角度验证了ITNN算法的有效性。同时,计算提出算法和对比算法提取的视频前景的F-measure值,从量化的角度进一步验证了ITNN算法的有效性。另外,实验还记录了各算法的视频前背景分离的运行时间,验证了ITNN算法的效率。总之,本文通过实验验证了提出的ITNN算法在视频前背景分离中的有效性和优越性。
