2015
|
Beveridge, Ross; Zhang, Hao; Draper, Bruce A; Flynn, Patrick J; Feng, Zhenhua; Huber, Patrik; Kittler, Josef; Huang, Zhiwu; Li, Shaoxin; Li, Yan; Štruc, Vitomir; Križaj, Janez; others, Report on the FG 2015 video person recognition evaluation Proceedings Article In: 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (IEEE FG), pp. 1–8, IEEE 2015. @inproceedings{beveridge2015report,
title = {Report on the FG 2015 video person recognition evaluation},
author = {Ross Beveridge and Hao Zhang and Bruce A Draper and Patrick J Flynn and Zhenhua Feng and Patrik Huber and Josef Kittler and Zhiwu Huang and Shaoxin Li and Yan Li and Vitomir Štruc and Janez Križaj and others},
url = {https://lmi.fe.uni-lj.si/en/reportonthefg2015videopersonrecognitionevaluation/},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
booktitle = {11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (IEEE FG)},
volume = {1},
pages = {1--8},
organization = {IEEE},
abstract = {This report presents results from the Video Person Recognition Evaluation held in conjunction with the 11th IEEE International Conference on Automatic Face and Gesture Recognition. Two experiments required algorithms to recognize people in videos from the Point-and-Shoot Face Recognition Challenge Problem (PaSC). The first consisted of videos from a tripod mounted high quality video camera. The second contained videos acquired from 5 different handheld video cameras. There were 1401 videos in each experiment of 265 subjects. The subjects, the scenes, and the actions carried out by the people are the same in both experiments. Five groups from around the world participated in the evaluation. The video handheld experiment was included in the International Joint Conference on Biometrics (IJCB) 2014 Handheld Video Face and Person Recognition Competition. The top verification rate from this evaluation is double that of the top performer in the IJCB competition. Analysis shows that the factor most effecting algorithm performance is the combination of location and action: where the video was acquired and what the person was doing.},
keywords = {biometrics, competition, face verification, FG, group evaluation, PaSC, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
This report presents results from the Video Person Recognition Evaluation held in conjunction with the 11th IEEE International Conference on Automatic Face and Gesture Recognition. Two experiments required algorithms to recognize people in videos from the Point-and-Shoot Face Recognition Challenge Problem (PaSC). The first consisted of videos from a tripod mounted high quality video camera. The second contained videos acquired from 5 different handheld video cameras. There were 1401 videos in each experiment of 265 subjects. The subjects, the scenes, and the actions carried out by the people are the same in both experiments. Five groups from around the world participated in the evaluation. The video handheld experiment was included in the International Joint Conference on Biometrics (IJCB) 2014 Handheld Video Face and Person Recognition Competition. The top verification rate from this evaluation is double that of the top performer in the IJCB competition. Analysis shows that the factor most effecting algorithm performance is the combination of location and action: where the video was acquired and what the person was doing. |
Dobrišek, Simon; Štruc, Vitomir; Križaj, Janez; Mihelič, France Face recognition in the wild with the Probabilistic Gabor-Fisher Classifier Proceedings Article In: 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (IEEE FG): BWild 2015, pp. 1–6, IEEE 2015. @inproceedings{dobrivsek2015face,
title = {Face recognition in the wild with the Probabilistic Gabor-Fisher Classifier},
author = {Simon Dobrišek and Vitomir Štruc and Janez Križaj and France Mihelič},
url = {https://lmi.fe.uni-lj.si/en/facerecognitioninthewildwiththeprobabilisticgabor-fisherclassifier/},
year = {2015},
date = {2015-01-01},
urldate = {2015-01-01},
booktitle = {11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (IEEE FG): BWild 2015},
volume = {2},
pages = {1--6},
organization = {IEEE},
abstract = {The paper addresses the problem of face recognition in the wild. It introduces a novel approach to unconstrained face recognition that exploits Gabor magnitude features and a simplified version of the probabilistic linear discriminant analysis (PLDA). The novel approach, named Probabilistic Gabor-Fisher Classifier (PGFC), first extracts a vector of Gabor magnitude features from the given input image using a battery of Gabor filters, then reduces the dimensionality of the extracted feature vector by projecting it into a low-dimensional subspace and finally produces a representation suitable for identity inference by applying PLDA to the projected feature vector. The proposed approach extends the popular Gabor-Fisher Classifier (GFC) to a probabilistic setting and thus improves on the generalization capabilities of the GFC method. The PGFC technique is assessed in face verification experiments on the Point and Shoot Face Recognition Challenge (PaSC) database, which features real-world videos of subjects performing everyday tasks. Experimental results on this challenging database show the feasibility of the proposed approach, which improves on the best results on this database reported in the literature by the time of writing.},
keywords = {biometrics, BWild, FG, Gabor features, PaSC, plda, probabilistic Gabor Fisher classifier, probabilistic linear discriminant analysis},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper addresses the problem of face recognition in the wild. It introduces a novel approach to unconstrained face recognition that exploits Gabor magnitude features and a simplified version of the probabilistic linear discriminant analysis (PLDA). The novel approach, named Probabilistic Gabor-Fisher Classifier (PGFC), first extracts a vector of Gabor magnitude features from the given input image using a battery of Gabor filters, then reduces the dimensionality of the extracted feature vector by projecting it into a low-dimensional subspace and finally produces a representation suitable for identity inference by applying PLDA to the projected feature vector. The proposed approach extends the popular Gabor-Fisher Classifier (GFC) to a probabilistic setting and thus improves on the generalization capabilities of the GFC method. The PGFC technique is assessed in face verification experiments on the Point and Shoot Face Recognition Challenge (PaSC) database, which features real-world videos of subjects performing everyday tasks. Experimental results on this challenging database show the feasibility of the proposed approach, which improves on the best results on this database reported in the literature by the time of writing. |
2014
|
Peer, Peter; Emeršič, Žiga; Bule, Jernej; Žganec-Gros, Jerneja; Štruc, Vitomir Strategies for exploiting independent cloud implementations of biometric experts in multibiometric scenarios Journal Article In: Mathematical problems in engineering, vol. 2014, 2014. @article{peer2014strategies,
title = {Strategies for exploiting independent cloud implementations of biometric experts in multibiometric scenarios},
author = {Peter Peer and Žiga Emeršič and Jernej Bule and Jerneja Žganec-Gros and Vitomir Štruc},
url = {https://lmi.fe.uni-lj.si/en/strategiesforexploitingindependentcloudimplementationsofbiometricexpertsinmultibiometricscenarios/},
doi = {http://dx.doi.org/10.1155/2014/585139},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {Mathematical problems in engineering},
volume = {2014},
publisher = {Hindawi Publishing Corporation},
abstract = {Cloud computing represents one of the fastest growing areas of technology and offers a new computing model for various applications and services. This model is particularly interesting for the area of biometric recognition, where scalability, processing power, and storage requirements are becoming a bigger and bigger issue with each new generation of recognition technology. Next to the availability of computing resources, another important aspect of cloud computing with respect to biometrics is accessibility. Since biometric cloud services are easily accessible, it is possible to combine different existing implementations and design new multibiometric services that next to almost unlimited resources also offer superior recognition performance and, consequently, ensure improved security to its client applications. Unfortunately, the literature on the best strategies of how to combine existing implementations of cloud-based biometric experts into a multibiometric service is virtually nonexistent. In this paper, we try to close this gap and evaluate different strategies for combining existing biometric experts into a multibiometric cloud service. We analyze the (fusion) strategies from different perspectives such as performance gains, training complexity, or resource consumption and present results and findings important to software developers and other researchers working in the areas of biometrics and cloud computing. The analysis is conducted based on two biometric cloud services, which are also presented in the paper.},
keywords = {application, biometrics, cloud computing, face recognition, fingerprint recognition, fusion},
pubstate = {published},
tppubtype = {article}
}
Cloud computing represents one of the fastest growing areas of technology and offers a new computing model for various applications and services. This model is particularly interesting for the area of biometric recognition, where scalability, processing power, and storage requirements are becoming a bigger and bigger issue with each new generation of recognition technology. Next to the availability of computing resources, another important aspect of cloud computing with respect to biometrics is accessibility. Since biometric cloud services are easily accessible, it is possible to combine different existing implementations and design new multibiometric services that next to almost unlimited resources also offer superior recognition performance and, consequently, ensure improved security to its client applications. Unfortunately, the literature on the best strategies of how to combine existing implementations of cloud-based biometric experts into a multibiometric service is virtually nonexistent. In this paper, we try to close this gap and evaluate different strategies for combining existing biometric experts into a multibiometric cloud service. We analyze the (fusion) strategies from different perspectives such as performance gains, training complexity, or resource consumption and present results and findings important to software developers and other researchers working in the areas of biometrics and cloud computing. The analysis is conducted based on two biometric cloud services, which are also presented in the paper. |
Štruc, Vitomir; Žganec-Gros, Jerneja; Vesnicer, Boštjan; Pavešić, Nikola Beyond parametric score normalisation in biometric verification systems Journal Article In: IET Biometrics, vol. 3, no. 2, pp. 62–74, 2014. @article{struc2014beyond,
title = {Beyond parametric score normalisation in biometric verification systems},
author = {Vitomir Štruc and Jerneja Žganec-Gros and Boštjan Vesnicer and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/beyondparametricscorenormalisationinbiometricverificationsystems/},
doi = {10.1049/iet-bmt.2013.0076},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
journal = {IET Biometrics},
volume = {3},
number = {2},
pages = {62--74},
publisher = {IET},
abstract = {Similarity scores represent the basis for identity inference in biometric verification systems. However, because of the so-called miss-matched conditions across enrollment and probe samples and identity-dependent factors these scores typically exhibit statistical variations that affect the verification performance of biometric systems. To mitigate these variations, scorenormalisation techniques, such as the z-norm, the t-norm or the zt-norm, are commonly adopted. In this study, the authors study the problem of score normalisation in the scope of biometric verification and introduce a new class of non-parametric normalisation techniques, which make no assumptions regarding the shape of the distribution from which the scores are drawn (as the parametric techniques do). Instead, they estimate the shape of the score distribution and use the estimate to map the initial distribution to a common (predefined) distribution. Based on the new class of normalisation techniques they also develop a hybrid normalisation scheme that combines non-parametric and parametric techniques into hybrid two-step procedures. They evaluate the performance of the non-parametric and hybrid techniques in face-verification experiments on the FRGCv2 and SCFace databases and show that the non-parametric techniques outperform their parametric counterparts and that the hybrid procedure is not only feasible, but also retains some desirable characteristics from both the non-parametric and the parametric techniques.},
keywords = {biometrics, face verification, hybrid score normalization, score normalization, t-norm, tz-norm, z-norm, zt-norm},
pubstate = {published},
tppubtype = {article}
}
Similarity scores represent the basis for identity inference in biometric verification systems. However, because of the so-called miss-matched conditions across enrollment and probe samples and identity-dependent factors these scores typically exhibit statistical variations that affect the verification performance of biometric systems. To mitigate these variations, scorenormalisation techniques, such as the z-norm, the t-norm or the zt-norm, are commonly adopted. In this study, the authors study the problem of score normalisation in the scope of biometric verification and introduce a new class of non-parametric normalisation techniques, which make no assumptions regarding the shape of the distribution from which the scores are drawn (as the parametric techniques do). Instead, they estimate the shape of the score distribution and use the estimate to map the initial distribution to a common (predefined) distribution. Based on the new class of normalisation techniques they also develop a hybrid normalisation scheme that combines non-parametric and parametric techniques into hybrid two-step procedures. They evaluate the performance of the non-parametric and hybrid techniques in face-verification experiments on the FRGCv2 and SCFace databases and show that the non-parametric techniques outperform their parametric counterparts and that the hybrid procedure is not only feasible, but also retains some desirable characteristics from both the non-parametric and the parametric techniques. |
Križaj, Janez; Štruc, Vitomir; Mihelič, France A Feasibility Study on the Use of Binary Keypoint Descriptors for 3D Face Recognition Proceedings Article In: Proceedings of the Mexican Conference on Pattern Recognition (MCPR), pp. 142–151, Springer 2014. @inproceedings{krivzaj2014feasibility,
title = {A Feasibility Study on the Use of Binary Keypoint Descriptors for 3D Face Recognition},
author = {Janez Križaj and Vitomir Štruc and France Mihelič},
url = {https://lmi.fe.uni-lj.si/en/afeasibilitystudyontheuseofbinarykeypointdescriptorsfor3dfacerecognition/},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
booktitle = {Proceedings of the Mexican Conference on Pattern Recognition (MCPR)},
pages = {142--151},
organization = {Springer},
abstract = {Despite the progress made in the area of local image descriptors in recent years, virtually no literature is available on the use of more recent descriptors for the problem of 3D face recognition, such as BRIEF, ORB, BRISK or FREAK, which are binary in nature and, therefore, tend to be faster to compute and match, while requiring signi cantly less memory for storage than, for example, SIFT or SURF. In this paper, we try to close this gap and present a feasibility study on the use of these descriptors for 3D face recognition. Descriptors are evaluated on the three challenging 3D face image datasets, namely, the FRGC, UMB and CASIA. Our experiments show the binary descriptors ensure slightly lower veri cation rates than SIFT, comparable to those of the SURF descriptor, while being an order of magnitude faster than SIFT. The results suggest that the use of binary descriptors represents a viable alternative to the established descriptors.},
keywords = {3d face recognition, binary descriptors, biometrics, BRISK, CASIA, face verification, FREAK, FRGC, MCPR, ORB, performance evaluation, SIFT, SURF},
pubstate = {published},
tppubtype = {inproceedings}
}
Despite the progress made in the area of local image descriptors in recent years, virtually no literature is available on the use of more recent descriptors for the problem of 3D face recognition, such as BRIEF, ORB, BRISK or FREAK, which are binary in nature and, therefore, tend to be faster to compute and match, while requiring signi cantly less memory for storage than, for example, SIFT or SURF. In this paper, we try to close this gap and present a feasibility study on the use of these descriptors for 3D face recognition. Descriptors are evaluated on the three challenging 3D face image datasets, namely, the FRGC, UMB and CASIA. Our experiments show the binary descriptors ensure slightly lower veri cation rates than SIFT, comparable to those of the SURF descriptor, while being an order of magnitude faster than SIFT. The results suggest that the use of binary descriptors represents a viable alternative to the established descriptors. |
Vesnicer, Boštjan; Žganec-Gros, Jerneja; Dobrišek, Simon; Štruc, Vitomir Incorporating Duration Information into I-Vector-Based Speaker-Recognition Systems Proceedings Article In: Proceedings of Odyssey: The Speaker and Language Recognition Workshop, pp. 241–248, 2014. @inproceedings{vesnicer2014incorporating,
title = {Incorporating Duration Information into I-Vector-Based Speaker-Recognition Systems},
author = {Boštjan Vesnicer and Jerneja Žganec-Gros and Simon Dobrišek and Vitomir Štruc},
url = {https://lmi.fe.uni-lj.si/en/incorporatingdurationinformationintoi-vector-basedspeaker-recognitionsystems/},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
booktitle = {Proceedings of Odyssey: The Speaker and Language Recognition Workshop},
pages = {241--248},
abstract = {Most of the existing literature on i-vector-based speaker recognition focuses on recognition problems, where i-vectors are extracted from speech recordings of sufficient length. The majority of modeling/recognition techniques therefore simply ignores the fact that the i-vectors are most likely estimated unreliably when short recordings are used for their computation. Only recently, were a number of solutions proposed in the literature to address the problem of duration variability, all treating the i-vector as a random variable whose posterior distribution can be parameterized by the posterior mean and the posterior covariance. In this setting the covariance matrix serves as a measure of uncertainty that is related to the length of the available recording. In contract to these solutions, we address the problem of duration variability through weighted statistics. We demonstrate in the paper how established feature transformation techniques regularly used in the area of speaker recognition, such as PCA or WCCN, can be modified to take duration into account. We evaluate our weighting scheme in the scope of the i-vector challenge organized as part of the Odyssey, Speaker and Language Recognition Workshop 2014 and achieve a minimal DCF of 0.280, which at the time of writing puts our approach in third place among all the participating institutions.},
keywords = {acustic features, biometrics, duration, duration modeling, i-vector, i-vector challenge, Odyssey, performance evaluation, speaker recognition, speech technologies},
pubstate = {published},
tppubtype = {inproceedings}
}
Most of the existing literature on i-vector-based speaker recognition focuses on recognition problems, where i-vectors are extracted from speech recordings of sufficient length. The majority of modeling/recognition techniques therefore simply ignores the fact that the i-vectors are most likely estimated unreliably when short recordings are used for their computation. Only recently, were a number of solutions proposed in the literature to address the problem of duration variability, all treating the i-vector as a random variable whose posterior distribution can be parameterized by the posterior mean and the posterior covariance. In this setting the covariance matrix serves as a measure of uncertainty that is related to the length of the available recording. In contract to these solutions, we address the problem of duration variability through weighted statistics. We demonstrate in the paper how established feature transformation techniques regularly used in the area of speaker recognition, such as PCA or WCCN, can be modified to take duration into account. We evaluate our weighting scheme in the scope of the i-vector challenge organized as part of the Odyssey, Speaker and Language Recognition Workshop 2014 and achieve a minimal DCF of 0.280, which at the time of writing puts our approach in third place among all the participating institutions. |
Beveridge, Ross; Zhang, Hao; Flynn, Patrick; Lee, Yooyoung; Liong, Venice Erin; Lu, Jiwen; de Angeloni, Marcus Assis; de Pereira, Tiago Freitas; Li, Haoxiang; Hua, Gang; Štruc, Vitomir; Križaj, Janez; Phillips, Jonathon The ijcb 2014 pasc video face and person recognition competition Proceedings Article In: Proceedings of the IEEE International Joint Conference on Biometrics (IJCB), pp. 1–8, IEEE 2014. @inproceedings{beveridge2014ijcb,
title = {The ijcb 2014 pasc video face and person recognition competition},
author = {Ross Beveridge and Hao Zhang and Patrick Flynn and Yooyoung Lee and Venice Erin Liong and Jiwen Lu and Marcus Assis de Angeloni and Tiago Freitas de Pereira and Haoxiang Li and Gang Hua and Vitomir Štruc and Janez Križaj and Jonathon Phillips},
url = {https://lmi.fe.uni-lj.si/en/theijcb2014pascvideofaceandpersonrecognitioncompetition/},
year = {2014},
date = {2014-01-01},
urldate = {2014-01-01},
booktitle = {Proceedings of the IEEE International Joint Conference on Biometrics (IJCB)},
pages = {1--8},
organization = {IEEE},
abstract = {The Point-and-Shoot Face Recognition Challenge (PaSC) is a performance evaluation challenge including 1401 videos of 265 people acquired with handheld cameras and depicting people engaged in activities with non-frontal head pose. This report summarizes the results from a competition using this challenge problem. In the Video-to-video Experiment a person in a query video is recognized by comparing the query video to a set of target videos. Both target and query videos are drawn from the same pool of 1401 videos. In the Still-to-video Experiment the person in a query video is to be recognized by comparing the query video to a larger target set consisting of still images. Algorithm performance is characterized by verification rate at a false accept rate of 0:01 and associated receiver operating characteristic (ROC) curves. Participants were provided eye coordinates for video frames. Results were submitted by 4 institutions: (i) Advanced Digital Science Center, Singapore; (ii) CPqD, Brasil; (iii) Stevens Institute of Technology, USA; and (iv) University of Ljubljana, Slovenia. Most competitors demonstrated video face recognition performance superior to the baseline provided with PaSC. The results represent the best performance to date on the handheld video portion of the PaSC.},
keywords = {biometrics, competition, face recognition, group evaluation, IJCB, PaSC, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
The Point-and-Shoot Face Recognition Challenge (PaSC) is a performance evaluation challenge including 1401 videos of 265 people acquired with handheld cameras and depicting people engaged in activities with non-frontal head pose. This report summarizes the results from a competition using this challenge problem. In the Video-to-video Experiment a person in a query video is recognized by comparing the query video to a set of target videos. Both target and query videos are drawn from the same pool of 1401 videos. In the Still-to-video Experiment the person in a query video is to be recognized by comparing the query video to a larger target set consisting of still images. Algorithm performance is characterized by verification rate at a false accept rate of 0:01 and associated receiver operating characteristic (ROC) curves. Participants were provided eye coordinates for video frames. Results were submitted by 4 institutions: (i) Advanced Digital Science Center, Singapore; (ii) CPqD, Brasil; (iii) Stevens Institute of Technology, USA; and (iv) University of Ljubljana, Slovenia. Most competitors demonstrated video face recognition performance superior to the baseline provided with PaSC. The results represent the best performance to date on the handheld video portion of the PaSC. |
2013
|
Križaj, Janez; Dobrišek, Simon; Štruc, Vitomir; Pavešić, Nikola Robust 3D face recognition using adapted statistical models Proceedings Article In: Proceedings of the Electrotechnical and Computer Science Conference (ERK'13), 2013. @inproceedings{krizajrobust,
title = {Robust 3D face recognition using adapted statistical models},
author = {Janez Križaj and Simon Dobrišek and Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/robust3dfacerecognitionusingadaptedstatisticalmodels/},
year = {2013},
date = {2013-09-20},
urldate = {2013-09-20},
booktitle = {Proceedings of the Electrotechnical and Computer Science Conference (ERK'13)},
abstract = {The paper presents a novel framework to 3D face recognition that exploits region covariance matrices (RCMs), Gaussian mixture models (GMMs) and support vector machine (SVM) classifiers. The proposed framework first combines several 3D face representations at the feature level using RCM descriptors and then derives low-dimensional feature vectors from the computed descriptors with the unscented transform. By doing so, it enables computations in Euclidean space, and makes Gaussian mixture modeling feasible. Finally, a support vector classifier is used for identity inference. As demonstrated by our experimental results on the FRGCv2 and UMB databases, the proposed framework is highly robust and exhibits desirable characteristics such as an inherent mechanism for data fusion (through the RCMs), the ability to examine local as well as global structures of the face with the same descriptor, the ability to integrate domain-specific prior knowledge into the modeling procedure and consequently to handle missing or unreliable data.},
keywords = {3d face recognition, biometrics, covariance descriptor, face verification, FRGC, GMM, modeling, performance evaluation, region-covariance matrix},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper presents a novel framework to 3D face recognition that exploits region covariance matrices (RCMs), Gaussian mixture models (GMMs) and support vector machine (SVM) classifiers. The proposed framework first combines several 3D face representations at the feature level using RCM descriptors and then derives low-dimensional feature vectors from the computed descriptors with the unscented transform. By doing so, it enables computations in Euclidean space, and makes Gaussian mixture modeling feasible. Finally, a support vector classifier is used for identity inference. As demonstrated by our experimental results on the FRGCv2 and UMB databases, the proposed framework is highly robust and exhibits desirable characteristics such as an inherent mechanism for data fusion (through the RCMs), the ability to examine local as well as global structures of the face with the same descriptor, the ability to integrate domain-specific prior knowledge into the modeling procedure and consequently to handle missing or unreliable data. |
Štruc, Vitomir; Žganec-Gros, Jerneja; Pavešić, Nikola; Dobrišek, Simon Zlivanje informacij za zanseljivo in robustno razpoznavanje obrazov Journal Article In: Electrotechnical Review, vol. 80, no. 3, pp. 1-12, 2013. @article{EV_Struc_2013,
title = {Zlivanje informacij za zanseljivo in robustno razpoznavanje obrazov},
author = {Vitomir Štruc and Jerneja Žganec-Gros and Nikola Pavešić and Simon Dobrišek},
url = {https://lmi.fe.uni-lj.si/en/zlivanjeinformacijzazanseljivoinrobustnorazpoznavanjeobrazov/},
year = {2013},
date = {2013-09-01},
urldate = {2013-09-01},
journal = {Electrotechnical Review},
volume = {80},
number = {3},
pages = {1-12},
abstract = {The existing face recognition technology has reached a performance level where it is possible to deploy it in various applications providing they are capable of ensuring controlled conditions for the image acquisition procedure. However, the technology still struggles with its recognition performance when deployed in uncontrolled and unconstrained conditions. In this paper, we present a novel approach to face recognition designed specifically for these challenging conditions. The proposed approach exploits information fusion to achieve robustness. In the first step, the approach crops the facial region from each input image in three different ways. It then maps each of the three crops into one of four color representations and finally extracts several feature types from each of the twelve facial representations. The described procedure results in a total of thirty facial representations that are combined at the matching score level using a fusion approach based on linear logistic regression (LLR) to arrive at a robust decision regarding the identity of the subject depicted in the input face image. The presented approach was enlisted as a representative of the University of Ljubljana and Alpineon d.o.o. to the 2013 face-recognition competition that was held in conjunction with the IAPR International Conference on Biometrics and achieved the best overall recognition results among all competition participants. Here, we describe the basic characteristics of the approach, elaborate on the results of the competition and, most importantly, present some interesting findings made during our development work that are also of relevance to the research community working in the field of face recognition.},
keywords = {biometrics, face recognition, fusion, performance evaluation},
pubstate = {published},
tppubtype = {article}
}
The existing face recognition technology has reached a performance level where it is possible to deploy it in various applications providing they are capable of ensuring controlled conditions for the image acquisition procedure. However, the technology still struggles with its recognition performance when deployed in uncontrolled and unconstrained conditions. In this paper, we present a novel approach to face recognition designed specifically for these challenging conditions. The proposed approach exploits information fusion to achieve robustness. In the first step, the approach crops the facial region from each input image in three different ways. It then maps each of the three crops into one of four color representations and finally extracts several feature types from each of the twelve facial representations. The described procedure results in a total of thirty facial representations that are combined at the matching score level using a fusion approach based on linear logistic regression (LLR) to arrive at a robust decision regarding the identity of the subject depicted in the input face image. The presented approach was enlisted as a representative of the University of Ljubljana and Alpineon d.o.o. to the 2013 face-recognition competition that was held in conjunction with the IAPR International Conference on Biometrics and achieved the best overall recognition results among all competition participants. Here, we describe the basic characteristics of the approach, elaborate on the results of the competition and, most importantly, present some interesting findings made during our development work that are also of relevance to the research community working in the field of face recognition. |
Križaj, Janez; Štruc, Vitomir; Dobrišek, Simon Combining 3D face representations using region covariance descriptors and statistical models Proceedings Article In: Proceedings of the IEEE International Conference on Automatic Face and Gesture Recognition and Workshops (IEEE FG), Workshop on 3D Face Biometrics, IEEE, Shanghai, China, 2013. @inproceedings{FG2013,
title = {Combining 3D face representations using region covariance descriptors and statistical models},
author = {Janez Križaj and Vitomir Štruc and Simon Dobrišek},
url = {https://lmi.fe.uni-lj.si/en/combining3dfacerepresentationsusingregioncovariancedescriptorsandstatisticalmodels/},
year = {2013},
date = {2013-05-01},
urldate = {2013-05-01},
booktitle = {Proceedings of the IEEE International Conference on Automatic Face and Gesture Recognition and Workshops (IEEE FG), Workshop on 3D Face Biometrics},
publisher = {IEEE},
address = {Shanghai, China},
abstract = {The paper introduces a novel framework for 3D face recognition that capitalizes on region covariance descriptors and Gaussian mixture models. The framework presents an elegant and coherent way of combining multiple facial representations, while simultaneously examining all computed representations at various levels of locality. The framework first computes a number of region covariance matrices/descriptors from different sized regions of several image representations and then adopts the unscented transform to derive low-dimensional feature vectors from the computed descriptors. By doing so, it enables computations in the Euclidean space, and makes Gaussian mixture modeling feasible. In the last step a support vector machine classification scheme is used to make a decision regarding the identity of the modeled input 3D face image. The proposed framework exhibits several desirable characteristics, such as an inherent mechanism for data fusion/integration (through the region covariance matrices), the ability to examine the facial images at different levels of locality, and the ability to integrate domain-specific prior knowledge into the modeling procedure. We assess the feasibility of the proposed framework on the Face Recognition Grand Challenge version 2 (FRGCv2) database with highly encouraging results.},
keywords = {3d face recognition, biometrics, covariance descriptors, face recognition, face verification, FG, gaussian mixture models, GMM, unscented transform},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper introduces a novel framework for 3D face recognition that capitalizes on region covariance descriptors and Gaussian mixture models. The framework presents an elegant and coherent way of combining multiple facial representations, while simultaneously examining all computed representations at various levels of locality. The framework first computes a number of region covariance matrices/descriptors from different sized regions of several image representations and then adopts the unscented transform to derive low-dimensional feature vectors from the computed descriptors. By doing so, it enables computations in the Euclidean space, and makes Gaussian mixture modeling feasible. In the last step a support vector machine classification scheme is used to make a decision regarding the identity of the modeled input 3D face image. The proposed framework exhibits several desirable characteristics, such as an inherent mechanism for data fusion/integration (through the region covariance matrices), the ability to examine the facial images at different levels of locality, and the ability to integrate domain-specific prior knowledge into the modeling procedure. We assess the feasibility of the proposed framework on the Face Recognition Grand Challenge version 2 (FRGCv2) database with highly encouraging results. |
Peer, Peter; Bule, Jernej; Gros, Jerneja Žganec; Štruc, Vitomir Building cloud-based biometric services Journal Article In: Informatica, vol. 37, no. 2, pp. 115, 2013. @article{peer2013building,
title = {Building cloud-based biometric services},
author = {Peter Peer and Jernej Bule and Jerneja Žganec Gros and Vitomir Štruc},
url = {https://lmi.fe.uni-lj.si/en/buildingcloud-basedbiometricservices/},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
journal = {Informatica},
volume = {37},
number = {2},
pages = {115},
publisher = {Slovenian Society Informatika/Slovensko drustvo Informatika},
abstract = {Over the next few years the amount of biometric data being at the disposal of various agencies and authentication service providers is expected to grow significantly. Such quantities of data require not only enormous amounts of storage but unprecedented processing power as well. To be able to face this future challenges more and more people are looking towards cloud computing, which can address these challenges quite effectively with its seemingly unlimited storage capacity, rapid data distribution and parallel processing capabilities. Since the available literature on how to implement cloud-based biometric services is extremely scarce, this paper capitalizes on the most important challenges encountered during the development work on biometric services, presents the most important standards and recommendations pertaining to biometric services in the cloud and ultimately, elaborates on the potential value of cloud-based biometric solutions by presenting a few existing (commercial) examples. In the final part of the paper, a case study on fingerprint recognition in the cloud and its integration into the e-learning environment Moodle is presented.},
keywords = {biometrics, cloud computing, development. SaaS, face recognition, fingerprint recognition},
pubstate = {published},
tppubtype = {article}
}
Over the next few years the amount of biometric data being at the disposal of various agencies and authentication service providers is expected to grow significantly. Such quantities of data require not only enormous amounts of storage but unprecedented processing power as well. To be able to face this future challenges more and more people are looking towards cloud computing, which can address these challenges quite effectively with its seemingly unlimited storage capacity, rapid data distribution and parallel processing capabilities. Since the available literature on how to implement cloud-based biometric services is extremely scarce, this paper capitalizes on the most important challenges encountered during the development work on biometric services, presents the most important standards and recommendations pertaining to biometric services in the cloud and ultimately, elaborates on the potential value of cloud-based biometric solutions by presenting a few existing (commercial) examples. In the final part of the paper, a case study on fingerprint recognition in the cloud and its integration into the e-learning environment Moodle is presented. |
Štruc, Vitomir; Pavešić, Nikola; Žganec-Gros, Jerneja; Vesnicer, Boštjan Patch-wise low-dimensional probabilistic linear discriminant analysis for Face Recognition Proceedings Article In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2352–2356, IEEE 2013. @inproceedings{vstruc2013patch,
title = {Patch-wise low-dimensional probabilistic linear discriminant analysis for Face Recognition},
author = {Vitomir Štruc and Nikola Pavešić and Jerneja Žganec-Gros and Boštjan Vesnicer},
url = {https://lmi.fe.uni-lj.si/en/patch-wiselow-dimensionalprobabilisticlineardiscriminantanalysisforfacerecognition/},
doi = {10.1109/ICASSP.2013.6638075},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {2352--2356},
organization = {IEEE},
abstract = {The paper introduces a novel approach to face recognition based on the recently proposed low-dimensional probabilistic linear discriminant analysis (LD-PLDA). The proposed approach is specifically designed for complex recognition tasks, where highly nonlinear face variations are typically encountered. Such data variations are commonly induced by changes in the external illumination conditions, viewpoint changes or expression variations and represent quite a challenge even for state-of-the-art techniques, such as LD-PLDA. To overcome this problem, we propose here a patch-wise form of the LDPLDA technique (i.e., PLD-PLDA), which relies on local image patches rather than the entire image to make inferences about the identity of the input images. The basic idea here is to decompose the complex face recognition problem into simpler problems, for which the linear nature of the LD-PLDA technique may be better suited. By doing so, several similarity scores are derived from one facial image, which are combined at the final stage using a simple sum-rule fusion scheme to arrive at a single score that can be employed for identity inference. We evaluate the proposed technique on experiment 4 of the Face Recognition Grand Challenge (FRGCv2) database with highly promising results.},
keywords = {biometrics, face verification, FRGC, ICASSP, patch-wise approach, plda, probabilistic linear discriminant analysis},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper introduces a novel approach to face recognition based on the recently proposed low-dimensional probabilistic linear discriminant analysis (LD-PLDA). The proposed approach is specifically designed for complex recognition tasks, where highly nonlinear face variations are typically encountered. Such data variations are commonly induced by changes in the external illumination conditions, viewpoint changes or expression variations and represent quite a challenge even for state-of-the-art techniques, such as LD-PLDA. To overcome this problem, we propose here a patch-wise form of the LDPLDA technique (i.e., PLD-PLDA), which relies on local image patches rather than the entire image to make inferences about the identity of the input images. The basic idea here is to decompose the complex face recognition problem into simpler problems, for which the linear nature of the LD-PLDA technique may be better suited. By doing so, several similarity scores are derived from one facial image, which are combined at the final stage using a simple sum-rule fusion scheme to arrive at a single score that can be employed for identity inference. We evaluate the proposed technique on experiment 4 of the Face Recognition Grand Challenge (FRGCv2) database with highly promising results. |
Günther, Manuel; Costa-Pazo, Artur; Ding, Changxing; Boutellaa, Elhocine; Chiachia, Giovani; Zhang, Honglei; de Angeloni, Marcus Assis; Štruc, Vitomir; Khoury, Elie; Vazquez-Fernandez, Esteban; others, The 2013 face recognition evaluation in mobile environment Proceedings Article In: Proceedings of the IAPR International Conference on Biometrics (ICB), pp. 1–7, IAPR 2013. @inproceedings{gunther20132013,
title = {The 2013 face recognition evaluation in mobile environment},
author = {Manuel Günther and Artur Costa-Pazo and Changxing Ding and Elhocine Boutellaa and Giovani Chiachia and Honglei Zhang and Marcus Assis de Angeloni and Vitomir Štruc and Elie Khoury and Esteban Vazquez-Fernandez and others},
url = {https://lmi.fe.uni-lj.si/en/the2013facerecognitionevaluationinmobileenvironment/},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {Proceedings of the IAPR International Conference on Biometrics (ICB)},
pages = {1--7},
organization = {IAPR},
abstract = {Automatic face recognition in unconstrained environments is a challenging task. To test current trends in face recognition algorithms, we organized an evaluation on face recognition in mobile environment. This paper presents the results of 8 different participants using two verification metrics. Most submitted algorithms rely on one or more of three types of features: local binary patterns, Gabor wavelet responses including Gabor phases, and color information. The best results are obtained from UNILJ-ALP, which fused several image representations and feature types, and UCHU, which learns optimal features with a convolutional neural network. Additionally, we assess the usability of the algorithms in mobile devices with limited resources.},
keywords = {biometrics, competition, face recognition, face verification, group evaluation, mobile biometrics, MOBIO, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
Automatic face recognition in unconstrained environments is a challenging task. To test current trends in face recognition algorithms, we organized an evaluation on face recognition in mobile environment. This paper presents the results of 8 different participants using two verification metrics. Most submitted algorithms rely on one or more of three types of features: local binary patterns, Gabor wavelet responses including Gabor phases, and color information. The best results are obtained from UNILJ-ALP, which fused several image representations and feature types, and UCHU, which learns optimal features with a convolutional neural network. Additionally, we assess the usability of the algorithms in mobile devices with limited resources. |
2012
|
Križaj, Janez; Štruc, Vitomir; Dobrišek, Simon Robust 3D Face Recognition Journal Article In: Electrotechnical Review, vol. 79, no. 1-2, pp. 1-6, 2012. @article{Križaj-EV-2012,
title = {Robust 3D Face Recognition},
author = {Janez Križaj and Vitomir Štruc and Simon Dobrišek},
url = {https://lmi.fe.uni-lj.si/en/robust3dfacerecognition/},
year = {2012},
date = {2012-06-01},
urldate = {2012-06-01},
journal = {Electrotechnical Review},
volume = {79},
number = {1-2},
pages = {1-6},
abstract = {Face recognition in uncontrolled environments is hindered by variations in illumination, pose, expression and occlusions of faces. Many practical face-recognition systems are affected by these variations. One way to increase the robustness to illumination and pose variations is to use 3D facial images. In this paper 3D face-recognition systems are presented. Their structure and operation are described. The robustness of such systems to variations in uncontrolled environments is emphasized. We present some preliminary results of a system developed in our laboratory.},
keywords = {3d face recognition, biometrics, gaussian mixture models, GMM, modeling},
pubstate = {published},
tppubtype = {article}
}
Face recognition in uncontrolled environments is hindered by variations in illumination, pose, expression and occlusions of faces. Many practical face-recognition systems are affected by these variations. One way to increase the robustness to illumination and pose variations is to use 3D facial images. In this paper 3D face-recognition systems are presented. Their structure and operation are described. The robustness of such systems to variations in uncontrolled environments is emphasized. We present some preliminary results of a system developed in our laboratory. |
Vesnicer, Bostjan; Gros, Jerneja Žganec; Pavešić, Nikola; Štruc, Vitomir Face recognition using simplified probabilistic linear discriminant analysis Journal Article In: International Journal of Advanced Robotic Systems, vol. 9, 2012. @article{vesnicer2012face,
title = {Face recognition using simplified probabilistic linear discriminant analysis},
author = {Bostjan Vesnicer and Jerneja Žganec Gros and Nikola Pavešić and Vitomir Štruc},
url = {https://lmi.fe.uni-lj.si/en/facerecognitionusingsimplifiedprobabilisticlineardiscriminantanalysis/},
doi = {10.5772/52258},
year = {2012},
date = {2012-01-01},
urldate = {2012-01-01},
journal = {International Journal of Advanced Robotic Systems},
volume = {9},
publisher = {InTech},
abstract = {Face recognition in uncontrolled environments remains an open problem that has not been satisfactorily solved by existing recognition techniques. In this paper, we tackle this problem using a variant of the recently proposed Probabilistic Linear Discriminant Analysis (PLDA). We show that simplified versions of the PLDA model, which are regularly used in the field of speaker recognition, rely on certain assumptions that not only result in a simpler PLDA model, but also reduce the computational load of the technique and - as indicated by our experimental assessments - improve recognition performance. Moreover, we show that, contrary to the general belief that PLDA-based methods produce well calibrated verification scores, score normalization techniques can still deliver significant performance gains, but only if non-parametric score normalization techniques are employed. Last but not least, we demonstrate the competitiveness of the simplified PLDA model for face recognition by comparing our results with the state-of-the-art results from the literature obtained on the second version of the large-scale Face Recognition Grand Challenge (FRGC) database.},
keywords = {biometrics, face recognition, plda, simplified PLDA},
pubstate = {published},
tppubtype = {article}
}
Face recognition in uncontrolled environments remains an open problem that has not been satisfactorily solved by existing recognition techniques. In this paper, we tackle this problem using a variant of the recently proposed Probabilistic Linear Discriminant Analysis (PLDA). We show that simplified versions of the PLDA model, which are regularly used in the field of speaker recognition, rely on certain assumptions that not only result in a simpler PLDA model, but also reduce the computational load of the technique and - as indicated by our experimental assessments - improve recognition performance. Moreover, we show that, contrary to the general belief that PLDA-based methods produce well calibrated verification scores, score normalization techniques can still deliver significant performance gains, but only if non-parametric score normalization techniques are employed. Last but not least, we demonstrate the competitiveness of the simplified PLDA model for face recognition by comparing our results with the state-of-the-art results from the literature obtained on the second version of the large-scale Face Recognition Grand Challenge (FRGC) database. |
2011
|
Štruc, Vitomir; Pavešić, Nikola Photometric normalization techniques for illumination invariance Book Section In: Zhang, Yu-Jin (Ed.): Advances in Face Image Analysis: Techniques and Technologies, pp. 279-300, IGI-Global, 2011. @incollection{IGI2011,
title = {Photometric normalization techniques for illumination invariance},
author = {Vitomir Štruc and Nikola Pavešić},
editor = {Yu-Jin Zhang},
url = {https://lmi.fe.uni-lj.si/en/photometricnormalizationtechniquesforilluminationinvariance/},
doi = {10.4018/978-1-61520-991-0.ch015},
year = {2011},
date = {2011-01-01},
urldate = {2011-01-01},
booktitle = {Advances in Face Image Analysis: Techniques and Technologies},
pages = {279-300},
publisher = {IGI-Global},
abstract = {Face recognition technology has come a long way since its beginnings in the previous century. Due to its countless application possibilities, it has attracted the interest of research groups from universities and companies around the world. Thanks to this enormous research effort, the recognition rates achievable with the state-of-the-art face recognition technology are steadily growing, even though some issues still pose major challenges to the technology. Amongst these challenges, coping with illumination-induced appearance variations is one of the biggest and still not satisfactorily solved. A number of techniques have been proposed in the literature to cope with the impact of illumination ranging from simple image enhancement techniques, such as histogram equalization, to more elaborate methods, such as anisotropic smoothing or the logarithmic total variation model. This chapter presents an overview of the most popular and efficient normalization techniques that try to solve the illumination variation problem at the preprocessing level. It assesses the techniques on the YaleB and XM2VTS databases and explores their strengths and weaknesses from the theoretical and implementation point of view.},
keywords = {biometrics, face recognition, illumination invariance, illumination normalization, photometric normalization},
pubstate = {published},
tppubtype = {incollection}
}
Face recognition technology has come a long way since its beginnings in the previous century. Due to its countless application possibilities, it has attracted the interest of research groups from universities and companies around the world. Thanks to this enormous research effort, the recognition rates achievable with the state-of-the-art face recognition technology are steadily growing, even though some issues still pose major challenges to the technology. Amongst these challenges, coping with illumination-induced appearance variations is one of the biggest and still not satisfactorily solved. A number of techniques have been proposed in the literature to cope with the impact of illumination ranging from simple image enhancement techniques, such as histogram equalization, to more elaborate methods, such as anisotropic smoothing or the logarithmic total variation model. This chapter presents an overview of the most popular and efficient normalization techniques that try to solve the illumination variation problem at the preprocessing level. It assesses the techniques on the YaleB and XM2VTS databases and explores their strengths and weaknesses from the theoretical and implementation point of view. |
2010
|
Štruc, Vitomir; Pavešić, Nikola Face recogniton from color images using sparse projection analysis Proceedings Article In: Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010), pp. 445-453, Povoa de Varzim, Portugal, 2010. @inproceedings{ICIAR2010_Sparse,
title = {Face recogniton from color images using sparse projection analysis},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/facerecognitonfromcolorimagesusingsparseprojectionanalysis/},
year = {2010},
date = {2010-06-01},
urldate = {2010-06-01},
booktitle = {Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010)},
pages = {445-453},
address = {Povoa de Varzim, Portugal},
abstract = {The paper presents a novel feature extraction technique for face recognition which uses sparse projection axes to compute a lowdimensional representation of face images. The proposed technique derives the sparse axes by first recasting the problem of face recognition as a regression problem and then solving the new (under-determined) regression problem by computing the solution with minimum L1 norm. The developed technique, named Sparse Projection Analysis (SPA), is applied to color as well as grey-scale images from the XM2VTS database and compared to popular subspace projection techniques (with sparse and dense projection axes) from the literature. The results of the experimental assessment show that the proposed technique ensures promising results on un-occluded as well occluded images from the XM2VTS database.},
keywords = {biometrics, face verification, ICIAR, performance evaluation, sparse projection analysis},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper presents a novel feature extraction technique for face recognition which uses sparse projection axes to compute a lowdimensional representation of face images. The proposed technique derives the sparse axes by first recasting the problem of face recognition as a regression problem and then solving the new (under-determined) regression problem by computing the solution with minimum L1 norm. The developed technique, named Sparse Projection Analysis (SPA), is applied to color as well as grey-scale images from the XM2VTS database and compared to popular subspace projection techniques (with sparse and dense projection axes) from the literature. The results of the experimental assessment show that the proposed technique ensures promising results on un-occluded as well occluded images from the XM2VTS database. |
Križaj, Janez; Štruc, Vitomir; Pavešić, Nikola Adaptation of SIFT Features for Robust Face Recognition Proceedings Article In: Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010), pp. 394-404, Povoa de Varzim, Portugal, 2010. @inproceedings{ICIAR2010_Sift,
title = {Adaptation of SIFT Features for Robust Face Recognition},
author = {Janez Križaj and Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/adaptationofsiftfeaturesforrobustfacerecognition/},
year = {2010},
date = {2010-06-01},
urldate = {2010-06-01},
booktitle = {Proceedings of the 7th International Conference on Image Analysis and Recognition (ICIAR 2010)},
pages = {394-404},
address = {Povoa de Varzim, Portugal},
abstract = {The Scale Invariant Feature Transform (SIFT) is an algorithm used to detect and describe scale-, translation- and rotation-invariant local features in images. The original SIFT algorithm has been successfully applied in general object detection and recognition tasks, panorama stitching and others. One of its more recent uses also includes face recognition, where it was shown to deliver encouraging results. SIFT-based face recognition techniques found in the literature rely heavily on the so-called keypoint detector, which locates interest points in the given image that are ultimately used to compute the SIFT descriptors. While these descriptors are known to be among others (partially) invariant to illumination changes, the keypoint detector is not. Since varying illumination is one of the main issues affecting the performance of face recognition systems, the keypoint detector represents the main source of errors in face recognition systems relying on SIFT features. To overcome the presented shortcoming of SIFT-based methods, we present in this paper a novel face recognition technique that computes the SIFT descriptors at predefined (fixed) locations learned during the training stage. By doing so, it eliminates the need for keypoint detection on the test images and renders our approach more robust to illumination changes than related approaches from the literature. Experiments, performed on the Extended Yale B face database, show that the proposed technique compares favorably with several popular techniques from the literature in terms of performance.},
keywords = {biometrics, dense SIFT, face recognition, performance evaluation, SIFT, SIFT features},
pubstate = {published},
tppubtype = {inproceedings}
}
The Scale Invariant Feature Transform (SIFT) is an algorithm used to detect and describe scale-, translation- and rotation-invariant local features in images. The original SIFT algorithm has been successfully applied in general object detection and recognition tasks, panorama stitching and others. One of its more recent uses also includes face recognition, where it was shown to deliver encouraging results. SIFT-based face recognition techniques found in the literature rely heavily on the so-called keypoint detector, which locates interest points in the given image that are ultimately used to compute the SIFT descriptors. While these descriptors are known to be among others (partially) invariant to illumination changes, the keypoint detector is not. Since varying illumination is one of the main issues affecting the performance of face recognition systems, the keypoint detector represents the main source of errors in face recognition systems relying on SIFT features. To overcome the presented shortcoming of SIFT-based methods, we present in this paper a novel face recognition technique that computes the SIFT descriptors at predefined (fixed) locations learned during the training stage. By doing so, it eliminates the need for keypoint detection on the test images and renders our approach more robust to illumination changes than related approaches from the literature. Experiments, performed on the Extended Yale B face database, show that the proposed technique compares favorably with several popular techniques from the literature in terms of performance. |
Štruc, Vitomir; Vesnicer, Boštjan; Mihelič, France; Pavešić, Nikola Removing Illumination Artifacts from Face Images using the Nuisance Attribute Projection Proceedings Article In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'10), pp. 846-849, IEEE, Dallas, Texas, USA, 2010. @inproceedings{ICASSP2010,
title = {Removing Illumination Artifacts from Face Images using the Nuisance Attribute Projection},
author = {Vitomir Štruc and Boštjan Vesnicer and France Mihelič and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/removingilluminationartifactsfromfaceimagesusingthenuisanceattributeprojection/},
doi = {10.1109/ICASSP.2010.5495203},
year = {2010},
date = {2010-03-01},
urldate = {2010-03-01},
booktitle = {Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'10)},
pages = {846-849},
publisher = {IEEE},
address = {Dallas, Texas, USA},
abstract = {Illumination induced appearance changes represent one of the open challenges in automated face recognition systems still significantly influencing their performance. Several techniques have been presented in the literature to cope with this problem; however, a universal solution remains to be found. In this paper we present a novel normalization scheme based on the nuisance attribute projection (NAP), which tries to remove the effects of illumination by projecting away multiple dimensions of a low dimensional illumination subspace. The technique is assessed in face recognition experiments performed on the extended YaleB and XM2VTS databases. Comparative results with state-of-the-art techniques show the competitiveness of the proposed technique.},
keywords = {biometrics, face recognition, face verification, illumination changes, illumination invariance, nuisance attribute projection, robust recognition},
pubstate = {published},
tppubtype = {inproceedings}
}
Illumination induced appearance changes represent one of the open challenges in automated face recognition systems still significantly influencing their performance. Several techniques have been presented in the literature to cope with this problem; however, a universal solution remains to be found. In this paper we present a novel normalization scheme based on the nuisance attribute projection (NAP), which tries to remove the effects of illumination by projecting away multiple dimensions of a low dimensional illumination subspace. The technique is assessed in face recognition experiments performed on the extended YaleB and XM2VTS databases. Comparative results with state-of-the-art techniques show the competitiveness of the proposed technique. |
Štruc, Vitomir; Pavešić, Nikola From Gabor Magnitude to Gabor Phase Features: Tackling the Problem of Face Recognition under Severe Illumination Changes Book Section In: Oravec, Milos (Ed.): Face Recognition, pp. 215-238, In-Tech, Vienna, 2010. @incollection{InTech2010,
title = {From Gabor Magnitude to Gabor Phase Features: Tackling the Problem of Face Recognition under Severe Illumination Changes},
author = {Vitomir Štruc and Nikola Pavešić},
editor = {Milos Oravec},
url = {https://lmi.fe.uni-lj.si/en/fromgabormagnitudetogaborphasefeaturestacklingtheproblemoffacerecognitionundersevereilluminationchanges/},
doi = {10.5772/8938},
year = {2010},
date = {2010-01-01},
urldate = {2010-01-01},
booktitle = {Face Recognition},
pages = {215-238},
publisher = {In-Tech},
address = {Vienna},
keywords = {biometrics, face recognition, feature extraction, Gabor features, Gabor filters, illumination changes, phase features},
pubstate = {published},
tppubtype = {incollection}
}
|
Štruc, Vitomir; Pavešić, Nikola The Complete Gabor-Fisher Classifier for Robust Face Recognition Journal Article In: EURASIP Advances in Signal Processing, vol. 2010, pp. 26, 2010. @article{CGF-Struc_2010,
title = {The Complete Gabor-Fisher Classifier for Robust Face Recognition},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/thecompletegabor-fisherclassifierforrobustfacerecognition/},
doi = {10.1155/2010/847680},
year = {2010},
date = {2010-01-01},
urldate = {2010-01-01},
journal = {EURASIP Advances in Signal Processing},
volume = {2010},
pages = {26},
abstract = {This paper develops a novel face recognition technique called Complete Gabor Fisher Classifier (CGFC). Different from existing techniques that use Gabor filters for deriving the Gabor face representation, the proposed approach does not rely solely on Gabor magnitude information but effectively uses features computed based on Gabor phase information as well. It represents one of the few successful attempts found in the literature of combining Gabor magnitude and phase information for robust face recognition. The novelty of the proposed CGFC technique comes from (1) the introduction of a Gabor phase-based face representation and (2) the combination of the recognition technique using the proposed representation with classical Gabor magnitude-based methods into a unified framework. The proposed face recognition framework is assessed in a series of face verification and identification experiments performed on the XM2VTS, Extended YaleB, FERET, and AR databases. The results of the assessment suggest that the proposed technique clearly outperforms state-of-the-art face recognition techniques from the literature and that its performance is almost unaffected by the presence of partial occlusions of the facial area, changes in facial expression, or severe illumination changes.},
keywords = {biometrics, combined model, face recognition, feature extraction, Gabor features, phase features},
pubstate = {published},
tppubtype = {article}
}
This paper develops a novel face recognition technique called Complete Gabor Fisher Classifier (CGFC). Different from existing techniques that use Gabor filters for deriving the Gabor face representation, the proposed approach does not rely solely on Gabor magnitude information but effectively uses features computed based on Gabor phase information as well. It represents one of the few successful attempts found in the literature of combining Gabor magnitude and phase information for robust face recognition. The novelty of the proposed CGFC technique comes from (1) the introduction of a Gabor phase-based face representation and (2) the combination of the recognition technique using the proposed representation with classical Gabor magnitude-based methods into a unified framework. The proposed face recognition framework is assessed in a series of face verification and identification experiments performed on the XM2VTS, Extended YaleB, FERET, and AR databases. The results of the assessment suggest that the proposed technique clearly outperforms state-of-the-art face recognition techniques from the literature and that its performance is almost unaffected by the presence of partial occlusions of the facial area, changes in facial expression, or severe illumination changes. |
Poh, Norman; Chan, Chi Ho; Kittler, Josef; Marcel, Sebastien; Cool, Christopher Mc; Rua, Enrique Argones; Castro, Jose Luis Alba; Villegas, Mauricio; Paredes, Roberto; Struc, Vitomir; others, An evaluation of video-to-video face verification Journal Article In: IEEE Transactions on Information Forensics and Security, vol. 5, no. 4, pp. 781–801, 2010. @article{poh2010evaluation,
title = {An evaluation of video-to-video face verification},
author = {Norman Poh and Chi Ho Chan and Josef Kittler and Sebastien Marcel and Christopher Mc Cool and Enrique Argones Rua and Jose Luis Alba Castro and Mauricio Villegas and Roberto Paredes and Vitomir Struc and others},
url = {https://lmi.fe.uni-lj.si/en/anevaluationofvideo-to-videofaceverification/},
doi = {10.1109/TIFS.2010.2077627},
year = {2010},
date = {2010-01-01},
urldate = {2010-01-01},
journal = {IEEE Transactions on Information Forensics and Security},
volume = {5},
number = {4},
pages = {781--801},
publisher = {IEEE},
abstract = {Person recognition using facial features, e.g., mug-shot images, has long been used in identity documents. However, due to the widespread use of web-cams and mobile devices embedded with a camera, it is now possible to realize facial video recognition, rather than resorting to just still images. In fact, facial video recognition offers many advantages over still image recognition; these include the potential of boosting the system accuracy and deterring spoof attacks. This paper presents an evaluation of person identity verification using facial video data, organized in conjunction with the International Conference on Biometrics (ICB 2009). It involves 18 systems submitted by seven academic institutes. These systems provide for a diverse set of assumptions, including feature representation and preprocessing variations, allowing us to assess the effect of adverse conditions, usage of quality information, query selection, and template construction for video-to-video face authentication.},
keywords = {biometrics, competition, face recognition, face verification, group evaluation, video},
pubstate = {published},
tppubtype = {article}
}
Person recognition using facial features, e.g., mug-shot images, has long been used in identity documents. However, due to the widespread use of web-cams and mobile devices embedded with a camera, it is now possible to realize facial video recognition, rather than resorting to just still images. In fact, facial video recognition offers many advantages over still image recognition; these include the potential of boosting the system accuracy and deterring spoof attacks. This paper presents an evaluation of person identity verification using facial video data, organized in conjunction with the International Conference on Biometrics (ICB 2009). It involves 18 systems submitted by seven academic institutes. These systems provide for a diverse set of assumptions, including feature representation and preprocessing variations, allowing us to assess the effect of adverse conditions, usage of quality information, query selection, and template construction for video-to-video face authentication. |
Štruc, Vitomir; Dobrišek, Simon; Pavešić, Nikola Confidence Weighted Subspace Projection Techniques for Robust Face Recognition in the Presence of Partial Occlusions Proceedings Article In: Proceedings of the International Conference on Pattern Recognition (ICPR'10), pp. 1334-1338, Istanbul, Turkey, 2010. @inproceedings{ICPR_Struc_2010,
title = {Confidence Weighted Subspace Projection Techniques for Robust Face Recognition in the Presence of Partial Occlusions},
author = {Vitomir Štruc and Simon Dobrišek and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/confidenceweightedsubspaceprojectiontechniquesforrobustfacerecognitioninthepresenceofpartialocclusions/},
year = {2010},
date = {2010-01-01},
urldate = {2010-01-01},
booktitle = {Proceedings of the International Conference on Pattern Recognition (ICPR'10)},
pages = {1334-1338},
address = {Istanbul, Turkey},
keywords = {biometrics, face recognition, face verification, ICPR, performance evaluation, subspace projection},
pubstate = {published},
tppubtype = {inproceedings}
}
|
2009
|
Štruc, Vitomir; Gajšek, Rok; Pavešić, Nikola Principal Gabor Filters for Face Recognition Proceedings Article In: Proceedings of the 3rd IEEE International Conference on Biometrics: Theory, Systems and Applications (BTAS'09), pp. 1-6, IEEE, Washington D.C., U.S.A., 2009. @inproceedings{BTAS2009,
title = {Principal Gabor Filters for Face Recognition},
author = {Vitomir Štruc and Rok Gajšek and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/principalgaborfiltersforfacerecognition/},
doi = {10.1109/BTAS.2009.5339020},
year = {2009},
date = {2009-09-01},
urldate = {2009-09-01},
booktitle = {Proceedings of the 3rd IEEE International Conference on Biometrics: Theory, Systems and Applications (BTAS'09)},
pages = {1-6},
publisher = {IEEE},
address = {Washington D.C., U.S.A.},
abstract = {Gabor filters have proven themselves to be a powerful tool for facial feature extraction. An abundance of recognition techniques presented in the literature exploits these filters to achieve robust face recognition. However, while exhibiting desirable properties, such as orientational selectivity or spatial locality, Gabor filters have also some shortcomings which crucially affect the characteristics and size of the Gabor representation of a given face pattern. Amongst these shortcomings the fact that the filters are not orthogonal one to another and are, hence, correlated is probably the most important. This makes the information contained in the Gabor face representation redundant and also affects the size of the representation. To overcome this problem we propose in this paper to employ orthonormal linear combinations of the original Gabor filters rather than the filters themselves for deriving the Gabor face representation. The filters, named principal Gabor filters for the fact that they are computed by means of principal component analysis, are assessed in face recognition experiments performed on the XM2VTS and YaleB databases, where encouraging results are achieved.},
keywords = {biometrics, face verification, feature extraction, Gabor features, performance evaluation, principal Gabor filters},
pubstate = {published},
tppubtype = {inproceedings}
}
Gabor filters have proven themselves to be a powerful tool for facial feature extraction. An abundance of recognition techniques presented in the literature exploits these filters to achieve robust face recognition. However, while exhibiting desirable properties, such as orientational selectivity or spatial locality, Gabor filters have also some shortcomings which crucially affect the characteristics and size of the Gabor representation of a given face pattern. Amongst these shortcomings the fact that the filters are not orthogonal one to another and are, hence, correlated is probably the most important. This makes the information contained in the Gabor face representation redundant and also affects the size of the representation. To overcome this problem we propose in this paper to employ orthonormal linear combinations of the original Gabor filters rather than the filters themselves for deriving the Gabor face representation. The filters, named principal Gabor filters for the fact that they are computed by means of principal component analysis, are assessed in face recognition experiments performed on the XM2VTS and YaleB databases, where encouraging results are achieved. |
Štruc, Vitomir; Ma, Zongmin; Pavešić, Nikola Nuisance Attribute Projection in the Logarithm Domain for Face Recognition under Severe Illumination Changes Proceedings Article In: Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'09), pp. 279-281, Portorož, Slovenia, 2009. @inproceedings{ERK2009N,
title = {Nuisance Attribute Projection in the Logarithm Domain for Face Recognition under Severe Illumination Changes},
author = {Vitomir Štruc and Zongmin Ma and Nikola Pavešić},
year = {2009},
date = {2009-09-01},
booktitle = {Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'09)},
pages = {279-281},
address = {Portorož, Slovenia},
keywords = {biometrics, face verification, illumination changes, illumination invariance, nuisance attribute projection, performance evaluation, robust recognition},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Štruc, Vitomir; Ma, Zongmin; Pavešić, Nikola Face Recognition using Sparse Projection Axes Proceedings Article In: Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'09), pp. 271-274, Portorož, Slovenia, 2009. @inproceedings{ERK2009S,
title = {Face Recognition using Sparse Projection Axes},
author = {Vitomir Štruc and Zongmin Ma and Nikola Pavešić},
year = {2009},
date = {2009-09-01},
booktitle = {Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'09)},
pages = {271-274},
address = {Portorož, Slovenia},
keywords = {biometrics, erk, face recognition, face verification, performance evaluation, sparse projection analysis},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Štruc, Vitomir; Pavešić, Nikola A comparative assessment of appearance based feature extraction techniques and their susceptibility to image degradations in face recognition systems Proceedings Article In: Proceedings of the International Conference on Machine Learning and Pattern Recognition (ICMLPR'09), pp. 326-334, Paris, France, 2009. @inproceedings{FSKD208b,
title = {A comparative assessment of appearance based feature extraction techniques and their susceptibility to image degradations in face recognition systems},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/acomparativeassessmentofappearancebasedfeatureextractiontechniquesandtheirsusceptibilitytoimagedegradationsinfacerecognitionsystems/},
year = {2009},
date = {2009-06-01},
urldate = {2009-06-01},
booktitle = {Proceedings of the International Conference on Machine Learning and Pattern Recognition (ICMLPR'09)},
volume = {54},
pages = {326-334},
address = {Paris, France},
abstract = {Over the past decades, automatic face recognition has become a highly active research area, mainly due to the countless application possibilities in both the private as well as the public sector. Numerous algorithms have been proposed in the literature to cope with the problem of face recognition, nevertheless, a group of methods commonly referred to as appearance based have emerged as the dominant solution to the face recognition problem. Many comparative studies concerned with the performance of appearance based methods have already been presented in the literature, not rarely with inconclusive and often with contradictory results. No consent has been reached within the scientific community regarding the relative ranking of the efficiency of appearance based methods for the face recognition task, let alone regarding their susceptibility to appearance changes induced by various environmental factors. To tackle these open issues, this paper assess the performance of the three dominant appearance based methods: principal component analysis, linear discriminant analysis and independent component analysis, and compares them on equal footing (i.e., with the same preprocessing procedure, with optimized parameters for the best possible performance, etc.) in face verification experiments on the publicly available XM2VTS database. In addition to the comparative analysis on the XM2VTS database, ten degraded versions of the database are also employed in the experiments to evaluate the susceptibility of the appearance based methods on various image degradations which can occur in ”real-life” operating conditions. Our experimental results suggest that linear discriminant analysis ensures the most consistent verification rates across the tested databases.},
keywords = {biometrics, face recognition, face verification, image degradations, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
Over the past decades, automatic face recognition has become a highly active research area, mainly due to the countless application possibilities in both the private as well as the public sector. Numerous algorithms have been proposed in the literature to cope with the problem of face recognition, nevertheless, a group of methods commonly referred to as appearance based have emerged as the dominant solution to the face recognition problem. Many comparative studies concerned with the performance of appearance based methods have already been presented in the literature, not rarely with inconclusive and often with contradictory results. No consent has been reached within the scientific community regarding the relative ranking of the efficiency of appearance based methods for the face recognition task, let alone regarding their susceptibility to appearance changes induced by various environmental factors. To tackle these open issues, this paper assess the performance of the three dominant appearance based methods: principal component analysis, linear discriminant analysis and independent component analysis, and compares them on equal footing (i.e., with the same preprocessing procedure, with optimized parameters for the best possible performance, etc.) in face verification experiments on the publicly available XM2VTS database. In addition to the comparative analysis on the XM2VTS database, ten degraded versions of the database are also employed in the experiments to evaluate the susceptibility of the appearance based methods on various image degradations which can occur in ”real-life” operating conditions. Our experimental results suggest that linear discriminant analysis ensures the most consistent verification rates across the tested databases. |
Štruc, Vitomir; Pavešić, Nikola A comparison of feature normalization techniques for PCA-based palmprint recognition Proceedings Article In: Proceedings of the International Conference on Mathematical Modeling (MATHMOD'09), pp. 2450-2453, Viena, Austria, 2009. @inproceedings{Mathmod09,
title = {A comparison of feature normalization techniques for PCA-based palmprint recognition},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/acomparisonoffeaturenormalizationtechniquesforpca-basedpalmprintrecognition/},
year = {2009},
date = {2009-02-01},
urldate = {2009-02-01},
booktitle = {Proceedings of the International Conference on Mathematical Modeling (MATHMOD'09)},
pages = {2450-2453},
address = {Viena, Austria},
abstract = {Computing user templates (or models) for biometric authentication systems is one of the most crucial steps towards efficient and accurate biometric recognition. The constructed templates should encode user specific information extracted from a sample of a given biometric modality, such as, for example, palmprints, and exhibit a sufficient level of dissimilarity with other templates stored in the systems database. Clearly, the characteristics of the user templates depend on the approach employed for the extraction of biometric features, as well as on the procedure used to normalize the extracted feature vectors. While feature-extraction methods are a well studied topic, for which a vast amount of comparative studies can be found in the literature, normalization techniques lack such studies and are only briefly mentioned in most cases. In this paper we, therefore, apply several normalization techniques to feature vectors extracted from palmprint images by means of principal component analysis (PCA) and perform a comparative analysis on the results. We show that the choice of an appropriate normalization technique greatly influences the performance of the palmprint-based authentication system and can result in error rate reductions of more than 30%.},
keywords = {biometrics, face verification, feature normalization, normalization, pca, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
Computing user templates (or models) for biometric authentication systems is one of the most crucial steps towards efficient and accurate biometric recognition. The constructed templates should encode user specific information extracted from a sample of a given biometric modality, such as, for example, palmprints, and exhibit a sufficient level of dissimilarity with other templates stored in the systems database. Clearly, the characteristics of the user templates depend on the approach employed for the extraction of biometric features, as well as on the procedure used to normalize the extracted feature vectors. While feature-extraction methods are a well studied topic, for which a vast amount of comparative studies can be found in the literature, normalization techniques lack such studies and are only briefly mentioned in most cases. In this paper we, therefore, apply several normalization techniques to feature vectors extracted from palmprint images by means of principal component analysis (PCA) and perform a comparative analysis on the results. We show that the choice of an appropriate normalization technique greatly influences the performance of the palmprint-based authentication system and can result in error rate reductions of more than 30%. |
Štruc, Vitomir; Pavešić, Nikola Image normalization techniques for robust face recognition Proceedings Article In: Proceedings of the International Conference on Signal Processing, Robotics and Automation (ISPRA'09), pp. 155-160, Cambridge, UK, 2009. @inproceedings{ISPRA09,
title = {Image normalization techniques for robust face recognition},
author = {Vitomir Štruc and Nikola Pavešić},
year = {2009},
date = {2009-02-01},
booktitle = {Proceedings of the International Conference on Signal Processing, Robotics and Automation (ISPRA'09)},
pages = {155-160},
address = {Cambridge, UK},
keywords = {biometrics, face recognition, face verification, histogram remapping, performance evaluation, preprocessing},
pubstate = {published},
tppubtype = {inproceedings}
}
|
Štruc, Vitomir; Pavešić, Nikola Hand-Geometry Device Book Section In: Li, Stan Z (Ed.): Encyclopedia of biometrics, pp. 693-698, Springer-Verlag, New York, 2009. @incollection{Springer2009,
title = {Hand-Geometry Device},
author = {Vitomir Štruc and Nikola Pavešić},
editor = {Stan Z Li},
url = {https://lmi.fe.uni-lj.si/en/hand-geometrydevice/},
doi = {10.1007/978-0-387-73003-5_14},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
booktitle = {Encyclopedia of biometrics},
pages = {693-698},
publisher = {Springer-Verlag},
address = {New York},
abstract = {Hand-geometry devices are specially designed biometric devices used for capturing the geometric characteristics (e.g., the length, width, thickness and curvature of the fingers, the palm size, and the distances between joints) of a human hand for hand-geometry-based identity verification. A typical hand-geometry device records images of the lateral and dorsal parts of the hand with a charge-coupled device (CCD) camera that is mounted above a flat surface on which the person presented to the device places his/her hand. The set of geometrical features extracted from these images is then matched against a pre-recorded template stored in the device’s database. Depending on the result of this matching procedure, the identity of the person presented to the device is either verified or not.},
keywords = {biometrics, device, encyclopedia, hand geometry, sensor},
pubstate = {published},
tppubtype = {incollection}
}
Hand-geometry devices are specially designed biometric devices used for capturing the geometric characteristics (e.g., the length, width, thickness and curvature of the fingers, the palm size, and the distances between joints) of a human hand for hand-geometry-based identity verification. A typical hand-geometry device records images of the lateral and dorsal parts of the hand with a charge-coupled device (CCD) camera that is mounted above a flat surface on which the person presented to the device places his/her hand. The set of geometrical features extracted from these images is then matched against a pre-recorded template stored in the device’s database. Depending on the result of this matching procedure, the identity of the person presented to the device is either verified or not. |
Štruc, Vitomir; Pavešić, Nikola Gabor-based kernel-partial-least-squares discrimination features for face recognition Journal Article In: Informatica (Vilnius), vol. 20, no. 1, pp. 115-138, 2009. @article{Inform-Struc_2009,
title = {Gabor-based kernel-partial-least-squares discrimination features for face recognition},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/gabor-basedkernel-partial-least-squaresdiscriminationfeaturesforfacerecognition/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
journal = {Informatica (Vilnius)},
volume = {20},
number = {1},
pages = {115-138},
abstract = {The paper presents a novel method for the extraction of facial features based on the Gabor-wavelet representation of face images and the kernel partial-least-squares discrimination (KPLSD) algorithm. The proposed feature-extraction method, called the Gabor-based kernel partial-least-squares discrimination (GKPLSD), is performed in two consecutive steps. In the first step a set of forty Gabor wavelets is used to extract discriminative and robust facial features, while in the second step the kernel partial-least-squares discrimination technique is used to reduce the dimensionality of the Gabor feature vector and to further enhance its discriminatory power. For optimal performance, the KPLSD-based transformation is implemented using the recently proposed fractional-power-polynomial models. The experimental results based on the XM2VTS and ORL databases show that the GKPLSD approach outperforms feature-extraction methods such as principal component analysis (PCA), linear discriminant analysis (LDA), kernel principal component analysis (KPCA) or generalized discriminant analysis (GDA) as well as combinations of these methods with Gabor representations of the face images. Furthermore, as the KPLSD algorithm is derived from the kernel partial-least-squares regression (KPLSR) model it does not suffer from the small-sample-size problem, which is regularly encountered in the field of face recognition.},
keywords = {biometrics, face recogntiion, kernel partial least squares, kpca, lda, pca},
pubstate = {published},
tppubtype = {article}
}
The paper presents a novel method for the extraction of facial features based on the Gabor-wavelet representation of face images and the kernel partial-least-squares discrimination (KPLSD) algorithm. The proposed feature-extraction method, called the Gabor-based kernel partial-least-squares discrimination (GKPLSD), is performed in two consecutive steps. In the first step a set of forty Gabor wavelets is used to extract discriminative and robust facial features, while in the second step the kernel partial-least-squares discrimination technique is used to reduce the dimensionality of the Gabor feature vector and to further enhance its discriminatory power. For optimal performance, the KPLSD-based transformation is implemented using the recently proposed fractional-power-polynomial models. The experimental results based on the XM2VTS and ORL databases show that the GKPLSD approach outperforms feature-extraction methods such as principal component analysis (PCA), linear discriminant analysis (LDA), kernel principal component analysis (KPCA) or generalized discriminant analysis (GDA) as well as combinations of these methods with Gabor representations of the face images. Furthermore, as the KPLSD algorithm is derived from the kernel partial-least-squares regression (KPLSR) model it does not suffer from the small-sample-size problem, which is regularly encountered in the field of face recognition. |
Štruc, Vitomir; Žibert, Janez; Pavešić, Nikola Histogram remapping as a preprocessing step for robust face recognition Journal Article In: WSEAS transactions on information science and applications, vol. 6, no. 3, pp. 520-529, 2009. @article{WSEAS-Struc_2009,
title = {Histogram remapping as a preprocessing step for robust face recognition},
author = {Vitomir Štruc and Janez Žibert and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/histogramremappingasapreprocessingstepforrobustfacerecognition/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
journal = {WSEAS transactions on information science and applications},
volume = {6},
number = {3},
pages = {520-529},
abstract = {Image preprocessing techniques represent an essential part of a face recognition systems, which has a great impact on the performance and robustness of the recognition procedure. Amongst the number of techniques already presented in the literature, histogram equalization has emerged as the dominant preprocessing technique and is regularly used for the task of face recognition. With the property of increasing the global contrast of the facial image while simultaneously compensating for the illumination conditions present at the image acquisition stage, it represents a useful preprocessing step, which can ensure enhanced and more robust recognition performance. Even though, more elaborate normalization techniques, such as the multiscale retinex technique, isotropic and anisotropic smoothing, have been introduced to field of face recognition, they have been found to be more of a complement than a real substitute for histogram equalization. However, by closer examining the characteristics of histogram equalization, one can quickly discover that it represents only a specific case of a more general concept of histogram remapping techniques (which may have similar characteristics as histogram equalization does). While histogram equalization remapps the histogram of a given facial image to a uniform distribution, the target distribution could easily be replaced with an arbitrary one. As there is no theoretical justification of why the uniform distribution should be preferred to other target distributions, the question arises: how do other (non-uniform) target distributions influence the face recognition process and are they better suited for the recognition task. To tackle this issues, we present in this paper an empirical assessment of the concept of histogram remapping with the following target distributions: the uniform, the normal, the lognormal and the exponential distribution. We perform comparative experiments on the publicly available XM2VTS and YaleB databases and conclude that similar or even better recognition results that those ensured by histogram equalization can be achieved when other (non-uniform) target distribution are considered for the histogram remapping. This enhanced performance, however, comes at a price, as the nonuniform distributions rely on some parameters which have to be trained or selected appropriately to achieve the optimal performance.},
keywords = {biometrics, face recognition, histogram, histogram remapping, image processing, preprocessing},
pubstate = {published},
tppubtype = {article}
}
Image preprocessing techniques represent an essential part of a face recognition systems, which has a great impact on the performance and robustness of the recognition procedure. Amongst the number of techniques already presented in the literature, histogram equalization has emerged as the dominant preprocessing technique and is regularly used for the task of face recognition. With the property of increasing the global contrast of the facial image while simultaneously compensating for the illumination conditions present at the image acquisition stage, it represents a useful preprocessing step, which can ensure enhanced and more robust recognition performance. Even though, more elaborate normalization techniques, such as the multiscale retinex technique, isotropic and anisotropic smoothing, have been introduced to field of face recognition, they have been found to be more of a complement than a real substitute for histogram equalization. However, by closer examining the characteristics of histogram equalization, one can quickly discover that it represents only a specific case of a more general concept of histogram remapping techniques (which may have similar characteristics as histogram equalization does). While histogram equalization remapps the histogram of a given facial image to a uniform distribution, the target distribution could easily be replaced with an arbitrary one. As there is no theoretical justification of why the uniform distribution should be preferred to other target distributions, the question arises: how do other (non-uniform) target distributions influence the face recognition process and are they better suited for the recognition task. To tackle this issues, we present in this paper an empirical assessment of the concept of histogram remapping with the following target distributions: the uniform, the normal, the lognormal and the exponential distribution. We perform comparative experiments on the publicly available XM2VTS and YaleB databases and conclude that similar or even better recognition results that those ensured by histogram equalization can be achieved when other (non-uniform) target distribution are considered for the histogram remapping. This enhanced performance, however, comes at a price, as the nonuniform distributions rely on some parameters which have to be trained or selected appropriately to achieve the optimal performance. |
Štruc, Vitomir; Gajšek, Rok; Mihelič, France; Pavešić, Nikola Using regression techniques for coping with the one-sample-size problem of face recognition Journal Article In: Electrotechnical Review, vol. 76, no. 1-2, pp. 7-12, 2009. @article{EV-Struc_2009,
title = {Using regression techniques for coping with the one-sample-size problem of face recognition},
author = {Vitomir Štruc and Rok Gajšek and France Mihelič and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/usingregressiontechniquesforcopingwiththeone-sample-sizeproblemoffacerecognition/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
journal = {Electrotechnical Review},
volume = {76},
number = {1-2},
pages = {7-12},
abstract = {There is a number of face recognition paradigms which ensure good recognition rates with frontal face images. However, the majority of them require an extensive training set and degrade in their performance when an insufficient number of training images is available. This is especially true for applications where only one image per subject is at hand for training. To cope with this one-sample-size (OSS) problem, we propose to employ subspace projection based regression techniques rather than modifications of the established face recognition paradigms, such as the principal component or linear discriminant analysis, as it was done in the past. Experiments performed on the XM2VTS and ORL databases show the effectiveness of the proposed approach. Also presented is a comparative assessment of several regression techniques and some popular face
recognition methods.},
keywords = {biometrics, face recognition, one sample size problem, regression techniques, small sample size},
pubstate = {published},
tppubtype = {article}
}
There is a number of face recognition paradigms which ensure good recognition rates with frontal face images. However, the majority of them require an extensive training set and degrade in their performance when an insufficient number of training images is available. This is especially true for applications where only one image per subject is at hand for training. To cope with this one-sample-size (OSS) problem, we propose to employ subspace projection based regression techniques rather than modifications of the established face recognition paradigms, such as the principal component or linear discriminant analysis, as it was done in the past. Experiments performed on the XM2VTS and ORL databases show the effectiveness of the proposed approach. Also presented is a comparative assessment of several regression techniques and some popular face
recognition methods. |
Štruc, Vitomir; Pavešić, Nikola Phase-congruency features for palm-print verification Journal Article In: IET Signal Processing, vol. 3, no. 4, pp. 258-268, 2009. @article{IET-Struc_2009,
title = {Phase-congruency features for palm-print verification},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/phase-congruencyfeaturesforpalm-printverification/},
doi = {10.1049/iet-spr.2008.0152},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
journal = {IET Signal Processing},
volume = {3},
number = {4},
pages = {258-268},
keywords = {biometrics, feature extraction, palmprint verification, palmprints, phase congruency features, recognition},
pubstate = {published},
tppubtype = {article}
}
|
Štruc, Vitomir; Pavešić, Nikola Gaussianization of image patches for efficient palmprint recognition Journal Article In: Electrotechnical Review, vol. 76, no. 5, pp. 245-250, 2009. @article{EV_2009_palms,
title = {Gaussianization of image patches for efficient palmprint recognition},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/gaussianizationofimagepatchesforefficientpalmprintrecognition/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
journal = {Electrotechnical Review},
volume = {76},
number = {5},
pages = {245-250},
abstract = {In this paper we present a comparison of the two dominant image preprocessing techniques for palmprint recognition, namely, histogram equalization and mean-variance normalization. We show that both techniques pursue a similar goal and that the difference in recognition efficiency stems from the fact that not all assumptions underlying the mean-variance normalization approach are always met. We present an alternative justification of why histogram equalization ensures enhanced verification performance, and, based on the findings, propose two novel preprocessing techniques: gaussianization of the palmprint images and gaussianization of image patches. We present comparative results obtained on the PolyU database and show that the patch-based normalization technique ensures stat-of-the-art recognition results with a simple feature extraction method and the nearest neighbor classifier.},
keywords = {biometrics, gaussianization, histogram remapping, palmprint recognition, palmprints, preprocessing},
pubstate = {published},
tppubtype = {article}
}
In this paper we present a comparison of the two dominant image preprocessing techniques for palmprint recognition, namely, histogram equalization and mean-variance normalization. We show that both techniques pursue a similar goal and that the difference in recognition efficiency stems from the fact that not all assumptions underlying the mean-variance normalization approach are always met. We present an alternative justification of why histogram equalization ensures enhanced verification performance, and, based on the findings, propose two novel preprocessing techniques: gaussianization of the palmprint images and gaussianization of image patches. We present comparative results obtained on the PolyU database and show that the patch-based normalization technique ensures stat-of-the-art recognition results with a simple feature extraction method and the nearest neighbor classifier. |
Poh, Norman; Chan, Chi Ho; Kittler, Josef; Marcel, Sebastien; McCool, Christopher; Argones-Rua, Enrique; Alba-Castro, Jose Luis; Villegas, Mauricio; Paredes, Roberto; Štruc, Vitomir; Pavešić, Nikola; Salah, Albert Ali; Fang, Hui; Costen, Nicholas Face Video Competition Proceedings Article In: Tistarelli, Massimo; Nixon, Mark (Ed.): Proceedings of the international Conference on Biometrics (ICB), pp. 715-724, Springer-Verlag, Berlin, Heidelberg, 2009. @inproceedings{ICB2009,
title = {Face Video Competition},
author = {Norman Poh and Chi Ho Chan and Josef Kittler and Sebastien Marcel and Christopher McCool and Enrique Argones-Rua and Jose Luis Alba-Castro and Mauricio Villegas and Roberto Paredes and Vitomir Štruc and Nikola Pavešić and Albert Ali Salah and Hui Fang and Nicholas Costen},
editor = {Massimo Tistarelli and Mark Nixon},
url = {https://lmi.fe.uni-lj.si/en/facevideocompetition/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
booktitle = {Proceedings of the international Conference on Biometrics (ICB)},
volume = {5558},
pages = {715-724},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
series = {Lecture Notes on Computer Science},
abstract = {Person recognition using facial features, e.g., mug-shot images, has long been used in identity documents. However, due to the widespread use of web-cams and mobile devices embedded with a camera, it is now possible to realise facial video recognition, rather than resorting to just still images. In fact, facial video recognition offers many advantages over still image recognition; these include the potential of boosting the system accuracy and deterring spoof attacks. This paper presents the first known benchmarking effort of person identity verification using facial video data. The evaluation involves 18 systems submitted by seven academic institutes.},
keywords = {biometrics, competition, face recognition, face verification, ICB, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
Person recognition using facial features, e.g., mug-shot images, has long been used in identity documents. However, due to the widespread use of web-cams and mobile devices embedded with a camera, it is now possible to realise facial video recognition, rather than resorting to just still images. In fact, facial video recognition offers many advantages over still image recognition; these include the potential of boosting the system accuracy and deterring spoof attacks. This paper presents the first known benchmarking effort of person identity verification using facial video data. The evaluation involves 18 systems submitted by seven academic institutes. |
Štruc, Vitomir; Pavešić, Nikola Illumination Invariant Face Recognition by Non-Local Smoothing Proceedings Article In: Biometric ID management and multimodal communication, pp. 1-8, Springer-Verlag, Berlin, Heidelberg, 2009. @inproceedings{BioID_Multi2009,
title = {Illumination Invariant Face Recognition by Non-Local Smoothing},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/illuminationinvariantfacerecognitionbynon-localsmoothing/},
year = {2009},
date = {2009-01-01},
urldate = {2009-01-01},
booktitle = {Biometric ID management and multimodal communication},
volume = {5707},
pages = {1-8},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
series = {Lecture Notes on Computer Science},
abstract = {Existing face recognition techniques struggle with their performance when identities have to be determined (recognized) based on image data captured under challenging illumination conditions. To overcome the susceptibility of the existing techniques to illumination variations numerous normalization techniques have been proposed in the literature. These normalization techniques, however, still exhibit some shortcomings and, thus, offer room for improvement. In this paper we identify the most important weaknesses of the commonly adopted illumination normalization techniques and presents two novel approaches which make use of the recently proposed non-local means algorithm. We assess the performance of the proposed techniques on the YaleB face database and report preliminary results.},
keywords = {biometrics, face verification, illumination changes, illumination invariance, illumination normalization, pca, preprocessing},
pubstate = {published},
tppubtype = {inproceedings}
}
Existing face recognition techniques struggle with their performance when identities have to be determined (recognized) based on image data captured under challenging illumination conditions. To overcome the susceptibility of the existing techniques to illumination variations numerous normalization techniques have been proposed in the literature. These normalization techniques, however, still exhibit some shortcomings and, thus, offer room for improvement. In this paper we identify the most important weaknesses of the commonly adopted illumination normalization techniques and presents two novel approaches which make use of the recently proposed non-local means algorithm. We assess the performance of the proposed techniques on the YaleB face database and report preliminary results. |
2008
|
Štruc, Vitomir; Vesnicer, Boštjan; Pavešić, Nikola The phase-based Gabor Fisher classifier and its application to face recognition under varying illumination conditions Proceedings Article In: Proceedings of the IEEE International Conference on Signal Processing and Communication Systems (ICSPCS'08), pp. 1-6, IEEE, Gold Coast, Australia, 2008, ISBN: 978-1-4244-4243-0. @inproceedings{ICSPCS08,
title = {The phase-based Gabor Fisher classifier and its application to face recognition under varying illumination conditions},
author = {Vitomir Štruc and Boštjan Vesnicer and Nikola Pavešić},
doi = {10.1109/ICSPCS.2008.4813663},
isbn = {978-1-4244-4243-0},
year = {2008},
date = {2008-12-01},
booktitle = {Proceedings of the IEEE International Conference on Signal Processing and Communication Systems (ICSPCS'08)},
pages = {1-6},
publisher = {IEEE},
address = {Gold Coast, Australia},
abstract = {The paper introduces a feature extraction technique for face recognition called the phase-based Gabor Fisher classifier (PBGFC). The PBGFC method constructs an augmented feature vector which encompasses Gabor-phase information derived from a novel representation of face images - the oriented Gabor phase congruency image (OGPCI) - and then applies linear discriminant analysis to the augmented feature vector to reduce its dimensionality. The feasibility of the proposed method was assessed in a series of face verification experiments performed on the XM2VTS database. The experimental results show that the PBGFC method performs better than other popular feature extraction techniques such as principal component analysis (PCA), the Fisherface method or the DCT-mod2 approach, while it ensures similar verification performance as the established Gabor Fisher Classifier (GFC). The results also show that the proposed phase-based Gabor Fisher classifier performs the best among the tested methods when severe illumination changes are introduced to the face images.},
keywords = {biometrics, face verification, feature extraction, Gabor features, performance evaluation, phase congruency features, phase features},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper introduces a feature extraction technique for face recognition called the phase-based Gabor Fisher classifier (PBGFC). The PBGFC method constructs an augmented feature vector which encompasses Gabor-phase information derived from a novel representation of face images - the oriented Gabor phase congruency image (OGPCI) - and then applies linear discriminant analysis to the augmented feature vector to reduce its dimensionality. The feasibility of the proposed method was assessed in a series of face verification experiments performed on the XM2VTS database. The experimental results show that the PBGFC method performs better than other popular feature extraction techniques such as principal component analysis (PCA), the Fisherface method or the DCT-mod2 approach, while it ensures similar verification performance as the established Gabor Fisher Classifier (GFC). The results also show that the proposed phase-based Gabor Fisher classifier performs the best among the tested methods when severe illumination changes are introduced to the face images. |
Štruc, Vitomir; Pavešić, Nikola The corrected normalized correlation coefficient: a novel way of matching score calculation for LDA-based face verification Proceedings Article In: Proceedings of the IEEE International Conference on Fuzzy Systems and Knowledge Discovery (FSKD'08), pp. 110-115, IEEE, Jinan, China, 2008, ISBN: 978-0-7695-3305-6. @inproceedings{FSKD208b,
title = {The corrected normalized correlation coefficient: a novel way of matching score calculation for LDA-based face verification},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/thecorrectednormalizedcorrelationcoefficientanovelwayofmatchingscorecalculationforlda-basedfaceverification/},
doi = {10.1109/FSKD.2008.334},
isbn = {978-0-7695-3305-6},
year = {2008},
date = {2008-10-01},
urldate = {2008-10-01},
booktitle = {Proceedings of the IEEE International Conference on Fuzzy Systems and Knowledge Discovery (FSKD'08)},
volume = {4},
pages = {110-115},
publisher = {IEEE},
address = {Jinan, China},
abstract = {The paper presents a novel way of matching score calculation for LDA-based face verification. Different from the classical matching schemes, where the decision regarding the identity of the user currently presented to the face verification system is made based on the similarity (or distance) between the "live" feature vector and the template of the claimed identity, we propose to employ a measure we named the corrected normalized correlation coefficient, which considers both the similarity with the template of the claimed identity as well as the similarity with all other templates stored in the database. The effectiveness of the proposed measure was assessed on the publicly available XM2VTS database where encouraging results were achieved.},
keywords = {biometrics, face verification, lda, matching score calculation},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper presents a novel way of matching score calculation for LDA-based face verification. Different from the classical matching schemes, where the decision regarding the identity of the user currently presented to the face verification system is made based on the similarity (or distance) between the "live" feature vector and the template of the claimed identity, we propose to employ a measure we named the corrected normalized correlation coefficient, which considers both the similarity with the template of the claimed identity as well as the similarity with all other templates stored in the database. The effectiveness of the proposed measure was assessed on the publicly available XM2VTS database where encouraging results were achieved. |
Štruc, Vitomir; Mihelič, France; Gajšek, Rok; Pavešić, Nikola Regression techniques versus discriminative methods for face recognition Proceedings Article In: Proceedings of the 9th international PhD Workshop on Systems and Control, pp. 1-5, Izola, Slovenia, 2008. @inproceedings{PHD2008,
title = {Regression techniques versus discriminative methods for face recognition},
author = {Vitomir Štruc and France Mihelič and Rok Gajšek and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/regressiontechniquesversusdiscriminativemethodsforfacerecognition/},
year = {2008},
date = {2008-10-01},
urldate = {2008-10-01},
booktitle = {Proceedings of the 9th international PhD Workshop on Systems and Control},
pages = {1-5},
address = {Izola, Slovenia},
abstract = {In the field of face recognition it is generally believed that ”state of the art” recognition rates can only be achieved when discriminative (e.g., linear or generalized discriminant analysis) rather than expressive (e.g., principal or kernel principal component analysis) methods are used for facial feature extraction. However, while being superior in terms of the recognition rates, the discriminative techniques still exhibit some shortcomings when compared to the expressive approaches. More specifically, they suffer from the so-called small sample size (SSS) problem which is regularly encountered in the field of face recognition and occurs when the sample dimensionality is larger than the number of available training samples per subject. In this type of problems, the discriminative techniques need modifications in order to be feasible, but even in their most elaborate forms require at least two training samples per subject. The expressive approaches, on the other hand, are not susceptible to the SSS problem and are thus applicable even in the most extreme case of the small sample size problem, i.e., when only one training sample per subject is available. Nevertheless, in this paper we will show that the recognition performance of the expressive methods can match (or in some cases surpass) that of the discriminative techniques if the expressive feature extraction approaches are used as multivariate regression techniques with a pre-designed response matrix that encodes the class membership of the training samples. The effectiveness of the regression techniques for face recognition is demonstrated in a series of experiments performed on the ORL database. Additionally a comparative assessment of the regression techniques and popular discriminative approaches is presented.},
keywords = {biometrics, face recognition, face verification, modeling, performance evaluation, regression techniques},
pubstate = {published},
tppubtype = {inproceedings}
}
In the field of face recognition it is generally believed that ”state of the art” recognition rates can only be achieved when discriminative (e.g., linear or generalized discriminant analysis) rather than expressive (e.g., principal or kernel principal component analysis) methods are used for facial feature extraction. However, while being superior in terms of the recognition rates, the discriminative techniques still exhibit some shortcomings when compared to the expressive approaches. More specifically, they suffer from the so-called small sample size (SSS) problem which is regularly encountered in the field of face recognition and occurs when the sample dimensionality is larger than the number of available training samples per subject. In this type of problems, the discriminative techniques need modifications in order to be feasible, but even in their most elaborate forms require at least two training samples per subject. The expressive approaches, on the other hand, are not susceptible to the SSS problem and are thus applicable even in the most extreme case of the small sample size problem, i.e., when only one training sample per subject is available. Nevertheless, in this paper we will show that the recognition performance of the expressive methods can match (or in some cases surpass) that of the discriminative techniques if the expressive feature extraction approaches are used as multivariate regression techniques with a pre-designed response matrix that encodes the class membership of the training samples. The effectiveness of the regression techniques for face recognition is demonstrated in a series of experiments performed on the ORL database. Additionally a comparative assessment of the regression techniques and popular discriminative approaches is presented. |
Štruc, Vitomir; Mihelič, France; Pavešić, Nikola Combining experts for improved face verification performance Proceedings Article In: Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'08), pp. 233-236, Portorož, Slovenia, 2008. @inproceedings{ERK2008,
title = {Combining experts for improved face verification performance},
author = {Vitomir Štruc and France Mihelič and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/combiningexpertsforimprovedfaceverificationperformance/},
year = {2008},
date = {2008-09-01},
urldate = {2008-09-01},
booktitle = {Proceedings of the IEEE International Electrotechnical and Computer Science Conference (ERK'08)},
pages = {233-236},
address = {Portorož, Slovenia},
abstract = {Samodejno razpoznavanje (avtentikacija/identifikacija) obrazov predstavlja eno najaktivnejših raziskovalnih področij biometrije. Avtentikacija oz. identifikacija oseb z razpoznavanjem obrazov ponuja možen način povečanja varnosti pri različnih dejavnostih, (npr. pri elektronskem poslovanju na medmrežju, pri bančnih storitvah ali pri vstopu v določene prostore, stavbe in države). Ponuja univerzalen in nevsiljiv način razpoznavanja oseb, ki pa trenutno še ni dovolj zanesljiv. Kot možna rešitev problema zanesljivosti razpoznavanja se v literaturi vse pogosteje pojavljajo večmodalni pristopi, v katerih se razpoznavanje izvede na podlagi večjega števila postopkov razpoznavanja obrazov. V skladu z opisanim trendom, bomo v članku ovrednotili zanesljivost delovanja različnih postopkov razpoznavanja obrazov, ki jih bomo na koncu združili še v večmodalni pristop. S pomočjo eksperimentov na podatkovni zbirki XM2VTS bomo preverili zanesljivost delovanja večmodalnega pristopa in jo primerjali z zanesljivostjo uveljavljenih postopkov razpoznavanja.},
keywords = {biometrics, erk, face recognition, face verification, fusion, performance evaluation},
pubstate = {published},
tppubtype = {inproceedings}
}
Samodejno razpoznavanje (avtentikacija/identifikacija) obrazov predstavlja eno najaktivnejših raziskovalnih področij biometrije. Avtentikacija oz. identifikacija oseb z razpoznavanjem obrazov ponuja možen način povečanja varnosti pri različnih dejavnostih, (npr. pri elektronskem poslovanju na medmrežju, pri bančnih storitvah ali pri vstopu v določene prostore, stavbe in države). Ponuja univerzalen in nevsiljiv način razpoznavanja oseb, ki pa trenutno še ni dovolj zanesljiv. Kot možna rešitev problema zanesljivosti razpoznavanja se v literaturi vse pogosteje pojavljajo večmodalni pristopi, v katerih se razpoznavanje izvede na podlagi večjega števila postopkov razpoznavanja obrazov. V skladu z opisanim trendom, bomo v članku ovrednotili zanesljivost delovanja različnih postopkov razpoznavanja obrazov, ki jih bomo na koncu združili še v večmodalni pristop. S pomočjo eksperimentov na podatkovni zbirki XM2VTS bomo preverili zanesljivost delovanja večmodalnega pristopa in jo primerjali z zanesljivostjo uveljavljenih postopkov razpoznavanja. |
Štruc, Vitomir; Pavešić, Nikola Palmprint recognition using the trace transform Proceedings Article In: Proceedings of the national conference ROSUS'08, pp. 41-48, Maribor, Slovenia, 2008. @inproceedings{rosus08,
title = {Palmprint recognition using the trace transform},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/palmprintrecognitionusingthetracetransform/},
year = {2008},
date = {2008-03-01},
urldate = {2008-03-01},
booktitle = {Proceedings of the national conference ROSUS'08},
pages = {41-48},
address = {Maribor, Slovenia},
abstract = {Biometrija je znanstvena veda o metodah razpoznavanja ljudi na podlagi njihovih fizioloških in/ali vedenjskih značilnosti. Sistemi, ki uporabljajo te metode, služijo kot varnostni mehanizmi za omejevanje dostopa do določenih prostorov, zgradb ali storitev ter kot pomoč pri kriminalističnih preiskavah. V članku predstavljamo primer biometričnega sistema, ki preveri identiteto uporabnika na podlagi slike njegove dlani. Sistem temelji na novem, hibridnem postopku izpeljave značilk, ki na slikovnem področju dlani najprej izvede Kadyrov-Petrouvo transformacijo, transformirane slike pa s postopkom linearne diskriminantne analize v nadaljevanju pretvori v kompaktne vektorje značilk. Uspešnost razpoznavanja s predlaganim sistemom smo preizkusili na obsežni podatkovni zbirki, kjer smo dosegli zadovoljive rezultate.},
keywords = {biometrics, palmprints, trace transform},
pubstate = {published},
tppubtype = {inproceedings}
}
Biometrija je znanstvena veda o metodah razpoznavanja ljudi na podlagi njihovih fizioloških in/ali vedenjskih značilnosti. Sistemi, ki uporabljajo te metode, služijo kot varnostni mehanizmi za omejevanje dostopa do določenih prostorov, zgradb ali storitev ter kot pomoč pri kriminalističnih preiskavah. V članku predstavljamo primer biometričnega sistema, ki preveri identiteto uporabnika na podlagi slike njegove dlani. Sistem temelji na novem, hibridnem postopku izpeljave značilk, ki na slikovnem področju dlani najprej izvede Kadyrov-Petrouvo transformacijo, transformirane slike pa s postopkom linearne diskriminantne analize v nadaljevanju pretvori v kompaktne vektorje značilk. Uspešnost razpoznavanja s predlaganim sistemom smo preizkusili na obsežni podatkovni zbirki, kjer smo dosegli zadovoljive rezultate. |
Štruc, Vitomir; Mihelič, France; Pavešić, Nikola Face authentication using a hybrid approach Journal Article In: Journal of Electronic Imaging, vol. 17, no. 1, pp. 1-11, 2008. @article{JEI-Struc_2008,
title = {Face authentication using a hybrid approach},
author = {Vitomir Štruc and France Mihelič and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/faceauthenticationusingahybridapproach/},
doi = {10.1117/1.2885149},
year = {2008},
date = {2008-01-01},
urldate = {2008-01-01},
journal = {Journal of Electronic Imaging},
volume = {17},
number = {1},
pages = {1-11},
abstract = {This paper presents a hybrid approach to face-feature extraction based on the trace transform and the novel kernel partial-least-squares discriminant analysis (KPA). The hybrid approach, called trace kernel partial-least-squares discriminant analysis (TKPA) first uses a set of fifteen trace functionals to derive robust and discriminative facial features and then applies the KPA method to reduce their dimensionality. The feasibility of the proposed approach was successfully tested on the XM2VTS database, where a false rejection rate (FRR) of 1.25% and a false acceptance rate (FAR) of 2.11% were achieved in our best-performing face-authentication experiment. The experimental results also show that the proposed approach can outperform kernel methods such as generalized discriminant analysis (GDA), kernel fisher analysis (KFA) and complete kernel fisher discriminant analysis (CKFA) as well as combinations of these methods with features extracted using the trace transform.},
keywords = {biometrics, face recognition, hybrid approach, kernel partial least squares, trace transform},
pubstate = {published},
tppubtype = {article}
}
This paper presents a hybrid approach to face-feature extraction based on the trace transform and the novel kernel partial-least-squares discriminant analysis (KPA). The hybrid approach, called trace kernel partial-least-squares discriminant analysis (TKPA) first uses a set of fifteen trace functionals to derive robust and discriminative facial features and then applies the KPA method to reduce their dimensionality. The feasibility of the proposed approach was successfully tested on the XM2VTS database, where a false rejection rate (FRR) of 1.25% and a false acceptance rate (FAR) of 2.11% were achieved in our best-performing face-authentication experiment. The experimental results also show that the proposed approach can outperform kernel methods such as generalized discriminant analysis (GDA), kernel fisher analysis (KFA) and complete kernel fisher discriminant analysis (CKFA) as well as combinations of these methods with features extracted using the trace transform. |
2007
|
Mihelič, Nikola Pavešić Vitomir Štruc France Color spaces for face recognition Proceedings Article In: Proceedings of the International Electrotechnical and Computer Science Conference (ERK'07), pp. 171-174, Portorož, Slovenia, 2007. @inproceedings{ERK2007,
title = {Color spaces for face recognition},
author = {Nikola Pavešić Vitomir Štruc France Mihelič},
url = {https://lmi.fe.uni-lj.si/en/colorspacesforfacerecognition/},
year = {2007},
date = {2007-01-01},
urldate = {2007-01-01},
booktitle = {Proceedings of the International Electrotechnical and Computer Science Conference (ERK'07)},
pages = {171-174},
address = {Portorož, Slovenia},
abstract = {The paper investigates the impact that the face-image color space has on the verification performance of two popular face recognition procedures, i.e., the Fisherface approach and the Gabor-Fisher classifier - GFC. Experimental results on the XM2VTS database show that the Fisherface technique performs best when features are extracted from the Cr component of the YCbCr color space, while the performance of the Gabor-Fisher classifier is optimized when grey-scale intensity face-images are used for feature extraction. Based on these findings, a novel face recognition framework that combines the Fisherface and the GFC method is introduced in this paper and its feasibility demonstrated in a comparative study where, in addition to the proposed method, six widely used feature extraction techniques were tested for their face verification performance.},
key = {ERK2007},
keywords = {biometrics, color spaces, computer vision, erk, face recognition, local conference},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper investigates the impact that the face-image color space has on the verification performance of two popular face recognition procedures, i.e., the Fisherface approach and the Gabor-Fisher classifier - GFC. Experimental results on the XM2VTS database show that the Fisherface technique performs best when features are extracted from the Cr component of the YCbCr color space, while the performance of the Gabor-Fisher classifier is optimized when grey-scale intensity face-images are used for feature extraction. Based on these findings, a novel face recognition framework that combines the Fisherface and the GFC method is introduced in this paper and its feasibility demonstrated in a comparative study where, in addition to the proposed method, six widely used feature extraction techniques were tested for their face verification performance. |
Štruc, Vitomir; Pavešić, Nikola Impact of image degradations on the face recognition accuracy Journal Article In: Electrotechnical Review, vol. 74, no. 3, pp. 145-150, 2007. @article{EV-Struc_2007,
title = {Impact of image degradations on the face recognition accuracy},
author = {Vitomir Štruc and Nikola Pavešić},
url = {https://lmi.fe.uni-lj.si/en/impactofimagedegradationsonthefacerecognitionaccuracy/},
year = {2007},
date = {2007-01-01},
urldate = {2007-01-01},
journal = {Electrotechnical Review},
volume = {74},
number = {3},
pages = {145-150},
abstract = {The accuracy of automatic face recognition systems depends on various factors among which robustness and accuracy of the face localization procedure, choice of an appropriate face-feature extraction procedure, as well as use of a suitable matching algorithm are the most important. Current systems perform relatively well whenever test images to be recognized are captured under conditions similar to those of the training images. However, they are not robust enough if there is a difference between test and training images. Changes in image characteristics such as noise, colour depth, background and compression all cause a drop in performance of even the best systems of today. At this point the main question is which image characteristics are the most important in terms of face recognition performance and how they affect the recognition accuracy. This paper addresses these issues and presents performance evaluation (Table 2.) of three popular subspace methods (PCA, LDA and ICA) using ten degraded versions of the XM2VTS face image database [10]. The presented experimental results show the effects of different changes in image characteristics on four score level fusion rules, namely, the maximum, minimum, sum and product rule. All of the feature extraction procedures as well as the fusion strategies are rather insensitive to the presence of noise, JPEG compression, colour depth reduction, and so forth, while on the other hand they all exhibit great sensitivity to degradations such as face occlusion and packet loss simulation},
keywords = {biometrics, face recognition, ica, image degradations, lda, pca},
pubstate = {published},
tppubtype = {article}
}
The accuracy of automatic face recognition systems depends on various factors among which robustness and accuracy of the face localization procedure, choice of an appropriate face-feature extraction procedure, as well as use of a suitable matching algorithm are the most important. Current systems perform relatively well whenever test images to be recognized are captured under conditions similar to those of the training images. However, they are not robust enough if there is a difference between test and training images. Changes in image characteristics such as noise, colour depth, background and compression all cause a drop in performance of even the best systems of today. At this point the main question is which image characteristics are the most important in terms of face recognition performance and how they affect the recognition accuracy. This paper addresses these issues and presents performance evaluation (Table 2.) of three popular subspace methods (PCA, LDA and ICA) using ten degraded versions of the XM2VTS face image database [10]. The presented experimental results show the effects of different changes in image characteristics on four score level fusion rules, namely, the maximum, minimum, sum and product rule. All of the feature extraction procedures as well as the fusion strategies are rather insensitive to the presence of noise, JPEG compression, colour depth reduction, and so forth, while on the other hand they all exhibit great sensitivity to degradations such as face occlusion and packet loss simulation |
0000
|
Peter Rot Blaz Meden, Philipp Terhorst Privacy-Enhancing Face Biometrics: A Comprehensive Survey Journal Article In: IEEE Transactions on Information Forensics and Security, vol. vol. 16, pp. 4147-4183, 0000. @article{TIFS_PrivacySurvey,
title = {Privacy-Enhancing Face Biometrics: A Comprehensive Survey},
author = {Blaz Meden, Peter Rot, Philipp Terhorst, Naser Damer, Arjan Kuijper, Walter J. Scheirer, Arun Ross, Peter Peer, Vitomir Srruc},
url = {https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9481149
https://lmi.fe.uni-lj.si/en/visual_privacy_of_faces__a_survey_preprint-compressed/},
doi = {10.1109/TIFS.2021.3096024},
journal = {IEEE Transactions on Information Forensics and Security},
volume = {vol. 16},
pages = {4147-4183},
abstract = {Biometric recognition technology has made significant advances over the last decade and is now used across a number of services and applications. However, this widespread deployment has also resulted in privacy concerns and evolving societal expectations about the appropriate use of the technology. For example, the ability to automatically extract age, gender, race, and health cues from biometric data has heightened concerns about privacy leakage. Face recognition technology, in particular, has been in the spotlight, and is now seen by many as posing a considerable risk to personal privacy. In response to these and similar concerns, researchers have intensified efforts towards developing techniques and computational models capable of ensuring privacy to individuals, while still facilitating the utility of face recognition technology in several application scenarios. These efforts have resulted in a multitude of privacy--enhancing techniques that aim at addressing privacy risks originating from biometric systems and providing technological solutions for legislative requirements set forth in privacy laws and regulations, such as GDPR. The goal of this overview paper is to provide a comprehensive introduction into privacy--related research in the area of biometrics and review existing work on textit{Biometric Privacy--Enhancing Techniques} (B--PETs) applied to face biometrics. To make this work useful for as wide of an audience as possible, several key topics are covered as well, including evaluation strategies used with B--PETs, existing datasets, relevant standards, and regulations and critical open issues that will have to be addressed in the future. },
keywords = {B-PETs, biometrics, DEID, deidentification, face deidentification, face recognition, FaceGEN, overview, privacy, privacy-enhancing techniques, survey},
pubstate = {published},
tppubtype = {article}
}
Biometric recognition technology has made significant advances over the last decade and is now used across a number of services and applications. However, this widespread deployment has also resulted in privacy concerns and evolving societal expectations about the appropriate use of the technology. For example, the ability to automatically extract age, gender, race, and health cues from biometric data has heightened concerns about privacy leakage. Face recognition technology, in particular, has been in the spotlight, and is now seen by many as posing a considerable risk to personal privacy. In response to these and similar concerns, researchers have intensified efforts towards developing techniques and computational models capable of ensuring privacy to individuals, while still facilitating the utility of face recognition technology in several application scenarios. These efforts have resulted in a multitude of privacy--enhancing techniques that aim at addressing privacy risks originating from biometric systems and providing technological solutions for legislative requirements set forth in privacy laws and regulations, such as GDPR. The goal of this overview paper is to provide a comprehensive introduction into privacy--related research in the area of biometrics and review existing work on textit{Biometric Privacy--Enhancing Techniques} (B--PETs) applied to face biometrics. To make this work useful for as wide of an audience as possible, several key topics are covered as well, including evaluation strategies used with B--PETs, existing datasets, relevant standards, and regulations and critical open issues that will have to be addressed in the future. |