基于混沌序列和RIPless理论的循环压缩测量矩阵的构造

压缩测量矩阵的构造是压缩感知的核心工作之一.循环矩阵由于其对应离散卷积且具有快速算法被广泛应用于压缩测量矩阵.本文力图将混沌的优点和循环矩阵的优点相结合,提出基于混沌序列的循环压缩测量矩阵.混沌循环测量矩阵元素的产生仅需要利用混沌的内在确定性,即利用混沌映射公式、初始值以及一定的采样间隔就可以产生独立同分布的随机序列;同时混沌序列的外在随机性可以满足压缩测量矩阵对随机性的要求.本文给出了使用Cat混沌映射时混沌循环测量矩阵的构造方法,以及该矩阵RIPless特性的检验.研究了采用构造的混沌循环测量矩阵对一维和二维信号进行压缩测量的效果,并与采用传统的循环测量矩阵的效果进行了比较.结果表明,混沌循环测量矩阵对于一维和二维信号都具有很好的恢复效果,且对二维信号的恢复性能要优于已有的循环矩阵.从相图角度分析了混沌循环测量矩阵优于已有的循环矩阵的机理,指出混沌的内在确定性和外在随机性的有机结合是所构造的混沌循环测量矩阵性能优于传统的循环矩阵的本质性原因.     

二进制信号的混沌压缩测量与重构

二进制信号的压缩感知问题对应超奈奎斯特信号系统中未编码的二进制符号的检测问题, 具有重要的研究意义. 已有的二进制信号压缩测量采用高斯随机矩阵, 信号重构采用经典的l₁最小化方法. 本文利用混沌映射构造基于Cat序列的循环测量矩阵, 并提出一种针对二进制信号的全新的重构算法——平滑函数逼近法. 文章构造的混沌循环测量矩阵兼具确定性和随机性的优点, 能够抵御低信令效率和低信噪比的影响, 取得更好的压缩测量效果. 文章提出的平滑函数逼近法利用非凸函数代替原问题不连续的目标函数, 将组合优化问题转化为具有等式约束的优化问题进行求解. 利用稀疏贝叶斯学习算法进一步修正误差, 得到更准确的重构信号. 在信道含有加性高斯白噪声的条件下对二进制信号进行了压缩测量与重构的数值仿真, 仿真结果表明:基于Cat 序列的循环测量矩阵的压缩测量效果明显优于传统的高斯随机矩阵; 平滑函数逼近法对二进制信号的重构性能明显优于经典的l₁最小化方法.     

托普利兹-循环块相位掩膜矩阵压缩成像

在托普利兹和循环矩阵的基础上,提出一种新的托普利兹-循环块相位掩膜矩阵可压缩双透镜成像方法,模拟实验结果表明:新的相位掩膜矩阵压缩成像可以在显著减少测量的同时,有效地捕获图像信息来重建原始图像;新相位掩膜矩阵的研究为确定性测量在压缩成像领域的应用提供了更多的支撑,在拥有原托普利兹和循环确定性测量优点的同时,还拥有自身的...     

托普利兹-循环块相位掩膜矩阵压缩成像

在托普利兹和循环矩阵的基础上,提出一种新的托普利兹-循环块相位掩膜矩阵可压缩双透镜成像方法.模拟实验结果表明:新的相位掩膜矩阵压缩成像可以在显著减少测量的同时,有效地捕获图像信息来重建原始图像|新相位掩膜矩阵的研究为确定性测量在压缩成像领域的应用提供了更多的支撑,在拥有原托普利兹和循环确定性测量优点的同时,还拥有自身的块结构特点,可以进一步减少物理实现成本,为新的照相机的设计提供若干理论、计算和技术支撑.     

确定性矩阵可分离压缩成像

针对可分离压缩传感使用的可分离随机正交矩阵在处理大尺度图像等高维信号感知时难度太大或成本过高的问题,引入确定性测量矩阵,提出确定性矩阵可分离压缩传感,可将如托普利兹矩阵及循环矩阵等具有确定性结构的矩阵作为可分离压缩传感的左、右可分离矩阵.该方案可以降低独立元素的数目,从而显著降低前端物理实现的难度与成本.数值模拟实验分别评估了该方法在不同采样率及不同图像尺寸下的压缩重建性能,结果表明该方法在独立元素非常少的情形下得到与原随机正交矩阵相近的重建质量,证明了其可行性.     

