Dan Zhang Supervisor: Prof. Y. Y. Tang 11 th PGDay.

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints
Advertisements

Shapelets Correlated with Surface Normals Produce Surfaces Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Group Meeting Presented by Wyman 10/14/2006
Wavelets Fast Multiresolution Image Querying Jacobs et.al. SIGGRAPH95.
Proposed concepts illustrated well on sets of face images extracted from video: Face texture and surface are smooth, constraining them to a manifold Recognition.
Face Recognition By Sunny Tang.
FMRI Signal Analysis Using Empirical Mean Curve Decomposition Fan Deng Computer Science Department The University of Georgia Introduction.
Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.
Kizhner 1MAPLD 2005/1020 On the Hilbert-Huang Transform Theoretical Developments Semion Kizhner, Karin Blank, Thomas Flatley, Norden E. Huang, David Petrick.
Nonstationary Signal Processing Hilbert-Huang Transform Joseph DePasquale 22 Mar 07.
The Hilbert Transform and Empirical Mode Decomposition: Suz Tolwinski University of Arizona Program in Applied Mathematics Spring 2007 RTG Powerful Tools.
On Empirical Mode Decomposition and its Algorithms
ICIP 2000, Vancouver, Canada IVML, ECE, NTUA Face Detection: Is it only for Face Recognition?  A few years earlier  Face Detection Face Recognition 
SURF: Speeded-Up Robust Features
Phase-Based Level Set Segmentation of Ultrasound Images
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Face Recognition Under Varying Illumination Erald VUÇINI Vienna University of Technology Muhittin GÖKMEN Istanbul Technical University Eduard GRÖLLER Vienna.
G O D D A R D S P A C E F L I G H T C E N T E R Upconversion Study with the Hilbert-Huang Transform Jordan Camp Kenji Numata John Cannizzo Robert Schofield.
Affine Linear Transformations Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
A Study of Approaches for Object Recognition
The Empirical Mode Decomposition Method Sifting. Goal of Data Analysis To define time scale or frequency. To define energy density. To define joint frequency-energy.
Paradoxes on Instantaneous Frequency a la Leon Cohen Time-Frequency Analysis, Prentice Hall, 1995 Chapter 2: Instantaneous Frequency, P. 40.
Subband-based Independent Component Analysis Y. Qi, P.S. Krishnaprasad, and S.A. Shamma ECE Department University of Maryland, College Park.
Distinctive image features from scale-invariant keypoints. David G. Lowe, Int. Journal of Computer Vision, 60, 2 (2004), pp Presented by: Shalomi.
Project Presentation: March 9, 2006
Scale Invariant Feature Transform (SIFT)
1 Concatenated Trial Based Hilbert-Huang Transformation on Mismatch Negativity Fengyu Cong 1, Tuomo Sipola1, Xiaonan Xu2, Tiina Huttunen-Scott3, Tapani.
MATH 3290 Mathematical Modeling
The Analytic Function from the Hilbert Transform and End Effects Theory and Implementation.
Ashish Uthama EOS 513 Term Paper Presentation Ashish Uthama Biomedical Signal and Image Computing Lab Department of Electrical.
Oral Defense by Sunny Tang 15 Aug 2003
Ensemble Empirical Mode Decomposition
National Chiao Tung University MVEMD vs. MDEMD + Applications in EEG & Gait Analyses John K. Zao Computer Science Dept. & Brain Research Center National.
Facial Recognition CSE 391 Kris Lord.
Phase: An Important Low-Level Image Invariant Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Image recognition using analysis of the frequency domain features 1.
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
Hurieh Khalajzadeh Mohammad Mansouri Mohammad Teshnehlab
Sep.2008DISP Time-Frequency Analysis 時頻分析  Speaker: Wen-Fu Wang 王文阜  Advisor: Jian-Jiun Ding 丁建均 教授   Graduate.
Multimodal Information Analysis for Emotion Recognition
E MPIRICAL M ODE D ECOMPOSITION BASED T ECHNIQUE APPLIED IN EXPERIMENTAL BIOSIGNALS Alexandros Karagiannis Mobile Radio Communications Laboratory School.
Image Processing Edge detection Filtering: Noise suppresion.
10/24/2015 Content-Based Image Retrieval: Feature Extraction Algorithms EE-381K-14: Multi-Dimensional Digital Signal Processing BY:Michele Saad
An introduction to Empirical Mode Decomposition. The simplest model for a signal is given by circular functions of the type Such “Fourier modes” are of.
Phase Congruency Detects Corners and Edges Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
Authors: Sriram Ganapathy, Samuel Thomas, and Hynek Hermansky Temporal envelope compensation for robust phoneme recognition using modulation spectrum.
Chapter 9 Frequency Response and Transfer Function
CCN COMPLEX COMPUTING NETWORKS1 This research has been supported in part by European Commission FP6 IYTE-Wireless Project (Contract No: )
A Tutorial on using SIFT Presented by Jimmy Huff (Slightly modified by Josiah Yoder for Winter )
Week 11 – Spectral TV and Convex analysis Guy Gilboa Course
Scale Invariant Feature Transform (SIFT)
Ensemble Empirical Mode Decomposition Zhaohua Wu Center for Ocean-Land-Atmosphere Studies And Norden E Huang National Central University.
2D Fourier Transform.
An Introduction to Time-Frequency Analysis Speaker: Po-Hong Wu Advisor: Jian-Jung Ding Digital Image and Signal Processing Lab GICE, National Taiwan University.
The Empirical Mode Decomposition Method Sifting. Goal of Data Analysis To define time scale or frequency. To define energy density. To define joint frequency-energy.
WLD: A Robust Local Image Descriptor Jie Chen, Shiguang Shan, Chu He, Guoying Zhao, Matti Pietikäinen, Xilin Chen, Wen Gao 报告人:蒲薇榄.
Empirical Mode Decomposition of Geophysical Well log Data of Bombay Offshore Basin, Mumbai, India Gaurav S. Gairola and E. Chandrasekhar Department of.
Interaction of Tsunamis with Short Surface Waves: An Experimental Study James M. Kaihatu Texas Engineering Experiment Station Zachry Department of Civil.
Electronics And Communications Engineering Nalla Malla Reddy Engineering College Major Project Seminar on “Phase Preserving Denoising of Images” Guide.
Paradoxes on Instantaneous Frequency
Lecture 16: Hilbert-Huang Transform Background:
Distinctive Image Features from Scale-Invariant Keypoints
Scale Invariant Feature Transform (SIFT)
PLIP BASED UNSHARP MASKING FOR MEDICAL IMAGE ENHANCEMENT
Outline Linear Shift-invariant system Linear filters
Face Recognition and Detection Using Eigenfaces
Outline Linear Shift-invariant system Linear filters
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
An image adaptive, wavelet-based watermarking of digital images
Presentation transcript:

