TESES E DISSERTAÇÕES
2018 |
Samira Santos da Silva Aggregating Partial Least Squares Models for Open-set Face Identification Masters Thesis Federal University of Minas Gerais, 2018. Resumo | Links | BibTeX | Tags: Face Identification, Open-set Face Recognition, Partial Least Squares @mastersthesis{Silva:2018:MSc,Face identification is an important task in computer vision and has a myriad of applications, such as in surveillance, forensics and human-computer interaction. In the past few years, several methods have been proposed to solve face identification task in closed-set scenarios, that is, methods that make assumption of all the probe images necessarily matching a gallery individual. However, in real-world applications, one might want to determine the identity of an unknown face in open-set scenarios. In this work, we propose a novel method to perform open-set face identification by aggregating Partial Least Squares models using the one-against-all protocol in a simple but fast way. The model outputs are combined into a response histogram which is balanced if the probe face belongs to a gallery individual or have a highlighted bin, otherwise. Evaluation is performed in four datasets: FRGCv1, FG-NET, Pubfig and Pubfig83. Results show significant improvement when compared to state-of-the art approaches regardless challenges posed by different datasets. |
2017 |
Rafael Henrique Vareto Face Recognition based on a Collection of Binary Classifiers Masters Thesis Federal University of Minas Gerais, 2017. Resumo | BibTeX | Tags: Artificial Neural Network, Face Verification, Machine Learning, Open-set Face Identification, Partial Least Squares, Support Vector Machine, Surveillance @mastersthesis{Vareto:2017:MSc,Face Recognition is one of the most relevant problems in computer vision as we consider its importance to areas such as surveillance, forensics and psychology. In fact, a real-world recognition system has to cope with several unseen individuals and determine either if a given face image is associated with a subject registered in a gallery of known individuals or if two given faces represent equivalent identities. In this work, not only we combine hashing functions, embedding of classifiers and response value histograms to estimate when probe samples belong to the gallery set, but we also extract relational features to model the relation between pair of faces to determine whether they are from the same person. Both proposed methods are evaluated on five datasets: FRGCv1, LFW, PubFig, PubFig83 and CNN VGGFace. Results are promising and show that our method continues effective for both open-set face identification and verification tasks regardless of the dataset difficulty. |
2015 |
Cassio Elias Santos dos Junior Partial Least Squares for Face Hashing Masters Thesis Federal University of Minas Gerais, 2015. Resumo | Links | BibTeX | Tags: DeepEyes, Face Identification, Face Recognition, GigaFrames, Indexing Structure, Local Sensitive Hashing, Partial Least Squares, VER+ @mastersthesis{Santos:2015:MSc,Face identification is an important research topic due to areas such as its application to surveillance, forensics and human-computer interaction. In the past few years, a myriad of methods for face identification has been proposed in the literature, with just a few among them focusing on scalability. In this work, we propose a simple but efficient approach for scalable face identification based on partial least squares (PLS) and random independent hash functions inspired by locality-sensitive hashing (LSH), resulting in the PLS for hashing (PLSH) approach. The original PLSH approach is further extended using feature selection to reduce the computational cost to evaluate the PLS-based hash functions, resulting in the state-of-the-art extended PLSH approach (ePLSH). The proposed approach is evaluated in the dataset FERET and in the dataset FRGCv1. The results show significant reduction in the number of subjects evaluated in the face identification (reduced to 0.3% of the gallery), providing averaged speedups up to 233 times compared to evaluating all subjects in the face gallery and 58 times compared to previous works in the literature. |
2018 |
Samira Santos da Silva Aggregating Partial Least Squares Models for Open-set Face Identification Masters Thesis Federal University of Minas Gerais, 2018. Resumo | Links | BibTeX | Tags: Face Identification, Open-set Face Recognition, Partial Least Squares @mastersthesis{Silva:2018:MSc,Face identification is an important task in computer vision and has a myriad of applications, such as in surveillance, forensics and human-computer interaction. In the past few years, several methods have been proposed to solve face identification task in closed-set scenarios, that is, methods that make assumption of all the probe images necessarily matching a gallery individual. However, in real-world applications, one might want to determine the identity of an unknown face in open-set scenarios. In this work, we propose a novel method to perform open-set face identification by aggregating Partial Least Squares models using the one-against-all protocol in a simple but fast way. The model outputs are combined into a response histogram which is balanced if the probe face belongs to a gallery individual or have a highlighted bin, otherwise. Evaluation is performed in four datasets: FRGCv1, FG-NET, Pubfig and Pubfig83. Results show significant improvement when compared to state-of-the art approaches regardless challenges posed by different datasets. |
2017 |
Rafael Henrique Vareto Face Recognition based on a Collection of Binary Classifiers Masters Thesis Federal University of Minas Gerais, 2017. Resumo | BibTeX | Tags: Artificial Neural Network, Face Verification, Machine Learning, Open-set Face Identification, Partial Least Squares, Support Vector Machine, Surveillance @mastersthesis{Vareto:2017:MSc,Face Recognition is one of the most relevant problems in computer vision as we consider its importance to areas such as surveillance, forensics and psychology. In fact, a real-world recognition system has to cope with several unseen individuals and determine either if a given face image is associated with a subject registered in a gallery of known individuals or if two given faces represent equivalent identities. In this work, not only we combine hashing functions, embedding of classifiers and response value histograms to estimate when probe samples belong to the gallery set, but we also extract relational features to model the relation between pair of faces to determine whether they are from the same person. Both proposed methods are evaluated on five datasets: FRGCv1, LFW, PubFig, PubFig83 and CNN VGGFace. Results are promising and show that our method continues effective for both open-set face identification and verification tasks regardless of the dataset difficulty. |
2015 |
Cassio Elias Santos dos Junior Partial Least Squares for Face Hashing Masters Thesis Federal University of Minas Gerais, 2015. Resumo | Links | BibTeX | Tags: DeepEyes, Face Identification, Face Recognition, GigaFrames, Indexing Structure, Local Sensitive Hashing, Partial Least Squares, VER+ @mastersthesis{Santos:2015:MSc,Face identification is an important research topic due to areas such as its application to surveillance, forensics and human-computer interaction. In the past few years, a myriad of methods for face identification has been proposed in the literature, with just a few among them focusing on scalability. In this work, we propose a simple but efficient approach for scalable face identification based on partial least squares (PLS) and random independent hash functions inspired by locality-sensitive hashing (LSH), resulting in the PLS for hashing (PLSH) approach. The original PLSH approach is further extended using feature selection to reduce the computational cost to evaluate the PLS-based hash functions, resulting in the state-of-the-art extended PLSH approach (ePLSH). The proposed approach is evaluated in the dataset FERET and in the dataset FRGCv1. The results show significant reduction in the number of subjects evaluated in the face identification (reduced to 0.3% of the gallery), providing averaged speedups up to 233 times compared to evaluating all subjects in the face gallery and 58 times compared to previous works in the literature. |