The application of DBF neural networks for object recognition

On the basis of DBF nets proposed by Wang Shoujue, the model and properties of DBF neural network were discussed in this paper. When applied in pattern recognition, the algorithm and implement on hardware were presented respectively. We did experiments on recognition of omnidirectionally oriented rigid objects on the same level, using direction basis function neural networks, which acts by the method of covering the high dimensional geometrical distribution of the sample set in the feature space. Many animal and vehicle models (even with rather similar shapes) were recognized omnidirectionally thousands of times. For total 8800 tests, the correct recognition rate is 98.75%, the error rate and the rejection rate are 0.5% and 1.25% respectively. (C) 2003 Elsevier Inc. All rights reserved.

Geometrical learning, descriptive geometry, and biomimetic pattern recognition

Studies on learning problems from geometry perspective have attracted an ever increasing attention in machine learning, leaded by achievements on information geometry. This paper proposes a different geometrical learning from the perspective of high-dimensional descriptive geometry. Geometrical properties of high-dimensional structures underlying a set of samples are learned via successive projections from the higher dimension to the lower dimension until two-dimensional Euclidean plane, under guidance of the established properties and theorems in high-dimensional descriptive geometry. Specifically, we introduce a hyper sausage like geometry shape for learning samples and provides a geometrical learning algorithm for specifying the hyper sausage shapes, which is then applied to biomimetic pattern recognition. Experimental results are presented to show that the proposed approach outperforms three types of support vector machines with either a three degree polynomial kernel or a radial basis function kernel, especially in the cases of high-dimensional samples of a finite size. (c) 2005 Elsevier B.V. All rights reserved.

Biomimetic (topological) pattern recognition - A new model of pattern recognition theory and its application

A new theoretical model of Pattern Recognition principles was proposed, which is based on "matter cognition" instead of "matter classification" in traditional statistical Pattern Recognition. This new model is closer to the function of human being, rather than traditional statistical Pattern Recognition using "optimal separating" as its main principle. So the new model of Pattern Recognition is called the Biomimetic Pattern Recognition (BPR)(1). Its mathematical basis is placed on topological analysis of the sample set in the high dimensional feature space. Therefore, it is also called the Topological Pattern Recognition (TPR). The fundamental idea of this model is based on the fact of the continuity in the feature space of any one of the certain kinds of samples. We experimented with the Biomimetic Pattern Recognition (BPR) by using artificial neural networks, which act through covering the high dimensional geometrical distribution of the sample set in the feature space. Onmidirectionally cognitive tests were done on various kinds of animal and vehicle models of rather similar shapes. For the total 8800 tests, the correct recognition rate is 99.87%. The rejection rate is 0.13% and on the condition of zero error rates, the correct rate of BPR was much better than that of RBF-SVM.

A criterion for local interconvertibility between all-tripartite Gaussian states

We arrive at a necessary and sufficient criterion that can be readily used for interconvertibility between general, all-tripartite Gaussian states under local quantum operation. The derivation involves a systematic reduction that converts the original complex conditions in high-dimensional, 6n x 6n matrix space eventually into 2 x 2 matrix problems.

Manifold covering theory in biomimetic pattern recognition

We describe a new model which is based on the concept of cognizing theory. The method identifies subsets of the data which are embedded in arbitrary oriented lower dimensional space. We definite manifold covering in biomimetic pattern recognition, and study its property. Furthermore, we propose this manifold covering algorithm based on Biomimetic Pattern Recognition. At last, the experimental results for face recognition demonstrates that the correct rejection rate of the test samples excluded in the classes of training samples is very high and effective.

Cognitive models in biomimetic pattern cognition

We describe a new model which is based on the concept of cognizing theory. The method identifies subsets of the data which are embedded in arbitrary oriented lower dimensional space. We definite k-mean covering, and study its property. Covering subsets of points are repeatedly sampled to construct trial geometry space of various dimensions. The sampling corresponding to the feature space having the best cognition ability between a mode near zero and the rest is selected and the data points are partitioned on the basis of the best cognition ability. The repeated sampling then continues recursively on each block of the data. We propose this algorithm based on cognition models. The experimental results for face recognition demonstrate that the correct rejection rate of the test samples excluded in the classes of training samples is very high and effective.

Discriminative Orthogonal Neighborhood-Preserving Projections for Classification

Orthogonal neighborhood-preserving projection (ONPP) is a recently developed orthogonal linear algorithm for overcoming the out-of-sample problem existing in the well-known manifold learning algorithm, i.e., locally linear embedding. It has been shown that ONPP is a strong analyzer of high-dimensional data. However, when applied to classification problems in a supervised setting, ONPP only focuses on the intraclass geometrical information while ignores the interaction of samples from different classes. To enhance the performance of ONPP in classification, a new algorithm termed discriminative ONPP (DONPP) is proposed in this paper. DONPP 1) takes into account both intraclass and interclass geometries; 2) considers the neighborhood information of interclass relationships; and 3) follows the orthogonality property of ONPP. Furthermore, DONPP is extended to the semisupervised case, i.e., semisupervised DONPP (SDONPP). This uses unlabeled samples to improve the classification accuracy of the original DONPP. Empirical studies demonstrate the effectiveness of both DONPP and SDONPP.

Self-assembly of rod-coil-rod ABA-type triblock copolymers

