半张量积压缩感知模型的l0-范数解

目的 半张量积压缩感知模型是一种可以有效降低压缩感知过程中随机观测矩阵所占存储空间的新方法,利用该模型可以成倍降低观测矩阵所需的存储空间。为寻求基于该模型新的重构方法,同时提升降维后观测矩阵的重构性能,提出一种采用光滑高斯函数拟合l₀-范数方法进行重构。方法 构建降维随机观测矩阵,对原始信号进行采样;构建可微且期望值为零的光滑高斯函数来拟合不连续的l₀-范数,采用最速下降法进行重构,最终得到稀疏信号的估计值。结果 实验分别采用1维稀疏信号和2维图像信号进行测试,并从重构概率、收敛速度、重构信号的峰值信噪比等角度进行了测试和比较。验证结果表明,本文所述算法的重构概率、收敛速度较该模型的l_q-范数（0 <q <1）方法有一定的提升,且当观测矩阵大小降低为通常的1/64,甚至1/256时,仍能保持较高的重构性能。结论 本文所述的重构算法,能在更大程度上降低观测矩阵的大小,同时基本保持重构的精度。     

Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain

Compressed sensing(CS)is a new technique of utilizing a priori knowledge on sparsity of data in a certain domain for minimizing necessary number of measurements.Based on this idea,this paper proposes a novel synthetic aperture radar(SAR)imaging approach by exploiting sparseness of echo data in the fractional Fourier domain.The effectiveness and robustness of the approach are assessed by some numerical experiments under various noisy conditions and different measurement matrices.Experimental results have shown that,the obtained images by using the CS technique depend on measurement matrix and have higher output signal to noise ratio than traditional pulse compression technique.Finally simulated and real data are also processed and the achieved results show that the proposed approach is capable of reconstructing the image of targets and effectively suppressing noise.     

A fast watermarking algorithm with enhanced security using compressive sensing and principle components and its performance analysis against a set of standard attacks

An algorithm for watermarking of digital images is proposed in this paper which utilizes Compressive Sensing (CS) with Principle Components (PCs) to achieve robustness, speed and security. CS is applied on PCs of watermark image to get the CS measurements. The singular values of these CS measurements are embedded with a scale factor into the HL subband of the cover image. The generated watermarked image contains three-layer security: one from PCs and other two from CS measurements. To recover PCs from CS measurements, a convex optimization tool, namely, the Orthogonal Matching Pursuit (OMP) is employed. Experiments are performed on both types of cover images; one with more low frequency components and another with more high frequency components. The algorithm offers state-of-the art values of robustness and security in presence of different checkmark attacks like geometrical, non-geometrical and JPEG compression. A comparison of robustness of proposed algorithm with existing algorithms reveals that the proposed algorithm outperforms for most of the noise attacks. The performance of proposed algorithm with different wavelet families (e.g., orthogonal, biorthogonal, symmetric and asymmetric) are compared in terms of robustness and execution time. Such comparison may be helpful in selecting a suitable wavelet for a class of cover images in presence of checkmark attacks. The Haar wavelet performs better for geometric noise attack whereas Bior6.8 and Sym8 for non-geometric and JPEG compression type of noise attacks. The execution time of proposed algorithm with Haar wavelet is found to be minimum for all checkmark attacks. Moreover, it is quite less as compared to Optimization based methods and close to the other watermarking technique used for H.264 video standard.     

基于稀疏带状矩阵的二维图像重建

压缩传感（Compressed Sensing,CS）是数据采样同时实现压缩的新理论、新技术。针对大图像重构时采用的测量矩阵维数高,所需存储空间过大的问题,引入稀疏带状概念,提出了稀疏带状测量矩阵,可减少测量矩阵独立随机元,根据图像按列逐步处理的方式,测量矩阵维数大大降低。实验结果表明基于稀疏带状测量矩阵的逐列图像重构算法在保证重建质量的情况下,计算速度也大大提升。     

Meaningful image encryption algorithm based on compressive sensing and integer wavelet transform

