An efficient optimization of measurement matrix for compressive sensing

Compressive sensing (CS) is a new paradigm for signal acquisition and reconstruction, which can reconstruct the signal at less than the Nyquist sampling rate. The sampling of the signal occurs through a measurement matrix (MM); thus, MM generation is significant in the context of the CS framework. In this paper, an optimization algorithm is introduced for the generation of the MM of CS based on Restricted Isometric Property (RIP) mandates that eigenvalues of the sensing matrix fall within an interval also minimizes the mutual coherence of the sensing matrix (i.e. the product of the MM and sparsifying matrix). A novel gradient-based iterative optimization method is used to reduce the eigenvalues of the sensing matrix by SVD decomposition. Meanwhile, the proposed algorithm can also reduce the operational complexity. Experimental results and analysis prove that the optimized MM reduces the maximum mutual and average mutual coherence between the MM and the sparsifying basis, which shows the effectiveness of the proposed algorithm over some state-of-art works.     

Measurement matrix optimization based on incoherent unit norm tight frame

This paper considers the problem of measurement matrix optimization for compressed sensing (CS) in which the dictionary is assumed to be given, such that it leads to an effective sensing matrix. Due to important properties of equiangular tight frames (ETFs) to achieve Welch bound equality, the measurement matrix optimization based on ETF has received considerable attention and many algorithms have been proposed for this aim. These methods produce sensing matrix with low mutual coherence based on initializing the measurement matrix with random Gaussian ensembles. This paper, use incoherent unit norm tight frame (UNTF) as an important frame with the aim of low mutual coherence and proposes a new method to construction a measurement matrix of any dimension while measurement matrix initialized by partial Fourier matrix. Simulation results show that the obtained measurement matrix effectively reduces the mutual coherence of sensing matrix and has a fast convergence to Welch bound compared with other methods.     

基于自相关函数的SRSF信号感知矩阵优化方法

根据随机步进频率(random stepped-frequency, RSF)信号特征,结合感知矩阵优化理论,提出了一种基于自相关函数的稀疏RSF (sparse RSF,SRSF)信号感知矩阵优化方法. 首先,在构建稀疏重构模型的基础上,给出了SRSF信号波形参数与感知矩阵构造方式的内在联系;然后,研究了感知矩阵互相关系数矩阵与信号自相关函数（模糊函数的零多普勒切面）的关系,得出在特定条件下两者等价的结论,进而将二维感知矩阵优化问题转化为一维自相关函数的波形优化设计问题;最后,利用基于自相关函数最大旁瓣与均值旁瓣联合约束的波形优化方法对上述结论进行了验证. 仿真实验验证了感知矩阵互相关系数与信号自相关函数的关系,且通过对波形的设计,实现了优化感知矩阵、提升信号稀疏重构性能的目的.     

上行免调度NOMA系统中基于遗传算法的扩频矩阵优化方法

为了提升基于压缩感知(Compressive Sensing,CS)框架下的免调度非正交多址接入(Non-Orthogonal Multiple Access,NOMA)系统的信道估计和多用户检测性能,本文提出了一种基于遗传算法(Genetic Algorithm,GA)的扩频矩阵优化方法.该方法以最小化扩频矩阵的互相...     

采用确定性测量矩阵的宽带压缩采样的研究

在对宽带信号进行处理的过程中,常运用压缩感知的理论来获得有效的信息。而在实践压缩感知理论的压缩采样的结构中,调制宽带转换器的采样结构更加适合用于处理宽频带信号。文中研究了调制宽带转换器的压缩采样原理,也介绍了随机测量矩阵和确定性测量矩阵。分别将随机矩阵和确定性矩阵作为该调制宽带转换器的测量矩阵,对比分析了该采样结构的重构性能。研究了在确定性测量矩阵的基础上,该采样结构在折叠和非折叠条件下的信号重构性能,同时,也对系统的通道数目对性能重构和信噪比的影响进行了补充分析。     

