Active shape models—their training and application
Computer Vision and Image Understanding
Face Recognition by Elastic Bunch Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Keyword Spotting in Poorly Printed Documents using Pseudo 2-D Hidden Markov Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Handwritten Character Classification Using Nearest Neighbor in Large Databases
IEEE Transactions on Pattern Analysis and Machine Intelligence
Elastic image matching is NP-complete
Pattern Recognition Letters
Face Recognition Using Active Appearance Models
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume II - Volume II
A Monotonic and Continuous Two-Dimensional Warping Based on Dynamic Programming
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Elastic Transformation of the Image Pixel Grid for Similarity Based Face Identification
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
The CMU Pose, Illumination, and Expression (PIE) Database
FGR '02 Proceedings of the Fifth IEEE International Conference on Automatic Face and Gesture Recognition
Robust Real-Time Face Detection
International Journal of Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
CVPRW '06 Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop
Convergent Tree-Reweighted Message Passing for Energy Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Deformation Models for Image Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Speeded-Up Robust Features (SURF)
Computer Vision and Image Understanding
Face recognition with disguise and single gallery images
Image and Vision Computing
Why Is Facial Occlusion a Challenging Problem?
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
Face recognition under occlusions and variant expressions with partial similarity
IEEE Transactions on Information Forensics and Security
Probabilistic learning for fully automatic face recognition across pose
Image and Vision Computing
Membrane nonrigid image registration
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
PCA-SIFT: a more distinctive representation for local image descriptors
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Constrained Energy Minimization for Matching-Based Image Recognition
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Recognizing partially occluded faces from a single sample per class using string-based matching
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
The fast and the flexible: extended pseudo two-dimensional warping for face recognition
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
IEEE Transactions on Information Forensics and Security
Exact optimization for Markov random fields with convex priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Neural Networks
Hi-index | 0.01 |
This paper systematically analyzes the strengths and weaknesses of existing image warping algorithms on the tasks of face recognition. Image warping is used to cope with local and global image variability and in general is an NP-complete problem. Although many approximations have recently been proposed, neither thorough comparison, nor systematic analysis of methods in a common scheme has been done so far. We follow the bottom-up approach and analyze the methods with increasing degree of image structure preserved during optimization. We evaluate the presented warping approaches on four challenging face recognition tasks in highly variable domains. Our findings indicate that preserving maximum dependencies between neighboring pixels by imposing strong geometrical constraints leads to the best recognition results while making optimization efficient.