Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/3506
Title: Assessing facial age similarity: a framework for evaluating the robustness of different feature sets
Authors: Tsapatsoulis, Nicolas 
Lanitis, Andreas 
metadata.dc.contributor.other: Τσαπατσούλης, Νικόλας
Λανίτης, Ανδρέας
Major Field of Science: Natural Sciences
Field Category: Computer and Information Sciences
Keywords: Accurate sets;Age progression;Face images;Feature sets;Feature vectors;Imaging conditions;Noise effects;Biometrics
Issue Date: 2014
Source: 13th International Conference of the Biometrics Special Interest Group, 2014, Darmstadt, Germany, 10-12 September 2014
Abstract: A framework that can be used for assessing the suitability of different feature vectors in the task of determining the age similarity between a pair of faces is introduced. This framework involves the use of a dataset containing images displaying compounded types of variation along with the use of an ideal dataset, containing pairs of age-separated face images captured under identical imaging conditions. The use of the ideal dataset in conjunction with deliberate introduction of controlled noise, allows the extraction of conclusions related to the robustness of different feature vectors to different types of noise effects. The ultimate aim of this work is the derivation of comprehensive and accurate set of metrics for evaluating the performance of age progression algorithms in order to support comparative age progression evaluations.
URI: https://hdl.handle.net/20.500.14279/3506
Type: Conference Papers
Affiliation : Cyprus University of Technology 
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation

Files in This Item:
File Description SizeFormat
Tsapatsoulis_2014.pdf134.68 kBAdobe PDFView/Open
CORE Recommender
Show full item record

Page view(s) 20

457
Last Week
0
Last month
4
checked on Nov 21, 2024

Download(s) 20

91
checked on Nov 21, 2024

Google ScholarTM

Check


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.