Terrorists Team members: Ágnes Bartha György Kovács Imre Hajagos Wojciech Zyla.

Slides:



Advertisements
Similar presentations
EigenFaces and EigenPatches Useful model of variation in a region –Region must be fixed shape (eg rectangle) Developed for face recognition Generalised.
Advertisements

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
EE462 MLCV Lecture 5-6 Object Detection – Boosting Tae-Kyun Kim.
Rapid Object Detection using a Boosted Cascade of Simple Features Paul Viola, Michael Jones Conference on Computer Vision and Pattern Recognition 2001.
Rapid Object Detection using a Boosted Cascade of Simple Features Paul Viola, Michael Jones Conference on Computer Vision and Pattern Recognition 2001.
Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction.
Face Detection & Synthesis using 3D Models & OpenCV Learning Bit by Bit Don Miller ITP, Spring 2010.
Low Complexity Keypoint Recognition and Pose Estimation Vincent Lepetit.
Face Recognition and Biometric Systems
AdaBoost & Its Applications
Face detection Many slides adapted from P. Viola.
Cos 429: Face Detection (Part 2) Viola-Jones and AdaBoost Guest Instructor: Andras Ferencz (Your Regular Instructor: Fei-Fei Li) Thanks to Fei-Fei Li,
EE462 MLCV Lecture 5-6 Object Detection – Boosting Tae-Kyun Kim.
The Viola/Jones Face Detector Prepared with figures taken from “Robust real-time object detection” CRL 2001/01, February 2001.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm Lecture #20.
The Viola/Jones Face Detector (2001)
Dimensionality Reduction Chapter 3 (Duda et al.) – Section 3.8
HCI Final Project Robust Real Time Face Detection Paul Viola, Michael Jones, Robust Real-Time Face Detetion, International Journal of Computer Vision,
Face Recognition Under Varying Illumination Erald VUÇINI Vienna University of Technology Muhittin GÖKMEN Istanbul Technical University Eduard GRÖLLER Vienna.
Principal Component Analysis
CS 790Q Biometrics Face Recognition Using Dimensionality Reduction PCA and LDA M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Robust Real-time Object Detection by Paul Viola and Michael Jones ICCV 2001 Workshop on Statistical and Computation Theories of Vision Presentation by.
Face detection and recognition Many slides adapted from K. Grauman and D. Lowe.
A Robust Real Time Face Detection. Outline  AdaBoost – Learning Algorithm  Face Detection in real life  Using AdaBoost for Face Detection  Improvements.
Face Recognition using PCA (Eigenfaces) and LDA (Fisherfaces)
Adaboost and its application
CS 223B Assignment 1 Help Session Dan Maynes-Aminzade.
A Robust Real Time Face Detection. Outline  AdaBoost – Learning Algorithm  Face Detection in real life  Using AdaBoost for Face Detection  Improvements.
Robust Real-Time Object Detection Paul Viola & Michael Jones.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Face Recognition: An Introduction
Foundations of Computer Vision Rapid object / face detection using a Boosted Cascade of Simple features Presented by Christos Stoilas Rapid object / face.
Face Detection CSE 576. Face detection State-of-the-art face detection demo (Courtesy Boris Babenko)Boris Babenko.
FACE DETECTION AND RECOGNITION By: Paranjith Singh Lohiya Ravi Babu Lavu.
Facial Recognition CSE 391 Kris Lord.
CS 485/685 Computer Vision Face Recognition Using Principal Components Analysis (PCA) M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
SVD(Singular Value Decomposition) and Its Applications
Face Detection using the Viola-Jones Method
A Tutorial on Object Detection Using OpenCV
EADS DS / SDC LTIS Page 1 7 th CNES/DLR Workshop on Information Extraction and Scene Understanding for Meter Resolution Image – 29/03/07 - Oberpfaffenhofen.
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition by D. Tao, X. Li, and J. Maybank, TPAMI 2007 Presented by Iulian Pruteanu.
Detecting Pedestrians Using Patterns of Motion and Appearance Paul Viola Microsoft Research Irfan Ullah Dept. of Info. and Comm. Engr. Myongji University.
Access Control Via Face Recognition Progress Review.
Window-based models for generic object detection Mei-Chen Yeh 04/24/2012.
Lecture 29: Face Detection Revisited CS4670 / 5670: Computer Vision Noah Snavely.
Robust Real-time Face Detection by Paul Viola and Michael Jones, 2002 Presentation by Kostantina Palla & Alfredo Kalaitzis School of Informatics University.
Classification Course web page: vision.cis.udel.edu/~cv May 12, 2003  Lecture 33.
ECE738 Advanced Image Processing Face Detection IEEE Trans. PAMI, July 1997.
Face Recognition: An Introduction
CSE 185 Introduction to Computer Vision Face Recognition.
Automated Solar Cavity Detection
Adaboost and Object Detection Xu and Arun. Principle of Adaboost Three cobblers with their wits combined equal Zhuge Liang the master mind. Failure is.
Lecture 09 03/01/2012 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
The Viola/Jones Face Detector A “paradigmatic” method for real-time object detection Training is slow, but detection is very fast Key ideas Integral images.
Bibek Jang Karki. Outline Integral Image Representation of image in summation format AdaBoost Ranking of features Combining best features to form strong.
Hand Gesture Recognition Using Haar-Like Features and a Stochastic Context-Free Grammar IEEE 高裕凱 陳思安.
PCA vs ICA vs LDA. How to represent images? Why representation methods are needed?? –Curse of dimensionality – width x height x channels –Noise reduction.
FACE DETECTION : AMIT BHAMARE. WHAT IS FACE DETECTION ? Face detection is computer based technology which detect the face in digital image. Trivial task.
Lecture 10 Pattern Recognition and Classification II
A Brief Introduction on Face Detection Mei-Chen Yeh 04/06/2010 P. Viola and M. J. Jones, Robust Real-Time Face Detection, IJCV 2004.
Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin, South Korea Copyright © solarlits.com.
2D-LDA: A statistical linear discriminant analysis for image matrix
Hand Detection with a Cascade of Boosted Classifiers Using Haar-like Features Qing Chen Discover Lab, SITE, University of Ottawa May 2, 2006.
2. Skin - color filtering.
PRESENTED BY Yang Jiao Timo Ahonen, Matti Pietikainen
Recognition: Face Recognition
Feature space tansformation methods
A Tutorial on Object Detection Using OpenCV
Lecture 29: Face Detection Revisited
Presentation transcript:

