基于动态贝叶斯网络的音视频双模态说话人识别

动态贝叶斯网络在描述具有多个通道的复杂随机过程方面具有优异的性能．基于动态贝叶斯网络进行音视频双模态说话人识别的工作．分析了音视频联合建模的层级结构,利用动态贝叶斯网络对不同层级的音视频关联关系建立模型,并基于该模型进行音视频说话人识别的实验．通过对不同层级的建模过程及说话人识别实验的结果进行分析,结果表明,动态贝叶斯网络为描述音视频间的时序相关性和特征相关性提供了有效的建模方法,在不同语音信噪比的情况下均能提高说话人识别的性能．     

采用变结构动态贝叶斯网络的交通流量预测

物联网和大数据流式计算的快速发展为智能交通系统的研究带来新的机遇。交通流量预测一直是智能交通系统的关键问题。针对交通流量预测中一个固定模型无法适应多种环境的问题,以及面向数据流的模型更新问题,提出了一种基于变结构动态贝叶斯网络的交通流量预测方法。该方法以复杂事件处理和事件上下文为基础,通过上下文聚类进行历史数据的划分,并通过事件流在线聚类支持聚簇的更新。面向不同聚簇的数据,采取搜索-打分的方法学习对应的贝叶斯网络结构,基于高斯混合模型实现贝叶斯网络的近似推断。在线预测时根据当前上下文选择合适的模型或模型组合进行预测。真实和仿真数据上的实验结果表明,该方法能够获得比当前常用方法更好的预测效果。     

贝叶斯网络分类器近似学习算法

贝叶斯网络在很多领域应用广泛,作为分类器更是一种有效的常用分类方法,它有着很高复杂度,这使得贝叶斯网络分类器在应用中受到诸多限制。通过对贝叶斯网络分类器算法的近似处理,可以有效减少计算量,并且得到令人满意的分类准确率。通过分析一种将判别式算法变为产生式算法的近似方法,介绍了这种算法的近似过程,并将其应用在了贝叶斯网分类算法中。接着对该算法进行分析,利用该算法的稳定性特点,提出Bagging-aCLL 集成分类算法,它进一步提高了该近似算法的分类精度。最后通过实验确定了该算法在分类准确率上确有不错的表现。     

基于HMM模型的语音单元边界的自动切分

基于隐尔马可夫模型（HMM）的强制对齐方法被用于文语转换系统（TTS）语音单元边界切分.为提高切分准确性,本文对HMM模型的特征选择,模型参数和模型聚类进行优化.实验表明：12维静态Mel频率倒谱系数（MFCC）是最优的语音特征;HMM模型中的状态模型采用单高斯;对于特定说话人的HMM模型,使用分类与衰退树（CART）聚类生成的绑定状态模型个数在3 000左右最优.在英文语音库中音素边界切分的实验中,切分准确率从模型优化前的77.3%提高到85.4%.     

基于背景模型的自动视频分割方法

提出一种基于背景模型的自动视频分割方法。该方法结合了背景恢复技术和目标跟踪技术进行视频分割。算法分背景重建、运动目标提取、跟踪技术的使用和后处理4个步骤。同时提出了一种新跟踪算法去除大噪声的干扰。文章阐述了方法的基本思想、理论依据和实现。实验表明:该方法具有很好的效果,具有较强实时性。     

利用贝叶斯网络进行遥感变化检测

多时相遥感信息变化检测及其算法探索是当前国际遥感领域研究的热点,但是贝叶斯网络在遥感数据分类、特别是应用在变化检测方面的文献却很少。本文介绍了利用贝叶斯网络的变量间独立性测试原理,构建了输入两个时相多波段遥感信息的有向无环结构,利用训练后的网络进行两个时相多波段遥感变化信息的检测,取得了较好的效果。对北京六环线以内区域,1994年、2003年5种地类变化信息的遥感数据检测和类型转换进行了统计,其中耕地转换为城镇的占整个区域的26.52%,绿地增加占整个区域4.68%,水体减少占整个区域6.78%,导致裸地增加占整个区域4.80%,这个结果也在1∶5万的航空影像和地面上得到了验证。实验结果表明,贝叶斯网络为遥感数据的直接变化检测提供了一种新的途径。     