Efficient 3D imaging method of MIMO radar for moving target

When compressive sensing (CS) was used to achieve sparse imaging of moving targets,the Doppler frequency caused by motion will increase the processing dimension,change the center frequency of echo and worsen the mutual coherence property of measurement matrix.In order to improve the three-dimensional (3D) imaging performance of MIMO radar for moving targets,an efficient method was proposed.In each dimension,the distribution information of targets was searched respectively and a new low-dimensional measurement matrix was reconstructed accordingly,so the targets’ area was narrowed down.At the same time,in order to optimize the mutual coherence property of measurement matrix,Bayesian method was used to optimize the velocity-dimensional projection matrix to reduce the strong mutual coherence brought by sampling of Doppler frequency,then the efficient sparse imaging could be achieved.The simulation results show that proposed method can improve the efficiency,accurate imaging performance with efficient.     

一种基于特征值分解的测量矩阵优化方法

测量矩阵是压缩感知中一个很重要的部分,为了减小测量矩阵与稀疏变换矩阵的互相干性,从而改善重建质量,本文首先通过测量矩阵和稀疏变换矩阵的乘积构造得到一个Gram矩阵,然后定义了一种基于Gram矩阵非对角线元素的整体互相干系数,推导出整体互相干系数与Gram矩阵特征值之间的关系。在此基础上,我们提出了一个最优化模型,在不改变Gram矩阵特征值和的前提下,让每个大于零的特征值的大小都为它们和的平均值,使得测量矩阵和稀疏变换矩阵的整体互相干系数达到最小,从而优化了测量矩阵的性能。将该方法用在一些已知的测量矩阵上,实验结果中矩阵的优化速度快,并且用优化矩阵所得的图像的PSNR有所提高,表明本文优化测量矩阵的方法在重建效果和优化速度方面都有一定的优势。      

Signal Reconstruction From Noisy Random Projections

Recent results show that a relatively small number of random projections of a signal can contain most of its salient information. It follows that if a signal is compressible in some orthonormal basis, then a very accurate reconstruction can be obtained from random projections. This "compressive sampling" approach is extended here to show that signals can be accurately recovered from random projections contaminated with noise. A practical iterative algorithm for signal reconstruction is proposed, and potential applications to coding, analog-digital (A/D) conversion, and remote wireless sensing are discussed     

Compressive Sensing Measurement Matrix Generator Based on Improved SC-Array LDPC Code

We construct and implement a compressive sensing measurement matrix based on improved size-compatible (ISC)-array low-density parity-check (LDPC) code. First, we propose an improved measurement matrix from the array LDPC code matrix. The proposed measurement matrix retains suitable quasi-cyclic structures and supports arbitrary code lengths. It also achieves a high perfect recovery percentage compared with a Gaussian random matrix of the same size. Second, we propose a hardware scheme using cycle shift registers to design the compressive sensing measurement matrix generator. This provides simple circuit architecture during the generation of the measurement matrix. According to simulation verifications, the measurement matrix construction method is effective and entails fewer shift registers and a lower area overhead by using a simplified hardware implementation scheme. The compressive sensing measurement matrix generator can generate all of the required elements in the ISC-array LDPC code matrix with an acceptable hardware overhead. Therefore, it can be widely applied to large-scale sparse signal compressive sensing.     

A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing

In this paper the problem of optimization of the measurement matrix in compressive (also called compressed) sensing framework is addressed. In compressed sensing a measurement matrix that has a small coherence with the sparsifying dictionary (or basis) is of interest. Random measurement matrices have been used so far since they present small coherence with almost any sparsifying dictionary. However, it has been recently shown that optimizing the measurement matrix toward decreasing the coherence is possible and can improve the performance. Based on this conclusion, we propose here an alternating minimization approach for this purpose which is a variant of Grassmannian frame design modified by a gradient-based technique. The objective is to optimize an initially random measurement matrix to a matrix which presents a smaller coherence than the initial one. We established several experiments to measure the performance of the proposed method and compare it with those of the existing approaches. The results are encouraging and indicate improved reconstruction quality, when utilizing the proposed method.     

