认知任务驱动的fMRI脑功能网络构建方法

针对脑功能网络的构建受到特定大脑图谱对兴趣点描述准确度及覆盖度的限制,提出了基于认知任务信息和神经影像数据的脑功能网络构建方法。首先计算fMRI体素对于认知任务的敏感度,然后在此基础上选取兼顾分布均衡和去中心化的大脑兴趣点,从而构建任务驱动的脑功能网络。实验通过在人脸情绪识别认知任务相关的梭状回构造任务驱动的脑功能网络,其度中心性、聚类系数、全局效率、局部效率这四个复杂网络指标均优于典型大脑图谱梭状回中兴趣点构成的网络。结果表明,计算得到的大脑兴趣点具有更强的整合性,更适合用于表征特定认知任务下的脑功能网络。     

Statistical pattern recognition in remote sensing

Remote sensing with sensors mounted on satellites or aircrafts is much needed for resource management, environmental monitoring, disaster response, and homeland defense. Remote sensing data considered include those from multispectral, hyperspectral, radar, optical, and infrared sensors. Classification is often one of the major tasks in information processing. For example, we need to identify vegetations, waterways, and man-made structures from remote sensing of earth. The large amount of data available makes remote sensing data uniquely suitable for statistical pattern recognition. This paper will address several issues on statistical pattern recognition that are related to information processing in remote sensing. Though the paper is largely tutorial in nature, some specific issues considered are image models for characterization of contextual information, neural networks for image classification, and the performance measures.Either to supplement the capability of sensors or to effectively utilize the enormous amount of sensor data, many advances in statistical pattern recognition can be very useful in machine recognition of the data. The potentials and opportunities of using statistical pattern recognition in remote sensing are indeed unlimited.     

一种融合多源信息的脑效应连接网络蚁群学习算法

脑效应连接(Effective connectivity, EC)网络是人脑连接组研究中一项重要的研究课题,识别脑效应连接网络已成为评价正常脑功能及其与神经退化疾病相关损伤的一种有效手段.针对从功能性磁共振成像数据中进行脑效应连接网络的学习问题,提出了一种将多源信息与蚁群优化过程相融合的学习方法.新方法首先利用弥散张量...     

Minimum classification error learning for sequential data in the wavelet domain

Wavelet analysis has found widespread use in signal processing and many classification tasks. Nevertheless, its use in dynamic pattern recognition have been much more restricted since most of wavelet models cannot handle variable length sequences properly. Recently, composite hidden Markov models which observe structured data in the wavelet domain were proposed to deal with this kind of sequences. In these models, hidden Markov trees account for local dynamics in a multiresolution framework, while standard hidden Markov models capture longer correlations in time. Despite these models have shown promising results in simple applications, only generative approaches have been used so far for parameter estimation. The goal of this work is to take a step forward in the development of dynamic pattern recognizers using wavelet features by introducing a new discriminative training method for this Markov models. The learning strategy relies on the minimum classification error approach and provides re-estimation formulas for fully non-tied models. Numerical experiments on phoneme recognition show important improvement over the recognition rate achieved by the same models trained using maximum likelihood estimation.     

A finite mixture model for simultaneous high-dimensional clustering, localized feature selection and outlier rejection

Model-based approaches and in particular finite mixture models are widely used for data clustering which is a crucial step in several applications of practical importance. Indeed, many pattern recognition, computer vision and image processing applications can be approached as feature space clustering problems. For complex high-dimensional data, however, the use of these approaches presents several challenges such as the presence of many irrelevant features which may affect the speed and also compromise the accuracy of the used learning algorithm. Another problem is the presence of outliers which potentially influence the resulting model’s parameters. For this purpose, we propose and discuss an algorithm that partitions a given data set without a priori information about the number of clusters, the saliency of the features or the number of outliers. We illustrate the performance of our approach using different applications involving synthetic data, real data and objects shape clustering.     

Predictive models for multibiometric systems

Recognizing a subject given a set of biometrics is a fundamental pattern recognition problem. This paper builds novel statistical models for multibiometric systems using geometric and multinomial distributions. These models are generic as they are only based on the similarity scores produced by a recognition system. They predict the bounds on the range of indices within which a test subject is likely to be present in a sorted set of similarity scores. These bounds are then used in the multibiometric recognition system to predict a smaller subset of subjects from the database as probable candidates for a given test subject. Experimental results show that the proposed models enhance the recognition rate beyond the underlying matching algorithms for multiple face views, fingerprints, palm prints, irises and their combinations.     

