Face Recognition Using Sparse Fingerprint Classification Algorithm

Face Recognition Using Sparse Fingerprint Classification Algorithm. Larrain, T., Bernhard, J., Mery, D., & Bowyer, K. IEEE Transactions on Information, Forensics and Security, 12(7):1646-1657, 2017.

Paper doi abstract bibtex

Unconstrained face recognition is still an open problem as state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called Sparse Fingerprint Classification Algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject's face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the dataset is small or medium (i.e., the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms.

@article{Mery2017:IEEE-TIFS,
  title={Face Recognition Using Sparse Fingerprint Classification Algorithm},
author={Larrain, T. and Bernhard, J. and Mery, D. and Bowyer, K.}, 
journal = {IEEE Transactions on Information, Forensics and Security},
volume = 12,
number = 7,
pages = {1646-1657},
  year = 2017,
  abstract = {Unconstrained face recognition is still an open problem as state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called Sparse Fingerprint Classification Algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject's face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the dataset is small or medium (i.e., the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms.},
  url = {http://ieeexplore.ieee.org/document/7875165/},
  doi = {10.1109/TIFS.2017.2680403}
}

Downloads: 0

{"_id":"xucxZMSCiRdgzwhkg","bibbaseid":"larrain-bernhard-mery-bowyer-facerecognitionusingsparsefingerprintclassificationalgorithm-2017","downloads":0,"creationDate":"2017-03-01T10:48:47.555Z","title":"Face Recognition Using Sparse Fingerprint Classification Algorithm","author_short":["Larrain, T.","Bernhard, J.","Mery, D.","Bowyer, K."],"year":2017,"bibtype":"article","biburl":"http://dmery.sitios.ing.uc.cl/Prints/Mery_Domingo.bib ","bibdata":{"bibtype":"article","type":"article","title":"Face Recognition Using Sparse Fingerprint Classification Algorithm","author":[{"propositions":[],"lastnames":["Larrain"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Bernhard"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Mery"],"firstnames":["D."],"suffixes":[]},{"propositions":[],"lastnames":["Bowyer"],"firstnames":["K."],"suffixes":[]}],"journal":"IEEE Transactions on Information, Forensics and Security","volume":"12","number":"7","pages":"1646-1657","year":"2017","abstract":"Unconstrained face recognition is still an open problem as state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called Sparse Fingerprint Classification Algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject's face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the dataset is small or medium (i.e., the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms.","url":"http://ieeexplore.ieee.org/document/7875165/","doi":"10.1109/TIFS.2017.2680403","bibtex":"@article{Mery2017:IEEE-TIFS,\n title={Face Recognition Using Sparse Fingerprint Classification Algorithm},\nauthor={Larrain, T. and Bernhard, J. and Mery, D. and Bowyer, K.}, \njournal = {IEEE Transactions on Information, Forensics and Security},\nvolume = 12,\nnumber = 7,\npages = {1646-1657},\n year = 2017,\n abstract = {Unconstrained face recognition is still an open problem as state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called Sparse Fingerprint Classification Algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject's face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the dataset is small or medium (i.e., the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms.},\n url = {http://ieeexplore.ieee.org/document/7875165/},\n doi = {10.1109/TIFS.2017.2680403}\n}\n\n\n\n","author_short":["Larrain, T.","Bernhard, J.","Mery, D.","Bowyer, K."],"key":"Mery2017:IEEE-TIFS","id":"Mery2017:IEEE-TIFS","bibbaseid":"larrain-bernhard-mery-bowyer-facerecognitionusingsparsefingerprintclassificationalgorithm-2017","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/7875165/"},"metadata":{"authorlinks":{"mery, d":"https://bibbase.org/show?bib=http://dmery.sitios.ing.uc.cl/Prints/Mery_Domingo.bib&msg=embed&theme=side&authorFirst=1"}}},"search_terms":["face","recognition","using","sparse","fingerprint","classification","algorithm","larrain","bernhard","mery","bowyer"],"keywords":[],"authorIDs":["24TkaxcPXqc7t8oo2","5456ff2b8b01c819300000f6","5de77464021482de01000070","5e1c779a92587bde0100013e","5e221d6c71dcf8df0100002b","5e253d35561b8fde0100008c","5e28810c67e11edf0100008d","5e533ea853de8dde01000042","5e54fee296ed20df0100003d","DR8QRotRb5C33T8Rb","FDHBz8WWdRXnWmR7h","NKHZCaBn3zKAa5ocL","Pxb9bPepYv65oXxi9","ayym4ZHJzF7jQcz8Q","d6Qqa2JYQxcTSLaGE","dmtweywdYxkx3KjDt","fN7f2faCKTWJvL9rb","h2WsvS5g4tT8oqpZH","syJh4acsFmZGsFfQS"],"dataSources":["xvobHwzyqavc6cCEz","68BuKygEnwqbDeD59"]}