Emergent Graphs with PCA-features for Improved Face Recognition
Alexander Heinrichs, Marco K. Müller, Andreas H. J. Tewes, Rolf P. Würtz · AIP conference proceedings · 2006
Built on the principles of “Learning from Nature” and “Self‐organization” Elastic Bunch Graph Matching for face recognition is a defining example for Organic Computing methodology. Here, we follow these principles further to advance the method in two respects. First, the requirement for manual annotation of landmarks is reduced to one single face, from which a self‐organizing selection process gradually builds up the bunches by adding the most similar face to the bunch graph and then recalculating the matching. Second, the resulting bunches are replaced by the principal components of the nodes of all persons in the database. The similarity function is restricted to a suitable subset of these components. The additional self‐organizing processes lead to improved precision of landmark localization and recognition rates. Altogether, an improved data structure for face storage has emerged from the simple presentation of examples in a minimally supervised way.