A comparative study of DIGNET, average, complete, single hierarchical and k-means clustering algorithms in 2D face image recognition

Konstantinos-Georgios Thanos; Stelios C. A. Thomopoulos

doi:10.1117/12.2050303

20 June 2014 A comparative study of DIGNET, average, complete, single hierarchical and k-means clustering algorithms in 2D face image recognition

Konstantinos-Georgios Thanos, Stelios C. A. Thomopoulos

Author Affiliations +

Proceedings Volume 9091, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIII; 90910Z (2014) https://doi.org/10.1117/12.2050303
Event: SPIE Defense + Security, 2014, Baltimore, MD, United States

Abstract

The study in this paper belongs to a more general research of discovering facial sub-clusters in different ethnicity face databases. These new sub-clusters along with other metadata (such as race, sex, etc.) lead to a vector for each face in the database where each vector component represents the likelihood of participation of a given face to each cluster. This vector is then used as a feature vector in a human identification and tracking system based on face and other biometrics. The first stage in this system involves a clustering method which evaluates and compares the clustering results of five different clustering algorithms (average, complete, single hierarchical algorithm, k-means and DIGNET), and selects the best strategy for each data collection. In this paper we present the comparative performance of clustering results of DIGNET and four clustering algorithms (average, complete, single hierarchical and k-means) on fabricated 2D and 3D samples, and on actual face images from various databases, using four different standard metrics. These metrics are the silhouette figure, the mean silhouette coefficient, the Hubert test Γ coefficient, and the classification accuracy for each clustering result. The results showed that, in general, DIGNET gives more trustworthy results than the other algorithms when the metrics values are above a specific acceptance threshold. However when the evaluation results metrics have values lower than the acceptance threshold but not too low (too low corresponds to ambiguous results or false results), then it is necessary for the clustering results to be verified by the other algorithms.

Citation Download Citation

Konstantinos-Georgios Thanos and Stelios C. A. Thomopoulos "A comparative study of DIGNET, average, complete, single hierarchical and k-means clustering algorithms in 2D face image recognition", Proc. SPIE 9091, Signal Processing, Sensor/Information Fusion, and Target Recognition XXIII, 90910Z (20 June 2014); https://doi.org/10.1117/12.2050303

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
19 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Signal to noise ratio

Principal component analysis

Detection and tracking algorithms

Image resolution

Facial recognition systems

Databases

Optical spheres

Show All Keywords

Keywords/Phrases

Search In:

Publication Years