A new meaningful image encryption algorithm based on compressive sensing (CS) and integer wavelet transformation (IWT) is proposed in this study. First of all, the initial values of chaotic system are encrypted by RSA algorithm, and then they are open as public keys. To make the chaotic sequence more random, a mathematical model is constructed to improve the random performance. Then, the plain image is compressed and encrypted to obtain the secret image. Secondly, the secret image is inserted with numbers zero to extend its size same to the plain image. After applying IWT to the carrier image and discrete wavelet transformation (DWT) to the inserted image, the secret image is embedded into the carrier image. Finally, a meaningful carrier image embedded with secret plain image can be obtained by inverse IWT. Here, the measurement matrix is built by both chaotic system and Hadamard matrix, which not only retains the characteristics of Hadamard matrix, but also has the property of control and synchronization of chaotic system. Especially, information entropy of the plain image is employed to produce the initial conditions of chaotic system. As a result, the proposed algorithm can resist known-plaintext attack (KPA) and chosen-plaintext attack (CPA). By the help of asymmetric cipher algorithm RSA, no extra transmission is needed in the communication. Experimental simulations show that the normalized correlation (NC) values between the host image and the cipher image are high. That is to say, the proposed encryption algorithm is imperceptible and has good hiding effect.     

低存储化压缩感知

目的 非相关观测是压缩感知(CS)理论中的关键因素。高斯随机矩阵作为一种普适的CS非相关观测矩阵,在压缩感知中得到广泛的研究与应用。但在实际应用中,却存在实际内存占用较多,不适应大规模应用的问题。为寻求降低随机观测矩阵所需的存储空间,提出一种基于半张量积的压缩感知方法,利用该方法可以成倍地降低观测矩阵所需的存储空间。方法 该方法利用半张量积理论,构建降维随机观测矩阵,实现对原始信号的随机观测,并采用l^q(0< q< 1)范数的迭代重加权最小二乘法进行重构,从而得到稀疏信号的估计值。结果 仿真实验分别采用1维稀疏信号和2维图像信号进行了测试,并从重构概率、迭代收敛速度、重构信号的峰值信噪比等角度进行了测试和比较。通过不同大小的随机观测矩阵比较验证表明,采用降维后观测矩阵进行采样和重构,其重构信号质量并没有明显下降,但其观测矩阵所需的存储空间却可大大降低,如降低为通常的1/4,1/16,甚至更低。结论 本文压缩感知方法,可以大大降低观测矩阵所需的存储空间,同时有效降低数据运算复杂度以及内存占用率,有助于压缩感知的应用。     

一种新的无损小波图像压缩算法

基于Daubechies 5-3旋转小波，本文提出了一种无损图像压缩新算法，这一工作证实了小波压缩的如下问题，小波压缩具有与JPEG那样快的运行速度，在不改变变换系数的条件下，采用序贯处理方法能急剧地减小存储器的需要量，能用小波实现图像的无损压缩，对比实验表明，这种快速，有效的无损图像压缩技术比标准的JBIG和无损的JPEG性能要优越。     

Compressive rendering: a rendering application of compressed sensing

Recently, there has been growing interest in compressed sensing (CS), the new theory that shows how a small set of linear measurements can be used to reconstruct a signal if it is sparse in a transform domain. Although CS has been applied to many problems in other fields, in computer graphics, it has only been used so far to accelerate the acquisition of light transport. In this paper, we propose a novel application of compressed sensing by using it to accelerate ray-traced rendering in a manner that exploits the sparsity of the final image in the wavelet basis. To do this, we raytrace only a subset of the pixel samples in the spatial domain and use a simple, greedy CS-based algorithm to estimate the wavelet transform of the image during rendering. Since the energy of the image is concentrated more compactly in the wavelet domain, less samples are required for a result of given quality than with conventional spatial-domain rendering. By taking the inverse wavelet transform of the result, we compute an accurate reconstruction of the desired final image. Our results show that our framework can achieve high-quality images with approximately 75 percent of the pixel samples using a nonadaptive sampling scheme. In addition, we also perform better than other algorithms that might be used to fill in the missing pixel data, such as interpolation or inpainting. Furthermore, since the algorithm works in image space, it is completely independent of scene complexity.     

Infrared and visible image fusion using fuzzy logic and population-based optimization

This paper presents a new wavelet-based algorithm for the fusion of spatially registered infrared and visible images. Wavelet-based image fusion is the most common fusion method, which fuses the information from the source images in the wavelet transform domain according to some fusion rules. We specifically propose new fusion rules for fusion of low and high frequency wavelet coefficients of the source images in the second step of the wavelet-based image fusion algorithm. First, the source images are decomposed using dual-tree discrete wavelet transform (DT-DWT). Then, a fuzzy-based approach is used to fuse high frequency wavelet coefficients of the IR and visible images. Particularly, fuzzy logic is used to integrate the outputs of three different fusion rules (weighted averaging, selection using pixel-based decision map (PDM), and selection using region-based decision map (RDM)), based on a dissimilarity measure of the source images. The objective is to utilize the advantages of previous pixel- and region-based methods in a single scheme. The PDM is obtained based on local activity measurement in the DT-DWT domain of the source images. A new segmentation-based algorithm is also proposed to generate the RDM using the PDM. In addition, a new optimization-based approach using population-based optimization is proposed for the low frequency fusion rule instead of simple averaging. After fusing low and high frequency wavelet coefficients of the source images, the final fused image is obtained using the inverse DT-DWT. This new method provides improved subjective and objectives results as compared to previous image fusion methods.     

