Share Email Print

Proceedings Paper

KD-tree based clustering algorithm for fast face recognition on large-scale data
Author(s): Yuanyuan Wang; Yaping Lin; Junfeng Yang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 6 July 2015
PDF: 5 pages
Proc. SPIE 9631, Seventh International Conference on Digital Image Processing (ICDIP 2015), 96311I (6 July 2015); doi: 10.1117/12.2196995
Show Author Affiliations
Yuanyuan Wang, Hunan Univ. (China)
Yaping Lin, Hunan Univ. (China)
Junfeng Yang, Hunan Univ. (China)

Published in SPIE Proceedings Vol. 9631:
Seventh International Conference on Digital Image Processing (ICDIP 2015)
Charles M. Falco; Xudong Jiang, Editor(s)

© SPIE. Terms of Use
Back to Top