步长自适应的测量矩阵迭代优化方法

在压缩感知中，降低传感矩阵的列相干性可以提高重构精度。因为稀疏字典一般是固定的，所以目前主要通过优化测量矩阵来间接降低传感矩阵列相干性。提出一种改进的测量矩阵优化算法，使用梯度下降法更新测量矩阵并结合Barzilai-Borwen方法以及Armijo准则，使步长能够在迭代中自适应调整并保证算法收敛性。仿真实验表明，所提出的方法具有更快的收敛速度并且能够得到更优的测量矩阵。     

带边界条件约束的非相干字典学习方法及其稀疏表示

从字典的相干性边界条件出发, 提出一种基于极分解的非相干字典学习方法(Polar decomposition based incoherent dictionary learning, PDIDL), 该方法将字典以Frobenius范数逼近由矩阵极分解获取的紧框架, 同时采用最小化所有原子对的内积平方和作为约束, 以降低字典的相干性, 并保持更新前后字典结构的整体相似特性. 采用最速梯度下降法和子空间旋转实现非相干字典的学习和优化. 最后将该方法应用于合成数据与实际语音数据的稀疏表示. 实验结果表明, 本文方法学习的字典能逼近等角紧框架(Equiangular tight-frame, ETF), 实现最大化稀疏编码, 在降低字典相干性的同时具有较低的稀疏表示误差.     

用稀疏相似性度量求解压缩传感矩阵

提出一种用稀疏相似性度量求解压缩传感矩阵的方法,并将其应用在图像重建和识别领域中.首先构造一种稀疏相似性度量,然后将其嵌入到传感矩阵的模糊代价函数中,最终传感矩阵的原子更新按照模糊方式进行计算.用该方法优化后的观测矩阵与字典矩阵之间保持了低相干性,并且样本的稀疏信号在相同重构条件下具备了更优的测量数目和质量.在ORL和FERET人脸数据库及91幅自然图像库上的实验结果验证了该算法的有效性.     

面向乳腺病理图像分类的非相干字典学习及稀疏表示算法

针对乳腺病理图像分类,提出一种非相干字典学习及其稀疏表示算法.首先针对不同类别的图像,基于在线字典学习算法分别学习各类特定的子字典;其次利用紧框架建立一种非相干字典学习模型,通过交替投影优化字典的相干性、秩与紧框架性,从而有效地约束字典的格拉姆矩阵与参考格拉姆矩阵的距离,获得判别性更强的非相干字典;最后采用子空间旋转方法优化非相干字典的稀疏表示性能.利用乳腺癌数据集BreaKHis进行实验的结果证明,该算法所学习的非相干字典能平衡字典的判别性与稀疏表示性能,在良性肿瘤与恶性肿瘤图像分类上获得了86.0%的分类精度;在良性肿瘤图像中的腺病与纤维腺瘤的分类上获得92.5%的分类精度.     

压缩感知中提升测量矩阵稀疏性的等效字典优化设计

在压缩感知中，可以通过减小等效字典（测量矩阵和稀疏字典的乘积）的互相干性值来提升稀疏重构算法的稳定性。已有的优化设计方法在减小等效字典互相干性值的同时没有考虑如何提高信号重构的计算效率，为了克服该问题，在稀疏字典固定的情形下，本文提出了一个关于测量矩阵的有约束光滑优化问题，其中第1个约束要求等效字典的Gram矩阵具有尽可能小的互相干性值；第2个则利用L₁范数来促进测量矩阵的稀疏性。然后，利用收敛的交替投影算法进行求解。数值实验表明：针对图像恢复问题，相对于采用已有优化设计方法得到的等效字典，本文提出的方法显著提高了测量矩阵中的零元素占比，同时使得压缩感知系统具有更高的信号重构精度。     

一种基于离散小波基的压缩传感测量矩阵优化方法

测量矩阵优化是压缩传感理论(CS)研究的重要内容,基于离散小波基,提出一种测量矩阵优化算法.根据离散小波变换的系数分布特点,构建优化矩阵来对原测量矩阵系数进行调整,提高了采样效率,同时降低了测量矩阵列向量的相干性.理论分析和实验验证表明,该优化算法对压缩传感中常用测量矩阵进行优化后,其重建效果都有所提高,特别是在低采样率的条件下,优化效果明显.经过验证,优化后的测量矩阵满足有限等距特性(RIP).     

基于压缩感知的微弱信号检测方法

提出了一种利用压缩感知原理测量微弱信号的方法,测量信号由伪随机序列调制,应用改造的测量矩阵,在一次测量基础上进行二次测量,利用压缩感知的恢复算法可以精确地确定信号在字典中的位置并且得到其幅度值。仿真实验证明本文方法可以用于检测信噪比高于-20 dB的微弱信号,将信号较完整地从噪声干扰中恢复出来,信号幅度误差很小。     

部分哈达玛矩阵分段弱正交匹配追踪算法

为解决分段弱正交匹配追踪算法在测量过程中难以获得高精度重构信号的问题,首先对以高斯矩阵为测量矩阵的传统SWOMP算法进行了分析,指出问题的关键在于高斯矩阵列相干性过大会影响残差信号的匹配过程,从而导致部分信号丢失,使重构精度下降;然后,根据分析提出了一种基于部分哈达玛矩阵的分段弱正交匹配追踪(PH-SWOMP)算法,其中部分哈达玛矩阵根据偶数行抽取原则进行构造,可以显著降低测量矩阵的互相关性;最后,通过与传统SWOMP算法的图像重构对比仿真实验对PH-SWOMP算法性能进行了验证,其中传统SWOMP算法分别选取高斯矩阵、托普利兹矩阵等4种矩阵作为测量矩阵.仿真结果表明,在相同条件下,相比于传统SWOMP算法, PH-SWOMP算法信噪比最大提高了53.95%,相应的重构时间缩短了15.41%,具有更小的恢复残差以及更高的信号重构成功率.     

基于分离字典构造的快速压缩感知重构算法

针对当前压缩感知重构算法存在重构质量偏低、重构时间过长等问题,提出了基于矩阵流形分离字典构造的分块压缩感知重构算法。首先,该算法基于矩阵流形模型训练出可分离稀疏表示矩阵,并对其正交化;其次,构造随机测量矩阵,并利用矩阵运算将其与得到的稀疏表示矩阵进行结合,进而构造出一组分离字典;最后,将该字典用于信号压缩感知中,并通过线性运算实现信号的快速重构。实验结果表明,与当前主流的压缩感知重构算法相比,所提算法在重构精度以及重构时间上都具有一定提升,并在对实时性要求高的领域中具有很好的应用价值。     

基于最优格拉斯曼框架的测量矩阵投影构造方法

压缩采样中测量矩阵对于信号的压缩及重建都有着十分重要的作用。为了减小测量矩阵与稀疏变换矩阵的互相干性,对测量矩阵和稀疏变换矩阵的乘积,构造其Gram矩阵并通过最优投影法优化之。格拉斯曼框架各元素间具有较小的相干性,使优化后的矩阵逼近格拉斯曼框架则可以获得更好的性能。     

压缩感知雷达感知矩阵优化

压缩感知雷达(Compressive sensing radar,CSR)的场景恢复性能要求感知矩阵相关系数尽可能小。针对感知矩阵相关系数的最小化问题,提出了基于模拟退火的感知矩阵优化算法,建立了基于随机滤波结构的CSR模型,给出了优化目标函数,采用模拟退火实现了发射波形、测量矩阵的优化以及联合优化。仿真结果表明该算法可以提高场景恢复精度,提升抗噪能力,增大可观测目标个数上限,且联合优化的性能优于波形和测量矩阵的单独优化。     

帐篷混沌序列稀疏测量矩阵构造

测量矩阵的构造是压缩感知(CS)中重要的研究内容之一.利用混沌系统伪随机性、遍历性的特点,提出了一种基于帐篷混沌序列构造确定性稀疏随机矩阵的方法.对混沌系统生成的确定性序列进行了间隔采样,采样后的序列满足统计独立性,然后通过符号函数映射,生成了具有稀疏性质的伪随机序列,进而构造出混沌稀疏测量矩阵.仿真实验表明:该方法构造出的混沌稀疏测量矩阵与高斯随机矩阵、稀疏随机矩阵及Bernoulli随机矩阵相比,具有类似的重构性能.混沌系统参数与初值固定时,构造的混沌稀疏测量矩阵是确定的,计算复杂度小且硬件上容易实现.     

A new construction of compressed sensing matrices for signal processing via vector spaces over finite fields

As an emerging sampling technique, Compressed Sensing provides a quite masterly approach to data acquisition. Compared with the traditional method, how to conquer the Shannon/Nyquist sampling theorem has been fundamentally resolved. In this paper, first, we provide deterministic constructions of sensing matrices based on vector spaces over finite fields. Second, we analyze two kinds of attributes of sensing matrices. One is the recovery performance with respect to compressing and recovering signals in terms of restricted isometry property. In particular, we obtain a series of binary sensing matrices with sparsity level that are quite better than some existing ones. In order to save the storage space and accelerate the recovery process of signals, another character sparsity of matrices has been taken into account. Third, we merge our binary matrices with some matrices owning low coherence in terms of an embedding manipulation to obtain the improved matrices still having low coherence. Finally, compared with the quintessential binary matrices, the improved matrices possess better character of compressing and recovering signals. The favorable performance of our binary and improved matrices have been demonstrated by numerical simulations.

     

基于截尾估计的概率估计方法

能否以高概率正确重建稀疏信号是压缩感知理论中的重要研究内容。信号的稀疏度及冗余字典原子间的相关特性是研究该内容的关键因素。文中运用累积增量的概念,提出了一种基于截尾概率的累积增量满足约束界的概率估计的方法。运用该方法,判断能否利用选取的测量矩阵正确重构原始信号。通过Matlab仿真,验证了将高斯随机矩阵作为观测矩阵,在OMP重构算法下,可以高概率地正确重构出原始信号,也验证了文中所提方法的合理性。     

