模式识别与人工智能
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.4, Published 2018-04-25

Papers and Reports    Researches and Applications    Surveys and Reviews   
   
Papers and Reports
293 Coding Scheme for Compressive Sensing Depth Video Based on Adaptive Bits Allocation
WANG Kang, LAN Xuguang, LI Xiangwei
By utilizing the compressive sensing in the depth video, the compressive sensing depth video(CSDV) is obtained. However, the redundancy of CSDV is still huge. A coding scheme for compressive sensing depth video(CSDV) based on Gaussian mixture models(GMM) and object edges is proposed. Firstly, the compressive sensing(CS) is utilized to compress 8 depth frames to acquire a CSDV frame in the temporal direction. A whole CSDV frame is divided into a set of non-overlap patches, and object edges in the patches are detected by Canny operator to reduce the computational complexity of quantization. Then, variable bits for different patches are allocated based on the percentages of non-zero pixels in every patch. The GMM is employed to model the CSDV frame patches and design product vector quantizers to quantize CSDV frames.
2018 Vol. 31 (4): 293-299 [Abstract] ( 524 ) [HTML 1KB] [ PDF 3102KB] ( 382 )
300 Fusing Continuous Region Characteristics and Background Learning Model for Saliency Computation
JI Chao, HUANG Xinbo, LIU Huiying, ZHANG Huiying, XING Xiaoqiang
To enhance the computational efficiency of saliency model, a continuous region feature and background learning based model is proposed and the salient regions of images are extracted and fused. Firstly, the distance from the target pixel to the pixels of the region around is calculated, and a method for measuring the comparison of saliency based on Bayesian is proposed. The continuity of regions are merged. The void regions are merged with the most similar regions to themselves. Then, three typical saliency algorithms are employed to deal with the same image, and consequently different saliency maps are obtained. The background of each significant feature map is acquired in the contrast way, and the mixed Gauss background model is established. The background maps are obtained by learning weight coefficient, and then the saliency regions are acquired through subtracting background map from the image. Finally, the saliency regions are fused with the cell regulation. The proposed algorithm is validated on public SED1 and ASD datasets. The F-Measure and MAE of the proposed algorithm are superior to those of the current popular algorithms.
2018 Vol. 31 (4): 300-309 [Abstract] ( 397 ) [HTML 1KB] [ PDF 1203KB] ( 651 )
310 Roll-Up and Drill-Down Building Algorithms of Layered Concept Lattice
ZHANG Jialu, WU Xia, ZHONG Jiaming, LU Ruhua
A model of layered concept lattice is established, when the attributes of a formal context can be decomposed into some sub-attributes. The relationship between the original concept lattice and the layered concept lattice is discussed. Two algorithms are proposed: the roll-up algorithm and the drill-down algorithm. In the roll-up algorithm, the upper concept is constructed by the lower concept, and in the drill-down algorithm, the lower concept is constructed by the upper concept. Examples and numerical experiments show that the layered concept lattice model can be used to model complex attribute data. Furthermore, the roll-up algorithm and the drill-down algorithm improve the efficiency of building concept lattice.
2018 Vol. 31 (4): 310-321 [Abstract] ( 489 ) [HTML 1KB] [ PDF 871KB] ( 246 )
322 Co-evolutionary Particle Swarm Optimization for Multitasking
CHENG Meiying, QIAN Qian, NI Zhiwei, ZHU Xuhui

The traditional particle swarm optimization(PSO) and its improved version aim to tackle the single task. With the development of electronic business, online severs need to deal with a batch of requests simultaneously, i.e. multitasking. Different from the parallel computer, the implicit parallelism of PSO is fully exploited, and co-evolution theory is introduced for multitasking. In the multitasking environment, different tasks correspond to different subpopulations, and the useful information is transferred from one subpopulation to another with a certain probability. Thus, co-evolutionary PSO for multitasking(CPSOM) is proposed in this paper. To verify the effectiveness of the proposed algorithm, CPSOM is used to solve a batch of function test problems, feature selection problems and constrained engineering optimization problems. Experimental results show that the useful information can be autonomously transferred from one task to another in the CPSOM environment. Moreover, cooperation of different tasks enhance the solution quality and speed up the convergence.

2018 Vol. 31 (4): 322-334 [Abstract] ( 719 ) [HTML 1KB] [ PDF 1134KB] ( 519 )
Surveys and Reviews
335 Survey of Object Detection Based on Deep Convolutional Network
WU Shuai, XU Yong, ZHAO Dongning

Deep convolutional network is prevalent in object detection task. Region-based convolutional neural network(RCNN) bridges the gap between the classification of deep convolutional network and the object detection task well. Then the whole object detection process is aggregated into a unified deep framework by Faster-RCNN. You only look once(YOLO) and single shot multibox detector(SSD) effectively improve the efficiency of object detection. Different deep object detection frameworks are comprehensively analyzed and divided into two categories: the proposal based framework and the regression based framework. The proposal based framework is utilized to generate thousands of candidate proposals and then classification and bounding box regression are conducted on these proposals. The regression based framework outputs the bounding box position through some special iterations directly. Furthermore, the advantage for different kinds of frameworks is demonstrated through adequate experiments on the mainstream database like PASCAL_VOC and COCO. Finally, the development direction of object detection is discussed.

