A Perturbation Analysis of Low-Rank Matrix Recovery by Schatten p-Minimization

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.

Degrees of freedom in low rank matrix estimation

The objective of this paper is to quantify the complexity of rank and nuclear norm constrained methods for low rank matrix estimation problems. Specifically, we derive analytic forms of the degrees of freedom for these types of estimators in several common settings. These results provide efficient ways of comparing different estimators and eliciting tuning parameters. Moreover, our analyses reveal new insights on the behavior of these low rank matrix estimators. These observations are of great theoretical and practical importance. In particular, they suggest that, contrary to conventional wisdom, for rank constrained estimators the total number of free parameters underestimates the degrees of freedom, whereas for nuclear norm penalization, it overestimates the degrees of freedom. In addition, when using most model selection criteria to choose the tuning parameter for nuclear norm penalization, it oftentimes suffices to entertain a finite number of candidates as opposed to a continuum of choices. Numerical examples are also presented to illustrate the practical implications of our results.

RGBD Salient Object Detection by Structured Low-Rank Matrix Recovery and Laplacian Constraint

A structured low-rank matrix recovery model for RGBD salient object detection is proposed. Firstly, the problem is described by a low-rank matrix recovery, and the hierarchical structure of RGB image is added to the sparsity term. Secondly, the depth information is fused into the model by a Laplacian regularization term to ensure that the image regions which share similar depth value will be allocated to similar saliency value. Thirdly, a variation of alternating direction method is proposed to solve the proposed model. Finally, both quantitative and qualitative experimental results on NLPR1000 and NJU400 show the advantage of the proposed RGBD salient object detection model. © 2017, Tianjin University and Springer-Verlag Berlin Heidelberg.

Robust Principal Component Analysis Integrating Sparse and Low-Rank Priors

Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.

Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data

The method of recovering a low-rank matrix with an unknown fraction whose entries are arbitrarily corrupted is known as the robust principal component analysis （RPCA）. This RPCA problem, under some conditions, can be exactly solved via convex optimization by minimizing a combination of the nuclear norm and the 11 norm. In this paper, an algorithm based on the Douglas-Rachford splitting method is proposed for solving the RPCA problem. First, the convex optimization problem is solved by canceling the constraint of the variables, and ~hen the proximity operators of the objective function are computed alternately. The new algorithm can exactly recover the low-rank and sparse components simultaneously, and it is proved to be convergent. Numerical simulations demonstrate the practical utility of the proposed algorithm.

Constrained Low Rank Approximation of the Hermitian Nonnegative-Definite Matrix

In this paper, we consider a constrained low rank approximation problem: , where E is a given complex matrix, p is a positive integer, and is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation . We discuss the range of p and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.

Low-Rank Positive Approximants of Symmetric Matrices

Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.

Correction of failure in antenna array using matrix pencil technique

In this paper a non-iterative technique is developed for the correction of faulty antenna array based on matrix pencil technique（MPT）. The failure of a sensor in antenna array can damage the radiation power pattern in terms of sidelobes level and nulls. In the developed technique, the radiation pattern of the array is sampled to form discrete power pattern information set. Then this information set can be arranged in the form of Hankel matrix（HM） and execute the singular value decomposition（SVD）. By removing nonprincipal values, we obtain an optimum lower rank estimation of HM. This lower rank matrix corresponds to the corrected pattern. Then the proposed technique is employed to recover the weight excitation and position allocations from the estimated matrix. Numerical simulations confirm the efficiency of the proposed technique, which is compared with the available techniques in terms of sidelobes level and nulls.

基于深度图像先验的高光谱图像去噪方法

为了避免现有的高光谱图像去噪优化模型仅考虑有限的高光谱内在结构特点、并未实现图像特征的精确表征的问题,采用了一种基于空谱深度图像先验与平滑的高光谱图像去噪方法,将紧框架变换与具有高表达与强学习能力的深度学习模型进行结合,构建基于深度学习的噪声去除模型。首先在低秩矩阵分解的基础上,利用特定的深度图像先验学习潜在的空谱特征;然后分别构建端元与丰度矩阵的紧框架稀疏正则探究空谱局部平滑,并解决深度图像先验的半拟合问题;最后设计高效迭代算法实现模型求解。结果表明,基于空谱深度图像先验的方法在各种复杂的噪声干扰下均表现出较好的视觉恢复性能,峰值信噪比至少有1 dB以上的提升,得到了高质量的恢复图像。该方法为高光谱图像去噪提供了参考。

电磁大数据自动化标注补全算法

