• Acta Optica Sinica
  • Vol. 38, Issue 2, 0210004 (2018)
Liyang Wu1、*, Lei Xiong1, Shaoyi Du2, Duyan Bi1, and Ting Fang1
Author Affiliations
  • 1 Aeronautics Engineering College, Air Force Engineering University, Xi'an, Shaanxi 710038, China
  • 2 Institute of Artificial Intelligence and Robotics, Xi'an Jiaotong University, Xi'an, Shaanxi 710049, China
  • show less
    DOI: 10.3788/AOS201838.0210004 Cite this Article Set citation alerts
    Liyang Wu, Lei Xiong, Shaoyi Du, Duyan Bi, Ting Fang. Robust and Precise Affine Registration for Faces Based on Fast Affine Template Matching and Modified Affine Iterative Closet Point Algorithm[J]. Acta Optica Sinica, 2018, 38(2): 0210004 Copy Citation Text show less
    Two similarity measure point set sampling methods. (a) Proposed method; (b) Fast-match algorithm
    Fig. 1. Two similarity measure point set sampling methods. (a) Proposed method; (b) Fast-match algorithm
    Annotation order of 42 facial feature points
    Fig. 2. Annotation order of 42 facial feature points
    Partial affine registration effect graphs for different face registration algorithms. (a) Rotate 90°; (b) Rotate 0°; (c) shrink to the half; (d) Rotate 45° and expand to 1.5 times
    Fig. 3. Partial affine registration effect graphs for different face registration algorithms. (a) Rotate 90°; (b) Rotate 0°; (c) shrink to the half; (d) Rotate 45° and expand to 1.5 times
    Partial affine registration results for different face registration algorithms
    Fig. 4. Partial affine registration results for different face registration algorithms
    Face affine registration effect graphs of FSFR algorithm with different Gaussian noise interferences. (a) Template face image; (b) variance of 0.01; (c) variance of 0.05; (d) variance of 0.1; (e) variance of 0.2; (f) variance of 0.4; (g) variance of 0.6; (h) variance of 0.8; (i) variance of 1.0
    Fig. 5. Face affine registration effect graphs of FSFR algorithm with different Gaussian noise interferences. (a) Template face image; (b) variance of 0.01; (c) variance of 0.05; (d) variance of 0.1; (e) variance of 0.2; (f) variance of 0.4; (g) variance of 0.6; (h) variance of 0.8; (i) variance of 1.0
    Face affine registration error curves of FSFR algorithm with different constraint coefficients
    Fig. 6. Face affine registration error curves of FSFR algorithm with different constraint coefficients
    Face affine registration effect graphs of FSFR algorithm with different constraint coefficients. (a) α=0; (b) α=0.5; (c) α=1; (d) α=1.5; (e) α=2; (f) α=2/k
    Fig. 7. Face affine registration effect graphs of FSFR algorithm with different constraint coefficients. (a) α=0; (b) α=0.5; (c) α=1; (d) α=1.5; (e) α=2; (f) α=2/k
    AlgorithmAFARESuccess rate /%Registration time /s
    SIFT[17]0.051977.7834.6940
    SURF[18]0.299044.449.1800
    ORB[20]0.176348.424.5140
    Fast-match[13]0.067747.2261.6080
    FSFR0.0230100.0030.0216
    Table 1. Affine registration results for different face registration algorithms
    Variance of Gaussian noise interferencesFARE
    SIFT[17]algorithmSURF[18]algorithmORB[20]algorithmFast-match[13]algorithmFSFR algorithm
    0.010.03680.04080.05120.05710.0323
    0.050.04910.05590.81950.05880.0475
    0.10.82310.05581.06040.06360.0551
    0.20.74120.06791.00060.06890.0637
    0.41.67630.95791.18370.07420.0713
    0.61.67631.16501.31540.08470.0781
    0.81.67632.47501.00200.09740.0936
    1.01.67633.88651.70440.46230.4636
    Table 2. Face affine registration error results for different face registration algorithms with different Gaussian noise interferences
    Liyang Wu, Lei Xiong, Shaoyi Du, Duyan Bi, Ting Fang. Robust and Precise Affine Registration for Faces Based on Fast Affine Template Matching and Modified Affine Iterative Closet Point Algorithm[J]. Acta Optica Sinica, 2018, 38(2): 0210004
    Download Citation