Patch-to-tensor embedding

Moshe Salhov, Guy Wolf, Amir Averbuch*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

A popular approach to deal with the "curse of dimensionality" in relation with highdimensional data analysis is to assume that points in these datasets lie on a lowdimensional manifold immersed in a high-dimensional ambient space. Kernel methods operate on this assumption and introduce the notion of local affinities between data points via the construction of a suitable kernel. Spectral analysis of this kernel provides a global, preferably low-dimensional, coordinate system that preserves the qualities of the manifold. In this paper, we extend the scalar relations used in this framework to matrix relations, which can encompass multidimensional similarities between local neighborhoods of points on the manifold. We utilize the diffusion maps methodology together with linearprojection operators between tangent spaces of the manifold to construct a super-kernel that represents these relations. The properties of the presented super-kernels are explored and their spectral decompositions are utilized to embed the patches of the manifold into a tensor space in which the relations between them are revealed. We present two applications that utilize the patch-to-tensor embedding framework: data classification and data clustering.

Original languageEnglish
Pages (from-to)182-203
Number of pages22
JournalApplied and Computational Harmonic Analysis
Volume33
Issue number2
DOIs
StatePublished - Sep 2012

Funding

FundersFunder number
Israel Science Foundation1041/10

    Keywords

    • Diffusion Maps
    • Dimensionality reduction
    • Kernel PCA
    • Manifold learning
    • Patch processing
    • Vector processing

    Fingerprint

    Dive into the research topics of 'Patch-to-tensor embedding'. Together they form a unique fingerprint.

    Cite this