Publikacije

@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 = {},

pubstate = {published},

tppubtype = {article}

}

@article{MUROVEC2004220,

title = {A repairing technique for the local search of the job-shop problem},

author = {Boštjan Murovec and Peter Šuhel},

url = {http://www.sciencedirect.com/science/article/pii/S0377221702007336},

doi = {https://doi.org/10.1016/S0377-2217(02)00733-6},

issn = {0377-2217},

year  = {2004},

date = {2004-01-01},

journal = {European Journal of Operational Research},

volume = {153},

number = {1},

pages = {220 - 238},

abstract = {The local search technique has become a widely used tool for solving many combinatorial optimization problems. In the case of the job-shop the implementation of such a technique is not straightforward at all due to the existence of the technological constraints among the operations that belong to the same job. Their presence renders a certain set of schedules infeasible. Consequently, special attention is required when defining optimization algorithms to prevent the possibility of reaching an infeasible schedule during execution. Traditionally, the problem is tackled on the neighborhood level by using only a limited set of moves for which feasibility inherently holds. This paper proposes an alternative way to avoid infeasibility by incorporating a repairing technique into the mechanism for applying moves to a schedule. Whenever an infeasible move is being applied, a repairing mechanism rearranges the underlying schedule in such a way that the feasibility of the move is restored. The possibility of reaching infeasible solutions is, therefore, eliminated on the lowest possible conceptual level. Consequently, neighborhood functions need not to be constrained to a limited set of feasible moves any more.},

note = {Timetabling and Rostering},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@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 = {},

pubstate = {published},

tppubtype = {article}

}