2018 Vol. 31 (4): 335-346 [Abstract] ( 1134 ) [HTML 1KB] [ PDF 1291KB] ( 1246 )
Researches and Applications
347 PROMETHEE Decision Method Based on Linguistic-Valued Lattice Implication Algebra
ZOU Li, LUO Siyuan, SHI Yuanyuan, REN Yonggong
Aiming at the problem of decision making with comparable and incomparable linguistic-valued information, a multi-attribute decision making method based on linguistic-valued lattice implication algebra(LV(n×2)) is proposed. The linguistic-valued evaluation matrix and its properties on LV(n×2) is discussed, and the priority function and the lattice-valued difference of LV(n×2) are put forward. Taking full account of the attribute value disparity information, the lattice-valued difference is applied to the preference ranking. By utilizing the linguistic-valued vector, linguistic-valued vector synthesis matrix is constructed to deal with multi-expert multi-attribute information in decision-making problems. The linguistic-valued evaluation matrix weighted aggregation operator(LMWAA operator) is introduced to aggregate the linguistic-valued evaluation matrix. Utilizing the noncompensatory nature of preference ranking organization method for enrichment evaluation(PROMETHEE) decision method, a PROMETHEE decision model based on linguistic-valued lattice implication algebra is constructed. The effectiveness and practicability of the proposed method are illustrated by an example of network commodity evaluation.
2018 Vol. 31 (4): 347-357 [Abstract] ( 437 ) [HTML 1KB] [ PDF 828KB] ( 326 )
358 Fuzzy Adaptive Binary Particle Swarm Optimization Algorithm Based on Evolutionary State Determination
LI Haojun, ZHANG Zheng, ZHANG Pengwei, WANG Wanliang
Since the binary particle swarm algorithm is easy to fall into local optimal solution and its convergence performance during later period is poor, a fuzzy adaptive binary particle swarm optimization algorithm based on evolutionary state determination(EFBPSO) is proposed. Population evolution state is determined by fuzzy classification method based on membership function. S-shaped mapping function and large inertia weight value are adopted to improve convergence speed and ensure stability of the algorithm in the earlier stage of the iterative process. V-shaped mapping function and the smaller inertia weight are employed to enhance global exploration ability of the algorithm and avoid the algorithm falling into local optimization in the later stage of iterative process. Simulation experimental results show that EFBPSO possesses higher convergence speed and accuracy and obtains better searching ability to avoid prematurity.
2018 Vol. 31 (4): 358-369 [Abstract] ( 450 ) [HTML 1KB] [ PDF 973KB] ( 429 )
370 Swarm Robotic Behaviour Learning in Search and Pre-Surround Stage for Targets Trapping Task
XUE Songdong, ZHANG Yunzheng, ZENG Jianchao
A strategy for navigation-type collective behaviour learning is developed for swarm robotic coordination in a target search task. Sub-swarms are formed by utilizing the method of dynamic self-organizing task allocation with closed-loop adjusting function, and then a social learning particle swarm optimization based robotic learning strategy is introduced into sub-swarms. In the sub-swarm, all robots are sorted in descending order by the cognition ability of each robot to its common desired target. The robots with better perception of the target are regarded as the behaviour demonstrators. Then, one of the behaviour demonstrators is selected randomly by each robot to learn in every dimension of the working space. Thus, the learning behaviour vector of each robot can be constructed for decision making on its future moving behaviour. The results show that the robot can coordinate with each other and the search efficiency is improved without the global social experience learning.
2018 Vol. 31 (4): 370-378 [Abstract] ( 470 ) [HTML 1KB] [ PDF 922KB] ( 276 )
379 Conditional Generative Adversarial Network Based on Image Semantic Annotation of Cloud Model
DU Qiuping, LIU Qun
As the missing information in the image is increasing, the existing methods extracting information from only a single image can not produce satisfactory completion results. Therefore, an automatic label conditional generative adversarial network(CGAN) based on image semantic is presented from the perspective of multi-granular cognition. It can be applied on image denoising and image completion. Firstly, the multi-layer semantic information from unlabeled images based on the Gaussian cloud transform algorithm is extracted. Then, the original images are segmented and the segmented images are labeled automatically in accordance with different granular semantic information. Furthermore, different granular segmented images and their labels are used as the training samples in the CGAN to get an image probability generation model, respectively. The large missing regions from a single image are completed based on the similar image generated by cloud semantic and CGAN. On the datasets of Caltech-UCSD Birds and Oxford-102flowers, the proposed model achieves the high performance in image denoising and image completion.
2018 Vol. 31 (4): 379-388 [Abstract] ( 587 ) [HTML 1KB] [ PDF 2593KB] ( 448 )
模式识别与人工智能
 

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