模式识别与人工智能
Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
Pattern Recognition and Artificial Intelligence
22 Judgement and Disposal of Academic Misconduct Article
22 Copyright Transfer Agreement
22 Proof of Confidentiality
22 Requirements for Electronic Version
More....
22 Chinese Association of Automation
22 National ResearchCenter for Intelligent Computing System
22 Institute of Intelligent Machines,Chinese Academy of Sciences
More....
 
 
2018 Vol.31 Issue.10, Published 2018-10-25

Papers and Reports    Researches and Applications   
   
Papers and Reports
869 Knowledge Programmable Intelligent Chip Systems(KPI-CS): Concept, Architecture and Vision
ZHANG Jun, WANG Fei-Yue

This article proposes the theory and the architecture of Knowledge Programmable Intelligent Chip Systems(KPI-CS). KPI-CS is based on cutting-edge heterogeneous computing and reconfigurable AI chip technologies, fusing complex system computing, knowledge engineering and semiconductor IC design technology. It is aimed at providing adaptability to different application scenarios, flexibility in chip architecture reconfiguration and rationality in AI algorithmic computing capability to support parallel intelligent systems. KPI-CS can provide effective and efficient real-time supporting computing facilities which adapt to different demands in intelligent systems.

2018 Vol. 31 (10): 869-876 [Abstract] ( 595 ) [HTML 1KB] [ PDF 747KB] ( 695 )
877 Bi-level Cascading GAN-Based Heterogeneous Conversion of Sketch-to-Realistic Images
CAI Yuting, CHEN Zhaojiong, YE Dongyi
In the pix2pix framework, edge line images are transformed into realistic ones. Different from the above, hand-drawing sketches are transformed into realistic images in this paper, which is more convenient for human-computer interaction. Firstly, bi-level cascading generative adversarial networks(GAN) are designed to implement the conversion task. The first-level GAN generates coarse-grained realistic images based on the information of the sketches, such as shape and semantic content. The second-level GAN converts the results of the first-level into more vivid high-resolution realistic images. Secondly, in view of the rare availability of "sketch-image" datasets for training the mentioned network, a method is proposed to generate simulated sketch data from a given image automatically. The sketch profile is obtained by improving the holistically nested edge detection algorithm(HED) and then deformed via moving least squares strategy to simulate characteristics of a sketch, such as discernible intention, simple lines and randomness. The experimental results show that using hand-drawing sketches as input, the proposed method outperforms the edge line training based method in terms of rationality and visual reality of the converted results. Moreover, the proposed simulated sketch generating method can be extended to other application areas related to sketch processing.
2018 Vol. 31 (10): 877-886 [Abstract] ( 634 ) [HTML 1KB] [ PDF 1586KB] ( 639 )
887 Cross Language Query Post-Translation Expansion Based on Matrix-Weighted Association Rules
HUANG Mingxuan, JIANG Caoqing, HE Donglei

A computing method for matrix-weighted itemset support is proposed firstly, and the algorithm of matrix-weighted association patterns mining for cross-language query expansion is presented. Then, the algorithm of cross-language query post-translation expansion is put forward based on matrix-weighted association rules mining. The first cross-language retrieval is performed to obtain the top initially retrieved documents(TIRDs) by machine translation, and the relevance feedback documents(RFDs) are gained from TIRDs by user correlation judgment. The matrix-weighted frequent itemsets containing original query terms are mined from RFDs by means of computing support and the association rules with original query terms are extracted from frequent itemsets according to the evaluation framework of confidence-interest. To implement cross-language query post-translation expansion, the consequents or antecedents of the rules are treated as expansion terms and the importance of the expansion terms is measured by the confidence and interest of the rule. Experiments on NTCIR-5 CLIR standard test set show that the proposed algorithm improves the performance of cross-language query expansion, and it is beneficial in cross-language retrieval of long queries. The performance of post-translation consequent expansion is better than that of the antecedent one.

