非相干子字典多原子快速匹配追踪算法

从冗余字典中得到信号的最稀疏表示是一个NP难问题,即使是次优的匹配追踪仍然相当复杂.该文提出一种多原子快速匹配追踪算法.该算法首先将冗余字典分解成M个非相干的子字典,每次迭代分别从各子字典中至多选取一个满足条件的原子组成多原子集;最后通过求信号在多原子集上的正交投影,得到信号的多原子稀疏逼近.实验采用真实音频信号进行仿真;结果表明新的算法获得与匹配追踪相当的稀疏逼近性能,同时大大提高了信号稀疏分解的速度.     

基于自适应冗余字典的语音信号稀疏表示算法

基于冗余字典的信号稀疏表示是一种新的信号表示理论,当前的理论研究主要集中在字典构造算法和稀疏分解算法两方面。该文提出一种新的基于自适应冗余字典的语音信号稀疏表示算法,该算法针对自相关函数为指数衰减的平稳信号,从K-L展开出发,建立了匹配信号结构的冗余字典,进而提出一种高效的基于非线性逼近的信号稀疏表示算法。实验结果表明冗余字典中原子的自适应性和代数结构使短时平稳语音信号稀疏表示具有较高的稀疏度和较好的重构精度,并使稀疏表示算法较好地应用于语音压缩感知理论。     

基于多原子快速匹配追踪的图像编码算法

该文提出一种多原子快速匹配追踪信号稀疏分解算法,并将其应用于静态图像编码。多原子匹配追踪通过每次迭代选取多个原子的形式,实现信号的快速稀疏分解。在此基础上,通过构造多尺度脊波字典实现图像的稀疏分解,并对稀疏分解的数据进行自适应量化和编码。实验结果表明,多原子匹配追踪获得了与匹配追踪相当的逼近性能,同时极大地提高了稀疏分解的速度。新的编码算法在低比特率情况下,获得了比JPEG2000更理想的编码性能。     

基于迭代自适应稀疏分解的雷达信号去噪

稀疏分解能有效分离信号和噪声,因此适用于信号去噪.文中构造了雷达回波稀疏表示的冗余字典,字典原子与目标回波波形匹配,基于该字典的雷达回波信号稀疏度就是目标数.针对稀疏度自适应匹配追踪算法进行低信噪比信号稀疏分解时的不足,提出了一种迭代自适应匹配追踪算法,采用规范化的残差之差作为迭代终止条件,使得稀疏分解过程能依据噪声水平自适应终止,以逐次逼近方式估计信号稀疏度,改善了稀疏分解的精度.仿真实验结果表明,该算法在低信噪比以及稀疏度未知的条件下,实现了雷达回波信号的准确稀疏分解,极大地提高了信噪比.     

基于多尺度自适应稀疏字典的小弱目标检测方法

针对单尺度固定函数的滤波器难以有效剔除杂波和提高小弱目标检测性能的不足,文中研究建立多尺度自适应稀疏字典,提出了一种多尺度自适应形态稀疏字典检测小弱目标方法。首先根据图像信号内容建立多尺度自适应形态稀疏字典,并将图像信号在多尺度稀疏字典中进行稀疏分解;然后在分析小原子稀疏表示系数的基础上建立稀疏表示系数直方图,并利用指数函数拟合小尺度原子的稀疏表示系数直方图;最后,根据指数函数拟合参数在杂波、噪声和目标表现出的差异检测小弱目标。该多尺度稀疏字典利用大尺度原子描述图像背景杂波,小尺度原子捕获图像细小特征。实验结果表明,与小波算法和Contourlet 算法相比,文中方法能更为有效地抑制背景杂波,减少背景残留,从而提高小弱目标检测性能。     

基于子空间的三阶多项式相位信号快速稀疏分解算法

针对稀疏分解冗余字典中原子数量庞大的缺点,该文提出一种三阶多项式相位信号的快速稀疏分解算法。该算法根据三阶多项式相位信号的特点,把原有信号变换成两个子空间信号,并根据这两个子空间信号构建相应的冗余字典,然后采用正交匹配追踪法来完成其稀疏分解,最后利用稀疏分解原理完成原有信号的稀疏分解。该算法把原有信号变换成两个不同子空间信号,构建了两个不同的冗余字典,对比采用一个冗余字典库,这种采用两个冗余字典的算法大大减少了原子数量,并且通过快速傅里叶变换,在一个冗余字典进行稀疏分解时,同时找到另一个冗余字典中的最匹配的原子。因此该算法通过减少原子数量和采用快速傅里叶变换大大加快了稀疏分解速度。实验结果表明,相比于采用Gabor原子构建的冗余字典,采用匹配追踪算法与遗传算法及最近提出的基于调制相关划分的快速稀疏分解,它的稀疏分解速度更快,并且具有更好的收敛性。     

基于稀疏表达的图像去噪方法研究