针对实际应用中电子侦察数据存在的数据质量差、标注率低等问题,将多传感器数据自动化标注问题抽象为稀疏矩阵恢复问题,在多平台多类型待标注监测数据与低秩稀疏矩阵之间建立正确的语义映射,进而转化为求解优化问题,并基于凸秩最小化算法对目标函数进行迭代以求得最优解。仿真实验结果表明,算法模型在目标特征信息缺失率40%~50%的恶劣情况下,恢复矩阵与原始矩阵的的最小均方根误差维持在0.06左右,能够有效实现矩阵恢复与数据的自动化标注。

一种求解低秩矩阵补全的修正加速近端梯度算法

设计适应大规模数据的快速算法是求解低秩矩阵补全的重点。文章改变了加速近端梯度算法的步长,对近似函数的近端最优点和上一迭代点增加了一个仿射组合。通过控制仿射系数,能够使得到的新迭代点有靠近原函数的趋势,进而能在保持算法精度的同时提高算法效率。最后通过相应的数值实验证明了算法的有效性和稳定性。

低复杂度的盲源分离和去混响联合优化方法

提出了一种低复杂度的基于加权预测误差(WPE)的独立低秩矩阵分析(ILRMA)方法。与现有的WPE-ILRMA方法把预测矩阵当成一个整体来处理不同,所提方法将预测矩阵展开来推导代价函数,利用不同声源的混合滤波器和分离滤波器之间的正交性简化代价函数的优化过程,进而以更低的计算复杂度对混合信号去混响。通过利用解耦预测矩阵和分离滤波器之间的关系,所提方法将维数较大的矩阵求逆转化为维数较小的矩阵求逆,从而取得了比WPE-ILMRA方法更低的计算复杂度。在最大似然框架下推导了所提方法的代价函数,并采用坐标梯度下降算法来估计参数。实验结果表明,所提方法能以更低的计算复杂度和更高的稳定性取得与WPE-ILRMA方法相似的分离性能。

扩散噪声环境下的多通道盲语音分离方法

适用于超定系统的处理扩散噪声的独立向量提取方法受限于高斯噪声假设,无法消除与目标声源同方向的扩散噪声。为此,提出了一种适用于扩散噪声环境的多通道盲源分离方法。该方法假设扩散噪声在各个方向上的能量分布均匀且具有时变特性。采用低秩声源模型和秩1空间模型构建适用于扩散噪声环境下混合信号的概率模型。在此基础上,通过最大似然准则推导出分离矩阵的更新公式,并估计语音和噪声的功率谱密度。最后,利用维纳滤波抑制与目标声源相同方向的扩散噪声。仿真实验结果表明,所提方法的声源分离性能和抑制噪声能力比现有算法取得了显著提高,验证了其在复杂噪声环境下的有效性。

基于稀疏线阵协方差矩阵重构的DOA估计方法研究

相比均匀线阵(Uniform Linear Array,ULA),相同阵元数目下稀疏线阵(Sparse Linear Array,SLA)的抗耦合效应更好,阵列孔径更大,到达方向(Direction of Arrival,DOA)估计的自由度(Degrees Of Freedom,DOF)更高,因而近年来得到了广泛的研究。为了可以进行高DOF的DOA估计,学者们开始研究SLA的差分虚拟阵元,差分虚拟阵元对应的协方差矩阵相比原阵元对应的协方差矩阵维度更大,因而估计的DOF更高。当SLA的差分虚拟阵元连续取值时,可以利用已有阵元的接收信息,得到SLA的协方差矩阵,在该矩阵的基础之上构建差分虚拟阵元的协方差矩阵进而进行DOA估计。然而,当SLA的差分虚拟阵元存在孔洞时,即差分虚拟阵元不能连续取值时,不能直接利用重构的协方差矩阵进行DOA估计,需要恢复完全增广协方差矩阵的信息再进行DOA估计。对于该问题,本文基于矢量化后原协方差矩阵和虚拟差分阵协方差矩阵的误差分布情况,并结合完全增广协方差矩阵的低秩特性和半正定特性来构建优化问题。通过求解该问题来恢复维度更高的完全增广协方差矩阵。最后对该矩阵进行奇异值分解,利用多重信号分类(Multiple Signal Classification,MUSIC)算法就可以获得多源的空间谱。本文最后通过数值仿真试验验证了所提算法可以实现高DOF的DOA估计,并且相比于现有算法,本文所提算法对欠定DOA估计的效果更好,多源DOA估计的精度更高,产生的误差更小。

基于稳健非负矩阵分解的用电数据清洗和插补

