基于去频谱混叠Contourlet变换的层内局部相关性图像降噪

提出了一种基于去频谱混叠Contourlet变换的层内局部相关性图像降噪新方法.含噪图像经抗混Contourlet多尺度变换,得到一个低频逼近子图和一系列不同尺度、不同方向的高频细节子图,充分利用变换域同层同方向子带内信号系数相关性强、噪声系数无相关性的特点,采用强局部化零均值高斯分布模型对高频细节子图进行降噪处理.实验结果表明,该方法计算效率高,能克服Contourlet变换中的频谱混叠,避免了重构图像出现"划痕"现象.无论是PSNR指标,还是在视觉效果上,该方法的去噪性能均好于Contourlet去噪、Contourlet域HMT去噪和基于抗混叠Contourlet变换的硬阈值去噪,在有效去噪的同时,具有很好的图像边缘和细节保护能力.     

基于Contourlet域HMT似然概率的图像融合方法

传统的基于Contourlet变换的图像融合方法大都 忽略了Contourlet系数之间 的相关性,导致特征信息的丢失。本文根据隐马尔可夫树(HMT)模型的两种状态和 3组概率确定能有效捕获尺度间、尺度内的Contourlet系数特性的似然概率,设计了图像融 合规则。实验结果表明,Contourlet域HMT模型应用于图像融合领域,能充分挖掘数据之间 的相关性,为融合图像提取更全面、准确的特征纹理信息。     

基于小波变换及隐式马尔科夫树模型的图像信号去噪

研究基于小波变换的隐式马尔科夫模型树(HMT)方法,用于去除图像信号中的白噪声。该方法利用了小波变换域系数间的相关性和自相似信息,并在Lenna图像中验证了方法的有效性。对不同程度污染的高斯白噪声图像的去噪效果与传统方法进行比较;结果表明,基于小波变换的HMT方法有更好的去噪效果,所建立的HMT模型更能体现图像的特征。     

一种概率自适应图像去噪模型

从小波变换入手,提出了一种概率自适应去噪模型.该模型包括尺度层间模型和层内模型.去噪方法首先利用小波域层间模型,将小波系数分成两类:有意义系数和无意义系数;然后在层内概率模型下运用最大后验概率估计方法,从有意义系数中恢复出原始系数.我们还将这种模型引入复数小波变换域.实验结果及分析表明了该去噪模型的有效性.     

一种基于小波域HMT模型的图像去噪方法研究

小波图像去噪已经成为图像去噪的主要方法之一。利用小波变换在去除噪声时,可提取并保存对视觉起主要作用的边缘信息,但现有的去噪声方法忽略了小波系数之间的相关性。针对这一不足,在小波域隐Markov树模型(HMT) 的基础上提出了一种图像去噪新方法。实验结果表明,与普通的小波去噪方法相比,该方法不但可以保留图像的边缘信息,而且能提高去噪后图像的峰值信噪比。     

非高斯双变量模型contourlet图像去噪

Contourlet变换是继小波变换之后的又一新变换.由于contourlet变换的多尺度和多方向特性,能有效地捕获到自然图像中的轮廓,并对其进行稀疏表示.详细分析了图像contourlet系数的统计特性,并利用非高斯双变量分布对系数层间相关性进行建模.最后,将此分布应用于图像去噪,就PSNR、NMSE和视觉质量这三方面的评价指标与contourlet HMT和小波阈值法进行了比较.实验结果表明：算法能获得较好的结果,尤其是对于含有丰富纹理的图像.     

基于子波变换局部极大值的信号去噪新算法

本文出了一种相尺度间信号子波变换极大值点相似系数的定义，它定量地描述了相邻尺度间子波变换极大点的相似性。在上核实 定主的基础上，提出了波变换域信号去噪的新算法。     

基于尺度间和尺度内相关性的平稳小波红外图像去噪

提出了一种基于尺度间和尺度内相关性的平稳小波变换红外图像去噪方法.首先对红外图像进行离散平稳小波变换,分别对各个分解层的高频子带,利用不同尺度小波系数形成的系数向量,通过线性最小均方误差估计小波系数,获得各个高频子带的估计系数,再利用小波系数尺度内的邻域相关性对小波系数进行修正,然后通过小波反变换得到去噪图像.仿真结果表明,考虑尺度间和尺度内相关性的平稳小波红外图像去噪算法能有效地去除红外图像噪声,在信噪比和视觉质量上要优于单纯考虑尺度间相关性的去噪方法.     

基于改进小波域隐马尔可夫模型的遥感图像分割

该文提出了一种基于改进小波域隐马尔可夫树(HMT)模型进行图像分割的方法。该方法利用基于希尔伯特变换对的二维方向小波,这种小波变换具有平移不变性、方向检测性好的特点。同时该方法还利用拓展HMT对该改进小波域中尺度间的小波系数相关性进行建模,并结合多背景融合技术进行遥感图像的分割,得到了优于已有文献的分割结果,而且与同类算法相比,降低了算法所需的计算量。     

基于小波域HMT模型的图像去噪研究

研究小波域隐式马尔可夫模型树(HMT),提出了一种基于小波域HMT模型抑制高斯白噪声的改进图像去噪算法.首先将噪声图像沿水平、垂直及对角方向进行平移变换;然后对平移后的图像进行小波变换,建立其对应的小波域HMT型,分别进行去噪处理.最后取所有去噪图像的均值作为最终的去噪图像.在仿真实验中,对不同程度污染下高斯白噪声的Lena图像分别采用该文算法、小波域硬阈值与软阈值去噪进行比较.结果表明,该文算法很好地保留了图像的细节和边缘信息;提高了图像的峰值信噪比;抑制了Gibbs效应;具有较好的去噪效果.通过实验仿真可以看出,这种方法较好地去除了白噪声;提高了图像的峰值信噪比;较好地保存了图像的边缘和细节信息;抑制了振铃现象.     

Directional multiscale modeling of images using the contourlet transform.

The contourlet transform is a new two-dimensional extension of the wavelet transform using multiscale and directional filter banks. The contourlet expansion is composed of basis images oriented at various directions in multiple scales, with flexible aspect ratios. Given this rich set of basis images, the contourlet transform effectively captures smooth contours that are the dominant feature in natural images. We begin with a detailed study on the statistics of the contourlet coefficients of natural images: using histograms to estimate the marginal and joint distributions and mutual information to measure the dependencies between coefficients. This study reveals the highly non-Gaussian marginal statistics and strong interlocation, interscale, and interdirection dependencies of contourlet coefficients. We also find that conditioned on the magnitudes of their generalized neighborhood coefficients, contourlet coefficients can be approximately modeled as Gaussian random variables. Based on these findings, we model contourlet coefficients using a hidden Markov tree (HMT) model with Gaussian mixtures that can capture all interscale, interdirection, and interlocation dependencies. We present experimental results using this model in image denoising and texture retrieval applications. In denoising, the contourlet HMT outperforms other wavelet methods in terms of visual quality, especially around edges. In texture retrieval, it shows improvements in performance for various oriented textures.     

Hidden Markov Bayesian texture segmentation using complex wavelet transform

The authors propose a multiscale Bayesian texture segmentation algorithm that is based on a complex wavelet domain hidden Markov tree (HMT) model and a hybrid label tree (HLT) model. The HMT model is used to characterise the statistics of the magnitudes of complex wavelet coefficients. The HLT model is used to fuse the interscale and intrascale context information. In the HLT, the interscale information is fused according to the label transition probability directly resolved by an EM algorithm. The intrascale context information is also fused so as to smooth out the variations in the homogeneous regions. In addition, the statistical model at pixel-level resolution is formulated by a Gaussian mixture model (GMM) in the complex wavelet domain at scale 1, which can improve the accuracy of the pixel-level model. The experimental results on several texture images are used to evaluate the algorithm.     

基于小波域多状态隐马尔科夫树模型的自适应 文本图像分割算法

本文针对文本图像首先提出了一种基于小波域多状态隐马尔科夫树模型的自适应文本图像分割算法(Context-Adapted wavelet-domain Hidden Markov Tree,简称为CAHMT),该算法具有较高的分割质量和较低的计算复杂度.其次,为了进一步提高CAHMT算法分割的效果,将该算法与微分算子、尺度系数相结合提出了两种新的文本图像分割算法.最后通过实例阐明了这些算法的有效性.     

基于小波域隐马尔可夫混合模型的SAR图像降斑算法

