Transfer discriminative logmaps

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, transfer learning has attracted much attention in multimedia. In this paper, we propose an efficient transfer dimensionality reduction algorithm called transfer discriminative Logmaps (TDL). TDL finds a common feature so that 1) the quadratic distance between the distribution of the training set and that of the testing set is minimized and 2) specific knowledge of the training samples can be conveniently delivered to or shared with the testing samples. Drawing on this common feature in the representation space, our objective is to develop a linear subspace in which discriminative and geometric information can be exploited. TDL adopts the margin maximization to identify discriminative information between different classes, while Logmaps is used to preserve the local-global geodesic distance as well as the direction information. Experiments carried out on both synthetic and real-word image datasets show the effectiveness of TDL for cross-domain face recognition and web image annotation. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Si, S., Tao, D., & Chan, K. P. (2009). Transfer discriminative logmaps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5879 LNCS, pp. 131–143). https://doi.org/10.1007/978-3-642-10467-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free