动态贝叶斯网络的灵敏性分析研究

灵敏性分析是研究复杂系统特性的一种重要方法.现有动态灵敏性分析方法都是针对特定类型的动态贝叶斯网络且计算复杂度高.为了对一般动态贝叶斯网络的灵敏性进行有效分析,提出了一种基于联合树的动态灵敏性分析算法(DSA_JT),DSA_JT算法构建动态网络的联合树,通过消息传播建立参数与目标结点的条件概率分布在时间上的函数关系;DSA_JT将联合概率分布分解成局部概率因式形式,通过降低计算幂次提升计算效率,但计算复杂度仍然偏高.为了更有效地提高动态贝叶斯网络灵敏性分析的计算性能,在DSA_JT算法的框架上提出了DSA_BK算法,DSA_BK算法在灵敏性函数计算过程中,用子系统的概率乘积近似整个系统的联合概率,通过对接口结点局部性的边缘化操作更新模型的联合概率分布,进一步降低了计算幂次,并论证了DSA_BK算法误差的有界性.进而,通过对这两种算法过程的抽象,分别给出了动态灵敏度函数计算公式的证明,表明2种算法可以有效处理一般动态贝叶斯网络的灵敏性分析问题.最后,在上证股票网络上的实验结果显示这2种算法的有效性.     

基于水平集接力的图像自动分割方法

为了实现图像的完全分割,基于无须重新初始化的水平集方法提出了一种接力水平集方法.该方法在待分割图像中自动交替地创建嵌套子区域和相应的初始水平集函数,使水平集函数在其中演化并收敛,然后重复这个过程直到子区域面积为0.与原始算法及经典的基于区域的水平集方法相比,该方法具有如下优点:1) 自动完成,无须交互式的初始化;2) 多次分割图像,能够比原始算法检测到更多的边缘;3) 对于非匀质的图像,能够取得比经典的基于区域的水平集方法更好的分割效果;4) 提供一个开放的分割算法框架,其他单水平集方法稍作修改后也可替换这里所使用的单水平集方法.实验结果表明,此算法对人造图像和医学影像实现了无须交互的完全分割,对非匀质图像分割表现出更好的鲁棒性.     

On Using Multiple Models for Automatic Speech Segmentation

In this paper, we propose a novel approach to automatic speech segmentation for unit-selection based text-to-speech systems. Instead of using a single automatic segmentation machine (ASM), we make use of multiple independent ASMs to produce a final boundary time-mark. Specifically, given multiple boundary time-marks provided by separate ASMs, we first compensate for the potential ASM-specific context-dependent systematic error (or a bias) of each time-mark and then compute the weighted sum of the bias-removed time-marks, yielding the final time-mark. The bias and weight parameters required for the proposed method are obtained beforehand for each phonetic context (e.g., /p/-/a/) through a training procedure where manual segmentations are utilized as the references. For the training procedure, we first define a cost function in order to quantify the discrepancy between the automatic and manual segmentations (or the error) and then minimize the sum of costs with respect to bias and weight parameters. In case a squared error is used for the cost, the bias parameters are easily obtained by averaging the errors of each phonetic context and then, with the bias parameters fixed, the weight parameters are simultaneously optimized through a gradient projection method which is adopted to overcome a set of constraints imposed on the weight parameter space. A decision tree which clusters all the phonetic contexts is utilized to deal with the unseen phonetic contexts. Our experimental results indicate that the proposed method improves the percentage of boundaries that deviate less than 20 ms with respect to the reference boundary from 95.06% with a HMM-based procedure and 96.85% with a previous multiple-model based procedure to 97.07%.     

混合贝叶斯网络在电磁态势估计中的应用