基于压缩感知的红外与可见光图像融合算法

压缩感知是一种新的信号采样理论,突破了传统的Nyquist采样率须为信号最高频率的2倍以上的定理。对于稀疏信号,它能够以远低于Nyquist采样速率对信号进行采样,并通过重构算法恢复出原信号。提出了一种基于压缩感知的红外与可见光图像融合算法,对图像进行测量,并通过融合算法对测量值进行融合。仿真实验显示,压缩感知能较好地实现图像的融合。     

基于改进粒子群算法的压缩感知

在稀疏信号处理中,压缩感知能够用较低的采样频率对稀疏信号进行压缩采样,而信号重建的问题则可归结为一个最优化问题,并可采用粒子群算法进行求解。针对压缩感知问题,本文对传统的粒子群算法进行了深入的分析和改进,得到了粒子数目的下界,并提出了三维环形邻域结构和多群协作机制,依此建立了有效的感知压缩重建方法,且将其应用于二维稀疏信号的重建。最后,本文通过在模拟和真实数据上实验结果验证了这种新型感知压缩方法的有效性和优越性。      

低幂平均列相关性测量矩阵构造算法

压缩感知是一种新的信号描述、采样和重构理论,其核心问题包括测量矩阵的选择和构造以及重构算法设计.本文首先提出感知矩阵幂平均列相关性定义,进而得出测量矩阵的择优原则;然后依据等角紧框架理论和特征向量近似法,提出新的测量矩阵构造算法,减小感知矩阵的幂平均列相关性.实验结果表明,本文算法达到了降低感知矩阵列相关性的目的.另外,当重构算法相同时,采用本文算法得到的测量矩阵比采用Gaussian、Elad、Xu和Vahid算法得到测量矩阵的重构错误率要低.     

基于分圆类构造卷积压缩感知测量矩阵

卷积压缩感知是近年来兴起的新型压缩感知技术。卷积压缩感知选用循环矩阵作为测量矩阵,其采样可以简化为卷积的过程,因此大大降低算法复杂度。该文基于分圆类构造适用于卷积压缩感知的测量矩阵,测量值通过利用确定性序列循环卷积信号,然后进行随机2次采样获得。该文构造的测量矩阵的相关性小于已有文献构造的测量矩阵的相关性。模拟仿真结果表明,该文构造的测量矩阵与同等条件下的随机高斯矩阵相比,可以更好地恢复稀疏信号;所构造的矩阵还可以应用于信道估计以及2维图像的重构。     

The high resolution MIMO radar system based on minimizing the statistical coherence of compressed sensing matrix

Compressed Sensing (CS) theory is a great breakthrough of the traditional Nyquist sampling theory. It can accomplish compressive sampling and signal recovery based on the sparsity of interested signal, the randomness of measurement matrix and nonlinear optimization method of signal recovery. Firstly, the CS principle is reviewed. Then the ambiguity function of Multiple-Input Multiple- Output (MIMO) radar is deduced. After that, combined with CS theory, the ambiguity function of MIMO radar is analyzed and simulated in detail. At last, the resolutions of coherent and non-coherent MIMO radars on the CS theory are discussed. Simulation results show that the coherent MIMO radar has better resolution performance than the non-coherent. But the coherent ambiguity function has higher side lobes, which caused a deterioration in radar target detection performances. The stochastic embattling method of sparse array based on minimizing the statistical coherence of sensing matrix is proposed. And simulation results show that it could effectively suppress side lobes of the ambiguity function and improve the capability of weak target detection.     

基于优化贝叶斯压缩感知算法的频谱检测