提出一种基于混合字典的图像稀疏分解去噪方法。使用小波包函数和离散余弦函数构成混合字典,采用匹配追踪算法对图像进行稀疏分解,提取含噪图像中的稀疏成分,最后利用稀疏成分进行图像重构,达到去除图像中噪声的目的。实验中与单一字典稀疏分解去噪算法进行了对比,结果表明,所提出的混合字典稀疏去噪算法可有效提取图像中的稀疏结构,改善重构图像的主客观质量。     

基于稀疏优化的图像压缩感知重建算法

在信号的稀疏表示方法中,传统的基于变换基的稀疏逼近不能自适应性地提取图像的纹理特征,而基于过完备字典的稀疏逼近算法复杂度过高.针对该问题,文章提出了一种基于小波变换稀疏字典优化的图像稀疏表示方法.该算法在图像小波变换的基础上构建图像过完备字典,利用同一场景图像的小波变换在纹理上具有内部和外部相似的属性,对过完备字典进行灰色关联度的分类,有效提高了图像表示的稀疏性.将该新算法应用于图像信号进行稀疏表示,以及基于压缩感知理论的图像采样和重建实验,结果表明新算法总体上提升了重建图像的峰值信噪比与结构相似度,并能有效缩短图像重建时间.     

一种基于拟牛顿法的CS投影矩阵优化算法

压缩感知(Compressed Sensing,CS)理论中,投影矩阵优化是一类通过提高观测数据信息量而改善性能的方法.由于投影矩阵与稀疏字典内积构造的Gram矩阵必定奇异,基于广义逆矩阵求解方法存在计算精度的问题.本文提出了一种利用拟牛顿法的CS投影矩阵优化算法.该算法分为两步:一是利用阈值函数约束Gram矩阵非对角线元素,使投影矩阵与稀疏字典的互相关系数逼近Welch界;二是采用秩2校正得到Hessian阵逆近似去修正梯度搜索方向.两个步骤交替执行,直到解出符合优化要求的投影矩阵.该算法始终保持下降性,具有超线性收敛速度,避免了矩阵函数二阶导数复杂的计算,计算量较小.实验结果表明,当信号稀疏度或观测数据相同时,本文算法的重构结果优于其他算法.     

组合正交基字典稀疏分解快速匹配追踪算法

组合正交基字典稀疏分解通过正交基的级联来构造完备字典,实现稀疏分解。针对稀疏分解的常见算法计算复杂度高的问题,提出一种快速匹配追踪算法。该算法首先求出并存储正交基向量之间的内积,然后根据向量正交基展开系数为其与正交基向量内积的性质将内积运算转化为代数运算,得到一种快速匹配追踪算法。实验结果表明,基于Dirac基和DCT基构成的完备字典对信号leleccum进行稀疏分解时,与匹配追踪(MP)算法相比,该算法的计算速度提高了大约10倍。     

Double-constraint flexible tree search-based orthogonal matching pursuit for DOA estimation using dynamic sensor arrays

Greedy algorithms have leveraged sparse signal models for parameter estimation purposes in applications including bearing estimation and direction-of-arrival (DOA) estimation. A dictionary whose elements correspond to observations for a sampling of the angle space is used for sparse approximation of the received signals; the resulting sparse coefficient vector’s support identifies the DOA estimates. Increasing the angle space sampling resolution provides better sparse approximations for arbitrary observations, while the resulting high dictionary coherence hampers the performance of standard sparse approximation, preventing accurate DOA estimation. To alleviate this shortcoming, in the each iteration, we use the structured sparsity model that keeps high coherent and close spacing dictionary elements. Besides, the proposed approach allows exploitation of the array orientation diversity (achievable via array dynamics) in the compressive sensing framework to address challenging array signal processing problems such as left-right ambiguity and poor estimation performance. And the simulation results show that our proposed algorithm can offer significantly improved performance in single-snapshot scenario with multiple sources.     

Design redundant Chebyshev dictionary with generalized extreme value distribution for sparse approximation and image denoising

This paper illustrates a novel method for designing redundant dictionary from Chebyshev polynomials for sparse coding. Having an overcomplete dictionary in ${{\mathbb R}^{d \times N}:d < N}$ from N, orthogonal functions need to sample d times from orthogonal intervals. It is proved (“Appendix B”) that uniform distribution is not optimal for sampling. Experiments show that using non-uniform measures for dividing orthogonal intervals has some advantages in making incoherent dictionary with a mutual coherence closer to equiangular tight frames, which is appropriate for sparse approximation methods. In this paper, we first describe the dictionary design problem, then modify this design with any kind of distribution, and define an objective function respect to its parameters. Because of the abundant extremums in this objective function, genetic algorithm is used to find the best parameters. Experimental results show that generalized extreme value distribution has better performance among others. This type of dictionary design improves the performance of sparse approximation and image denoising via redundant dictionary. The advantages of this method of designing overcomplete dictionaries are going to be compared with uniform ones in sparse approximation areas.     

Greed is good: algorithmic results for sparse approximation