On possibilities of using pattern recognition methods to study mathematical models

The possibilities of using pattern recognition methods to study mathematical models with a large number of parameters are discussed. The principal point is to study models by constructing phase and parametric portraits. This allows one to solve problems of predicting the states of the object described by the mathematical model in hand and controlling the object and analyzing and studying problems that follow from the particular content of the model. Examples of three mathematical models are given to illustrate this problem.     

3D Hough transform for sphere recognition on point clouds

Three-dimensional object recognition on range data and 3D point clouds is becoming more important nowadays. Since many real objects have a shape that could be approximated by simple primitives, robust pattern recognition can be used to search for primitive models. For example, the Hough transform is a well-known technique which is largely adopted in 2D image space. In this paper, we systematically analyze different probabilistic/randomized Hough transform algorithms for spherical object detection in dense point clouds. In particular, we study and compare four variants which are characterized by the number of points drawn together for surface computation into the parametric space and we formally discuss their models. We also propose a new method that combines the advantages of both single-point and multi-point approaches for a faster and more accurate detection. The methods are tested on synthetic and real datasets.     

Bayesian hypothesis testing for pattern discrimination in brain decoding

Research in cognitive neuroscience and in brain–computer interfaces (BCI) is frequently concerned with finding evidence that a given brain area processes, or encodes, given stimuli. Experiments based on neuroimaging techniques consist of a stimulation protocol presented to a subject while his or her brain activity is being recorded. The question is then whether there is enough evidence of brain activity related to the stimuli within the recorded data. Finding a link between brain activity and stimuli has recently been proposed as a classification task, called brain decoding. A classifier that can accurately predict which stimuli were presented to the subject provides support for a positive answer to the question. However, it is only the answer for a given data set and the question still remains whether it is a general rule that will apply also to new data. In this paper we try to reliably answer the neuroscientific question about the presence of a significant link between brain activity and stimuli once we have the classification results. The proposed method is based on a Beta-Binomial model for the population of generalization errors of classifiers from multi-subject studies within the Bayesian hypothesis testing framework. We present an application on nine brain decoding investigations from a real functional magnetic resonance imaging (fMRI) experiment about the relation between mental calculation and eye movements.     

人工免疫系统:原理、模型、分析及展望

目前，受生物免疫系统启发而产生的人工免疫系统（Artificial ImmuneSystem,AIS)正在兴起，它作为计算智能研究的新领域，提供了一种强大的信息处理和问题求解范式，该文侧重以AIS的基本原理框架为线索，对其研究状况加以系统综述，首先从AIS的生物原型入手，归纳提炼出其仿生机理，主要包括免疫识别，免疫学习，免疫记忆，克隆选择，个体多样性，分布式和自适应等，进而对几种典型的AIS模型和算法分门别类地进行了细致讨论，随后介绍了AIS在若干具有代表性的领域中的应用情况，最后通过对AIS的特性和存在问题的分析，展望了今后的研究重点和发展趋势。     

Discrete data clustering using finite mixture models

Finite mixture models have been applied for different computer vision, image processing and pattern recognition tasks. The majority of the work done concerning finite mixture models has focused on mixtures for continuous data. However, many applications involve and generate discrete data for which discrete mixtures are better suited. In this paper, we investigate the problem of discrete data modeling using finite mixture models. We propose a novel, well motivated mixture that we call the multinomial generalized Dirichlet mixture. The novel model is compared with other discrete mixtures. We designed experiments involving spatial color image databases modeling and summarization, and text classification to show the robustness, flexibility and merits of our approach.     

维度语音情感识别研究综述

情感识别是多学科交叉的研究方向,涉及认知科学、心理学、信号处理、模式识别、人工智能等领域的研究热点,目的是使机器理解人类情感状态,进而实现自然人机交互.首先,从心理学及认知学角度介绍了语音情感认知的研究进展,详细介绍了情感的认知理论、维度理论、脑机制以及基于情感理论的计算模型,旨在为语音情感识别提供科学的情感理论模型;然后,从人工智能的角度,系统地总结了目前维度情感识别的研究现状和发展,包括语音维度情感数据库、特征提取、识别算法等技术要点;最后,分析了维度情感识别技术目前面临的挑战以及可能的解决思路,对未来研究方向进行了展望.     