根据电磁态势估计原理,建立含连续值结点和离散值结点的混合贝叶斯网络模型,对一级融合的输出数据进行二级处理,估计干扰前后单架飞机对单个保护目标的威胁的变化情况.首先确定混合贝叶斯网络的结构,然后通过生成服从Dirichlet分布的随机数获得离散值输入结点的先验概率,根据卡尔曼滤波的结果(状态估计向量、估计协方差)确定连续值输入结点的先验概率:在连续值结点均服从线性高斯分布的假设下,通过时非线性、不连续函数进行一阶泰勒级数展开确定中间结点和输出结点的条件概率分布.仿真实验表明,混合贝叶斯网络是解决电磁态势估计问题的一种有效方法,且威胁估计的精度高.     

贝叶斯网络的并行EM学习算法

时间复杂性是基于EM框架的贝叶斯网络学习算法应用的一个瓶颈问题,本文首先提出一种并行的参数EM算法来学习具有缺省数据的贝叶斯网络参数,实验表明该算法可有效降低参数学习的时间复杂性,进而将该算法应用到结构EM算法中,提出一种并行的结构EM算法(PL-SEM),PL-SEM算法并行地计算各个样本的期望充分因子和贝叶斯网络的参数,降低结构学习的时间复杂性.     

Hardware/Software Partitioning Using Bayesian Belief Networks

In heterogeneous system design, partitioning of the functional specifications into hardware (HW) and software (SW) components is an important procedure. Often, an HW platform is chosen, and the SW is mapped onto the existing partial solution, or the actual partitioning is performed in an ad hoc manner. The partitioning approach presented is novel in that it uses Bayesian belief networks (BBNs) to categorize functional components into HW and SW classifications. The BBNpsilas ability to propagate evidence permits the effects of a classification decision that is made about one function to be felt throughout the entire network. In addition, because BBNs have a belief of hypotheses as their core, a quantitative measurement as to the correctness of a partitioning decision is achieved. A methodology for automatically generating the qualitative structural portion of BBN and the quantitative link matrices is given. A case study of a programmable thermostat is developed to illustrate the BBN approach. The outcomes of the partitioning process are discussed and placed in a larger design context, which is called model-based codesign.     

变结构动态贝叶斯网络的机制研究

传统的动态贝叶斯网络(Dynamic Bayesian networks, DBNs)描述的是一个稳态过程,而处理非稳态过程,变结构动态贝叶斯网络更适 用、更灵活、更有效.为了克服现有变结构离散 动态贝叶斯网络推理算法只能处理硬证据的缺陷,本文在深入分析变结构动态贝叶斯网络机制及其特 征的基础上,提出了变结构离散动态贝叶斯网络的 快速推理算法.此外,对变结构动态贝叶斯网络的特例,即数据缺失动态贝叶斯网络进行了定义并构建 了相应的模型.仿真实验验证了变结构离散动态贝 叶斯网络快速推理算法的有效性及计算效率.     

基于动态贝叶斯网络的入侵意图识别方法

在构建高层次攻击场景和处理复杂攻击时,入侵检测技术难以有效察觉入侵者的意图、识别攻击间的语义以及预测下一步攻击。为此,针对网络复杂攻击过程中的不确定性,提出一种基于动态贝叶斯网络的入侵意图识别方法,采用动态贝叶斯有向无环图实时表述攻击行为、意图与攻击目标之间的关联,应用概率推理方法预测入侵者的下一步攻击。实验结果反映入侵者的意图在入侵过程中的变化规律,验证该方法的有效性。     

Semantic Segmentation for Line Drawing Vectorization Using Neural Networks

In this work, we present a method to vectorize raster images of line art. Inverting the rasterization procedure is inherently ill‐conditioned, as there exist many possible vector images that could yield the same raster image. However, not all of these vector images are equally useful to the user, especially if performing further edits is desired. We therefore define the problem of computing an instance segmentation of the most likely set of paths that could have created the raster image. Once the segmentation is computed, we use existing vectorization approaches to vectorize each path, and then combine all paths into the final output vector image. To determine which set of paths is most likely, we train a pair of neural networks to provide semantic clues that help resolve ambiguities at intersection and overlap regions. These predictions are made considering the full context of the image, and are then globally combined by solving a Markov Random Field (MRF). We demonstrate the flexibility of our method by generating results on character datasets, a synthetic random line dataset, and a dataset composed of human drawn sketches. For all cases, our system accurately recovers paths that adhere to the semantics of the drawings.     

Automatic Tumor Segmentation with Deep Convolutional Neural Networks for Radiotherapy Applications

Accurate tumor delineation in medical images is of great importance in guiding radiotherapy. In nasopharyngeal carcinoma (NPC), due to its high variability, low contrast and discontinuous boundaries in magnetic resonance images (MRI), the margin of the tumor is especially difficult to be identified, making the radiotherapy planning a more challenging problem. The objective of this paper is to develop an automatic segmentation method of NPC in MRI for radiosurgery applications. To this end, we present to segment NPC using a deep convolutional neural network. Specifically, to obtain spatial consistency as well as accurate feature details for segmentation, multiple convolution kernel sizes are employed. The network contains a large number of trainable parameters which capture the relationship between the MRI intensity images and the corresponding label maps. When trained on subjects with pre-labeled MRI, the network can estimate the label class of each voxel for the testing subject which is only given the intensity image. To demonstrate the segmentation performance, we carry on our method on the T1-weighted images of 15 NPC patients, and compare the segmentation results against the radiologist’s reference outline. Experimental results show that the proposed method outperforms the traditional hand-crafted features based segmentation methods. The presented method in this paper could be useful for NPC diagnosis and helpful for guiding radiotherapy.     

基于图割与概率图谱的肝脏自动分割研究

提出一种利用均值漂移算法做预处理,将概率图谱与图割算法相结合的肝脏自动分割方法。该方法一方面有效利用概率图谱所代表的形状信息,并且以无参形状建模;另一方面,均值漂移算法对灰度和形状信息组成的综合信息进行过分割处理,利用过分割的区域代替单个像素参与图割算法,降低了优化算法的复杂度。实验结果表明,该方法有效结合了概率图谱和均值漂移算法的优点,提高了图割算法的精度和速度。     

基于神经元网络的汉语组块自动划分

介绍一种基于三层神经元网络的汉语组块自动划分方法。输入信息为句子中每一个字本身及与前后字组合的划分情况,输出为句子中每个字的划分结果。对于一个新输入的汉语句子,在该方法中。并不对句子进行切词,这是与别的组块分析方法的不同之处。实验表明,该方法是可行的。也是有效的。     

Learning Causal Bayesian Networks Using Minimum Free Energy Principle

Constraint-based search methods, which are a major approach to learning Bayesian networks, are expected to be effective in causal discovery tasks. However, such methods often suffer from impracticality of classical hypothesis testing for conditional independence when the sample size is insufficiently large. We present a new conditional independence (CI) testing method that is designed to be effective for small samples. Our method uses the minimum free energy principle, which originates from thermodynamics, with the “Data Temperature” assumption recently proposed by us. This CI method incorporates the maximum entropy principle and converges to classical hypothesis tests in asymptotic regions. In our experiments using repository datasets (Alarm/Insurance/Hailfinder/Barley/Mildew), the results show that our method improves the learning performance of the well known PC algorithm in the view of edge-reversed errors in addition to extra/missing errors.     

Modeling Incomplete Knowledge of Semantic Web Using Bayesian Networks

ABSTRACT

Interoperable ontologies already exist in the biomedical field, enabling scientists to communicate with minimum ambiguity. Unfortunately, ontology languages, in the semantic web, such as OWL and RDF(S), are based on crisp logic and thus they cannot handle uncertain knowledge about an application field, which is unsuitable for the medical domain. In this paper, we focus on modeling incomplete knowledge in the classical OWL ontologies, using Bayesian networks, all keeping the semantic of the first ontology, and applying algorithms dedicated to learn parameters of Bayesian networks in order to generate the Bayesian networks. We use EM algorithm for learning conditional probability tables of different nodes of Bayesian network automatically, contrary to different tools of Bayesian networks where probabilities are inserted manually. To validate our work, we have applied our model on the diagnosis of liver cancer using classical ontology containing incomplete instances, in order to handle medical uncertain knowledge, for predicting a liver cancer.