Log-Euclidean Kernels for Sparse Representation and Dictionary Learning
Authors:
- Peihua LiPLPeihua Li
- Qilong WangQWQilong Wang
- Wangmeng ZuoWZWangmeng Zuo
- Lei ZhangLZLei Zhang
- 1 December 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505499,p. 1601-1608
Abstract
The symmetric positive definite (SPD) matrices have been widely used in image and vision problems. Recently there are growing interests in studying sparse representation (SR) of SPD matrices, motivated by the great success of SR for vector data. Though the space of SPD matrices is well-known to form a Lie group that is a Riemannian manifold, existing work fails to take full advantage of its geometric structure. This paper attempts to tackle this problem by proposing a kernel based method for SR and dictionary learning (DL) of SPD matrices. We disclose that the space of SPD matrices, with the operations of logarithmic multiplication and scalar logarithmic multiplication defined in the Log-Euclidean framework, is a complete inner product space. We can thus develop a broad family of kernels that satisfies Mercer's condition. These kernels characterize the geodesic distance and can be computed efficiently. We also consider the geometric structure in the DL process by updating atom matrices in the Riemannian space instead of in the Euclidean space. The proposed method is evaluated with various vision problems and shows notable performance gains over state-of-the-arts.Keywords
This publication has 18 references indexed in Scilit:
- Kernel Learning for Extrinsic Classification of Manifold Features2013
- Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices2013
- Semantic Segmentation with Second-Order Pooling2012
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- Kernel methods in machine learningThe Annals of Statistics, 2008
- Geometric Means in a Novel Vector Space Structure on Symmetric Positive‐Definite MatricesSIAM Journal on Matrix Analysis and Applications, 2007
- A Riemannian Framework for Tensor ComputingInternational Journal of Computer Vision, 2006
- Diffusion tensor imaging: Concepts and applicationsJournal of Magnetic Resonance Imaging, 2001
- The FERET evaluation methodology for face-recognition algorithmsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Filtering for texture classification: a comparative studyIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999