基于贝叶斯压缩感知的子空间拟合离格DOA估计

针对传统的基于稀疏贝叶斯学习（Sparse Bayesian Learning,SBL）的波达方向估计算法对噪声鲁棒性不高的问题,提出了一种基于SBL的子空间拟合离格波达方向(Direction of Arrival,DOA)估计方法。首先对接收数据的协方差矩阵进行特征分解,获得信号的加权子空间,构造等价信号的稀疏表示模型并利用贝叶斯学习算法进行参数求解。同时对于网格划分带来的建模误差问题,采用了离格贝叶斯推导（Sparse Bayesian Inference,SBI）算法进行求解,利用期望最大化算法迭代更新相应的参数。仿真结果表明,相对于传统的DOA方法,该方法具有更好的估计精度。     

Khatri-Rao积变换下的离格信号DOA估计

当存在离格信号时,基于稀疏表示的波达角(DOA)估计算法性能损失严重.为解决这个问题,在对接收数据协方差矩阵进行Khatri-Rao积变换的基础上,推导了离格信号网格偏离量与紧邻信号原子系数之间的关系,提出了一种单一离格信号DOA估计方法.为提高对邻近离格信号DOA的估计性能,利用矩阵的广义逆性质提出了基于多原子系数的联合估计方法.仿真实验表明,单一离格信号DOA估计方法在低信噪比下有较好的性能,联合估计方法在高信噪比条件下对邻近离格信号DOA有较高的估计精度,同时所提算法估计性能几乎不受网格划分间距的影响,可以通过增大网格间距降低算法运算量.相关研究对阵列天线DOA估计具有一定的参考价值.     

基于空域稀疏性的嵌套MIMO雷达DOA估计算法

针对传统MIMO雷达可分辨目标数受限于虚拟阵元数的问题,该文提出一种基于嵌套阵的MIMO雷达阵形设计新方法并改进了相应的稀疏DOA估计算法。首先分析对传统MIMO雷达的虚拟阵元进行嵌套采样给DOA估计性能带来的影响;然后提出嵌套MIMO雷达阵形设计方法,在虚拟阵元数相同的情况下,该阵形比传统阵形分辨更多的目标;最后提出一种基于空域稀疏性的嵌套MIMO雷达改进DOA估计算法,该算法使用噪声子空间加权,在提高分辨率的同时可以有效消除伪峰。仿真结果验证了该文算法的有效性和优越性。     

基于稀疏贝叶斯学习的高效DOA估计方法

针对采用1l 范数优化的稀疏表示DOA估计算法正则化参数选取困难、计算复杂度高的问题,该文提出一种基于稀疏贝叶斯学习的高效算法.该算法首先利用均匀线阵的结构特性,将DOA估计联合稀疏模型的构建与求解转换到实数域进行.其次,通过优化稀疏贝叶斯学习的基消除机制,使该算法具有更快的收敛速度.仿真结果表明,与1l 范数优化类算法相比,该文方法具有更高的空间分辨率和估计精度且计算复杂度低.     

基于稀疏贝叶斯学习的空间紧邻信号DOA估计算法

离格(off-grid)波达方向(DOA)估计解决的是实际DOA和假设网格点的失配问题.对于空间紧邻信号的DOA,稀疏的网格点会导致精度和分辨率的下降,密集的网格点虽然可以提高估计精度却显著增加计算负担.针对此问题,该文提出基于稀疏贝叶斯学习(SBL)的空间紧邻信号DOA估计算法,主要包括3个步骤.首先,通过最大化阵列输出的边缘似然函数,推导了信号在拉普拉斯先验下的新不动点迭代方法,进行超参数的预估计,相比其他经典SBL算法提高了收敛速度;其次,利用新网格插值方法优化网格点集,并二次估计噪声方差和信号功率以分辨空间紧邻信号的DOA;最后,推导了似然函数关于角度的最大化公式以改进离格DOA搜索.仿真表明该算法比其他经典SBL类算法对空间紧邻信号的DOA具有更高的精度和分辨率,同时有计算效率的提升.     

基于稀疏贝叶斯学习的空间紧邻信号DOA估计算法

离格(off-grid)波达方向(DOA)估计解决的是实际DOA和假设网格点的失配问题。对于空间紧邻信号的DOA,稀疏的网格点会导致精度和分辨率的下降,密集的网格点虽然可以提高估计精度却显著增加计算负担。针对此问题,该文提出基于稀疏贝叶斯学习(SBL)的空间紧邻信号DOA估计算法,主要包括3个步骤。首先,通过最大化阵列输出的边缘似然函数,推导了信号在拉普拉斯先验下的新不动点迭代方法,进行超参数的预估计,相比其他经典SBL算法提高了收敛速度;其次,利用新网格插值方法优化网格点集,并二次估计噪声方差和信号功率以分辨空间紧邻信号的DOA;最后,推导了似然函数关于角度的最大化公式以改进离格DOA搜索。仿真表明该算法比其他经典SBL类算法对空间紧邻信号的DOA具有更高的精度和分辨率,同时有计算效率的提升。     

