Flexible array self-organizing map neural network and its application in complex pattern recognition

Due to the fixed array of competing-layer structure, observations distribution features cannot be well reflected by conventional SOM in two-dimensional plane. Aimed at solving this problem, a novel flexible array SOM algorithm (faSOM) is proposed in this paper. This algorithm can adaptively adjust the positions of competing-layer neurons to keep consistent with position of observations. As a result, the neurons in mapping space can maintain the original observation’ features. The faSOM algorithm is successfully applied in pattern recognition of two artificial datasets and red-spotted stonecrop samples. Both theory analysis and experimental results indicate that faSOM is an effective algorithm which can map observation’s inherent feature quickly and accurately. Compared with conventional SOM algorithm, feature mapping effect of faSOM algorithm is much better, because it resolves a typical problem in the conventional SOM that the structure of mapped dataset in competing-layer is distorted.     

A linguistic approach to 3-D object recognition

The principles of a 3-D object recognition system for combined intensity-image and depth-map understanding are discussed. The goal of such system is to be an inversion of image synthesis performed by 3-D computer graphics. A linguistic model for two system elements, the knowledge base and recognition strategy, being an extension of pattern recognition approaches, is outlined. It consists of a powerful object specification language and a simultaneous syntactic-semantic analysis in this language. The syntax is based on a node-controlled parallel structure grammar. Particular attention is paid to elements shared in common by several parts and to hidden line/surface problems. Both are embedded into the grammars derivation. The semantics is well-defined due to the attribution of the grammar.     

Walking pattern classification using a granular linguistic analysis

Classifying walking patterns helps the diagnosis of health status, disease progression and the effect of interventions. In this paper, we develop previous research on human gait to extract a meaningful set of parameters that allow us to design a highly interpretable system capable of identifying different gait styles with linguistic fuzzy if-then rules. The model easily discriminates among five different walking patterns, namely: normal walk, on tiptoes, dragging left limb, dragging right limb, and dragging both limbs. We have carried out a complete experimentation to test the performance of the extracted parameters to correctly classify these five chosen gait styles.     

Evolving pattern recognition systems

A hybrid evolutionary learning algorithm is presented that synthesizes a complete multiclass pattern recognition system. The approach uses a multifaceted representation that evolves layers of processing to perform feature extraction from raw input data, select cooperative sets of feature detectors, and assemble a linear classifier that uses the detectors' responses to label targets. The hybrid algorithm, called hybrid evolutionary learning for pattern recognition (HELPR), blends elements of evolutionary programming, genetic programming, and genetic algorithms to perform a search for an effective set of feature detectors. Individual detectors are represented as expressions composed of morphological and arithmetic operations. Starting with a few small random expressions, HELPR expands the number and complexity of the features to produce a recognition system that achieves high accuracy. Results are presented that demonstrate the performance of HELPR-generated recognition systems applied to the task of classification of high-range resolution radar signals.     

On fingerprint pattern recognition

Stochastic languages have been used for fingerprint classification⁽²⁾. In this note we observe that it is not possible to classify the fingerprint patterns in the absence of accurate registration of the fingerprint.Use of features like downward fork, upward fork, end, etc. have been suggested⁽⁴⁾ for fingerprint classification. It is noted that some of the results are either incorrect or incomplete. Limitations of the various algorithms are presented.     

基于仿生模式识别理论的声调识别

基音频率轨迹能比较真实地反映汉语普通话中的声调特性,通过识别不同的基音轨迹来识别声调,是一种较好的方法。根据仿生模式识别理论,提出用迭代自组织数据分析算法(ISODATA)寻找覆盖区中心,运用多权值神经网络对每个聚类中心实现覆盖的方法,实现四种声调的识别。通过实验与隐马尔科夫模型(HMM)和支持向量机(SVM)算法比较,在少量样本的情况下,能得到相对较高的识别率。     

Some methods for pattern recognition

The present study is dedicated to pattern recognition of alphabetical and numerical symbols. A recognition method based on modification of Hausdorff metrics is presented; then, another method named the method of radial neighborhoods is described. A series of experiments on test patterns are conducted.     

Neural network-based EKG pattern recognition

The highly nonlinear chaotic nature of electrocardiogram (EKG) data represents a well-suited application of artificial neural networks (ANNs) for the detection of normal and abnormal heartbeats. Digitized EKG data were applied to a two-layer feed-forward neural network trained to distinguish between different types of heartbeat patterns. The Levenberg–Marquardt training algorithm was found to provide the best training results. In our study, the trained ANN correctly distinguished between normal heartbeats and premature ventricular contractions in 92% of the cases presented.     

Artificial data for pattern recognition

The paper describes the generation of three types of artificial data and their use as test material in pattern recognition research. Type A data: The user defines the perfect decision surface. The classes are separable and the pdf's flat. This type is useful in two ways: (i) To investigate whether a learning procedure can achieve a minimal-cost solution. (ii) To compare the powers of two classifiers. Type B data: The user defines the optimal decision surface. The classes are not separable; the degree of overlap between the classes can be controlled by the user. The pdf's are approximately flat, except in regions close to this optimal decision boundary. This type is useful in the following ways: (i) To study the effect of varying the overlap between classes upon a learning procedure. (ii) To compare the powers of two classifiers on a random problem. Type C data: This type is a model of natural, clustered data. The user specifies the location, height, and spread of a number of “hills” in the pdf (for each class). These parameters allow us to calculate the pdf's and hence the Bayes' classification, at any given point. This provides a powerful tool for the objective evaluation of a learning classifier, operating on a realistic problem.     

MicroARTMAP for pattern recognition problems

Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implementation of pattern recognition applications have recently been investigated. In this paper, Sanchez’s MicroARTMAP has been discussed as a pattern recognizer/classifier for the image processing problems. The model inherently recognizes only noise free patterns and in case of noise perturbations (rotations/scaling/translation) misclassifies the images. To tackle this problem, a conventional Hu’s moment based rotation/scaling/translation invariant feature extractor has been employed. The potential of this model has been demonstrated on two problems, namely, recognition of alphabets and words and prediction of load from yield pattern of elasto-plastic analysis. The second example concerns with color images dealing with colored patterns. MicroARTMAP is also applied to other two civil engineering problems, namely (a) Indian Standard (IS) classification of soil and (b) prediction of earthquake parameters from the response spectrum in which no feature extractor step is necessary.     

Image normalization for pattern recognition

In general, there are four basic forms of distortion in the recognition of planar patterns: translation, rotation, scaling and skew. In this paper, a normalization algorithm has been developed which transforms pattern into its normal form such that it is invariant to translation, rotation, scaling and skew. After normalization, the recognition can be performed by a simple matching method. In the algorithm, we first compute the covariance matrix of a given pattern. Then we rotate the pattern according to the eigenvectors of the covariance matrix, and scale the pattern along the two eigenvectors according to the eigenvalues to bring the pattern to its most compact form. After the process, the pattern is invariant to translation, scaling and skew. Only the rotation problem remains unsolved. By applying the tensor theory, we find a rotation angle which can make the pattern invariant to rotation. Thus, the resulting pattern is invariant to translation, rotation, scaling and skew. The planar image used in this algorithm may be curved, shaped, a grey-level image or a coloured image, so its applications are wide, including recognition problems about curve, shape, grey-level and coloured patterns. The technique suggested in this paper is easy, does not need much computation, and can serve as a pre-processing step in computer vision applications.