Twin Kernel Embedding

Visualization of non-vectorial objects is not easy in practice due to their lack of convenient vectorial representation. Representative approaches are Kernel PCA and Kernel Laplacian Eigenmaps introduced recently in our research. Extending our earlier work, we propose in this paper a new algorithm called Twin Kernel Embedding (TKE) that preserves the similarity structure of input data in the latent space. Experimental evaluation on MNIST handwritten digit database verifies that TKE outperforms related methods.

• Type: Journal
• Year: 2008
• Where: PAMI
• Authors: Yi Guo, Junbin Gao, Paul W. Kwan
• Keywords: Convenient Vectorial Representation, Kernel Laplacian Eigenmaps, Kernel PCA, PAMI 2008