How does facial detection with matrices work?

Superposed_Cat
Messages
388
Reaction score
5
Hi all, there is a facial detection program called eigenfaces that supposedly uses eigenvectors to recognise faces, can anyone here share any intuition on how that works or send a link? Any help apreciated.
 
Physics news on Phys.org
http://en.wikipedia.org/wiki/Eigenface
http://en.wikipedia.org/wiki/Principal_component_analysis

The rough idea is that you start with a bunch of images of faces, and you compare the images, to calculate 'eigenfaces', which are composite faces which vary from the mean in different ways. The critical point is that these composite faces contain as much information per image as possible. So, say you are given 100 images of faces, then you could build new faces using a mix of all 100 faces. But, instead, you could calculate the eigenfaces, and just use the first 5 eigenfaces. And by using a mix of these 5 eigenfaces, you could potentially make (almost) as much variety as you could with the original 100 images. So, in a sense, we are trying to reduce the dimensionality of our problem, while still keeping as much of the information as possible.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top