This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho's basis pursuit (BP) paradigm can recover the optimal representation of an exactly sparse signal. It leverages this theory to show that both OMP and BP succeed for every sparse input signal from a wide class of dictionaries. These quasi-incoherent dictionaries offer a natural generalization of incoherent dictionaries, and the cumulative coherence function is introduced to quantify the level of incoherence. This analysis unifies all the recent results on BP and extends them to OMP. Furthermore, the paper develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal. From there, it argues that OMP is an approximation algorithm for the sparse problem over a quasi-incoherent dictionary. That is, for every input signal, OMP calculates a sparse approximant whose error is only a small factor worse than the minimal error that can be attained with the same number of terms.     

基于代理函数优化的稀疏性字典学习

稀疏性字典学习是指对在某个已知的基字典上具有稀疏表示的字典的学习.论文利用块松弛思想,将稀疏性字典学习问题转化为字典和系数的分别优化问题,利用代理函数优化方法分别对固定字典和固定系数情况下的目标函数进行优化处理,得到固定字典情况下的系数更新算法和固定系数情况下的字典更新算法,进而得到稀疏性字典学习算法.理论分析说明了本...     

Sparse approximation using M-term pursuit and application in image and video coding

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal components. The MTP algorithm provides an adaptive representation for signals in any complete dictionary. The basic idea behind the MTP is to partition the dictionary into L quasi-disjoint subdictionaries. A k-term signal approximation is then iteratively computed, where each iteration leads to the selection of M ≤ L atoms based on thresholding. The MTP algorithm is shown to achieve competitive performance with the matching pursuit (MP) algorithm that greedily selects atoms one by one. This is due to efficient partitioning of the dictionary. At the same time, the computational complexity is dramatically reduced compared to MP due to the batch selection of atoms. We finally illustrate the performance of MTP in image and video compression applications, where we show that the suboptimal atom selection of MTP is largely compensated by the reduction in complexity compared with MP.     

基于优化字典学习的遥感图像融合方法

为提升全色图像和多光谱图像的融合效果,该文提出基于优化字典学习的遥感图像融合方法。首先将经典图像库中的图像分块作为训练样本,对其进行K均值聚类,根据聚类结果适度裁减数量较多且相似度较高的图像块,减少训练样本个数。接着对裁减后的训练样本进行训练,得到通用性字典,并标记出相似字典原子和较少使用的字典原子。然后用与原稀疏模型差异最大的全色图像块规范化后替换相似字典原子和较少使用的字典原子,得到自适应字典。使用自适应字典对多光谱图像经IHS变换后获取的亮度分量和源全色图像进行稀疏表示,把每一个图像块稀疏系数中的模极大值系数分离,得到极大值稀疏系数,将剩下的稀疏系数称为剩余稀疏系数。针对极大值稀疏系数和剩余稀疏系数分别选择不同的融合规则进行融合,以保留更多的光谱信息和空间细节信息,最后进行IHS逆变换获得融合图像。实验结果表明,与传统方法相比所提方法得到的融合图像主观视觉效果较好,且客观评价指标更优。     

The nonparametric Bayesian dictionary learning based interpolation method for WSNs missing data

The conventional data interpolation methods based on sparse representation usually assume that the signal is sparse under the overcomplete dictionary. Specially, they must confirm the dimensions of dictionary and the signal sparse level in advance. However, it is hard to know them if the signal is complicated or dynamically changing. In this paper, we proposed a nonparametric Bayesian dictionary learning based interpolation method for WSNs missing data, which is the combination of sparse representation and data interpolation. This method need not preset sparse degrees and dictionary dimensions, and our dictionary atoms are drawn from a multivariate normal distribution. In this case, the dictionary size will be learned adaptively by the nonparametric Bayesian method. In addition, we implement the Dirichlet process to exploit the spatial similarity of the sensing data in WSNs, thus to improve the interpolation accuracy. The interpolation model parameters, the optimal dictionary and sparse coefficients, can be inferred by the means of Gibbs sampling. The missing data will be estimated commendably through the derived parameters. The experimental results show that the data interpolation method we proposed outperforms the conventional methods in terms of interpolation accuracy and robustness.     

Coupled dictionary learning in wavelet domain for Single-Image Super-Resolution

In this paper a coupled dictionary learning mechanism with mapping function is proposed in the wavelet domain for the task of Single-Image Super-Resolution. Sparsity is used as the invariant feature for achieving super-resolution. Instead of using a single dictionary multiple compact dictionaries are proposed in the wavelet domain. Such dictionaries will exhibit the properties of the wavelet transform such as compactness, directionality and redundancy. Six pairs of dictionaries are designed using a coupled dictionary mechanism with mapping function which helps in strengthening the similarity between the sparse coefficients. Low-resolution image is assumed as the approximation image of the first-level wavelet decomposition. High resolution is achieved by estimating the wavelet sub-bands of this low-resolution image by dictionary learning and sparsity. The proposed algorithm outperforms a well-known spatial domain and wavelet domain algorithm as evaluated on the existing comparative parameters such as structural similarity index measure and peak signal-to-noise ratio.