Optimizing feature selection in video-based recognition using Max-Min Ant System for the online video contextual advertisement user-oriented system

被引:16
作者
Le Nguyen Bao [1 ]
Dac-Nhuong Le [1 ,2 ]
Gia Nhu Nguyen [1 ]
Bhateja, Vikrant [3 ]
Satapathy, Suresh Chandra [4 ]
机构
[1] Duytan Univ, R&D Ctr Visualizat & Simulat, Danang 55000, Vietnam
[2] Haiphong Univ, Haiphong 180000, Vietnam
[3] Shri Ramswaroop Mem Grp Profess Coll, Lucknow 226028, Uttar Pradesh, India
[4] ANITS, Dept Comp Sci, Visakhapatnam 531162, Andhra Pradesh, India
关键词
Contextual advertising; Face recognition (FR); Feature selection (FS); DWT; PZMI; Video-based face recognition (VbFR); Nearest neighbor classifier (NNC); Max-Min Ant System (MMAS); FACE RECOGNITION; DISCRIMINANT-ANALYSIS; EIGENFACES; ALGORITHM;
D O I
10.1016/j.jocs.2016.10.016
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The online-advertising has been grown to focus on multimedia interactive model with through the Internet. Our Online Video Advertisement User-oriented (OVAU) system combined the machine learning model for face recognition from camera, multimedia streaming protocols, and video meta-data storage technology. face recognition (FR) is an importance phase which can to enhance the performance of our system. Feature Selection (FS) problem for FR is solved by MMAS-FS algorithms based-on PZMI and DWT features. The features set are represented by digraph G(E, V). Each node used to show the features, and the ability to choose a combination of features is presented the edges connecting between two adjacent nodes. The heuristic information extracted from the selected feature vector as ant's pheromone. The feature subset optimal is selected by the shortest length features and best presentation of classifier. The best subset used to classify the face recognition used Nearest Neighbor Classifier (NNC). The experiments were analyzed on FS shows that our algorithm can be easily applied without the priori information of features. The execution assessed of our calculation is more effective than previous approaches for Video-based recognition based on FS problem. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:361 / 370
页数:10
相关论文
共 57 条
[1]  
Alelyani S, 2014, CH CRC DATA MIN KNOW, P29
[2]  
Almuallim H., 1991, AAAI-91. Proceedings Ninth National Conference on Artificial Intelligence, P547
[3]  
[Anonymous], INT J INNOV MANAG TE
[4]  
[Anonymous], 2005, THESIS
[5]   A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles [J].
Balachandar, S. Raja ;
Kannan, K. .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 202 (01) :71-77
[6]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[7]   Multidimensional Scaling for Matching Low-Resolution Face Images [J].
Biswas, Soma ;
Bowyer, Kevin W. ;
Flynn, Patrick J. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (10) :2019-2030
[8]   A new LDA-based face recognition system which can solve the small sample size problem [J].
Chen, LF ;
Liao, HYM ;
Ko, MT ;
Lin, JC ;
Yu, GJ .
PATTERN RECOGNITION, 2000, 33 (10) :1713-1726
[9]  
Chen L, 2011, LECT NOTES ARTIF INT, V7106, P580, DOI 10.1007/978-3-642-25832-9_59
[10]  
Chin T.-J., 2006, P 7 INT C AUT FACE G