Random sampling for fast face sketch synthesis

被引:110
作者
Wang, Nannan [1 ]
Gao, Xinbo [2 ]
Li, Jie [2 ]
机构
[1] Xidian Univ, Sch Telecommun Engn, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Sch Elect Engn, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Face sketch synthesis; Locality constraint; Neighbor selection; Random sampling; Weight computation; IMAGE SUPERRESOLUTION;
D O I
10.1016/j.patcog.2017.11.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Exemplar-based face sketch synthesis plays an important role in both digital entertainment and law enforcement. It generally consists of two parts: neighbor selection and recognition weight representation. In this paper, we proposed a simple but effective method which employs offline random sampling instead of K-NN used in state-of-the-art methods. The proposed random sampling strategy reduces the time consuming for synthesis and has stronger scalability than state-of-the-art methods. In addition, we introduced locality constraint to model the distinct correlations between the test patch and random sampled patches. Extensive experiments on public face sketch databases demonstrate the superiority of the proposed method in comparison to state-of-the-art methods, in terms of both synthesis quality and time consumption. The proposed method could be extended to other heterogeneous face image transformation problems such as face hallucination. We release the source codes of our proposed methods and the evaluation metrics for future study online: http://www.ihitworld.com/RSLCR.html. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:215 / 227
页数:13
相关论文
共 40 条
[1]   On automated source selection for transfer learning in convolutional neural networks [J].
Afridi, Muhammad Jamal ;
Ross, Arun ;
Shapiro, Erik M. .
PATTERN RECOGNITION, 2018, 73 :65-75
[2]  
[Anonymous], 2002, Principal components analysis
[3]  
[Anonymous], 2016, IEEE SIGNAL PROCESSI
[4]  
[Anonymous], 2017, P IEEE C COMP VIS PA
[5]  
[Anonymous], 1998, AR FACE DATABASE
[6]  
[Anonymous], 1999, 2 INT C AUD VID BAS
[7]   Super-resolution through neighbor embedding [J].
Chang, H ;
Yeung, DY ;
Xiong, Y .
PROCEEDINGS OF THE 2004 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, 2004, :275-282
[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]   Face Sketch-Photo Synthesis and Retrieval Using Sparse Representation [J].
Gao, Xinbo ;
Wang, Nannan ;
Tao, Dacheng ;
Li, Xuelong .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2012, 22 (08) :1213-1226
[10]   Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval [J].
Gong, Yunchao ;
Lazebnik, Svetlana ;
Gordo, Albert ;
Perronnin, Florent .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (12) :2916-2929