A net-structure learning system for pattern description

This paper discusses a computer program that recognizes and describes two-dimensional patterns composed of subpatterns. The program also recognizes all patterns in a scene consisting of several patterns.

Patterns are stored in a learned hierarchical, net-structure memory. Weighted links between memory nodes represent subpattern/pattern relationships. Both short term and permanent memories are used.

Pattern recognition is accomplished with a serial heuristic search algorithm, which attempts to search memory and compute input properties efficiently. Without special processing, the program can be asked to look for all occurrences of a specified pattern in a scene.     

用于形状识别的目标轮廓无序点集描述与匹配

将目标形状的轮廓看成一个无序的点集,从中抽取形状特征,用于快速而有效的目标识别是形状分析任务中的挑战性问题.针对该问题,提出了一种基于复杂网络模型的形状描述和识别方法.该方法提出用一种自组织的网络动态演化模型构成一个分层的描述框架,在网络动态演化的每一个时刻,对网络分别进行局部测量和全局测量,抽取网络的无权特征和加权特征.在形状匹配阶段,用获得的局部描述子和全局描述子分别进行局部匹配（基于Hausdorff距离）和全局匹配（基于L₁距离）,组合两种匹配的距离值构成对形状的差异度度量.用标准的测试集对所提出的方法进行性能测试,实验结果表明,所提出的算法能够快速而又鲁棒地完成较高精度的形状识别任务.     

目标边界点集的层次化描述及其形状检索应用

提出用于轮廓线形状和区域形状图像检索的形状描述方法,该方法将目标形状的边界（包括内边界）表示为一个无序的点集,沿各方向对点集的迭代分割,建立层次化的边界点集描述模型.通过对各层形状边界的分割比和分散度的几何特征度量,产生各层的形状特征描述,对它们进行组合,建立对目标形状的层次化描述.两个目标形状的差异性度量定义为它们的层次化描述子的L-1距离.该方法具有：（1）通用性.能够描述轮廓线形状和区域形状这两种不同类型的形状;（2）可扩展性.基于所提出的分层描述框架,可以将分割比和分散度这两种几何度量进行扩展,纳入更多其他几何特征度量,以进一步提高形状描述的精度;（3）多尺度描述特性.提出的分层的描述机制,使得描述子具有内在的由粗到细的形状表征能力;（4）较低的计算复杂性.由于仅仅计算目标图像的边界像素点,使得算法具有较高的计算效率.用MPEG-7 CE-2区域形状图像库和MPEG-7 CE-1轮廓线形状图像库这两个标准测试集对该方法进行评估,并与同类的其他形状描述方法进行比较,实验结果表明：提出的方法在综合考虑检索精确率、检索效率和一般应用能力等指标的情况下,其性能上要优于各种参与比较的方法.     

Prototype learning for structured pattern representation applied to on-line recognition of handwritten Japanese characters

This paper describes prototype learning for structured pattern representation with common subpatterns shared among multiple character prototypes for on-line recognition of handwritten Japanese characters. Prototype learning algorithms have not yet been shown to be useful for structured or hierarchical pattern representation. In this paper, we incorporate cost-free parallel translation to negate the location distributions of subpatterns when they are embedded in character patterns. Moreover, we introduce normalization into a prototype learning algorithm to extract true feature distributions in raw patterns to aggregate distributions of feature points to subpattern prototypes. We show that our proposed method significantly improves structured pattern representation for Japanese on-line character patterns.     

Electrocardiogram (ECG) pattern modeling and recognition via deterministic learning

A method for electrocardiogram （ECG） pattern modeling and recognition via deterministic learning theory is presented in this paper. Instead of recognizing ECG signals beat-to-beat, each ECG signal which contains a number of heartbeats is recognized. The method is based entirely on the temporal features （i.e., the dynamics） of ECG patterns, which contains complete information of ECG patterns. A dynamical model is employed to demonstrate the method, which is capable of generating synthetic ECG signals. Based on the dynamical model, the method is shown in the following two phases： the identification （training） phase and the recognition （test） phase. In the identification phase, the dynamics of ECG patterns is accurately modeled and expressed as constant RBF neural weights through the deterministic learning. In the recognition phase, the modeling results are used for ECG pattern recognition. The main feature of the proposed method is that the dynamics of ECG patterns is accurately modeled and is used for ECG pattern recognition. Experimental studies using the Physikalisch-Technische Bundesanstalt （PTB） database are included to demonstrate the effectiveness of the approach.     

基于局部Gabor自适应三值模式的人脸识别

提出一种融合Gabor特征和局部三值模式（LTP）的人脸识别方法,并在算法中对局部三值模式（LTP）进行改进,提出能够自适应阈值的LATP算子。对归一化后的人脸图像进行多尺度、多方向的Gabor滤波提取其对应的幅值特征,在每个幅值图像上进行LATP运算,抽取局部邻域关系模式,这些模式的区域直方图再经过信息熵加权并串联得到最终的人脸描述,识别过程使用[χ2]距离对特征直方图进行相似度匹配。在ORL和Yale人脸数据库上实验,结果表明提出的算法对人脸表情和光照变化具有更好的适应性,对噪声干扰具有更强的鲁棒性。     