交替寻优生成元素幅值结合混沌随机相位构造循环测量矩阵

循环矩阵由于其对应离散卷积且具有快速算法被广泛应用于压缩测量矩阵. 本文从循环测量矩阵生成元素的幅值和相位两个方面探索循环测量矩阵的优化构造, 提出交替寻优生成元素的幅值并结合混沌随机相位实现循环测量矩阵的最优构造. 由一维和二维信号循环测量矩阵的不同表示形式出发, 将等价字典列向量之间互相干系数的Welch界作为逼近目标, 推导出了一维和二维信号循环测量矩阵生成元素幅值优化的统一数学模型, 提出采用交替寻优方法求解生成元素幅值的最优解. 利用混沌序列构造循环测量矩阵生成元素的随机相位. 与已有的典型循环测量矩阵相比, 本文优化构造的循环测量矩阵所对应的等价字典列向量之间具有更低的互相干性, 这正是所构造的循环测量矩阵优越性的本质所在.     

循环-托普利兹块相位掩模可压缩双透镜成像

压缩成像是压缩传感理论的重要应用领域之一,可以用比Nyquist测量数目少的测量值捕获充分信息重建稀疏或可压缩图像.在研究现有的压缩成像方法的基础上,给出一种新的循环-托普利兹块相位掩模矩阵可压缩双透镜成像方法.模拟实验结果表明新的相位掩模矩阵成像方法可以在欠采样的情况下有效地获得图像信息来重建原始图像.新方法的研究为...     

一种基于选择性测量的自适应压缩感知方法

针对低信噪比条件下现有压缩感知系统重构性能严重恶化的问题,提出了一种基于选择性测量的自适应压缩感知结构.首先推导并分析了经过压缩测量的噪声的统计特性及其对重构性能的影响;然后基于输出能量最小化准则,设计了一种压缩域投影滤波联合噪声检测的自适应感知器,感知获得噪声子空间的位置信息;进一步利用该信息构造选择性压缩测量矩阵,智能选择测量信号,同时"屏蔽"噪声分量,极大提高了压缩测量值的信噪比.仿真结果表明,相对于现有压缩感知结构,选择性测量的压缩感知结构明显改善了含噪稀疏信号的重构性能,可更好地应用于吸波材料的前端特性分析、认知无线电的频谱感知等领域.     

基于渐进添边的准循环压缩感知时延估计算法

针对时延估计问题中压缩感知类算法现有测量矩阵需要大量数据存储量的问题,提出了一种基于渐进添边的准循环压缩感知时延估计算法,实现了稀疏测量矩阵条件下接收信号时延的准确估计.该算法首先建立压缩感知与最大似然译码之间的理论桥梁,然后推导基于低密度奇偶校验码的测量矩阵的设计准则,引入渐进添边的思想构造具有准循环结构的稀疏测量矩阵,最后利用正交匹配追踪算法正确估计出时延.对本文算法的计算复杂度与测量矩阵的数据存储量进行理论分析.仿真结果表明,所提算法在测量矩阵维数相同的条件下正确重构概率高于高斯随机矩阵和随机奇偶校验测量矩阵,相比于随机奇偶校验矩阵,在数据存储量相等的条件下,以较少的计算复杂度代价得到了重构概率的较大提高.     

面向低信噪比的自适应压缩感知方法

在压缩感知工程应用中, 信号往往被噪声和干扰所影响, 常规的压缩感知方法难以达到理想的重构效果, 特别是低信噪比应用场景中, 稀疏重构往往会失效. 分析了压缩感知中噪声对重构性能的影响, 从理论上解释了压缩感知中的噪声折叠原理, 并在此基础上提出了一种基于方向性测量的自适应压缩感知方案. 该方案通过后端信号处理系统估计出噪声的相关信息并反馈至压缩感知前端, 前端根据反馈的噪声信息调整测量矩阵, 从而改变感知矩阵的方向, 自适应地感知稀疏谱, 从而有效地抑制信号噪声. 仿真实验表明, 所提的自适应压缩感知方法对稀疏信号重构性能有较大的提升.     

