By Topic

Quick Searching Based on L-K Means Hierarchical Clustering in a Huge Scale Face Database

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xiaohua Liu ; Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun ; Chunguang Zhou ; Libiao Zhang ; Huipeng Sheng
more authors

The L-K means hierarchy clustering is proposed to decrease the long time of searching in a huge scale face database by reducing retrieving range. The database is divided into several sub sets after clustering. One-step split is used to divide the massive sub set into a few of small sets. Data redundant technology and predefined thresh are worked on a class's edge elements which will be re-signed into some categories for correctly searching in sets. The experiment results show that the proposed methods can effectively improve the searching speed while ensuring similar retrieval accuracy to search in the whole database.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008