Computational limitations of model-based recognition

Reliable object recognition is an essential part of most visual systems. Model-based approaches to object recognition use a database (a library) of modeled objects; for a given set of sensed data, the problem of model-based recognition is to identify and locate the objects from the library that are present in the data. We show that the complexity of model-based recognition depends very heavily on the number of object models in the library even if each object is modeled by a small number of discrete features. Specifically, deciding whether a discrete set of sensed data can be interpreted as transformed object models from a given library is NP-complete if the transformation is any combination of translation, rotation, scaling, and perspective projection. This suggests that efficient algorithms for model-based recognition must use additional structure to avoid the inherent computational difficulties. © 1998 John Wiley & Sons, Inc.     

Infinite Liouville mixture models with application to text and texture categorization

This paper addresses the problem of proportional data modeling and clustering using mixture models, a problem of great interest and of importance for many practical pattern recognition, image processing, data mining and computer vision applications. Finite mixture models are broadly applicable to clustering problems. But, they involve the challenging problem of the selection of the number of clusters which requires a certain trade-off. The number of clusters must be sufficient to provide the discriminating capability between clusters required for a given application. Indeed, if too many clusters are employed overfitting problems may occur and if few are used we have a problem of underfitting. Here we approach the problem of modeling and clustering proportional data using infinite mixtures which have been shown to be an efficient alternative to finite mixtures by overcoming the concern regarding the selection of the optimal number of mixture components. In particular, we propose and discuss the consideration of infinite Liouville mixture model whose parameter values are fitted to the data through a principled Bayesian algorithm that we have developed and which allows uncertainty in the number of mixture components. Our experimental evaluation involves two challenging applications namely text classification and texture discrimination, and suggests that the proposed approach can be an excellent choice for proportional data modeling.     

Pattern classification with missing data: a review

Pattern classification has been successfully applied in many problem domains, such as biometric recognition, document classification or medical diagnosis. Missing or unknown data are a common drawback that pattern recognition techniques need to deal with when solving real-life classification tasks. Machine learning approaches and methods imported from statistical learning theory have been most intensively studied and used in this subject. The aim of this work is to analyze the missing data problem in pattern classification tasks, and to summarize and compare some of the well-known methods used for handling missing values.     

Hierarchical models for analysis and recognition of handwritten characters

Different hierarchical models in pattern analysis and recognition are proposed, based on occurrence probability of patterns. As an important application of recognizing handprinted characters, three typical kinds of hierarchical models such asM _89-89,M _89-36 andM _36-36 have been presented, accompanied by the computer algorithms for computing recognition rates of pattern parts. Moreover, a comparative study of their recognition rates has been conducted theoretically; and numerical experiments have been carried out to verify the analytical conclusions made. Various hierarchical models deliberated in this paper can provide users more or better choices of pattern models in practical application, and lead to a uniform computational scheme (or code). The recognition rates of parts can be improved remarkably by a suitable hierarchical model. For the modelM _89-36 in which case some of the Canadian standard handprinted characters have multiple occurrence probabilities, the total mean recognition rates of the given sample may reach 120% of that by the model proposed by Li et al., and 156% of that obtained from the subjective experiments reported by Suen.     

混合模式识别系统研究

讨论基于多种分类方法的模块组合实现的混合模式识别系统，它不同于利用多分类器输出结果表决的集成系统。提出两个系统：一个面向刷体汉字文本识别，另一个面策自由手写体字识别。     

Stochastic models for recognition of occluded targets

Recognition of occluded objects in synthetic aperture radar (SAR) images is a significant problem for automatic target recognition. Stochastic models provide some attractive features for pattern matching and recognition under partial occlusion and noise. In this paper, we present a hidden Markov modeling based approach for recognizing objects in SAR images. We identify the peculiar characteristics of SAR sensors and using these characteristics we develop feature based multiple models for a given SAR image of an object. The models exploiting the relative geometry of feature locations or the amplitude of SAR radar return are based on sequentialization of scattering centers extracted from SAR images. In order to improve performance we integrate these models synergistically using their probabilistic estimates for recognition of a particular target at a specific azimuth. Experimental results are presented using both synthetic and real SAR images.