By: David Gelbendorf, Hila Ben-Moshe Supervisor : Alon Zvirin 19.10.2015.

Slides:



Advertisements
Similar presentations
Top-Down & Bottom-Up Segmentation
Advertisements

By : Adham Suwan Mohammed Zaza Ahmed Mafarjeh. Achieving Security through Kinect using Skeleton Analysis (ASKSA)
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Automatic Feature Extraction for Multi-view 3D Face Recognition
Facial feature localization Presented by: Harvest Jang Spring 2002.
Each pixel is 0 or 1, background or foreground Image processing to
Automatic in vivo Microscopy Video Mining for Leukocytes * Chengcui Zhang, Wei-Bang Chen, Lin Yang, Xin Chen, John K. Johnstone.
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,
Authers : Yael Pritch Alex Rav-Acha Shmual Peleg. Presenting by Yossi Maimon.
The Viola/Jones Face Detector Prepared with figures taken from “Robust real-time object detection” CRL 2001/01, February 2001.
LYU0603 A Generic Real-Time Facial Expression Modelling System Supervisor: Prof. Michael R. Lyu Group Member: Cheung Ka Shun ( ) Wong Chi Kin ( )
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
Segmentation Divide the image into segments. Each segment:
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
Fitting a Model to Data Reading: 15.1,
MULTIPLE MOVING OBJECTS TRACKING FOR VIDEO SURVEILLANCE SYSTEMS.
Robust Real-Time Object Detection Paul Viola & Michael Jones.
Hand Movement Recognition By: Tokman Niv Levenbroun Guy Instructor: Todtfeld Ari.
Triangle-based approach to the detection of human face March 2001 PATTERN RECOGNITION Speaker Jing. AIP Lab.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Behavior Analysis Midterm Report Lipov Irina Ravid Dan Kotek Tommer.
3-D Computational Vision CSc Canny Edge Detection.
Facial Recognition CSE 391 Kris Lord.
Vision-Based Biometric Authentication System by Padraic o hIarnain Final Year Project Presentation.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
By Yevgeny Yusepovsky & Diana Tsamalashvili the supervisor: Arie Nakhmani 08/07/2010 1Control and Robotics Labaratory.
M ULTIFRAME P OINT C ORRESPONDENCE By Naseem Mahajna & Muhammad Zoabi.
Edit the text with your own short phrases. The animation is already done for you; just copy and paste the slide into your existing presentation. Face Detection,
Detecting Pedestrians Using Patterns of Motion and Appearance Paul Viola Microsoft Research Irfan Ullah Dept. of Info. and Comm. Engr. Myongji University.
CS 6825: Binary Image Processing – binary blob metrics
Lecture 2: Edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Digital Image Processing CCS331 Relationships of Pixel 1.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
Progress Report Development of a Driver Alert System for Road Safety.
Abstract Very important field of research in image processing is the ultrasound image processing. Because of the speckels, that are caused during the.
Non-Photorealistic Rendering and Content- Based Image Retrieval Yuan-Hao Lai Pacific Graphics (2003)
Eurecom, 6 Feb 2007http://biobimo.eurecom.fr Project BioBiMo 1.
Robust Real Time Face Detection
Categorization by Learning and Combing Object Parts B. Heisele, T. Serre, M. Pontil, T. Vetter, T. Poggio. Presented by Manish Jethwa.
Machine Vision Introduction to Using Cognex DVT Intellect.
Creating a Silhouette in Illustrator. Go File>Place and place the photo on the artboard. Select the photo and click Live Trace (its on the tool bar right.
Magic Camera Master’s Project Defense By Adam Meadows Project Committee: Dr. Eamonn Keogh Dr. Doug Tolbert.
Welcome Mill Lesson 15 – Part-2 Computer Aided Manufacturing Using Mastercam.
Presented by: Idan Aharoni
Application of Facial Recognition in Biometric Security Kyle Ferris.
Face Detection Final Presentation Mark Lee Nic Phillips Paul Sowden Andy Tait 9 th May 2006.
SUREILLANCE IN THE DEPARTMENT THROUGH IMAGE PROCESSING F.Y.P. PRESENTATION BY AHMAD IJAZ & UFUK INCE SUPERVISOR: ASSOC. PROF. ERHAN INCE.
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Essential components of the implementation are:  Formation of the network and weight initialization routine  Pixel analysis of images for symbol detection.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
An electronic document that stores various types of data.
Computational Vision CSCI 363, Fall 2012 Lecture 17 Stereopsis II
What you need: In order to use these programs you need a program that sends out OSC messages in TUIO format. There are a few options in programs that.
1 Berger Jean-Baptiste
CIVET seminar Presentation day: Presenter : Park, GilSoon.
Best Practice T-Scan5 Version T-Scan 5 vs. TS50-A PropertiesTS50-AT-Scan 5 Range51 – 119mm (stand- off 80mm / total 68mm) 94 – 194mm (stand-off.
HADI Tutorial Void Inspection Contents 1.Basic Void Inspection Procedure 2.Smooth ROI 3.Background Processing (Flatten BG) 4.Thresholding (Void.
Introduction to Computational and Biological Vision Keren shemesh
High-Level Vision Face Detection.
Find It VR Project (234329) Students: Yosef Albo, Bar Albo
Categorization by Learning and Combing Object Parts
Binary Image processing بهمن 92
Microsoft Excel 101.
Technique 6: General gray-level transformations
Technique 6: General gray-level transformations
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Application of Facial Recognition in Biometric Security
Presentation transcript:

By: David Gelbendorf, Hila Ben-Moshe Supervisor : Alon Zvirin

- GIP sensor: Today we are capable to capture 3D images - We are able to print in 3D, with the right printer - Everyone has a passport photo on he’s I.D card - Why not printing a face in 3D?

 First Stage:  Developing a tool for processing a facial video and printing a 3D face automatically  Input: a 3D record of a frontal face  Output: a 3D printed model of the face  Second Stage:  Wrap the tool in a easy-to-use GUI

- Printing a 3D object requires: - A good 3D image, which contains all face features (eyes, nose and mouth) and with high density

- Printing a 3D object requires: - Smoothness and fullness - The 3D frames are not complete. Many pixels has NAN values and missing data (non-Continuity) - Choosing bounding box

- Printing a 3D object requires: - Transformation of the 3D GIP file to a 3D printer standard format (for instance obj, stl)

Recoding a video Choosing Best Frame Processing frame (creating model) Converting to STL Model ready to print

- How to choose a good frame? - Solution: Use Viola Jones face detection algorithm: - Use VJ for searching facial features - Use VJ for detecting movement of facial features Choosing Best Frame

Profile Face (no detections) True positives + False Positives (double detection of mouth and left eye) Semi-Profile Face with low detection results Choosing Best Frame

Double detection of mouth, no detection of left/right eye No detection of pair of eyes Perfect match (one match for each detector) Choosing Best Frame

Facial features detection: - Scanning each frame for a face, pair of eyes, left eye, right eye, nose and mouth - Sorted by importance : -2: Face and pair of eyes: -1: left eye, right eye, *nose -0.5: Mouth -*0.75: if found more than one nose, there will be penalty -*0.5: if found more than 2 pair of eyes - Grade: normalized to [0..1] Choosing Best Frame

Movement Detection: -Examining difference of VJ detections in adjacent frames (previous and next frames) : -Pair of eyes, left eye, mouth, nose -Calculating the distance of adjacent detections frames (Euclidean metric) -Calculating a grade according to the results. A perfect grade (1.00) will be achieved only if perfect match is found between previous and next frames in all examined features. Choosing Best Frame

- Grades examples: Choosing Best Frame

 The chosen image is a raw 3d image, contains noise, holes and discontinuities.  Goal: automatic filtering of the image in order to create a 3D complete, continuous model Choosing Best Frame Processing Frame

 Challenge: choosing a right bounding box for the desired model (for instance, without background)  Solution: choosing the bounding box automatically with optimization Choosing Best Frame Processing Frame

 Bad Bounding Box (Noise is cut. Also, in the back of the head there is too much information) Choosing Best Frame Processing Frame

 Good Bounding Box: Choosing Best Frame Processing Frame

 Optimization of bounding box:  Specially important for Z axis (depth)  Iterative “exhaustive search” for optimal max Z:  Starting from a min size of max Z, and progressing with max of Z axis  Dividing the min – max range into levels, increasing the max Z value in each iteration  Calculating a grade for each max Z value  Searching for minimum grade  Second option: run constrained optimization to find optimal min and max value for x, y, z (6 variables) Choosing Best Frame Processing Frame

 Searching for minimum Weighted grade according to:  Length of Contour 2D: 0.2  Length of Contour 3D: 0.2  Number of pixels: 0.3  Quadratic Shape of Contour: 0.7 Choosing Best Frame Processing Frame

Choosing Best Frame Processing Frame

 Filtering:  3D filter:  A chosen filter (median, average, raw, beltrami)  Clean Margins  Remove pixels far from the median of their neighbors  Remove pixels with few neighbors  Choose K largest connectivity components  Filling Holes:  cubic interpolation of each 2D connected component Choosing Best Frame Processing Frame

 Problem:  Dark eyebrows: risk for missing data for building the model  Solution:  Detect and fix holes in eyebrows:  Detect eyebrows area with Viola Jones algorithm (by detecting pair of eyes position).  If holes detected, try to fix by moderate filtering. Choosing Best Frame Processing Frame

Choosing Best Frame Processing Frame

 Fixing Eyebrows – Examples (Detect):  Example 1 : eyebrows detection returns true negative (0% missing pixels):  Example 2: eyebrows detection returns true positive (28% missing pixels): Choosing Best Frame Processing Frame

 Fixing Eyebrows –Repair:  Trying to moderate image filtering parameters:  Changing threshold of minimal neighbors from 4 to 2.  Iteratively compute the distance threshold between a pixel and it’s median with is neighbors. Increasing threshold until fraction of missing data <8% or after reaching maximum threshold value. Choosing Best Frame Processing Frame

 Fixing Eyebrows – Examples ( Detect and fix ):  Example 1 : eyebrows detection returns true negative (0% missing pixels):  Example 2: eyebrows detection returns true positive (28% missing pixels):  After fixing, missing pixels fraction decreases to 5.7% Choosing Best Frame Processing Frame

 Fixing Eyebrows – Examples:  Example 3: Final Model with and without fixing Choosing Best Frame Processing Frame

 Fixing Eyebrows – drawbacks:  If Viola Jones algorithm fails to detect pair of eyes detection, eyebrows detection will fail as well.  Moderate filtering may result with a distorted model. Choosing Best Frame Processing Frame

 After bounding box optimization and filtering:  The 3D model is prepared  The Contour of the model is prepared Choosing Best Frame Processing Frame

 Face model is ready, we can transform the model into 3D STL format which is a known standard for 3D models  In the writing process, the 3D model’s points are re- arranged in triangles and their corresponding normals. Choosing Best Frame Processing FrameWriting STL file

 Automatic bounding box may result in a cut face  Automatic filtering process (which is not configured to each face individually) may result with a less accurate model, compared to a model which was filtered manually.  Run-time of the all automatic modules may take a couple of minutes

 Improving run-time of bottlenecks :  Run-time for calculating grade for each frame  Run-time for calculating bounding box  Run-time for writing STL modules  Improving filtering by adjusting parameters for each frame (change some parameters to be dynamic)  Building a better model from several different frames

 All option can be easily operated from the GUI:  Choosing a video  First Option:  Getting a 3D model to print automatically  Second Option:  Edit parameters for each module:  Choose best frame  Choose bounding box (option for manual or automatic bounding box)  Choose file format and save the model to print  Advanced menu to change several parameters

 Viola Jones in Matlab:  on.cascadeobjectdetector-class.html