Advanced search
1 file | 1.69 MB

Segmented face approximation with adaptive region growing based on low-degree polynomial fitting

Francis Deboeverie (UGent) , Peter Veelaert (UGent) and Wilfried Philips (UGent)
Author
Organization
Abstract
Nowadays, an objective in visual communication is to send and store images of faces at a low bit rate, such that the faces are still recognizable and that the compression does not prevent remote face analysis. We present a novel segmented face approximation algorithm. Greyscale face images are segmented into meaningful surface segments with an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L-infinity fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main novelty is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way, such as flat, planar, convex, concave or saddle patches. As a result, the surface segments correspond to facial features and the contours separating the surface segments coincide with real image face edges. Moreover, the curvature-based surface shape information facilitates many tasks in automated face analysis, demonstrated in this paper by face verification performed on the polynomial representation. The polynomial representation provides good approximation of facial features, while preserving all the necessary details of the face in the reconstructed image. When compared with different compression methods, we achieve higher compression ratios and better recognizable faces at low bit rates. This is confirmed by correct identification percentages obtained by face recognition algorithms on the compressed data.
Keywords
Region growing, Face recognition, Image approximation, Polynomial fitting, Face detection, Image segmentation, FEATURES, CONTEXT, RETRIEVAL, SPACE, VIDEO, ALGORITHM, K-SVD, COMPRESSION, FACIAL IMAGES, IMAGE-CODING TECHNIQUES

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.69 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Deboeverie, Francis, Peter Veelaert, and Wilfried Philips. 2015. “Segmented Face Approximation with Adaptive Region Growing Based on Low-degree Polynomial Fitting.” Ed. Murat Kunt. Signal Image and Video Processing 9 (2): 347–363.
APA
Deboeverie, F., Veelaert, P., & Philips, W. (2015). Segmented face approximation with adaptive region growing based on low-degree polynomial fitting. (M. Kunt, Ed.)SIGNAL IMAGE AND VIDEO PROCESSING, 9(2), 347–363.
Vancouver
1.
Deboeverie F, Veelaert P, Philips W. Segmented face approximation with adaptive region growing based on low-degree polynomial fitting. Kunt M, editor. SIGNAL IMAGE AND VIDEO PROCESSING. 2015;9(2):347–63.
MLA
Deboeverie, Francis, Peter Veelaert, and Wilfried Philips. “Segmented Face Approximation with Adaptive Region Growing Based on Low-degree Polynomial Fitting.” Ed. Murat Kunt. SIGNAL IMAGE AND VIDEO PROCESSING 9.2 (2015): 347–363. Print.
@article{3143457,
  abstract     = {Nowadays, an objective in visual communication is to send and store images of faces at a low bit rate, such that the faces are still recognizable and that the compression does not prevent remote face analysis. We present a novel segmented face approximation algorithm. Greyscale face images are segmented into meaningful surface segments with an adaptive region growing algorithm based on low-degree polynomial fitting. The algorithm uses a new adaptive thresholding technique with the L-infinity fitting cost as a segmentation criterion. The polynomial degree and the fitting error are automatically adapted during the region growing process. The main novelty is that the algorithm detects outliers and edges, distinguishes between strong and smooth intensity transitions and finds surface segments that are bent in a certain way, such as flat, planar, convex, concave or saddle patches. As a result, the surface segments correspond to facial features and the contours separating the surface segments coincide with real image face edges. Moreover, the curvature-based surface shape information facilitates many tasks in automated face analysis, demonstrated in this paper by face verification performed on the polynomial representation. The polynomial representation provides good approximation of facial features, while preserving all the necessary details of the face in the reconstructed image. When compared with different compression methods, we achieve higher compression ratios and better recognizable faces at low bit rates. This is confirmed by correct identification percentages obtained by face recognition algorithms on the compressed data.},
  author       = {Deboeverie, Francis and Veelaert, Peter and Philips, Wilfried},
  editor       = {Kunt, Murat},
  issn         = {1863-1703},
  journal      = {SIGNAL IMAGE AND VIDEO PROCESSING},
  keyword      = {Region growing,Face recognition,Image approximation,Polynomial fitting,Face detection,Image segmentation,FEATURES,CONTEXT,RETRIEVAL,SPACE,VIDEO,ALGORITHM,K-SVD,COMPRESSION,FACIAL IMAGES,IMAGE-CODING TECHNIQUES},
  language     = {eng},
  number       = {2},
  pages        = {347--363},
  title        = {Segmented face approximation with adaptive region growing based on low-degree polynomial fitting},
  url          = {http://dx.doi.org/10.1007/s11760-013-0441-6},
  volume       = {9},
  year         = {2015},
}

Altmetric
View in Altmetric
Web of Science
Times cited: