基于最大熵估计的支持向量机概率建模

提出一种基于最大熵估计的支持向量机概率建模方法．针对传统的支持向量机方法不能提供后验概率的输出问题，从信息熵的角度采用最大熵估计方法，直接对支持向量机输出进行后验概率建模．实验结果表明，与同类算法相比，所提出的基于最大熵估计的概率建模方法具有优良的性能．     

基于最大类间后验交叉熵的阈值化分割算法

从目标和背景的类间差异性出发,提出了一种基于最大类间交叉熵准则的阈值化分割新算法。该算法假设目标和背景象素的条件分布服从正态分布,利用贝叶斯公式估计象素属于目标和背景两类区域的后验概率,再搜索这两类区域后验概率之间的最大交叉熵。比较了新算法与基于最小交叉熵以及基于传统香农熵的阈值化算法的特点和分割性能。     

基于最大类间后验交叉熵的阈值比分割算法

从目标和背景的类间差异性出发,提出了一种基于最大类间交叉熵准则的阈值化分割新算法,算法阈设目标的背景象素的条件分布服从正态分布,利用贝叶期公式估计象素属于目标和背景两类区域的后验概率,再搜索这两为区域后验概率之间的最大交叉熵。比较了新算法一基于最小交叉熵以及基于传统香农熵的阈值化算法的分割性能。     

鉴别性最大后验概率声学模型自适应

为了更加准确地估计最小音素错误最大后验概率(MPE-MAP)自适应算法中的先验分布中心,使自适应后的声学模型参数更为准确,从而提高系统的识别性能,分别采用最大互信息最大后验概率(MMI-MAP)自适应和基于最大互信息准则与最大似然准则相结合的H-criterion最大后验概率(H-MAP)自适应估计先验分布中心,提出了基于最大互信息最大后验概率先验的最小音素错误最大后验概率(MPE-MMI-MAP)和基于H-criterion最大后验概率先验的最小音素错误最大后验概率(MPE-H-MAP)算法。任务自适应实验结果表明,MPE-MMI-MAP和MPE-H-MAP算法的自适应性能均优于MPE-MAP、MMI-MAP和最大后验概率(MAP)自适应方法,分别比MPE-MAP相对提高3.4%和2.7%。     

鉴别性最大后验概率声学模型自适应

为了更加准确地估计最小音素错误最大后验概率(MPE-MAP)自适应算法中的先验分布中心,使自适应后的声学模型参数更为准确,从而提高系统的识别性能,分别采用最大互信息最大后验概率(MMI-MAP)自适应和基于最大互信息准则与最大似然准则相结合的H-criterion最大后验概率(H-MAP)自适应估计先验分布中心,提出了基于最大互信息最大后验概率先验的最小音素错误最大后验概率(MPE-MMI-MAP)和基于H-criterion最大后验概率先验的最小音素错误最大后验概率(MPE-H-MAP)算法。任务自适应实验结果表明,MPE-MMI-MAP和MPE-H-MAP算法的自适应性能均优于MPE-MAP、MMI-MAP和最大后验概率(MAP)自适应方法,分别比MPE-MAP相对提高3.4%和2.7%。     

利用混沌PSO或分解的2维Tsallis灰度熵阈值分割

现有最大Shannon熵或Tsallis熵阈值选取方法没有从类内灰度均匀性出发,而仅依据图像灰度直方图,并且Tsallis熵法的分割效果通常优于Shannon熵法。为此,提出了基于混沌粒子群优化(PSO)和基于分解的两种2维Tsallis灰度熵阈值分割方法。首先,给出了1维Tsallis灰度熵阈值选取方法并将其推广到2维,导出了相应的2维Tsallis灰度熵阈值选取公式及其递推算法;其次,利用混沌PSO算法搜寻2维Tsallis灰度熵法的最佳阈值,并采用递推方式去除迭代过程中适应度函数的冗余运算,大大提高了运行速度;最后,将2维Tsallis灰度熵阈值选取方法的运算转化为两个1维Tsallis灰度熵法的运算,计算复杂度从O(L2)进一步降低到O(L)。实验结果表明,与2维最大Shannon熵法、2维最大Tsallis熵法及2维Tsallis交叉熵法相比,所提出的两种方法可以大幅提高图像分割质量和算法运行速度。     

信息论(五) 第五讲 信息处理

信息处理 5—1 信源剩余度和统计编码方法 研究信源编码的目的是为了提高通信效率,相同字母表的信源,由于概率分布不同和符号间相互关系不同,而熵不同,其中以符号间相互独立且等概率时的熵为最大。在连续消息情况下,最佳分布还与消息的限制条件有关。     

安全通论(7)——黑客篇之“战术研究”

文章精确地描述了黑客的静态形象,即,黑客可以用一个离散随机变量X来描述,这里X的可能取值为{1,2,…,n},概率P_r(X=i)=p_i,并且,p_1+p_2+…+p_n=1。此外,作者还给出了在一定假设下,黑客的最佳动态攻击战术,即,当黑客的资源投入比例为其静态概率分布值时,黑客的"黑产收入"达到最大值。特别是,在投入产出比均匀的前提下,黑客X的熵若减少1比特,那么,他的"黑产收入"就会翻一倍,换句话说,若黑客X的熵H(X)越小,那么,他就越厉害,他能够通过攻击行为获得的"黑产收入"就越高!     

支持向量机中引入后验概率的理论和方法研究

目前支持向量机解决模式识别问题是广大学者研究的热点，样本的后验概率在模式识别中至关重要，但是传统的支持向量机技术不提供后验概率，针对这一问题进行了3个方面的研究：（1）在给出样本点后验概率的基础上，将大规模优化问题分解成最大似然函数和最大分类边界两个规模优化问题；（2）给出了一种新的用后验概率修正最优分离超平面的方法，并且分析了该新方法的合理性；（3）用图像分类的3组实例说明本方法的有效性。     

基于2D-WLDH的最大熵阈值分割算法

在传统二维最大熵图像阈值分割算法中,二维直方图主对角区域的概率和近似为1的假设不够合理,且算法耗时较多.为此,提出一种新的最大熵分割算法.根据灰度级和韦伯局部描述子(WLD)建立二维WLD直方图(2D-WLDH),将其用于最大熵的阈值分割,并设计快速递推算法,以提高运行速度.实验结果表明,该算法的运行时间较少,分割效果较好.     

Reversible watermarking method based on asymmetric-histogram shifting of prediction errors

This paper tries to provide a new perspective for the research of reversible watermarking based on histogram shifting of prediction errors. Instead of obtaining one prediction error for the current pixel, we calculate multiple prediction errors by designing a multi-prediction scheme. An asymmetric error histogram is then constructed by selecting the suitable one from these errors. Compared with traditional symmetric histogram, the asymmetric error histogram reduces the amount of shifted pixels, thus improving the watermarked image quality. Moreover, a complementary embedding strategy is proposed by combining the maximum and minimum error histograms. As the two error histograms shift in the opposite directions during the embedding, some watermarked pixels will be restored to their original values, thus the image quality is further improved. Experimental findings also show that the proposed method re-creates watermarked images of higher quality that carry larger embedding capacity compared to conventional symmetric histogram methods, such as Tsai et al.’s and Luo et al.’s works.     

Seeking multi-thresholds for image segmentation with Learning Automata

This paper explores the use of the Learning Automata (LA) algorithm to compute threshold selection for image segmentation as it is a critical preprocessing step for image analysis, pattern recognition and computer vision. LA is a heuristic method which is able to solve complex optimization problems with interesting results in parameter estimation. Despite other techniques commonly seek through the parameter map, LA explores in the probability space providing appropriate convergence properties and robustness. The segmentation task is therefore considered as an optimization problem and the LA is used to generate the image multi-threshold separation. In this approach, one 1-D histogram of a given image is approximated through a Gaussian mixture model whose parameters are calculated using the LA algorithm. Each Gaussian function approximating the histogram represents a pixel class and therefore a threshold point. The method shows fast convergence avoiding the typical sensitivity to initial conditions such as the Expectation- Maximization (EM) algorithm or the complex time-consuming computations commonly found in gradient methods. Experimental results demonstrate the algorithm’s ability to perform automatic multi-threshold selection and show interesting advantages as it is compared to other algorithms solving the same task.     

An expert system based on fuzzy entropy for automatic threshold selection in image processing

In pattern recognition and image processing, the selection of appropriate threshold is a very significant issue. Especially, the selecting gray-level thresholds is a critical issue for many pattern recognition applications. Here, the maximum fuzzy entropy and fuzzy c-partition methods are used for the aim of the gray-level automatic threshold selection method. The fuzzy theory has been successfully applied to many areas, such as image processing, pattern recognition, computer vision, medicine, control, etc. The images have some fuzziness in nature. In this study, expert maximum fuzzy-Sure entropy (EMFSE) method for the maximum fuzzy entropy and fuzzy c-partition processes in automatic threshold selection is proposed. The experimental studies were conducted on many images by testing maximum fuzzy-Sure entropy against maximum fuzzy-Shannon entropy (MFSHE), maximum fuzzy-Havrada and Charvat entropy (MFHCE) methods for selecting optimum 2-level threshold value, respectively. The obtained experimental results show that the used MFSE method is superior to other MFSHE and MFHCE methods on selecting the 2-level threshold value automatically and effectively.     

基于直方图对的无损数据隐藏在指纹图像中的应用

指纹识别技术是最早的通过计算机实现的身份识别手段,在今天也是应用最为广泛的生物特征识别技术,但是该识别技术仅针对指纹图像本身.研究了在确保指纹图像不变的情况下隐藏信息,从而来提高识别的正确率.主要讲述了指纹图像(JPEG)的无损数据隐藏,采用的方法是直方图对,该方法的核心是构造直方图对从而嵌入信息.实验结果表明,该方法对指纹图像的纹理特征破坏小,嵌入后的图像的视觉失真也较小,图像质量较高,几乎不影响指纹图像的识别,同时可以把嵌入的信息和指纹识别结合起来从而提高身份认证的效率.     

Color image segmentation: advances and prospects

Image segmentation is very essential and critical to image processing and pattern recognition. This survey provides a summary of color image segmentation techniques available now. Basically, color segmentation approaches are based on monochrome segmentation approaches operating in different color spaces. Therefore, we first discuss the major segmentation approaches for segmenting monochrome images: histogram thresholding, characteristic feature clustering, edge detection, region-based methods, fuzzy techniques, neural networks, etc.; then review some major color representation methods and their advantages/disadvantages; finally summarize the color image segmentation techniques using different color representations. The usage of color models for image segmentation is also discussed. Some novel approaches such as fuzzy method and physics-based method are investigated as well.     

融合非局部空间灰度信息的三维Otsu法

为了提高最大类间方差阈值分割法(Otsu)对于图像噪声的鲁棒性,提出融合非局部空间灰度信息的三维Otsu法。该方法利用图像像素的灰度信息、邻域中值灰度信息和非局部空间灰度信息进行直方图统计,构建新颖的三维直方图,采用最大类间方差作为阈值选取准则。实验结果表明新方法对于噪声的鲁棒性要优于原始三维Otsu法,能够获得更加令人满意的分割结果。     

用于特征筛选的最近邻（KNN）法

把基于分类的最近邻（KNN）算法用于模式识别的特征筛选过程,并与传统的基于线性分析的模式识别特征筛选方法主成分回归（PCA）、偏最小二乘法（PLS）和K＿W检验等做比较,证明KNN方法对包容型数据的特征变量筛选尤其有效。为包容型数据的特征筛选提供了一种有力的工具。     

基于S分量指数加权H分量的圆形直方图阈值法

HSI颜色空间可以用三维空间下的圆锥模型进行解释,基于HSI颜色空间的H分量圆形直方图实现彩色图像分割具有可行性。针对HSI颜色空间的H分量圆形直方图毛刺较多以及相关阈值选取准则分割精度较低的问题,给出S分量指数加权H分量的直方图公式,利用S分量信息对H分量直方图的毛刺进行平滑处理,并通过分析给出指数加权因子的最优取值。在此基础上,提出一种圆形直方图阈值分割法,通过对整个圆形直方图进行整体角均值计算而得出新的阈值选取准则。实验结果表明,该圆形直方图阈值分割法具有有效性,在测试数据集上,与3个圆形最大熵阈值分割法以及2个阈值分割准则相比,所提方法的像素精度值平均提高3.2%,结构相似度值平均提高2.5%。     

用于数字图像直方图处理的一种二值映射规则

直方图表示数字图像中每一灰度级与其出现频数间的统计关系，它可给出图像的概貌性描述，而基于直方图修改技术的灰度变换是图像增强的实用而有效的处理方法之一。直方图处理包含均衡化和规定化两种技术。均衡化的目的是使图像像素均匀地分布在所有灰度级上；规定化的目的是将原图像的直方图转变为规定的直方图，以便突出一定灰度范围内的图像。为了进一步提高直方图处理算法的有效性，首先分析了现有的几种数字图像直方图均衡化和规定化算法存在的缺点，然后提出了一种新的二值映射规则(BML)，该规则基于最优控制原理，以直方图误差最小为准则进行灰度映射，实验证明．该规则算法简单，无论是用于直方图均衡化处理．还是用于直方图规定化处理，均较其他映射规则都更为有效。     

A simple automated dynamic threshold extraction method for the classification of large water bodies from landsat-8 OLI water index images

Traditional manual methods of extracting water bodies from remote sensing images cannot satisfy the requirements for mass processing of remote sensing data, and new automated methods are complicated and require a large amount of auxiliary data. The histogram bimodal method is a frequently used objective tool for threshold selection in image segmentation. However, automatically calculating the threshold is difficult because of complex surfaces and image noise, which lead to imperfect twin peaks. To overcome these difficulties, we developed an operational automated water extraction method. This method does not require the identification of twin histogram peaks but instead seeks minimum values in the threshold range to achieve an automated dynamic threshold. We calibrated the method for 18 lakes in China using Landsat 8 Operational Land Imager images, for which the relative error (RE) and coefficient of determination (R²) for threshold accuracy were 2.1% and 0.96, respectively. The RE of area accuracy was 0.59%. The advantages of the method lie in its simplicity and minimal requirements for auxiliary data while still achieving an accuracy comparable to that of other automatic water extraction methods. It can be applied to mass remote sensing data to calculate water thresholds and automatically extract large water bodies.