在小波域马尔可夫随机场(MRF)和隐马尔可夫树(HMT)的基础上,提出了一种新的合成孔径雷达(SAR)图像降斑算法.该算法在对乘性噪声不取对数变换的情况下,融合了贝叶斯最小均方误差(MMSE)抑制噪声技术.为了提高HMT的速度,采用了一个新的隐马尔可夫半树模型,该模型考虑了小波系数的持续性和聚类性,分别用HMT和MRF刻画.仿真结果表明该算法在抑制斑点噪声的同时,有效的保持了边缘,避免对数变换带来的一些误差,取得了好的效果,其速度比HMT模型提高了二十倍.     

Multiscale image segmentation using wavelet-domain hidden Markovmodels

We introduce a new image texture segmentation algorithm, HMTseg, based on wavelets and the hidden Markov tree (HMT) model. The HMT is a tree-structured probabilistic graph that captures the statistical properties of the coefficients of the wavelet transform. Since the HMT is particularly well suited to images containing singularities (edges and ridges), it provides a good classifier for distinguishing between textures. Utilizing the inherent tree structure of the wavelet HMT and its fast training and likelihood computation algorithms, we perform texture classification at a range of different scales. We then fuse these multiscale classifications using a Bayesian probabilistic graph to obtain reliable final segmentations. Since HMTseg works on the wavelet transform of the image, it can directly segment wavelet-compressed images without the need for decompression into the space domain. We demonstrate the performance of HMTseg with synthetic, aerial photo, and document image segmentations.     

Bayesian tree-structured image modeling using wavelet-domain hiddenMarkov models

Wavelet-domain hidden Markov models have proven to be useful tools for statistical signal and image processing. The hidden Markov tree (HMT) model captures the key features of the joint probability density of the wavelet coefficients of real-world data. One potential drawback to the HMT framework is the need for computationally expensive iterative training to fit an HMT model to a given data set (e.g., using the expectation-maximization algorithm). We greatly simplify the HMT model by exploiting the inherent self-similarity of real-world images. The simplified model specifies the HMT parameters with just nine meta-parameters (independent of the size of the image and the number of wavelet scales). We also introduce a Bayesian universal HMT (uHMT) that fixes these nine parameters. The uHMT requires no training of any kind, while extremely simple, we show using a series of image estimation/denoising experiments that these new models retain nearly all of the key image structure modeled by the full HMT. Finally, we propose a fast shift-invariant HMT estimation algorithm that outperforms other wavelet-based estimators in the current literature, both visually and in mean square error.     

Improved hidden Markov models in the wavelet-domain

Wavelet-domain hidden Markov models (HMMs), in particular the hidden Markov tree (HMT) model, have been introduced and applied to signal and image processing, e.g., signal denoising. We develop a simple initialization scheme for the efficient HMT model training and then propose a new four-state HMT model called HMT-2. We find that the new initialization scheme fits the HMT-2 model well. Experimental results show that the performance of signal denoising using the HMT-2 model is often improved over the two-state HMT model developed by Crouse et al. (see ibid., vol.46, p.886-902, 1998)     

Varying complexity in tree-structured image distribution models.

Probabilistic models of image statistics underlie many approaches in image analysis and processing. An important class of such models have variables whose dependency graph is a tree. If the hidden variables take values on a finite set, most computations with the model can be performed exactly, including the likelihood calculation, training with the EM algorithm, etc. Crouse et al. developed one such model, the hidden Markov tree (HMT). They took particular care to limit the complexity of their model. We argue that it is beneficial to allow more complex tree-structured models, describe the use of information theoretic penalties to choose the model complexity, and present experimental results to support these proposals. For these experiments, we use what we call the hierarchical image probability (HIP) model. The differences between the HIP and the HMT models include the use of multivariate Gaussians to model the distributions of local vectors of wavelet coefficients and the use of different numbers of hidden states at each resolution. We demonstrate the broad utility of image distributions by applying the HIP model to classification, synthesis, and compression, across a variety of image types, namely, electrooptical, synthetic aperture radar, and mammograms (digitized X-rays). In all cases, we compare with the HMT.     

Dual-tree complex wavelet hidden Markov tree model for image denoising

A new non-training complex wavelet hidden Markov tree (HMT) model, which is based on the dual-tree complex wavelet transform and a fast parameter estimation technique, is proposed for image denoising. This new model can mitigate the two problems (high computational cost and shift-variance) of the conventional wavelet HMT model simultaneously. Experiments show that the denoising approach with this new model achieves better performance than other related HMT- based image denoising algorithms.