基于小波域隐马尔科夫树模型的图像分割

改进了传统的基于小波域隐马尔科夫树模型的图像分割方法.由于传统方法均为直接选择小波子带系数作为训练特征,不能直接得到像素级分割结果;同时传统方法在后融合方面对所有尺度均采用同一种上下文背景,而忽略不同尺度上初分割类标志图的特点.因此,本文在粗分割阶段首先处理了训练时参数设置的问题,并选取了更能表征纹理的特征,能直接得到像素级分割结果;在多尺度融合阶段,充分利用不同尺度上类标志图的特性,不仅考虑粗尺度信息对融合结果的影响也考虑了细尺度信息对结果的影响.实验表明本文算法的视觉效果好干与本文进行比较的Choi提出的HMTseg以及孙强提出的WD-HMTseg遥感图像分割算法.     

改进多尺度融合结合小波域HMT模型的遥感图像分割

提出了一种结合权值背景融合的小波域多尺度图像分割方法。首先通过小波域隐马尔可夫树模型获得图像各个尺度上的初始分割,然后为各个尺度上每一分割像素点分别赋予权值,并建立一种融合父子尺度信息的新背景模型,最后利用权值背景融合各个尺度图像初始分割结果,得到像素级分割。仿真结果表明,该方法可得到优于已有文献的分割效果。     

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

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

模拟视觉感知机制的视频监控场景分类方法

监控场景分类能增强智能视频监控的准确性与自适应性.本文提出一种模拟人类视觉感知机制的监控场景分类方法.首先,用二维双密度双树复小波变换模拟视皮层中简单细胞的空间尺度与朝向感知机制,将一幅监控场景图像分解为一系列不同尺度及朝向上的小波子带图像.然后,模拟视皮层中复杂细胞结构所呈现的统计特征感知机制,用基于小波共生矩阵的复合统计特征提取方法对上述小波子带图像进行统计特征提取,生成监控场景图像对应的特征向量.最后,将样本集中不同类别监控场景图像对应的特征向量输入支持向量机,训练出视频监控场景分类器.实验结果表明,相比于常规的自然场景分类方法,本文方法更适合于处理包含丰富空间几何结构特征的视频监控场景.     

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

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

基于尺度乘积和相关性的图像去噪

为了去除图像的噪声,提出了一种基于尺度乘积和尺度相关性的平稳小波交换图像去噪方法.在传统小波系数估计的基础上,考虑到尺度间的相关性,利用不同尺度小波系数形成的系数向量,通过线性最小均方误差估计小波系数,获得各个高频子带的估计系数.针对单纯利用尺度间相关性去噪造成的图像边缘失真问题,在不同尺度小波系数形成的系数向量中引入了小波系数乘积,不但可以较好区分边缘信息和噪声信息,而且提高了原有算法的去噪能力.仿真结果表明,该图像去噪算法能有效去除图像噪声,较好保持图像边缘,在峰值信噪比和视觉质量上都有较大提高.     

基于小波变换的低对比度图像增强

针对传统算法存在噪声过增强的问题,提出了基于小波分析的图像增强算法。在小波变换多尺度分析的基础上,算法对图像多尺度分解得到的小波系数进行缩减去噪,然后在不同尺度上对各分解系数进行不同程度的增强;对同一尺度的系数进行非线性处理以增加对比度;增强低频子带图像的对比度以保证整体的增强效果。实验表明,该算法能有效地增强低对比度图像,减小了噪声的增强幅度,使结果图像具有很好的视觉效果。     

基于人眼视觉的小波域结构相似性图像质量客观评价方法

针对空域结构相似性评价方法在几何失真图像及噪声污染图像的质量评价中存在的不足,在考虑人眼视觉特性前提下,研究了一种基于人眼视觉的小波域结构相似度的图像质量评价方法(WDSSIM),该方法首先将参考图像和失真图像进行小波变换,以获取不同尺度和频带的子带图像,并根据人眼视觉JND模型,获取人眼视觉对参考图像的带间敏感度和各子带的带内敏感度;然后,以带内敏感度因子为权值分别求取参考图像和失真图像同一尺度和频带的子带图像之间的结构相似度;最后,以带间敏感度因子为权值对各子带对的结构相似度进行加权归一化,获得整幅图像的结构相似度.     

基于快速整数提升小波变换的多幅图像融合

在分析已有多分辨率图像融合方法的基础上,针对多幅图像融合模型的选择问题,提出了一种基于快速整数提升小波变换的多幅图像融合新算法。首先采用整数提升小波变换将多幅源图像分解到不同尺度、方向频带范围内,然后根据图像提升小波变换后不同子带的特点分别采用了2种新的高、低频融合策略,最后通过整数提升小波逆变换得到融合图像。对多幅源图像进行了融合实验,并对融合结果进行了主观和客观的评价。实验结果表明,该算法不仅适合多幅图像的实时快速融合,而且可以获得视觉效果较佳、细节更为丰富的融合图像。     

基于小波变换与深度残差融合的图像增强算法

针对目前基于小波变换图像融合增强算法原始图 像中的多尺度细节信息的不足,提 出了一种改进的多尺度小波变换与深度残差选择相结合的图像增强算法。利用小波变换对原 始图像进行分解提取得到它的多级分解系数后,再利用不同规则对不同层次的小波系数进行 重构,与此同时引入深度残差算法的思想对子带系数做残差。对于高频子带系数,计算子带 残差的系数与梯度特征融合方法的系数,选用两者最大值进行融合增强;而对于低频子带系 数则采用梯度特征融合增强系数与子带残差系数取平均值的算法进行融合。通过在MATLAB 平台上的实验对所提出算法进行验证,峰值信噪比相较于对比的方法都有所提高,且均方根 误差也得到减小,结构相似度都得到提高,结果表明该算法能增强图像的多尺度细节信息, 提高图像的信噪比,且具有更好的图像增强效果。     

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.     

基于Contourlet域HMT模型的多尺度图像分割

基于Contourlet系数分布统计特性,结合隐马尔可夫树（HMT）模型和贝叶斯准则提出一种新的图像分割算法.为了更有效保持Contourlet域不同尺度间的信息,提出一种新的加权邻域背景模型,给出了基于高斯混合模型的象素级分割算法和基于新的背景模型的多尺度融合算法.分别选择合成纹理图像、航拍图像和SAR图像进行实验,并与小波域HMTseg方法进行比较以说明算法的有效性.对合成纹理图像给出错分概率作为评价参数.实验结果表明本文方法不但在边缘信息和方向信息保持上有明显改进,而且错分概率明显降低,对真实图像得到了理想的分割效果.     

A wrapper-based approach to image segmentation and classification.

The traditional processing flow of segmentation followed by classification in computer vision assumes that the segmentation is able to successfully extract the object of interest from the background image. It is extremely difficult to obtain a reliable segmentation without any prior knowledge about the object that is being extracted from the scene. This is further complicated by the lack of any clearly defined metrics for evaluating the quality of segmentation or for comparing segmentation algorithms. We propose a method of segmentation that addresses both of these issues, by using the object classification subsystem as an integral part of the segmentation. This will provide contextual information regarding the objects to be segmented, as well as allow us to use the probability of correct classification as a metric to determine the quality of the segmentation. We view traditional segmentation as a filter operating on the image that is independent of the classifier, much like the filter methods for feature selection. We propose a new paradigm for segmentation and classification that follows the wrapper methods of feature selection. Our method wraps the segmentation and classification together, and uses the classification accuracy as the metric to determine the best segmentation. By using shape as the classification feature, we are able to develop a segmentation algorithm that relaxes the requirement that the object of interest to be segmented must be homogeneous in some low-level image parameter, such as texture, color, or grayscale. This represents an improvement over other segmentation methods that have used classification information only to modify the segmenter parameters, since these algorithms still require an underlying homogeneity in some parameter space. Rather than considering our method as, yet, another segmentation algorithm, we propose that our wrapper method can be considered as an image segmentation framework, within which existing image segmentation algorithms may be executed. We show the performance of our proposed wrapper-based segmenter on real-world and complex images of automotive vehicle occupants for the purpose of recognizing infants on the passenger seat and disabling the vehicle airbag. This is an interesting application for testing the robustness of our approach, due to the complexity of the images, and, consequently, we believe the algorithm will be suitable for many other real-world applications.     

Estimating a reference standard segmentation with spatially varying performance parameters: local MAP STAPLE

We present a new algorithm, called local MAP STAPLE, to estimate from a set of multi-label segmentations both a reference standard segmentation and spatially varying performance parameters. It is based on a sliding window technique to estimate the segmentation and the segmentation performance parameters for each input segmentation. In order to allow for optimal fusion from the small amount of data in each local region, and to account for the possibility of labels not being observed in a local region of some (or all) input segmentations, we introduce prior probabilities for the local performance parameters through a new maximum a posteriori formulation of STAPLE. Further, we propose an expression to compute confidence intervals in the estimated local performance parameters. We carried out several experiments with local MAP STAPLE to characterize its performance and value for local segmentation evaluation. First, with simulated segmentations with known reference standard segmentation and spatially varying performance, we show that local MAP STAPLE performs better than both STAPLE and majority voting. Then we present evaluations with data sets from clinical applications. These experiments demonstrate that spatial adaptivity in segmentation performance is an important property to capture. We compared the local MAP STAPLE segmentations to STAPLE, and to previously published fusion techniques and demonstrate the superiority of local MAP STAPLE over other state-of-the-art algorithms.     

基于聚类的网页有意义串提取算法

Since webpage classification is different from traditional text classification with its irregular words and phrases, massive and unlabeled features, which makes it harder for us to obtain effective feature. To cope with this problem, we propose two scenarios to extract meaningful strings based on document clustering and term clustering with multi-strategies to optimize a Vector Space Model (VSM) in order to improve webpage classification. The results show that document clustering work better than term clustering in coping with document content. However, a better overall performance is obtained by spectral clustering with document clustering. Moreover, owing to image existing in a same webpage with document content, the proposed method is also applied to extract image meaningful terms, and experiment results also show its effectiveness in improving webpage classification.     

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

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

Sonar image segmentation using an unsupervised hierarchical MRFmodel

This paper is concerned with hierarchical Markov random field (MRP) models and their application to sonar image segmentation. We present an original hierarchical segmentation procedure devoted to images given by a high-resolution sonar. The sonar image is segmented into two kinds of regions: shadow (corresponding to a lack of acoustic reverberation behind each object lying on the sea-bed) and sea-bottom reverberation. The proposed unsupervised scheme takes into account the variety of the laws in the distribution mixture of a sonar image, and it estimates both the parameters of noise distributions and the parameters of the Markovian prior. For the estimation step, we use an iterative technique which combines a maximum likelihood approach (for noise model parameters) with a least-squares method (for MRF-based prior). In order to model more precisely the local and global characteristics of image content at different scales, we introduce a hierarchical model involving a pyramidal label field. It combines coarse-to-fine causal interactions with a spatial neighborhood structure. This new method of segmentation, called the scale causal multigrid (SCM) algorithm, has been successfully applied to real sonar images and seems to be well suited to the segmentation of very noisy images. The experiments reported in this paper demonstrate that the discussed method performs better than other hierarchical schemes for sonar image segmentation.     

An Unsupervised Classification for Fully Polarimetric SAR Data Using SPAN/H/ IHSL Transform and The FCM Algorithm

 In this paper, the IHSL transform and the Fuzzy C-Means (FCM) segmentation algorithm are combined together to perform the unsupervised classification for fully polarimetric Synthetic Ap-erture Rader (SAR) data. We apply the IHSL colour transform to space to obtain a new space (RGB colour space) which has a uniform distinguishability among inner parameters and contains the whole polarimetric information in Then the FCM algorithm is applied to this RGB space to finish the classification procedure. The main advantages of this method are that the parameters in the color space have similar interclass distinguishability, thus it can achieve a high performance in the pixel based segmentation algorithm, and since we can treat the parameters in the same way, the segmentation procedure can be simplified. The experiments show that it can provide an improved classification result compared with the method which uses the space di-rectly during the segmentation procedure.     

Improved watershed transform for medical image segmentation using prior information

The watershed transform has interesting properties that make it useful for many different image segmentation applications: it is simple and intuitive, can be parallelized, and always produces a complete division of the image. However, when applied to medical image analysis, it has important drawbacks (oversegmentation, sensitivity to noise, poor detection of thin or low signal to noise ratio structures). We present an improvement to the watershed transform that enables the introduction of prior information in its calculation. We propose to introduce this information via the use of a previous probability calculation. Furthermore, we introduce a method to combine the watershed transform and atlas registration, through the use of markers. We have applied our new algorithm to two challenging applications: knee cartilage and gray matter/white matter segmentation in MR images. Numerical validation of the results is provided, demonstrating the strength of the algorithm for medical image segmentation.     

Multi-manifold-based skin classifier on feature space Voronoï regions for skin segmentation

Skin segmentation is a crucial and a challenging step in many face and gesture recognition techniques and it has various applications in human computer interaction, objectionable content filtering, image retrieval and many more. In this article, we propose a novel skin segmentation method, which uses multi-manifold-based skin classification of feature space skin candidate Voronoï regions to achieve accurate skin segmentation. The state-of-the-art skin segmentation techniques reported in this article focus on discrimination between textural feature vectors belonging to skin and non-skin classes. In contrast, the proposed method focuses on discrimination between textural feature vectors belonging to skin and skin-like (non-skin) classes, which lead to higher skin classification accuracy. Furthermore, we introduce a novel image segmentation technique based on spatial and feature space Dirichlet tessellation (also called a Voronoï diagram) to achieve feature space segmentation of skin candidate regions of an image. These feature space segments will then be classified using a multi-manifold-based skin classifier. The proposed skin segmentation method was evaluated on two benchmark skin segmentation data sets and its results were compared with four other state-of-the-art methods proposed for skin segmentation. The experimental results reported in this article confirm that the proposed method outperforms the existing skin segmentation approaches in terms of false alarm rates in the skin segmentation process. Also, the proposed method results in the lowest minimal detection error compared to the existing methods reported in this article.