Abstract
In order to extract low-dimensional features from image data, matrix-based subspace methods such as 2DPCA and tensor PCA have been recently proposed. Since these methods extract features based on 2D image matrices rather than 1D vectors, they can preserve useful information in image matrices and we can expect better classification performance by using the matrix features. In order to maximize the advantages of the matrix features, it is also important to use an appropriate similarity measure between two feature matrices. This paper proposes a method for learning similarity measures for feature matrices, which utilizes distribution properties of given data set and class membership. Through computational experiments with facial image data, we confirm that the obtained similarity measure by the proposed method can give better classification performance than conventional similarity measures for matrix data.
| Original language | English |
|---|---|
| Pages (from-to) | 1364-1372 |
| Number of pages | 9 |
| Journal | Pattern Recognition Letters |
| Volume | 33 |
| Issue number | 10 |
| DOIs | |
| State | Published - 15 Jul 2012 |
Keywords
- Principal component analysis
- Probabilistic learning
- Similarity measure
- Tensor
Fingerprint
Dive into the research topics of 'Probabilistic learning of similarity measures for tensor PCA'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver