Scaling up Class-Specific Kernel Discriminant Analysis for large-scale Face Verification
Research output: Contribution to journal › Article › Scientific › peer-review
Standard
Scaling up Class-Specific Kernel Discriminant Analysis for large-scale Face Verification. / Iosifidis, Alexandros; Gabbouj, Moncef.
In: IEEE Transactions on Information Forensics and Security, Vol. 11, No. 11, 2016, p. 2453-2465.Research output: Contribution to journal › Article › Scientific › peer-review
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Scaling up Class-Specific Kernel Discriminant Analysis for large-scale Face Verification
AU - Iosifidis, Alexandros
AU - Gabbouj, Moncef
PY - 2016
Y1 - 2016
N2 - In this paper, a novel approximate solution of the criterion used in non-linear class-specific discriminant subspace learning is proposed. We build on the Class-Specific Kernel Spectral Regression method which is a two-step process formed by an eigenanalysis step and a kernel regression step. Based on the structure of the intra-class and out-of-class scatter matrices, we provide a fast solution for the first step. For the second step, we propose the use of approximate kernel space definitions. We analytically show that the adoption of randomized and classspecific kernels have the effect of regularization and Nystr¨ombased approximation, respectively. We evaluate the proposed approach in face verification problems and compare it with existing approaches. Experimental results show the effectiveness and efficiency of the proposed Approximate Class-Specific Kernel Spectral Regression method, since it can provide satisfactory performance and scale well with the size of the data.
AB - In this paper, a novel approximate solution of the criterion used in non-linear class-specific discriminant subspace learning is proposed. We build on the Class-Specific Kernel Spectral Regression method which is a two-step process formed by an eigenanalysis step and a kernel regression step. Based on the structure of the intra-class and out-of-class scatter matrices, we provide a fast solution for the first step. For the second step, we propose the use of approximate kernel space definitions. We analytically show that the adoption of randomized and classspecific kernels have the effect of regularization and Nystr¨ombased approximation, respectively. We evaluate the proposed approach in face verification problems and compare it with existing approaches. Experimental results show the effectiveness and efficiency of the proposed Approximate Class-Specific Kernel Spectral Regression method, since it can provide satisfactory performance and scale well with the size of the data.
U2 - 10.1109/TIFS.2016.2582562
DO - 10.1109/TIFS.2016.2582562
M3 - Article
VL - 11
SP - 2453
EP - 2465
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
SN - 1556-6013
IS - 11
ER -