近年来,压缩感知理论依旧是信号处理领域的研究热点之一。将压缩感知应用于频谱检测技术可以突破传统的奈奎斯特采样定理,降低检测时采样率,因此可以减轻硬件处理的压力。因此适合用在频谱检测技术中,特别是宽带信号的频谱检测。本文对贝叶斯压缩感知理论（BCS,Bayesian Compressed Sensing）进行研究,并将其引入频谱检测技术中。在BCS算法的基础上,通过进一步减小高斯随机观测矩阵列向量的相关度,实现对观测矩阵的优化,得到一种优化的贝叶斯压缩感知算法（称其为OBCS算法,即Optimized BCS）。在MATLAB仿真中,本文提出将数零法作为频谱检测判决规则,并使用BCS和OMP算法作为对照,验证了OBCS算法无论在重构误差、检测概率还是虚警概率等指标上都具有最佳的效果。      

Generalized compressive detection of stochastic signals using Neyman–Pearson theorem

Compressive sensing (CS) enables reconstructing a sparse signal from fewer samples than those required by the classic Nyquist sampling theorem. In general, CS signal recovery algorithms have high computational complexity. However, several signal processing problems such as signal detection and classification can be tackled directly in the compressive measurement domain. This makes recovering the original signal from its compressive measurements not necessary in these applications. We consider in this paper detecting stochastic signals with known probability density function from their compressive measurements. We refer to it as the compressive detection problem to highlight that the detection task can be achieved via directly exploring the compressive measurements. The Neyman–Pearson (NP) theorem is applied to derive the NP detectors for Gaussian and non-Gaussian signals. Our work is more general over many existing literature in the sense that we do not require the orthonormality of the measurement matrix, and the compressive detection problem for stochastic signals is generalized from the case of Gaussian signals to the case of non-Gaussian signals. Theoretical performance results of the proposed NP detectors in terms of their detection probability and the false alarm rate averaged over the random measurement matrix are established. They are verified via extensive computer simulations.     

Hybrid wavelet measurement matrices for improving compressive imaging

Compressive sensing principle claims that a compressible signal can be recovered from a small number of random linear measurements. However, the design of efficient measurement basis in compressive imaging remains as a challenging problem. In this paper, a new set of hybrid wavelet measurement matrices is proposed to improve the quality of the compressive imaging, increase the compression ratio and reduce the processing time. The performance of these hybrid wavelet matrices for image modeling and reconstruction is evaluated and compared with other traditional measurement matrices such as the random measurement matrices, Walsh and DCT matrices. The compressive imaging approach chosen in this study is the block compressive sensing with smoothed projected Landweber reconstruction technique. The simulation results indicate that the imaging performance of the proposed hybrid wavelet measurement matrices is approximately 2–3 dB better than that obtained using Gaussian matrix especially at higher compression ratios.     

光子辅助压缩感知技术关键问题研究

为了保证光子辅助压缩感知系统在获取宽带信号的过程中,测量矩阵保持零均值,采用基于马赫-曾德尔调制器的并行结构,以实现待处理信号与零均值随机序列的混频;同时采用数字域后补偿的方式,改善了强度调制器非线性对系统恢复效果的负面影响,在一定范围内提升了系统的恢复效果。结果表明,改进后的光子辅助压缩感知结构在获取宽带射频稀疏信号时,具有更好的恢复效果。     

Measurement matrix design for CS-MIMO radar using multi-objective optimization

In this paper, we design a measurement matrix for a compressive sensing-multiple-input multiple-output radar in the presence of clutter and interference. To optimize the measurement matrix, three main criteria are considered simultaneously to improve detection and sparse recovery performance while suppressing clutter and interference. To this end, we consider three well-known criteria including Bhattacharyya distance, mutual coherency of sensing matrix, and signal-to-clutter-plus-interference ratio. Due to the use of simultaneous multi-objective functions, a multi-objective optimization (MOO) framework is exploited. Some numerical examples are provided to illustrate the achieved improvement of our proposed method in target detection and sparse recovery performance. Simulation results show that the proposed MOO technique for measurement matrix design can achieve superior performance in target detection compared with Gaussian random measurement matrix technique.