基于小波矩的抗几何攻击数字图像水印算法研究

针对旋转、缩放和平移等几何攻击破坏水印检测同步,从而导致水印检测失败等问题,利用归一化图像的缩放、平移不变性及小波矩的旋转不变特性,结合奇偶量化技术,提出了一种有效抵抗几何攻击的数字图像水印新算法。首先利用图像归一化技术将原始载体映射到几何不变空间内;然后计算归一化图像的小波矩,并选取部分稳定的低阶小波矩用于水印嵌入;最后利用奇偶量化方法将水印信息嵌入到所选小波矩的不变量内。仿真实验结果表明,该图像水印方案不仅具有良好的透明性,而且具有较强的抵抗常规信号处理、几何攻击、联合攻击等能力。     

过完备字典稀疏表示下的RAMP重构算法

压缩感知理论将采样理论与压缩理论合二为一,成为最近几年来的研究热点。主要依据图像的稀疏性或是可压缩性的特点,使用K-均值奇异值分解（K-Means Singular Value Decomposition,K-SVD）算法训练获得过完备字典,使用高斯随机矩阵作为测量矩阵,最后通过正则化自适应匹配追踪算法作为压缩感知重构算法,提出了K-SVD过完备字典的正则化自适应匹配追踪算法（KSVD Regularized Adaptive Matching Pursuit,KSVD-RAMP）。通过对重构图像的峰值信噪比、重构时间、相对误差等客观评价指标以及主观视觉上对所提算法以及传统的贪婪算法做对比。实验结果表明,该算法比基于离散小波稀疏表示的RAMP算法的峰值信噪比提升了2~6 dB。因此,该算法重构出的图像不管在视觉效果上,还是在客观评价指标上都有一定的改善。     

Fast Adaptive Wavelet for Remote Sensing Image Compression

Remote sensing images are hard to achieve high compression ratio because of their rich texture. By analyzing the influence of wavelet properties on image compression, this paper proposes wavelet construction rules and builds a new biorthogonal wavelet construction model with parameters. The model parameters are optimized by using genetic algorithm and adopting energy compaction as the optimization object function. In addition, in order to resolve the computation complexity problem of online construction, according to the image classification rule proposed in this paper we construct wavelets for different classes of images and implement the fast adaptive wavelet selection algorithm （FAWS）. Experimental results show wavelet bases of FAWS gain better compression performance than Daubechies9/7.     

Image Compression And Watermarking By Wavelet Localization

This paper has presented two image processing applications, compression and watermarking, by exploiting the localization property of wavelet transform. The first application proposes a simple region-based and scalable image compression algorithm. We locate the wavelet coefficients in the region of interest in each subband, and these groups of wavelet coefficients are used to adjust the resolution of the interested region. A watermarking method is described in the second application of this paper. The scheme examines the variations of the local Hölder regularity of the image and calculates the similarity of the correct watermark before and after modifications. Experimental results show that the proposed approach is quite effective in authenticating the origin of an image.     

基于结构化稀疏模型的压缩感知重构改进算法

目前,标准的CS重构算法仅利用信号和图像在小波变换下的稀疏先验信息,而并没有利用变换系数具有的结构化特性。为了能够快速精确地重建原始信号,将结构化稀疏模型与SP算法、CoSaMP算法相结合,提出了压缩感知重构的改进算法。另外,将基于双树复小波变换的系数结构模型融入上述算法,进一步提高重构性能。实验结果表明,所提出的算法可获得更高的图像重建质量。     

基于准循环低密度奇偶校验码的压缩感知测量矩阵

针对随机测量矩阵元素随机产生、不易于硬件实现的缺点,利用有限域上准循环低密度奇偶校验(QC-LDPC)码奇偶校验矩阵的构造方法,设计了一种确定性的结构化稀疏测量矩阵。由于QC-LDPC码的信道编解码性能较好,故以此为基础构造压缩感知(CS)测量矩阵预计有较好的性能。分别用一维和二维信号的CS重建实验验证新矩阵的性能,结果表明,与常用的测量矩阵相比,在相同的重建算法和压缩比条件下,新矩阵对应的重建误差较低,在峰值信噪比(PSNR)的评价指标上有所提高(0.5~1dB)。特别地,所提的确定性测量矩阵在结构上具有对称特性和准循环特性,如将其应用于硬件实现,可降低物理内存的需求量与硬件实现的复杂度。     