Self-assembled behavior of symmetric ABA rod-coil-rod triblock copolymer melts is studied by applying self-consistent-field lattice techniques in three-dimensional space. The phase diagram is constructed to understand the effects of the chain architecture on the self-assembled behavior. Four stable structures are observed for the ABA rod-coil-rod triblock, i.e., spherelike, lamellar, gyroidlike, and cylindrical structures. Different from AB rod-coil diblock and BAB coil-rod-coil triblock copolymers, the lamellar structure observed in ABA rod-coil-rod triblock copolymer melts is not stable for high volume fraction of the rod component (f(rod)=0.8), which is attributed to the intramolecular interactions between the two rod blocks of the polymer chain.

Study of self-assembly of symmetric coil-rod-coil ABA-type triblock copolymers by self-consistent field lattice method

The self-assembly of symmetric coil-rod-coil ABA-type triblock copolymer melts is studied by applying self-consistent field lattice techniques in a three-dimensional space. The self-assembled ordered structures differ significantly with the variation of the volume fraction of the rod component, which include lamellar, wave lamellar, gyroid, perforated lamellar, cylindrical, and spherical-like phases. To understand the physical essence of these phases and the regimes of occurrence, we construct the phase diagram, which matches qualitatively with the existing experimental results. Compared with the coil-rod AB diblock copolymer, our results revealed that the interfacial grafting density of the separating rod and coil segments shows important influence on the self-assembly behaviors of symmetric coil-rod-coil ABA triblock copolymer melts. We found that the order-disorder transition point changes from f(rod)=0.5 for AB diblock copolymers to f(rod)=0.6 for ABA triblock copolymers. Our results also show that the spherical-like and cylindrical phases occupy most of the region in the phase diagram, and the lamellar phase is found stable only at the high volume fraction of the rod.

Applications of the method of three-dimensional projection of a molecule in quantitative structure-activity relationship of phenol derivatives

Five variables for phenol derivatives were calculated by molecular projection in three-dimensional space which were combined with eight quantum-chemical parameters and three Am indices. These variables were selected by using leaps-and-bounds regression analysis. Multiple linear regression analysis and artificial neural networks' were performed, and the results obtained by using. artificial neural networks are superior than that obtained by using multiple linear regression.

离群模糊核聚类算法

一般说来,离群点是远离其他数据点的数据,但很可能包含着极其重要的信息.提出了一种新的离群模糊核聚类算法来发现样本集中的离群点.通过Mercer核把原来的数据空间映射到特征空间,并为特征空间的每个向量分配一个动态权值,在经典的FCM模糊聚类算法的基础上得到了一个特征空间内的全新的聚类目标函数,通过对目标函数的优化,最终得到了各个数据的权值,根据权值的大小标识出样本集中的离群点.仿真实验的结果表明了该离群模糊核聚类算法的可行性和有效性.

An Improved Ce/Se Scheme And Its Application To Detonation Propagation

An improved two-dimensional space-time conservation element and solution element ( CE/ SE) method with second-order accuracy is proposed, examined and extended to simulate the detonation propagations using detailed chemical reaction models. The numerical results of planar and cellular detonation are compared with corresponding results by the Chapman-Jouguet theory and experiments, and prove that the method is a new reliable way for numerical simulations of detonation propagation.

Pattern Recognition With Weighted Complex Networks

In this paper we introduce a weighted complex networks model to investigate and recognize structures of patterns. The regular treating in pattern recognition models is to describe each pattern as a high-dimensional vector which however is insufficient to express the structural information. Thus, a number of methods are developed to extract the structural information, such as different feature extraction algorithms used in pre-processing steps, or the local receptive fields in convolutional networks. In our model, each pattern is attributed to a weighted complex network, whose topology represents the structure of that pattern. Based upon the training samples, we get several prototypal complex networks which could stand for the general structural characteristics of patterns in different categories. We use these prototypal networks to recognize the unknown patterns. It is an attempt to use complex networks in pattern recognition, and our result shows the potential for real-world pattern recognition. A spatial parameter is introduced to get the optimal recognition accuracy, and it remains constant insensitive to the amount of training samples. We have discussed the interesting properties of the prototypal networks. An approximate linear relation is found between the strength and color of vertexes, in which we could compare the structural difference between each category. We have visualized these prototypal networks to show that their topology indeed represents the common characteristics of patterns. We have also shown that the asymmetric strength distribution in these prototypal networks brings high robustness for recognition. Our study may cast a light on understanding the mechanism of the biologic neuronal systems in object recognition as well.

An Extension of Self-Organizing Maps to Categorical Data

Self-organizing maps (SOM) have been recognized as a powerful tool in data exploratoration, especially for the tasks of clustering on high dimensional data. However, clustering on categorical data is still a challenge for SOM. This paper aims to extend standard SOM to handle feature values of categorical type. A batch SOM algorithm (NCSOM) is presented concerning the dissimilarity measure and update method of map evolution for both numeric and categorical features simultaneously.

Triangle Evolution-A Hybrid Heuristic for Global Optimization

Abstract This paper presents a hybrid heuristic{triangle evolution (TE) for global optimization. It is a real coded evolutionary algorithm. As in di®erential evolution (DE), TE targets each individual in current population and attempts to replace it by a new better individual. However, the way of generating new individuals is di®erent. TE generates new individuals in a Nelder- Mead way, while the simplices used in TE is 1 or 2 dimensional. The proposed algorithm is very easy to use and e±cient for global optimization problems with continuous variables. Moreover, it requires only one (explicit) control parameter. Numerical results show that the new algorithm is comparable with DE for low dimensional problems but it outperforms DE for high dimensional problems.