Terrorists Team members: Ágnes Bartha György Kovács Imre Hajagos Wojciech Zyla

The Project What is our goal? Who are they? How to start? How ro recognize face? –Face detection –Face feature detection –Eyes, mouth, nose related search

What is our goal? Find out if someone is a terrorist. Try to identify then even if they are disguised We have a problem..

Who are they? They are who –Blow up cars, buildings –Kill people –Undertake control Enough reason to do something

How to start? Database –Images of terrorist –Training images for identification ( by computer) Take a picture of suspicious person Start to do a program that decides if someone is a terrorist

How to recognize face? Problems –Disguised person –Other : rotated head, glasses. Use some algorithms –PCA –LDA OpenCV –Haar object detection –AdaBoot

PCA Principal Component Analysis reduce the dimensionality of the data while retaining as much as possible of the variation present in the original dataset implies information loss The best low-dimensional space can be determined by the "best„ eigenvectors of the covariance matrix (i.e., the eigenvectors corresponding to the "largest" eigenvalues, also called "principal components"). PCA projects the data along the directions where the data varies the most.

Problems of Eigenface technique Sensitive to rotation, scale and translation. Sensitive to lighting variations Background interference Face images should be preprocessed to lessen the effects of possible variations. Variations such as lighting and rotation can also be taken into account during training. The training dataset may include samples with such variations.

LDA Linear Discriminant Analysis The objective of LDA is to perform dimensionality reduction while preserving as much of the class discriminatory information as possible It seeks to find directions along which the classes are best separated. It does so by taking into consideration the scatter within-classes but also the scatter between-classes. It is also more capable of distinguishing image variation due to person identity from variation due to other sources such as illumination and expression. μr mean feature vector for class r. Kr number of training samples from class r. LDA computes a transformation that maximizes the between-class scatter while minimizing the within-class scatter:

LDA 2. Limitations: –at most R−1 nonzero eigenvalues. –matrix S w -1 does not always exist. need at least N +R training samples – not practical Use PCA to reduce dimention When the number of training samples is large and representative for each class, LDA outperforms PCA.

OpenCV Open Source Computer Vision Library –Extensive vision suport Convolution, thresholding, floodfills, histogramming Pyramidal-subsampling Learning-based vision Feature detection –Edge detection –Blob finders,..... –Haar cascade classifier

IplImage

OpenCV -- Haar OpenCV has a Haar features based face detection module. Uses local features such as edges and line patterns. It scans a given image at different scales as in template matching. Scale, translation and light invariant. However it is sensitive to rotation. –Rotate image and run again

Advantages of using OpenCV Haar object detection Face detector already implemented Its only argument is a xml file Detection at any scale Face detection (for videos) at 15 frames per second for 384*288 pixel images 90% objects detected – achievable doing 2 weeks training

Haar-Like Features Each Haar-like feature consists of two or three jointed “black” and “white” rectangles: The value of a Haar-like feature is the difference between the sum of the pixel gray level values within the black and white rectangular regions: f(x)=Sum black rectangle (pixel gray level) – Sum white rectangle (pixel gray level) Compared with raw pixel values, Haar-like features can reduce/increase the in-class/out-of-class variability, and thus making classification easier. Figure 1: A set of basic Haar-like features. Figure 2: A set of extended Haar-like features.

Haar-Like Features The rectangle Haar-like features can be computed rapidly using “integral image”. Integral image at location of x, y contains the sum of the pixel values above and left of x, y, inclusive: Haar features computed in constant time The sum of pixel values within “D”: AB C D P2P2 P3P3 P4P4 P1P1 P (x, y)

Adaboost classifier Selects a small number of critical visual features Combines a collection of weak classification functions to form a strong classifier The first and second features selected by AdaBoost for face detection

2. Haar-Like Features (cont’d) For example: to detect hand, the image is scanned by a sub-window containing a Haar-like feature. Based on each Haar-like feature f j, a weak classifier h j (x) is defined as: where x is a sub-window, and θ is a threshold. p j indicating the direction of the inequality sign.

Adaboost The computation cost using Haar-like features: Example: original image size: 320X240, sub-window size: 24X24, The total number of sub-windows with one Haar-like feature per second: (320-24)X(240-24)=63,936 Considering the scaling factor and the total number of Haar-like features, the computation cost is huge. AdaBoost (Adaptive Boost) is an iterative learning algorithm to construct a “strong” classifier using only a training set and a “weak” learning algorithm. A “weak” classifier with the minimum classification error is selected by the learning algorithm at each iteration. AdaBoost is adaptive in the sense that later classifiers are tuned up in favor of those sub-windows misclassified by previous classifiers.

Adaboost The algorithm:

 Adaboost starts with a uniform distribution of “ weights ” over training examples. The weights tell the learning algorithm the importance of the example.  Obtain a weak classifier from the weak learning algorithm, h j (x).  Increase the weights on the training examples that were misclassified.  (Repeat)  At the end, carefully make a linear combination of the weak classifiers obtained at all iterations. Adaboost

Simple to implement But.. –Suboptimal solution –Over fit in presence of noise

The Cascade of Classifiers A series of classifiers are applied to every sub-window. Increases speed The first classifier eliminates a large number of negative sub-windows and pass almost all positive sub-windows (high false positive rate) with very little processing. Subsequent layers eliminate additional negatives sub-windows (passed by the first classifier) but require more computation. After several stages of processing the number of negative sub-windows have been reduced radically.

The Cascade of Classifiers Negative samples: non-object images. Negative samples are taken from arbitrary images. These images must not contain object representations. Positive samples: images contain object (hand in our case). The hand in the positive samples must be marked out for classifier training.

image detecting face detecting features creating cropping face normalizing feature vector Database of terrorists comparing vectors results is not in the database 144x150 90x x256

Eye detection with Haar eye_haarcascade_classifier create a growable sequence of eyes detect the objects store them in the sequence

Thank you for your attention