2018 Vol. 31 (10): 887-898 [Abstract] ( 403 ) [HTML 1KB] [ PDF 871KB] ( 318 )
899 Long-Term Tracking Algorithm Based on Correlation Filter
LI Na, WU Lingfeng, LI Daxiang
Based on the kernelized correlation filter(KCF) algorithm, a long-term tracking algorithm combining target re-detection is proposed. Firstly, the histogram of oriented gradient features and LAB color information are fused, the appearance model is established and scale estimation is added to cope with the changes of object scale. Then, the peak ratio is introduced to control the start of re-detection module and a correlation filter model is re-learned by extracting Harris corners. Finally, the occluded object is continuously tracked with the proposed model updating strategy. Comparison experiments on OTB datasets show that the proposed algorithm produces higher tracking accuracy and is suitable for long-term tracking with occlusion.
2018 Vol. 31 (10): 899-908 [Abstract] ( 549 ) [HTML 1KB] [ PDF 2495KB] ( 414 )
909 Particle Swarm Optimization with Search Operator of Improved Pigeon-Inspired Algorithm
MA Long, LU Caiwu, GU Qinghua, RUAN Shunling
The standard particle swarm optimization is easy to have problems of low convergence speed and precision, prematurity and poor exploring ability during later period. Aiming at these problems, an optimized particle swarm optimization based on improved pigeon search operator is proposed. Population initialization is determined by Beta opposition-based learning strategy, and the diversity of population distribution is realized. The map compass operator is improved by the linear and nonlinear mutation strategy to improve the development and the exploration ability of the pigeon-inspired algorithm. Then, the location and the speed are updated by the improved combination optimization operator to speed up the convergence, enhance the precision and avoid falling into local optimal solution in the particle swarm optimization. Simulation experimental results show that the convergence speed is improved by IPSO, and the accuracy reaches the ideal value set by the functions.
2018 Vol. 31 (10): 909-920 [Abstract] ( 511 ) [HTML 1KB] [ PDF 935KB] ( 508 )
Researches and Applications
921 Personalized Learning Resource Recommendation Method Based on Stage Evolution Bidirectional Self-balancing
LI Haojun, ZHANG Zheng, ZHANG Pengwei

The existing personalized learning resource recommendation methods have problems of single model and low speed and matching degree. Therefore a personalized learning resource recommendation method based on stage evolution bidirectional self-balancing(EBPLRM-M) is proposed. Firstly, a personalized learning resource recommendation model is built based on stage evolution bidirectional self-balancing. The parameterized representations of resource recommendation features and fitness functions are improved. Then, a fuzzy adaptive binary particle swarm optimization algorithm based on evolutionary state determination is adopted to optimize the model. Finally, simulation results show that EBPLRM-M has higher matching degree and recommended speed compared with the recommendation methods adopting the classical algorithms.

2018 Vol. 31 (10): 921-932 [Abstract] ( 426 ) [HTML 1KB] [ PDF 880KB] ( 354 )
933 Interactive Leaf Segmentation Using Robust Random Walk
HU Jing, CHEN Zhibo, ZHANG Rongguo, YANG Meng

Segmenting the plant leaf by a fixed model is problematic due to different imaging conditions, such as backgrounds, shadows and reflections. In this paper,interactive plant leaf segmentation method based on robust random walk is proposed. The interactive strategy is employed to propagate prior information of user-specified pixel, and robust random walk algorithm is used to realize plant leaf segmentation. The relationship of pairwise pixels is considered based on random walk and a super-pixel-consistent constraint is added to make the edges of segmentation smooth. Since the random walk algorithm only considers pairwise pixel relations, it is sensitive to the specified and connected pixels. The prior information of specified pixel is obtained through human-machine interaction. On the basis of random walk model, a log-likelihood ratio is used to predict the probability of a pixel belonging to the background and guide the label propagation. Experiments on plant leaf images in loose controlled and uncontrolled environments show that the proposed method obtains smoother and more robust plant leaf segmentation images than other methods.