基于压缩感知DOA估计的稀疏阵列设计

根据格拉姆(Gram)矩阵优化测量矩阵的方法,给出了一种基于压缩感知波达方向(DOA)估计的均匀线阵的稀疏阵列设计方法.该方法不需要对阵列的输出数据进行压缩采样,直接利用稀疏阵列的输出数据,然后利用稀疏恢复算法求解DOA估计信息.实验仿真证明,相比于原均匀线阵,所提方法在阵元数目较少且信噪比较低的情况下具有更好的DOA估计性能.     

相干信源条件下的稀疏贝叶斯DOA估计

为了解决相干信源条件下的离格波达方向(Direction of Arrival,DOA)估计问题,在现阶段研究成果的基础上,将子空间平滑技术(Subspace Smoothing,SS)与离格稀疏贝叶斯算法(Off-grid Sparse Bayesian Interference,OGSBI)相结合,提出了SS-OGSBI算法.为了提高算法在小快拍低信噪比下的性能,与子空间拟合(Weighted Subspace Fitting,WSF)技术相结合,提出了SS-WSF-OGSBI算法.与稀疏贝叶斯算法对比,所提算法在均方根误差及估计成功率上均具有明显优势.     

基于稀疏贝叶斯学习的多跳频信号DOA估计方法

针对多跳频信号空域参数估计问题,该文在稀疏贝叶斯学习(SBL)的基础上,利用跳频信号的空域稀疏性实现了波达方向(DOA)的估计。首先构造空域离散网格,将实际DOA与网格点之间的偏移量建模进离散网格中,建立多跳频信号均匀线阵接收数据模型;然后通过SBL理论得到行稀疏信号矩阵的后验概率分布,用超参数控制偏移量和信号矩阵的行稀疏程度;最后利用期望最大化(EM)算法对超参数进行迭代,得到信号矩阵的最大后验估计以完成DOA的估计。理论分析与仿真实验表明该方法具有良好的估计性能并能适应较少快拍数的情况。     

基于TOEPLITZ重构的压缩感知嵌套阵列DOA估计

针对传统稀疏阵列波达方向（DOA）估计算法在小快拍数、低信噪比和多信源数等条件下的估计精度不高的问题,提出了一种基于TOEPLITZ重构的压缩感知嵌套阵列DOA估计方法。首先利用TOEPLITZ重构方法将虚拟阵列的输出信号向量构建成满秩协方差矩阵,然后利用信号在空间域的稀疏性,将阵列协方差矩阵进行稀疏表示,通过噪声子空间和信号子空间的正交关系构建权值向量,对稀疏向量进行加权约束,最后通过求解最优化方程获取入射信源的DOA估计。仿真结果表明,本文方法比传统稀疏阵列DOA估计算法在低信噪比、小快拍数和多信源数下具有更好的DOA估计性能。     

稀疏重构算法

在图像处理和统计中,对于一个大的欠定线性方程,找到一个稀疏的近似解,是一种常见问题。标准方法是对一个目标函数求极小值,其中目标函数由一个二次的误差项l₂加一个正则项l₁组成。针对一般性问题,目标函数有一个光滑的凸函数加上一个非光滑的正则项,提出了一种算法结构。该算法通过求解最优子问题,从而求出稀疏的近似解。仿真结果表明,该算法能够更快的求出近似解,在正则项是凸的情况下,可以证明目标函数的极小解是收敛的。     

基于稀疏贝叶斯学习的稀疏信号 表示ISAR成像方法

作为一种新的稀疏信号表示算法,SBL(稀疏贝叶斯学习)方法没有BP方法的结构错误,也比FOCUSS方法具有少的多的局部最小点.ISAR成像问题可以转化为稀疏信号表示的问题,因此本文首次将SBL用于ISAR成像.真实数据的成像结果表明SBL是一种比BP和FOCUSS更有效的ISAR成像算法.     

Sparse molecular image representation

Sparsity-based models have proven to be very effective in most image processing applications. The notion of sparsity has recently been extended to structured sparsity models where not only the number of components but also their support is important. This paper goes one step further and proposes a new model where signals are composed of a small number of molecules, which are each linear combinations of a few elementary functions in a dictionary. Our model takes into account the energy on the signal components in addition to their support. We study our prior in detail and propose a novel algorithm for sparse coding that permits the appearance of signal dependent versions of the molecules. Our experiments prove the benefits of the new image model in various restoration tasks and confirm the effectiveness of priors that extend sparsity in flexible ways especially in case of inverse problems with low quality data.     

Bayesian Sparse Topic Model

This paper presents a new Bayesian sparse learning approach to select salient lexical features for sparse topic modeling. The Bayesian learning based on latent Dirichlet allocation (LDA) is performed by incorporating the spike-and-slab priors. According to this sparse LDA (sLDA), the spike distribution is used to select salient words while the slab distribution is applied to establish the latent topic model based on those selected relevant words. The variational inference procedure is developed to estimate prior parameters for sLDA. In the experiments on document modeling using LDA and sLDA, we find that the proposed sLDA does not only reduce the model perplexity but also reduce the memory and computation costs. Bayesian feature selection method does effectively identify relevant topic words for building sparse topic model.     