针对运行工况下用电数据在采集和传输过程中通常存在噪声、异常值和丢失的数据质量问题,利用单一用户用电数据时空分布的低本征维和异常值的稀疏特性,提出一种基于低秩矩阵完备的数据缺失填补、降噪和异常值剔除统一处理方法框架。首先,鉴于实际中多用户用电场景和用电特征差异巨大,仅根据单一用户用电行为的内在相似性构建具有低秩特征的数据矩阵;进而,考虑列异常和稀疏异常等加性背景噪声影响,构建低秩提升正则约束的非负矩阵完备最优化模型;最后,采用交替迭代最小二乘法方式进行最优化问题求解,实现缺失数据填补和多重背景噪声消除。通过仿真分析和实验结果验证了算法的有效性和准确性。

2种低秩矩阵恢复优化模型的误差估计定理

近年来低秩矩阵恢复问题逐渐引起人们的关注,类似于向量稀疏恢复的充分条件是需要测量矩阵满足限制等距性质,低秩矩阵恢复的充分条件是需要一个线性映射满足限制等距性质.低秩矩阵恢复时所需的模型大致分为有噪和无噪两种恢复模型,恢复出来的结果需要不同的限制等距常数界去保证.文章证明了这2种优化模型的误差界估计定理,并得出了2种不同的限制等距常数界.

低秩自适应微调的一阶段红外目标跟踪

由于缺乏大规模的红外跟踪训练数据集,现有的红外跟踪方法大都利用在大规模可见光数据上预训练的模型,然后在小规模的红外数据上进行完全微调。然而,当预训练模型的参数规模迅速增大时,完全微调需要的内存和时间成本也急剧增长,这限制了低资源用户在大型模型上进行研究和应用。为解决该问题,提出一种参数、内存和时间高效自适应的红外目标跟踪算法。首先,通过Transformer的自注意力机制对模板和搜索区域图像进行联合特征提取和关系建模,获取与目标关联度更强的特征表示;其次,利用低秩自适应矩阵的侧网络将可训练参数从主干网络中进行解耦,以减少需要训练更新的参数规模;最后,设计一种轻量级空间特征增强模块,增强特征对目标和背景的判别能力。提出方法的训练参数,内存和时间分别仅占完全微调方法的0.04%、39.6%和66.2%,性能却超越了完全微调。在3个标准红外跟踪数据集LSOTB-TIR120,LSOTB-TIR100和PTB-TIR上的实验对比结果和消融实验证明了提出的方法是有效的。提出的方法在LSOTB-TIR120数据集上成功率为73.7%,精度为86.0%,归一化精度为78.5%;LSOTB-TIR100数据集上成功率为71.6%,精度为83.9%,归一化精度为76.1%;在PTB-TIR数据集上成功率为69.0%,精度为84.9%,均取得了当前最先进的跟踪性能。

基于低秩稀疏矩阵分解与定位窗滤波的混响抑制技术

在强混响背景下,使用传统的预白化处理、时频分析以及子空间分析等方法对动目标检测效果不佳,针对这一问题,本文利用近年来新引入的低秩稀疏矩阵分解理论来提高强混响背景下的动目标检测能力,采用多帧数据联合的鲁棒PCA处理算法,结合混响数据的声学特征将声学检测问题转化为图像分解问题,并通过对比PCA算法处理结果,给出算法的性能比较;与此同时,本文结合目标运动连续性和稀疏杂点随机性的特征差异,提出一种定位窗滤波方法,进一步滤除稀疏杂点,净化主动声呐显示图像,提高主动声呐动目标检测性能。仿真及试验数据处理结果说明,在阵元端信混比-5 dB情况下,算法仍然可以对目标准确定位,滤除稀疏杂点,且在时频域上效果更佳,显著提高了主动声呐动目标检测能力。

一种基于联合加权和截断的毫米波大规模MIMO信道估计

提出一种联合加权和截断核范数的毫米波大规模多输入多输出(MIMO)信道估计算法。针对毫米波大规模MIMO信道估计问题中训练和反馈开销大的问题,首先利用毫米波信道天线角度域稀疏的特性,把信道估计问题转化为低秩矩阵恢复问题。采用一种有效而灵活的秩函数——联合加权截断核范数作为核范数的松弛,构造出一种新的矩阵恢复模型用于信道估计问题,以最小化加权截断核范数为优化目标,并利用交替优化框架求解。仿真结果表明,该方法可以有效地提高信道估计的精度,并且具有可靠的收敛性。

矩阵数据的分类预测方法

文章在矩阵正态分布下研究矩阵数据的参数估计及其分类方法。首先,基于低秩分解和矩阵正态分布的惩罚似然函数方法提出矩阵数据的参数估计和秩的自适应确定方法;其次,应用块坐标下降方法与增广拉格朗日乘子算法给出有效的迭代估计算法;然后,基于判别分析方法提出低秩分解下的分类预测规则;最后,通过大量数值模拟及卫星陆地资源数据和手写体数字的识别应用,验证了低秩估计方法对提高矩阵数据的估计和分类预测精度具有明显的效果。