abhishek sharma and david w. jacobsbhokaal/files/documents/cvpr2011poster.pdfabhishek sharma and...

1
Bypassing Synthesis : PLS for Face Recognition with P ose, L ow-resolution and S ketch Abhishek Sharma and David W. Jacobs Problem Statement Comparing apples to oranges : Given a subject’s face image in some modality (pose, sketch, low - resolution) that is different than the gallery image modality, how to find a match? Earlier Approaches and drawbacks Virtual view synthesis - Great but its slow. Stereo matching Robust and accurate but slow and only for pose. CCA and Bilinear Model Fast but suboptimum. Partial Least Square (PLS) based proposed approach Use PLS to learn two projection directions W X and W Y from a training set {X, Y} (subject’s images in two modalities). Projection in intermediate subspace maximizes covariance between same subject’s images in different modality. 1-NN matching followed by projection. Accurate and very fast online. Exactly same framework works well for pose, sketch and low-resol. State-of-the-art for pose-invariant face recognition on CMU PIE. Experiments All the modalities tested using one simple generic algorithm. Pose Invariant Face Recognition CMU PIE face date set for experiments. 34 training and 34 testing, intensity features Low-Resolution (toy experiment) Sketch Face recognition -- Low - res images synthesized from FERET -- CUHK Face-Sketch dataset. -- High - Res images of size 76 by 66 -- 88 training, 100 testing, intensity. Method Gal. Size Type Accuracy Wang 100 Holistic 81 Liu 300 Patch 87.67 Klare 300 Pixel 99.47 PLS 100 Holistic 93.6 CCA 100 Holistic 94.6 Bilinear 100 Holistic 94.2 PLS Bridge Intermediate Subspace Pose Resolution Sketch W X W Y Color = Identity PLS based proposed method flow diagram 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 20 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 PLS Bases Used Recognition Accuracy 38 by 33 19 by 16 14 by 12 7 by 6 5 by 4 One ring (PLS) to rule (Recognize) them all (modalities) Theory and Discussion X and Y are two view of same info, W X and W Y two projection directions Partial Least Square (PLS) PLS - Maximizes covariance in the intermediate space. PLS - Optimum balance of discrimination and correlation. PLS - Performance not sensitive to # bases used. PLS, CCA & BLM Can be kernelized. CCA - Captures correlation only ( ). BLM - No explicit effort to capture correlation. PLS, CCA & BLM - Discard label information. PLS - Poor performance for more than two modalities. PLS - Greedy, Iterative and computationally intensive offline. All three were able to find linear mappings from one pose to other which are basically permutations with averaging and supposed to be highly non-linear and difficult to learn. It highlights the promising future aspects of the proposed approach. F UW Y E TW X T Y T X G TD U )] YW , XW ( max[ . . i i Y X cov t s )} (# , 2 , 1 { bases k i )] YW , XW ( max[ i i Y X corr Fig 2 PLS vs. Bilinear Model (BL), horizontal coordinates of X and Y are same and vertical coordinates are uncorrelated Accuracy curves for PLS Bilinear performed similar CCA performance ~ 40 % -66,2 (-47,13) (-46,2) (-32,2) (-17,2) (0,15) (0,2) (0,2) (16,2) (31,2) (44,2) (44,13) (62,3) 0.65 0.7 0.75 0.8 0.85 0.9 0.95 1 POSES ANGLES (HORIZONTAL, VERTICAL) ACCURACY -66,2 -46,2 -17,2 0,2 16,2 44,2 62,3 SIMPLS for W X (W) and W Y (Q) Define: A 0 =X'Y; M 0 =X'X; C 0 =I; c = #bas For each h = 1,…,c Do 1. Compute q h the dominant eigenvector of A h 'A h ; 2.w h =A h q h ; c h =w h 'M h w h ;w h =w h /sqrt(c h ); store w h into W as column 3. p h =M h w h ; store p h into P as a column. 4. q h =A h 'w h ; store q h into Q as a column. 5. v h =C h p h ; v h =v h /||v h ||; 6. C h+1 =C h -v h v h ';M h+1 =M h -p h p h ' 7. A h+1 =C h A h End For each X Y

Upload: others