Dan Zhang Supervisor: Prof. Y. Y. Tang 11 th PGDay

Contents  Motivation  Phase Congruency - Phase congruency theory - Calculate PC using monogenic filters  Monogenic Signals Obtained From BEMD - Hilbert-Huang Transform - The improved BEMD - Monogenic features of BIMFs  Experimental Results  Conclusions 211th PGDay HKBU-COMP-dzhang

Illumination Invariant Face Recognition  “Illumination changes could be larger than the differences between individuals.”  Methods: Lambertian surface, illumination cone, quotient image, model-based method, etc.  Frequency domain methods:  High-frequency components: robust to the illumination changes while low- frequency components are highly sensitive to.  Phase local feature: Phase Congruency (PC) is robust to invariant to changes in image brightness or contrast 11th PGDay HKBU-COMP-dzhang3

4 Hilbert Huang Transform (HHT) Framework Properties: 1D: data-driven, non-parametric adaptive to the original signal, do not need predetermined wavelet function, good at handle non-stationary and nonlinear Signals 2D: can capture more singular information in high-frequency componentsProperties: 1D: data-driven, non-parametric adaptive to the original signal, do not need predetermined wavelet function, good at handle non-stationary and nonlinear Signals 2D: can capture more singular information in high-frequency components

Motivation 1. From High-frequency Viewpoint Earlier studies and our studies show that high-frequency components are comparatively more robust to the illumination changes, while the low frequency component is sensitive to them. Generally, high-frequency component only is enough for illumination invariant facial feature extraction. 11th PGDay HKBU-COMP-dzhang5

Motivation 2. From HHT Method Viewpoint HHT theory provides us another efficient method to decompose signals into different frequency IMFs components. Because of the data-driven property and adaptiveness of the sifting process, it is able to capture more representative features and especially more singular information in high- frequency IMFs. It is reasonable to infer that the high-frequency components obtained by HHT framework may have more discriminate ability. 3. From Phase Feature Viewpoint Phase information was found to be crucial to feature perception. Phase congruency is a dimensionless quantity that is invariant to changes in illumination. 11th PGDay HKBU-COMP-dzhang6

7 Facial Feature Extraction Design

Phase Congruency (PC): PC Definitions 1. Morrone andOwens Definition (1) does not offer satisfactory local features and it is sensitive to noise. 2. P. Kovesi: more sensitive measure of PC 11th PGDay HKBU-COMP-dzhang8

9 3. P. Kovesi: PC calculated by wavelet : even-symmetric (cosine) and odd-symmetric (sine) wavelets at scale n 4. P. Kovesi: PC extended to 2D use the 1D analysis over m orientations

Phase Congruency (PC): Calculate PC using Monogenic Filters Riesz transform Monogenic signal 11th PGDay HKBU-COMP-dzhang10

Hilbert Huang Transform (HHT) Framework Step1: Empirical Mode Decomposition (EMD) 11th PGDay HKBU-COMP-dzhang11 Step 2: Hilbert Transform

HHT Framework extended to 2D Bidimensional EMD (BEMD) 11th PGDay HKBU-COMP-dzhang12

BIMFs 11th PGDay HKBU-COMP-dzhang13 Our Method Surface Interpolation Method 1 st BIMF 2 nd BIMF 3 rd BIMF residue

Monogenic Features of BIMFs (2D analytical signal) 11th PGDay HKBU-COMP-dzhang14 HHT Framework extended to 2D Row1,left: 1 st BIMF Row1, right: Amplitude Row2,left: orientation Row2, right: phase angle

PC Calculated using Monogenic Filters 11th PGDay HKBU-COMP-dzhang15 PC of original face PC of 1 st BIMF PC of 2 nd BIMF PC of 3 rd BIMF Weighted PC

11th PGDay HKBU-COMP-dzhang16 Feature Extraction Algorithm

11th PGDay HKBU-COMP-dzhang17 Face Database

11th PGDay HKBU-COMP-dzhang18

Conclusions  We use the phase congruency quantity based on the BIMFs to address the illumination face recognition problem.  We firstly proposed a new BEMD method based on the improved Evaluation of local mean, then apply the Riesz transform to get the corresponding monogenic signals. Based on the new phase local information obtained, PC is calculated. We combine the PC on different BIMFs and use the weighted mean as the facial features input to the classification process. Compared with other phase Based face recognition method, our proposed method shows its efficiency. 11th PGDay HKBU-COMP-dzhang19

11th PGDay HKBU-COMP-dzhang20 15-Mar-2010