返回
Learning predictable binary codes for face indexing
DOI:10.1016/j.patcog.2015.03.016.png)
摘要
En 中文
High dimensional dense features have been shown to be useful for face recognition, but result in high query time when searching a large-scale face database. Hence binary codes are often used to obtain fast query speeds as well as reduce storage requirements. However, binary codes for face features can become unstable and unpredictable due to face variations induced by pose, expression and illumination. This paper proposes a predictable hash code algorithm to map face samples in the original feature space to Hamming space. First, we discuss the 'predictability' of hash codes for face indexing. Second, we formulate the predictable hash coding problem as a non-convex combinatorial optimization problem, in which the distance between codes for samples from the same class is minimized while the distance between codes for samples from different classes is maximized. An Expectation Maximization method is introduced to iteratively find a sparse and predictable linear mapping. Lastly, a deep feature representation is learned to further enhance the predictability of binary codes. Experimental results on three commonly used face databases demonstrate the superiority of our predictable hash coding algorithm on large-scale problems. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Binary codes
Hashing
Face index
Large scale
Feature learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Cardiac Protection by Preconditioning Is Generated via an Iron-Signal Created by Proteasomal Degradation of Iron Proteins
PLoS ONE
IF0
Deep phenotyping of synovial molecular signatures by integrative systems analysis in rheumatoid arthritis通过类风湿关节炎的整合系统分析对滑膜分子特征进行深度表型分析
Rheumatology
IF0