Multi-camera calibration based on an invariant pattern

In this paper we present a method for the calibration of multiple cameras based on the extraction and use of the physical characteristics of a one-dimensional invariant pattern which is defined by four collinear markers. The advantages of this kind of pattern stand out in two key steps of the calibration process. In the initial step of camera calibration methods, related to sample points capture, the proposed method takes advantage of using a new technique for the capture and recognition of a robust sample of projective invariant patterns, which allows to capture simultaneously more than one invariant pattern in the tracking area and recognize each pattern individually as well as each marker that composes them. This process is executed in real time while capturing our sample of calibration points in the cameras of our system. This new feature allows to capture a more numerous and robust set of sample points than other patterns used for multi-camera calibration methods. In the last step of the calibration process, related to camera parameters' optimization, we explore the collinearity feature of the invariant pattern and add this feature in the camera parameters optimization model. This approach obtains better results in the computation of camera parameters. We present the results obtained with the calibration of two multi-camera systems using the proposed method and compare them with other methods from the literature.     

Discriminative local binary pattern

Local binary pattern (LBP) is widely used to extract image features as well as motion features in various visual recognition tasks. LBP is formulated in quite a simple form and thus enables us to extract effective features with a low computational cost. There, however, are some limitations mainly regarding sensitivity to noise and loss of image contrast information. In this paper, we propose a novel LBP-based feature extraction method to remedy those drawbacks without degrading the simplicity of the original LBP formulation. LBP is built upon encoding local pixel intensities into binary patterns which can be regarded as separating them into two modes (clusters). We introduce Fisher discriminant criterion to optimize the LBP coding for exploiting binary patterns more stably and discriminatively with robustness to noise. Besides, image contrast information is incorporated in a unified way by leveraging the discriminant score as a weight on the binary pattern; therefore, the prominent patterns, such as around edges, are emphasized. The proposed method is applicable to extract not only image features but also motion features by both efficiently decomposing a XYT volume patch into 2-D patches and employing the effective thresholding strategy based on the volume patch. In the experiments on various visual recognition tasks, the proposed method exhibits superior performance compared to the ordinary LBP and the other methods.     

A kernel autoassociator approach to pattern classification.

Autoassociators are a special type of neural networks which, by learning to reproduce a given set of patterns, grasp the underlying concept that is useful for pattern classification. In this paper, we present a novel nonlinear model referred to as kernel autoassociators based on kernel methods. While conventional non-linear autoassociation models emphasize searching for the non-linear representations of input patterns, a kernel autoassociator takes a kernel feature space as the nonlinear manifold, and places emphasis on the reconstruction of input patterns from the kernel feature space. Two methods are proposed to address the reconstruction problem, using linear and multivariate polynomial functions, respectively. We apply the proposed model to novelty detection with or without novelty examples and study it on the promoter detection and sonar target recognition problems. We also apply the model to mclass classification problems including wine recognition, glass recognition, handwritten digit recognition, and face recognition. The experimental results show that, compared with conventional autoassociators and other recognition systems, kernel autoassociators can provide better or comparable performance for concept learning and recognition in various domains.     

基于组合特征提取与多级SVM的轮胎花纹识别

基于轮胎花纹分类识别在交通与刑事部门的重要作用,提出了一种新的基于组合特征提取与多级SVM的轮胎花纹识别方法。分别采用非下采样Contourlet变换和灰度共生矩阵方法提取轮胎花纹特征;组合两种方法所提取的特征作为图像特征,并从中提取5个有效特征作为最终识别特征;运用提取的5个特征和多级支持向量机分类器完成轮胎花纹的分类识别。新的特征提取方法所得轮胎花纹特征分离度高,用决策树SVM分类器预测分类效果理想,对轮胎花纹的正确分类识别有着重要意义。     

Hierarchical visual event pattern mining and its applications

In this paper, we propose a hierarchical visual event pattern mining approach and utilize the patterns to address the key problems in video mining and understanding field. We classify events into primitive events (PEs) and compound events (CEs), where PEs are the units of CEs, and CEs serve as smooth priors and rules for PEs. We first propose a tensor-based video representation and Joint Matrix Factorization (JMF) for unsupervised primitive event categorization. Then we apply frequent pattern mining techniques to discover compound event pattern structures. After that, we utilize the two kinds of event patterns to address the applications of event recognition and anomaly detection. First we extend the Sequential Monte Carlo (SMC) method to recognition of live, sequential visual events. To accomplish this task we present a scheme that alternatively recognizes primitive and compound events in one framework. Then, we categorize the anomalies into abnormal events (never seen events) and abnormal contexts (rule breakers), and the two kinds of anomalies are detected simultaneously by embedding a deviation criterion into the SMC framework. Extensive experiments have been conducted which demonstrate that the proposed approach is effective as compared to other major approaches.     

