Ligang Zheng1,*, Chao Song2
CMC-Computers, Materials & Continua, Vol.56, No.3, pp. 529-539, 2018, DOI:10.3970/cmc.2018.03780
Abstract There is a steep increase in data encoded as symmetric positive definite (SPD) matrix in the past decade. The set of SPD matrices forms a Riemannian manifold that constitutes a half convex cone in the vector space of matrices, which we sometimes call SPD manifold. One of the fundamental problems in the application of SPD manifold is to find the nearest neighbor of a queried SPD matrix. Hashing is a popular method that can be used for the nearest neighbor search. However, hashing cannot be directly applied to SPD manifold due to its non-Euclidean intrinsic More >
Login
Register
