Discrete wavelet face graph matching

Abstract

We have designed a new face graph model, using the discrete wavelet transform, for fast elastic bunch graph matching. With fiducial points as graph nodes, and local-area power spectrum vectors estimated from a space-frequency tree as node attributes, the DWT graph achieves similar model matching performance to the Gabor graph, but with orders of magnitude faster computation.