采样列化的切比雪夫混沌测量矩阵构造算法研究

压缩感知利用信号的稀疏性,无损地从低维测量信号中恢复高维度稀疏信号,近年来得到极大发展。然而,目前存在的测量矩阵中大多存在元素相关性高等问题,无法保证恢复效果的精确性,大大制约了它们的应用前景。基于此,通过引入切比雪夫混沌系统,提出一种基于采样列化的切比雪夫混沌感知测量矩阵(SC3M)。不同于经典的相对独立取值的构造方法,SC3M矩阵通过对切比雪夫混沌序列做采样列化及归一化处理等操作来确保矩阵的低列相关性,以优化重构效果。进一步,结合Johnson-Lindenstrauss引理严格证明了其满足约束等距特性(RIP),给提出的测量矩阵的应用提供了扎实的理论依据。实验仿真表明,提出的混沌测量矩阵能确保良好的信号和图像重构精度,明显优于纯随机矩阵、伯努利矩阵和高斯矩阵等其它经典测量矩阵。     

An Evaluation of the Sparsity Degree for Sparse Recovery with Deterministic Measurement Matrices

The paper deals with the estimation of the maximal sparsity degree for which a given measurement matrix allows sparse reconstruction through ? ₁-minimization. This problem is a key issue in different applications featuring particular types of measurement matrices, as for instance in the framework of tomography with low number of views. In this framework, while the exact bound is NP hard to compute, most classical criteria guarantee lower bounds that are numerically too pessimistic. In order to achieve an accurate estimation, we propose an efficient greedy algorithm that provides an upper bound for this maximal sparsity. Based on polytope theory, the algorithm consists in finding sparse vectors that cannot be recovered by ? ₁-minimization. Moreover, in order to deal with noisy measurements, theoretical conditions leading to a more restrictive but reasonable bounds are investigated. Numerical results are presented for discrete versions of tomography measurement matrices, which are stacked Radon transforms corresponding to different tomograph views.     

Data Gathering in Wireless Sensor Networks Via Regular Low Density Parity Check Matrix

A great challenge faced by wireless sensor networks (WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However, it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property (StRIP) via regular low density parity check (RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that StRIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.      

依据列相关性优化高斯测量矩阵

为了提高信号重建的精度以及稀疏度适用范围,提出了一种新的测量矩阵优化方法,减小测量矩阵和稀疏变换矩阵的相关性。首先,由测量矩阵和稀疏变换矩阵的乘积构造Gram矩阵;根据Gram矩阵的维数,计算互相关函数的下确界即Welch界;其次,由Welch界确定阈值,收缩Gram矩阵中大于阈值的非对角元;然后,由新得的Gram矩阵和稀疏变换矩阵反解出测量矩阵,迭代更新,从而达到减小相关性,优化测量矩阵的目的。实验结果表明：依据Welch界优化测量矩阵,能快速降低压缩感知矩阵相关性的最大值,提高OMP算法的性能,例如在误差率为10_-0.9时,原高斯随机矩阵需要23个观测值,算法优化后只需16个观测值,相对于Elad、Zhao等观测矩阵优化方法,文中提出的算法具有更小的重构误差,性能和稳定性也略有提升。     

Equivalence Probability and Sparsity of Two Sparse Solutions in Sparse Representation

This paper discusses the estimation and numerical calculation of the probability that the 0-norm and 1-norm solutions of underdetermined linear equations are equivalent in the case of sparse representation. First, we define the sparsity degree of a signal. Two equivalence probability estimates are obtained when the entries of the 0-norm solution have different sparsity degrees. One is for the case in which the basis matrix is given or estimated, and the other is for the case in which the basis matrix is random. However, the computational burden to calculate these probabilities increases exponentially as the number of columns of the basis matrix increases. This computational complexity problem can be avoided through a sampling method. Next, we analyze the sparsity degree of mixtures and establish the relationship between the equivalence probability and the sparsity degree of the mixtures. This relationship can be used to analyze the performance of blind source separation (BSS). Furthermore, we extend the equivalence probability estimates to the small noise case. Finally, we illustrate how to use these theoretical results to guarantee a satisfactory performance in underdetermined BSS.      

Construction of compressed sensing matrices for signal processing

To cope with the huge expenditure associated with the fast growing sampling rate, compressed sensing (CS) is proposed as an effective technique of signal processing. In this paper, first, we construct a type of CS matrix to process signals based on singular linear spaces over finite fields. Second, we analyze two kinds of attributes of sensing matrices. One is the recovery performance corresponding to compressing and recovering signals. In particular, we apply two types of criteria, error-correcting pooling designs (PD) and restricted isometry property (RIP), to investigate this attribute. Another is the sparsity corresponding to storage and transmission signals. Third, in order to improve the ability associated with our matrices, we use an embedding approach to merge our binary matrices with some other matrices owing low coherence. At last, we compare our matrices with other existing ones via numerical simulations and the results show that ours outperform others.