Revision history [back]

Hi all, i hope that this is the right place where post this question, otherwise, if the post is inappropriate, please explain me why. For my thesis i'm facing the problem of face recognition in an embedded context in particular in a Intel Galileo Board. I experiment that face recognition in this board is time consuming and that is not possible to think a real-time face recognition. My intention is to measure the average time for recognition using the online face databases, as for example the yaledatabase and AT&T; i've already found a paper that addresses this issue. But before doing this i want to understand if there are paper or books that speak about time complexity of algorithms implemented in opencv (Eigenfaces, Fisherfaces and LocalBinaryPatternHistogram). I searched through the web an answer to this question but i've not found yet. If someone knows this theme and wants to help me, i thanks him in advance.