2018 Vol. 31 (10): 933-940 [Abstract] ( 492 ) [HTML 1KB] [ PDF 1989KB] ( 406 )
941 EEG Emotion Recognition Based on Sparse Group Lasso-Granger Causality Feature
GUO Jinliang, FANG Fang, WANG Wei, HE Hanna
Aiming at the current feature extraction based on the functional network level of single brain region, a sparse group lasso-granger causality method is proposed to extract the causal relation among different brain regions as the characteristics of EEG at the effectual brain network level. The α, β and γ EEG bands of participants are extracted. The sparse group lasso algorithm is used to filter the obtained values of the cascade causality measures to acquire high correlation feature subsets as the emotion classification features. Finally the SVM classifier is utilized for emotion classification. Moreover, the ReliefF(filter feature selection) algorithm is employed to select an effective EEG channels to reduce the computational time complexity. The experiments show that the proposed method obtains a higher average emotion classification accuracy on the Valence-Arousal two-dimensional emotion model, and the classification result of the proposed method is better than that of the contrast EEG features. The extracted emotion EEG features can effectively recognize the subjects in different emotional states.
2018 Vol. 31 (10): 941-949 [Abstract] ( 650 ) [HTML 1KB] [ PDF 870KB] ( 652 )
950 Rough Co-training Model for Incomplete Weakly Labeled Data
GAO Can, ZHOU Jie, GAO Tianyu, LAI Zhihui
To address the problem of learning from incomplete weakly labeled data, a semi-supervised co-training model based on rough set theory is proposed. A semi-supervised discernibility matrix is firstly defined and then used to generate two sufficient and diverse semi-supervised reducts. The base classifiers are trained on the labeled data with two reducts, and then the two classifiers are learned from each other on the unlabeled data by labeling the confident unlabeled examples to its concomitant until no eligible unlabeled example is available. Experimental results on selected UCI datasets show that the proposed model achieves better performance on incomplete weakly labeled data compared with other models, and the effectiveness of the proposed model is verified.
2018 Vol. 31 (10): 950-957 [Abstract] ( 456 ) [HTML 1KB] [ PDF 761KB] ( 372 )
958 Action Recognition Fused with RGB-D Multi-modal Features and Radius-Margin Bounded Extreme Learning
LIU Tianliang, CHEN Kehu, DAI Xiubin, LUO Jiebo

An exemplars multiple kernel learning-extreme learning machine(MKL-ELM) based human action recognition approach with multi-modal visual feature fusion from RGB-D videos is proposed to solve the problem of single modal visual feature with the limited discrimination ability for all categories of human actions. Firstly, the robust and dense moving pose features with human skeleton surface fitting and dense trajectories from human motion are extracted. The sparse histogram of oriented principal component(SHOPC) features of 3D body geometry with the normal plane of dense point clouds is perceived and the histogram of 3D gradient orientation(HOG3D) features embedded with human appearance textures on spatial temporal neighbor of body nodes in the given videos is extracted. The modified MKL-ELM with radius-margin bound is exploited to fuse the given multi-modal visual features. Then, the set of the representative exemplars for each human action is mined with the contrast data technique. Finally, each sample is hierarchically classified by the designed exemplars-MKL-ELM model with greedy prediction strategy to recognize the human actions with the fused features and the given exemplars. The experiments show that compared with the traditional methods, the proposed action recognition method has significant advantages with high classification accuracy and computational efficiency.

2018 Vol. 31 (10): 958-964 [Abstract] ( 413 ) [HTML 1KB] [ PDF 653KB] ( 446 )
模式识别与人工智能
 

Supervised by
China Association for Science and Technology
Sponsored by
Chinese Association of Automation
NationalResearchCenter for Intelligent Computing System
Institute of Intelligent Machines, Chinese Academy of Sciences
Published by
Science Press
 
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn