Efficient multilevel image segmentation through fuzzy entropy maximization and graph cut optimization

The fuzzy c-partition entropy has been widely adopted as a global optimization technique for finding the optimized thresholds for multilevel image segmentation. However, it involves expensive computation as the number of thresholds increases and often yields noisy segmentation results since spatial coherence is not enforced. In this paper, an iterative calculation scheme is presented for reducing redundant computations in entropy evaluation. The efficiency of threshold selection is further improved through utilizing the artificial bee colony algorithm as the optimization technique. Finally, instead of performing thresholding for each pixel independently, the presented algorithm oversegments the input image into small regions and uses the probabilities of fuzzy events to define the costs of different label assignments for each region. The final segmentation results is computed using graph cut, which produces smooth segmentation results. The experimental results demonstrate the presented iterative calculation scheme can greatly reduce the running time and keep it stable as the number of required thresholds increases. Quantitative evaluations over 20 classic images also show that the presented algorithm outperforms existing multilevel segmentation approaches.     

Explicit solution of relative entropy weighted control

We consider the minimization over probability measures of the expected value of a random variable, regularized by relative entropy with respect to a given probability distribution. In the general setting we provide a complete characterization of the situations in which a finite optimal value exists and the situations in which a minimizing probability distribution exists. Specializing to the case where the underlying probability distribution is Wiener measure, we characterize finite relative entropy changes of measure in terms of square integrability of the corresponding change of drift. For the optimal change of measure for the relative entropy weighted optimization, an expression involving the Malliavin derivative of the cost random variable is derived. The theory is illustrated by its application to several examples, including the case where the cost variable is the maximum of a standard Brownian motion over a finite time horizon. For this example we obtain an exact optimal drift, as well as an approximation of the optimal drift through a Monte-Carlo algorithm.     

Entropy of fluidized bed—a measure of particles mixing

The paper presents an attempt to define the physical entropy of the dense phase of a fluidized bed, based on liquid-like properties of fluidized systems. The quantity U was used as the analogy of temperature in classical thermodynamics. The obtained expression for physical entropy was compared to the correlation suggested for the Kolmogorov entropy in bubbling bed.     

在线用户兴趣多样性的实证研究

在线用户的群体兴趣对于分析在线社会网络以及个性化推荐至关重要。研究的目的是引入信息熵这一指标来准确度量用户兴趣的多样性。分别在电影网站MovieLens和音乐网站Last．FM数据上进行实证分析,即统计度相同的用户所选产品的信息熵值。MovieLens的结果表明,随着用户度的增加,熵值出现先上升后下降的趋势,即度小的用户和度大的用户的兴趣比较专一,而一般用户的兴趣较为多样;而Last．FM的结果表明,度小用户的兴趣非常多样,但随着用户听过的音乐数量越多,兴趣越明确。通过建立随机模型与实证结果进行比较,可以发现绝大多数用户在真实数据集上的兴趣的多样性比随机情况要大,可见用户的兴趣对用户行为模式的影响显著。     

基于动态特性的D-LTSV语音端点检测方法

端点检测是语音信号处理的一个关键环节。为提高语音在低性噪比以及非平稳噪声环境下的端点检测性能,在长时信号变化特征(LTSV)的基础上提出一种新的D-LTSV语音端点检测方法。采用Bartlett-Welch方法估计语音谱,分析语音谱在长时域上的熵,利用倒谱的动态特性分析方法提取连续帧熵值的动态变化特征。实验结果表明,D-LTSV综合考虑了语音的非平稳性和帧间非平稳性的动态变化情况,具有比LTSV更好的分辨能力,特别是在低性噪比和非平稳噪声的环境下,D-LTSV的分辨能力提升了50.77%,能够准确地进行端点检测,具有更强的鲁棒性。     

代数约简的条件信息熵表示及其高效约简算法

给出如何保持正区域不变的语义分析,提出一种修正条件信息熵计算公式,证明保持修正条件信息熵不变与保持正区域不变相互等价。在此基础上,给出代数约简概念的修正条件信息熵表示。给出反例说明修正条件信息熵不具有单调性,导致没法给出自底向上的启发式约简算法,证明了代数协调集中不可删除属性的不可逆性质,提出一种自顶向下直接删除属性的高效约简算法。它从所有条件属性集出发,逐步删除不必要的属性,只需遍历各属性一次,即可保证得到原始决策表的一个代数约简。数值算例和实验验证了该算法的正确性和高效性。     

最大熵和条件随机场模型相融合的藏文人名识别

藏文人名识别是藏文信息处理领域研究的难点之一,其识别效果直接影响到藏文自动分词的精度和相关应用系统的性能,包括藏汉翻译、藏文信息检索、文本分类等。该文在分析藏文人名构成规律和特点的基础上,提出了一种最大熵和条件随机场相融合的藏文人名识别方法。实验表明,该方法可以获取较好的识别效果,在我们的测试集上F-测度值到达了93.08%。     

基于熵值模糊评判法的地域通信网脆弱性评估磁

地域通信网作为一种复杂网络系统,具有复杂性、模糊性和多变性等特性,对其脆弱性评估指标赋权时,如果主观性较强,就容易出现与实际数据不相符的现象。针对这一情况,提出将熵值模糊综合评判法应用于地域通信网脆弱性评估。依据地域通信网的实际情况,建立层次化的脆弱性指标体系,在此基础上建立模糊集合及隶属度矩阵。运用熵值法对评价指标进行赋权,依次得到各层指标模糊评价,求得评估结果的数值。该方法充分保证了评估指标权重的客观性,能够更准确、方便地描述地域通信网的脆弱性。     

基于传播模拟的消息流行度预测

社交网络中的消息流行度预测问题对于信息推荐和病毒式营销等应用具有重要意义。该文提出了一种基于传播模拟的消息流行度预测方法,首先使用最大熵模型学习并预测用户转发消息的概率,然后使用独立级联传播模型在真实的社会网络上模拟消息的传播过程,从而完成消息流行度的预测。该方法的优点在于更充分的利用了社会网络的结构和用户特征信息。该文在Twitter数据集上的实验结果表明,相对于基准方法,该文提出的方法具有更高的准确率和稳定性。