6 July 2015 KD-tree based clustering algorithm for fast face recognition on large-scale data
Author Affiliations +
Proceedings Volume 9631, Seventh International Conference on Digital Image Processing (ICDIP 2015); 96311I (2015) https://doi.org/10.1117/12.2196995
Event: Seventh International Conference on Digital Image Processing (ICDIP15), 2015, Los Angeles, United States
Abstract
This paper proposes an acceleration method for large-scale face recognition system. When dealing with a large-scale database, face recognition is time-consuming. In order to tackle this problem, we employ the k-means clustering algorithm to classify face data. Specifically, the data in each cluster are stored in the form of the kd-tree, and face feature matching is conducted with the kd-tree based nearest neighborhood search. Experiments on CAS-PEAL and self-collected database show the effectiveness of our proposed method.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yuanyuan Wang, Yuanyuan Wang, Yaping Lin, Yaping Lin, Junfeng Yang, Junfeng Yang, } "KD-tree based clustering algorithm for fast face recognition on large-scale data", Proc. SPIE 9631, Seventh International Conference on Digital Image Processing (ICDIP 2015), 96311I (6 July 2015); doi: 10.1117/12.2196995; https://doi.org/10.1117/12.2196995
PROCEEDINGS
5 PAGES


SHARE
Back to Top