稀疏信道下基于稀疏贝叶斯学习的精简星座盲均衡算法

针对稀疏信道的盲均衡问题,在精简星座均衡算法框架下建立线性模型,利用稀疏信道下均衡器固有的稀疏特性,引入具有稀疏促进作用的先验分布对均衡器系数加以约束,使用稀疏贝叶斯学习方法迭代求解均衡器系数得到最大后验估计值。该文提出的均衡方法属于数据复用类均衡算法的范畴,能够适用于数据较短的应用场合。与随机梯度方法相比,算法性能受均衡器长度影响较小,收敛后误符号率性能更好,仿真实验验证了算法的有效性。     

阵列多台阶稀疏技术

本文探讨了用多个幅度台阶（包括０和１）对阵列进行稀疏的多台阶稀疏技术，与统计密度锥削稀疏技术（幅度仅用０和１）相比，该技术能明显改善稀疏阵天线的副瓣电平，文中用概率方法和最佳一致逼近概念进行了详细阐述，并给出了峰值副瓣电平低于给定值的概率。     

Sparse Poisson noisy image deblurring

Deblurring noisy Poisson images has recently been a subject of an increasing amount of works in many areas such as astronomy and biological imaging. In this paper, we focus on confocal microscopy, which is a very popular technique for 3-D imaging of biological living specimens that gives images with a very good resolution (several hundreds of nanometers), although degraded by both blur and Poisson noise. Deconvolution methods have been proposed to reduce these degradations, and in this paper, we focus on techniques that promote the introduction of an explicit prior on the solution. One difficulty of these techniques is to set the value of the parameter, which weights the tradeoff between the data term and the regularizing term. Only few works have been devoted to the research of an automatic selection of this regularizing parameter when considering Poisson noise; therefore, it is often set manually such that it gives the best visual results. We present here two recent methods to estimate this regularizing parameter, and we first propose an improvement of these estimators, which takes advantage of confocal images. Following these estimators, we secondly propose to express the problem of the deconvolution of Poisson noisy images as the minimization of a new constrained problem. The proposed constrained formulation is well suited to this application domain since it is directly expressed using the antilog likelihood of the Poisson distribution and therefore does not require any approximation. We show how to solve the unconstrained and constrained problems using the recent alternating-direction technique, and we present results on synthetic and real data using well-known priors, such as total variation and wavelet transforms. Among these wavelet transforms, we specially focus on the dual-tree complex wavelet transform and on the dictionary composed of curvelets and an undecimated wavelet transform.     

分块自适应图像稀疏分解

针对图像稀疏分解的计算时间复杂度非常高这个问题,提出了分块自适应图像稀疏分解算法。该算法根据稀疏分解计算时间复杂度和待分解图像大小之间的关系。把待分解图像分成互不重叠的小块。然后对每个小块图像进行稀疏分解。根据每一块的复杂程度。自适应地决定稀疏分解的结束。实验结果表明。在分解原子个数相近或相同的条件下。新算法对稀疏分解后重建图像比在整幅图像上进行稀疏分解重建的图像质量下降0．5dB。但计算速度提高了约15倍。     

基于多重核的稀疏表示分类

稀疏表示分类（SRC）及核方法在模式识别的很多问题中都得到了成功的运用.为了提高其分类精度,提出多重核稀疏表示及其分类（MKSRC）方法.提出一种快速求解稀疏系数的优化迭代方法并给出了其收敛到全局最优解的证明.对于多重核的权重给出了两种自动更新方式并进行了分析与比较.在不同的人脸图像库上的分类实验显示了所提出的多重核稀疏表示分类的优越性.     

Sparse intrinsic decomposition and applications

This paper proposes an intrinsic decomposition method from a single RGB-D image. To remedy the highly ill-conditioned problem, the reflectance component is regularized by a sparsity term, which is weighted by a bilateral kernel to exploit non-local structural correlation. As shading images are piece-wise smooth and have sparse gradient fields, the sparse-induced ${\ell }_1$-norm is used to regularize the finite difference of the direct irradiance component, which is the most dominant sub-component of shading and describes the light directly received by the surfaces of the objects from the light source. To derive an efficient algorithm, the proposed model is transformed into an unconstrained minimization of the augmented Lagrangian function, which is then optimized via the alternating direction method. The stability of the proposed method with respect to parameter perturbation and its robustness to noise are investigated by experiments. Quantitative and qualitative evaluation demonstrates that our method has better performance than state-of-the-art methods. Our method can also achieve intrinsic decomposition from a single color image by integrating existed depth estimation methods. We also present a depth refinement method based on our intrinsic decomposition method, which obtains more geometry details without texture artifacts. Other application, e.g., texture editing, also demonstrates the effectiveness of our method.