Image Encryption Scheme with Compressed Sensing Based on a New Six-Dimensional Non-Degenerate Discrete Hyperchaotic System and Plaintext-Related Scrambling

Digital images can be large in size and contain sensitive information that needs protection. Compression using compressed sensing performs well, but the measurement matrix directly affects the signal compression and reconstruction performance. The good cryptographic characteristics of chaotic systems mean that using one to construct the measurement matrix has obvious advantages. However, existing low-dimensional chaotic systems have low complexity and generate sequences with poor randomness. Hence, a new six-dimensional non-degenerate discrete hyperchaotic system with six positive Lyapunov exponents is proposed in this paper. Using this chaotic system to design the measurement matrix can improve the performance of image compression and reconstruction. Because image encryption using compressed sensing cannot resist known- and chosen-plaintext attacks, the chaotic system proposed in this paper is introduced into the compressed sensing encryption framework. A scrambling algorithm and two-way diffusion algorithm for the plaintext are used to encrypt the measured value matrix. The security of the encryption system is further improved by generating the SHA-256 value of the original image to calculate the initial conditions of the chaotic map. A simulation and performance analysis shows that the proposed image compression-encryption scheme has high compression and reconstruction performance and the ability to resist known- and chosen-plaintext attacks.     

基于改进的分块压缩感知红外图像重建

针对基于压缩感知理论的红外图像重建问题,提出一种基于改进的分块压缩感知红外图像重建方法。该方法首先对原始红外图像进行分块,并对每个子块用相同的观测矩阵进行随机观测,获得少量的观测数据;然后利用谱图小波变换优异的稀疏特性,将其引入平滑投影Landweber算法进行迭代优化重建,同时采用混合中值滤波进行处理以增加图像的平滑度和减少块伪影,最后输出满足要求的高质量红外图像。实验结果表明,在相同采样率下,该方法对于不同类型红外图像的重建性能均优于目前广为采用的一些小波压缩感知方法,可获得更高质量的红外图像。     

基于压缩感知的反射光谱重构算法研究

光谱反射率描述物体的表面颜色特征,为了能够获取物体自身更加精确的颜色信息,在图像处理领域光谱反射率重构成为了关注的话题。反射光谱重构算法是对实验物体表面在可见光范围内每一波长处的光谱反射率进行重构,以达到提高物体自身颜色准确复制的精度,最后建立相应的反射光谱。尝试将压缩感知(CS)理论应用到光谱实验中,对光谱反射率进行重构。首先是介绍了压缩感知理论知识,然后把压缩感知理论与光谱反射率原理相结合,根据基于压缩感知的光谱反射率重构的理论框架,选取合适的采样值,压缩感知的采样值即压缩值,小波基作为正交矩阵,高斯随机矩阵作为测量矩阵,正交矩阵与测量矩阵需要保证具有不相关性,将原始光谱反射率从高维到低维进行线性投影,得到低维的观测信号,运行简单的正交匹配追踪算法(OMP)对低维的观测信号进行由低维到高维的高精度重构,重构得到的光谱反射率与原始光谱反射率具有相同的维度,最后将压缩感知重构算法与传统的光谱反射率重构算法伪逆法与多项式回归法进行比较。经过压缩感知重构算法得到的色差值与均方根误差值都小于伪逆法和多项式回归法重构的结果,经压缩感知的重构精度明显提高;经压缩感知重构的光谱曲线可以达到或者更接近原始光谱曲线的峰值,整体效果更接近原始光谱曲线;经多项式回归法和伪逆法重构的光谱曲线达不到原始峰值,整体上存在偏差。可以认为压缩感知用低采样的数据达到了全采样的效果,提高了光谱反射率重构的精度。基于压缩感知的光谱反射率重构算法效果明显优于传统的多项式回归法和伪逆法,可以将压缩感知理论应用到实际的多光谱成像系统中。     

