关键词: 计算机应用, 人脸识别, 聚类, 快速检索

Abstract:

An L-K means hierarchy clustering algorithm is proposed to overcome the long time searching in a huge scale face database. By clustering method the whole database is divided into a number of subdatasets. Data redundant technique and predefined threshold are applied to reassign clustering edge elements of into certain subdatasets. Then the searching is only carried out in one or few subdatasets, which greatly reduces the searching time. Experiment results show that the proposed method can significantly reduce the searching range, thus effectively increasing the searching speed while ensuring similar retrieval accuracy as to search the whole database.

Key words: computer application, face recognition, clustering, fast searching