Post on 03-Feb-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

  • Bypassing Synthesis : PLS for Face Recognition with Pose, Low-resolution and SketchAbhishek Sharma and David W. Jacobs

    Problem Statement

    Comparing apples to oranges : Given a subject’s face image in some modality (pose, sketch, low - resolution) that is different than the gallery image modality, how to find a match?

    Earlier Approaches and drawbacks

    • Virtual view synthesis - Great but its slow.

    • Stereo matching – Robust and accurate but slow and only for pose.

    • CCA and Bilinear Model – Fast but suboptimum.

    Partial Least Square (PLS) based proposed approach

    • Use PLS to learn two projection directions WX and WY from a training set {X, Y} (subject’s images in two modalities).

    • Projection in intermediate subspace maximizes covariance between same subject’s images in different modality.

    • 1-NN matching followed by projection.

    • Accurate and very fast online.

    • Exactly same framework works well for pose, sketch and low-resol.

    • State-of-the-art for pose-invariant face recognition on CMU PIE.

    Experiments

    All the modalities tested using one simple generic algorithm.

    Pose Invariant Face Recognition

    • CMU PIE face date set for experiments.

    • 34 training and 34 testing, intensity features

    Low-Resolution (toy experiment) Sketch – Face recognition

    -- Low - res images synthesized from FERET -- CUHK Face-Sketch dataset.

    -- High - Res images of size 76 by 66 -- 88 training, 100 testing, intensity.

    Method Gal. Size Type Accuracy

    Wang 100 Holistic 81

    Liu 300 Patch 87.67

    Klare 300 Pixel 99.47

    PLS 100 Holistic 93.6

    CCA 100 Holistic 94.6

    Bilinear 100 Holistic 94.2

    PLS Bridge

    Intermediate

    Subspace

    Pose

    Resolution

    Sketch

    WX WY

    Color = Identity

    PLS based proposed method flow diagram

    1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20200

    0.1

    0.2

    0.3

    0.4

    0.5

    0.6

    0.7

    0.8

    0.9

    1

    PLS Bases Used

    Recognitio

    n A

    ccura

    cy

    38 by 33

    19 by 16

    14 by 12

    7 by 6

    5 by 4

    One ring (PLS) to rule (Recognize) them all (modalities)Theory and DiscussionX and Y are two view of same info, WX and WY two projection directionsPartial Least Square (PLS)

    PLS - Maximizes covariance in the intermediate space.

    PLS - Optimum balance of discrimination and correlation.

    PLS - Performance not sensitive to # bases used.

    PLS, CCA & BLM – Can be kernelized.

    CCA - Captures correlation only ( ).

    BLM - No explicit effort to capture correlation.

    PLS, CCA & BLM - Discard label information.

    PLS - Poor performance for more than two modalities.

    PLS - Greedy, Iterative and computationally intensive offline.

    All three were able to find linear mappings from one pose to other which are

    basically permutations with averaging and supposed to be highly non-linear and

    difficult to learn. It highlights the promising future aspects of the proposed approach.

    F UW Y ETW X TYT

    X G TD U

    )]YW,XW(max[..ii YX

    covts )}(#,2,1{ baseski

    )]YW,XW(max[ii YX

    corrFig 2 PLS vs. Bilinear Model (BL),

    horizontal coordinates of X and Y

    are same and vertical coordinates

    are uncorrelated

    Accuracy curves for PLS

    Bilinear performed similar

    CCA performance ~ 40 %

    -66,2 (-47,13) (-46,2) (-32,2) (-17,2) (0,15) (0,2) (0,2) (16,2) (31,2) (44,2) (44,13) (62,3)

    0.65

    0.7

    0.75

    0.8

    0.85

    0.9

    0.95

    1

    POSES ANGLES (HORIZONTAL, VERTICAL)

    AC

    CU

    RA

    CY

    -66,2

    -46,2

    -17,2

    0,2

    16,2

    44,2

    62,3

    SIMPLS for WX(W) and WY(Q)Define: A0=X'Y; M0=X'X; C0=I; c = #bas

    For each h = 1,…,c

    Do

    1. Compute qh the dominant eigenvector

    of Ah'Ah;

    2.wh=Ahqh ; ch=wh'Mhwh;wh=wh/sqrt(ch);

    store wh into W as column

    3. ph=Mhwh; store ph into P as a column.

    4. qh=Ah'wh; store qh into Q as a column.

    5. vh=Chph; vh=vh/||vh||;

    6. Ch+1=Ch - vhvh' ; Mh+1=Mh - phph'

    7. Ah+1=ChAh

    End For each

    X Y