KD-tree based clustering algorithm for fast face recognition on large-scale data

Yuanyuan Wang; Yaping Lin; Junfeng Yang

doi:10.1117/12.2196995

6 July 2015 KD-tree based clustering algorithm for fast face recognition on large-scale data

Yuanyuan Wang, Yaping Lin, Junfeng Yang

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.

Citation Download Citation

Yuanyuan Wang, Yaping Lin, and 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); https://doi.org/10.1117/12.2196995

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available