随机间距稀疏三元Toeplitz矩阵相位掩模压缩成像

压缩成像是一种基于压缩传感(CS)理论的新成像方法,其优点是可以用比传统的Nyquist采样定理所需测量数目少得多的测量值重建原稀疏或可压缩图像。在研究Bernoulli和Toeplitz测量矩阵的基础上,提出一种新的随机间距稀疏三元Toeplitz相位掩模矩阵。实验结果表明,在可压缩双透镜成像系统中,与Bernoulli和Bernoulli-Toeplitz相位掩模矩阵相比,新相位掩模矩阵的成像信噪比与之相当。但是随机独立变元个数和非零元个数显著减少,在数据存储与传输时更具优势,物理上更易实现,甚至重建时间是只有它们的21%～66%。     

Secure collaborative cognitive radio based on chaotic modulation and compressive sensing

Cognitive radio (CR) is a wireless technology that is used to overcome the spectrum scarcity problem. CR includes several stages, spectrum sensing is the first stage in the CR cycle. Traditional spectrum sensing (SS) techniques have many challenges in the wideband spectrum. CR security is an important problem, since when an attacker from outside the network access the sensing information this produces an increase in sensing time and reduces the opportunities for exploiting vacant band. Compressive sensing (CS) is proposed to capture all the wideband spectrum at the same time to solve the challenges and improve the performance in the traditional techniques and then one of the traditional SS techniques are applied to the reconstructed signal for detection purpose. The sensing matrix is the core of CS must be designed in a way that produces a low reconstruction error with high compression. There are many types of sensing matrices, the chaotic matrix is the best type in terms of security, memory storage, and system performance. Few works in the literature use the chaotic matrix in CS based CR and these works have many challenges: they used sample distance in the chaotic map to generate a chaotic sequence which consumes high resources, they did not take into consideration the security in reporting channel, and they did not measure their works using real primary user (PU) signal of a practical application under fading channel and low SNR values. In this paper, we propose a chaotic CS based collaborative scenario to solve all challenges that have been presented. We proposed a chaotic matrix based on the Henon map and use the differential chaotic shift keying (DCSK) modulation to transmit the measurement vector through the reporting channel to increase the security and improve the performance under fading channel. The simulation results are tested based on a recorded real-TV signal as PU and Compressive Sampling Matching Pursuit (CoSaMP) recovery algorithm under AWGN and TDL-C fading channels in collaborative and non-collaborative scenarios. The performance of the proposed system has been measured using recovery error, mean square error (MSE), derived probability of detection (Pdrec), and sensitivity to initial values. To measure the improvement introduced by the proposed system, it is evaluated in comparison with selected chaotic and random matrices. The results show that the proposed system provides low recovery error, MSE, with high Pdrec, security, and compression under SNR equal to −30 dB in AWGN and TDL-C fading channels as compared to other matrices in the literature.     

An image encryption scheme based on three-dimensional Brownian motion and chaotic system

At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional(3D) bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion(BCB3DBM)is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system(LTS). Furthermore, block confusion based on position sequence group(BCBPSG) is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed.     

Learning-based compressed sensing for infrared image super resolution

This paper presents an infrared image super-resolution method based on compressed sensing (CS). First, the reconstruction model under the CS framework is established and a Toeplitz matrix is selected as the sensing matrix. Compared with traditional learning-based methods, the proposed method uses a set of sub-dictionaries instead of two coupled dictionaries to recover high resolution (HR) images. And Toeplitz sensing matrix allows the proposed method time-efficient. Second, all training samples are divided into several feature spaces by using the proposed adaptive k-means classification method, which is more accurate than the standard k-means method. On the basis of this approach, a complex nonlinear mapping from the HR space to low resolution (LR) space can be converted into several compact linear mappings. Finally, the relationships between HR and LR image patches can be obtained by multi-sub-dictionaries and HR infrared images are reconstructed by the input LR images and multi-sub-dictionaries. The experimental results show that the proposed method is quantitatively and qualitatively more effective than other state-of-the-art methods.