基于多尺度轮廓段的形状特征提取与识别

形状识别是计算机视觉与模式识别领域的重要研究内容。形状的特征选取与描述是形状识别的研究热点。针对现有识别方法的不足，提出一种通过对不同长度轮廓段进行描述，进行特征提取的方法。对每个形状均在6种尺度下进行特征提取，每种尺度选取5种轮廓段特征参数，实现了对形状的特征描述。在形状识别阶段，使用动态时间规整（DTW）算法度量形状描述子之间的匹配距离，实现形状识别。分别在Kimia99、Kimia216和MPEG-7数据库中进行算法验证，结果表明基于多尺度轮廓段的形状特征描述子具有旋转、缩放、平移和局部遮挡不变性，识别率优于现有算法。     

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.     

A robotic vision system for object identification and manipulation using synergetic pattern recognition

This paper discusses the application of the synergetic pattern recognition method to a robotic vision system for workpiece identification and manipulation in automated flexible manufacturing environments. The original synergetic algorithm is extended to allow its pattern attention parameters to have different values. Stability analysis of the extended recognition model indicates that the prototype patterns are the only stable patterns and undesired spurious patterns cannot exist. A simple scheme for tuning attention parameters is developed. Simulation results show that the number of object misclassification is reduced significantly with this extension. In addition, an image preprocessing procedure enables synergetic recognition to be simultaneously invariant to spatial pattern translation, rotation, and scaling; while an approach for recovering position, orientation, and size information is also proposed. Simple and efficient task-directed and object-specific strategies for robotic workpiece manipulation are now easy to implement based on these results and procedures.     

Design pattern recovery through visual language parsing and source code analysis

In this paper we propose an approach for recovering structural design patterns from object-oriented source code. The recovery process is organized in two phases. In the first phase, the design pattern instances are identified at a coarse-grained level by considering the design structure only and exploiting a parsing technique used for visual language recognition. Then, the identified candidate patterns are validated by a fine-grained source code analysis phase. The recognition process is supported by a tool, namely design pattern recovery environment, which allowed us to assess the retrieval effectiveness of the proposed approach on six public-domain programs and libraries.     

A sequential pattern mining approach to design taxonomies for hierarchical music genre recognition

In this paper, music genre taxonomies are used to design hierarchical classifiers that perform better than flat classifiers. More precisely, a novel method based on sequential pattern mining techniques is proposed for the extraction of relevant characteristics that enable to propose a vector representation of music genres. From this representation, the agglomerative hierarchical clustering algorithm is used to produce music genre taxonomies. Experiments are realized on the GTZAN dataset for performances evaluation. A second evaluation on GTZAN augmented by Afro genres has been made. The results show that the hierarchical classifiers obtained with the proposed taxonomies reach accuracies of 91.6 % (more than 7 % higher than the performances of the existing hierarchical classifiers).     

Effective pattern recognition and find-density-peaks clustering based blind identification for underdetermined speech mixing systems

In order to achieve high-efficiency blind identification (BI) for underdetermined speech mixing systems without recovery degradation, this paper proposes a novel BI scheme based on effective pattern recognition and the find-density-peaks (FDP) clustering algorithm. To lower BI’s computational complexity, a 3-step effective pattern recognition procedure is proposed, which consists of voiced-sound pattern sifting, spectrum correction based harmonic representation and phase uniformity based single-active-source (SAS) pattern recognition. Furthermore, a 5-step FDP clustering procedure is summarized and utilized to determine the souce number and estimate all the columns of the mixing matrix. Our experimental results showed that, the proposed 3-step effective pattern recognition procedure can condense the original 56383 TF patterns into only 194 effective SAS patterns, which considerably alleviates the computational burden of BI. Moreover, by means of FDP clustering, not only the source number can be intuitively and readily determined, but also the mixing matrix can be estimated with a higher recovery SNR than the existing BI schemes. Due to harmonic-like components are of wide applications, our proposed BI scheme possesses a vast potential in other harmonics-related blind-signal-separation (BSS) fields such as mechanical vibration analysis, channel estimation in communication.     

A hybrid immune model for unsupervised structural damage pattern recognition

This paper presents an unsupervised structural damage pattern recognition approach based on the fuzzy clustering and the artificial immune pattern recognition (AIPR). The fuzzy clustering technique is used to initialize the pattern representative (memory cell) for each data pattern and cluster training data into a specified number of patterns. To improve the quality of memory cells, the artificial immune pattern recognition method based on immune learning mechanisms is employed to evolve memory cells. The presented hybrid immune model (combined with fuzzy clustering and the artificial immune pattern recognition) has been tested using a benchmark structure proposed by the IASC–ASCE (International Association for Structural Control–American Society of Civil Engineers) Structural Health Monitoring Task Group. The test results show the feasibility of using the hybrid AIPR (HAIPR) method for the unsupervised structural damage pattern recognition.