基于区域特性的压缩感知多聚焦融合算法

传统的基于压缩感知的图像融合算法是对整个系数进行稀疏处理,而小波分解后的低频系数不稀疏,导致压缩重构质量降低,并且传统的融合规则不易简单、全面地提取高频系数的特征值。针对这一问题,分别对小波分解得到的高、低频系数采取不同的融合规则进行处理,提出了一种改进的区域特性高频压缩感知的融合算法。其中,低频系数采用区域方差加权绝对值最大融合;高频系数首先通过具有较好RIP性质的随机观测矩阵进行压缩采样,得到的观测值基于能量匹配度的不同进行相加或加权融合,以融合不同方向的高频子带特征信息,再用正交匹配追踪重构算法对高频部分进行信号重构。最后,低频、高频信息在小波逆变换下重构出融合图像。实验结果表明,与以往的基于压缩感知的融合方法相比,此算法的融合图像更清晰,新算法无论是在主观评价还是客观评价指标上都有利于图像信号重构,并具有较好的使用性。     

基于结构树集合分割的效能选择性图像编码算法的改进

J．M．Shapiro提出的嵌入式小波零树(EZW)图像压缩编码算法，以其渐进嵌入的风格和简单高效的特点，开辟了小波变换在图像压缩编码应用中的广阔前景，引起了人们的普遍关注。在EZW算法之后，又有许多对EZW算法进行改进的方案被相继提出。其中由A．Said提出的基于结构树集合分割(SPIHT)的算法对进一步提高EZW算法的压缩比效果尤为明显。而文献[1]又提出了基于结构树集合分割的效能选择性(AS-SPIHT)图像编码算法。本文提出了一种改进的AS-SPIHT(IAS-SPIHT)图像编码算法。该算法首先通过建立四元组模型，简化了SPIHT及AS-SPIHT算法的实现；其次，通过充分利用已检出重要系数的先验知识，进一步提高了压缩比。     

An improved lossless image compression algorithm based on Huffman coding

There is an increasing number of image data produced in our life nowadays, which creates a big challenge to store and transmit them. For some fields requiring high fidelity, the lossless image compression becomes significant, because it can reduce the size of image data without quality loss. To solve the difficulty in improving the lossless image compression ratio, we propose an improved lossless image compression algorithm that theoretically provides an approximately quadruple compression combining the linear prediction, integer wavelet transform (IWT) with output coefficients processing and Huffman coding. A new hybrid transform exploiting a new prediction template and a coefficient processing of IWT is the main contribution of this algorithm. The experimental results on three different image sets show that the proposed algorithm outperforms state-of-the-art algorithms. The compression ratios are improved by at least 6.22% up to 72.36%. Our algorithm is more suitable to compress images with complex texture and higher resolution at an acceptable compression speed.

     

基于压缩感知的图像盲水印算法

针对现代数字水印的设计要求,结合压缩感知理论,提出一种图像盲水印算法。该算法利用自然载体图像在小波域中稀疏的特性,将加密后的水印嵌入载体图像离散小波变换系数中。提取水印时, 无需原始载体图像或其他先验知识,根据向量空间、矩阵方程的一些性质,以及压缩感知的重构算法,只需一个密钥(随机数种子)即可从嵌有水印的载体图像中精确提取水印并重构原始载体图像。实验证明,该水印算法具有良好的特性,能够满足实际应用的要求。     

基于灰度共生矩阵和同步正交匹配追踪的分形图像压缩

针对传统分形图像压缩中存在计算复杂度高以及编码时间较长的问题,提出了一种基于灰度共生矩阵纹理特征的正交化分形编码算法。首先,从特征提取和图像检索的角度建立起范围块和域块之间的相似性度量矩阵,由此将全局搜索转化为局域搜索来缩减码本;然后,定义一个新的规范块作为新的灰度描述特征,从而简化了块之间的变换过程;最后,引入同步正交匹配追踪（SOMP）稀疏分解正交化分形编码的概念,将块之间的灰度匹配转化为求解相应的稀疏系数矩阵,进而实现了一个范围块和多个域块之间的匹配关系。实验结果表明,与稀疏分形图像压缩（SFIC）算法相比,所提算法在不降低图像重建质量的前提下节省平均约88%的编码时间;与双交叉和特征算法相比,所提算法能够在保持更好的图像重建质量的同时显著缩短编码时间。