Random sampling for fast face sketch synthesis

PATTERN RECOGNITION

卷:76

Article

Wang, Nannan¹  Gao, Xinbo²  Li, Jie² 

[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;   

DOI  :  10.1016/j.patcog.2017.11.008

来源: Elsevier

【 摘 要 】

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.

【 授权许可】

Free