Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!

Add to Chrome

Add to Firefox

Add to Edge

David Tien

Low Rank Representation on Riemannian Manifold of Square Root Densities

Aug 18, 2015
Yifan Fu, Junbin Gao, Xia Hong, David Tien

Figure 1 for Low Rank Representation on Riemannian Manifold of Square Root Densities

Figure 2 for Low Rank Representation on Riemannian Manifold of Square Root Densities

Figure 3 for Low Rank Representation on Riemannian Manifold of Square Root Densities

Figure 4 for Low Rank Representation on Riemannian Manifold of Square Root Densities

In this paper, we present a novel low rank representation (LRR) algorithm for data lying on the manifold of square root densities. Unlike traditional LRR methods which rely on the assumption that the data points are vectors in the Euclidean space, our new algorithm is designed to incorporate the intrinsic geometric structure and geodesic distance of the manifold. Experiments on several computer vision datasets showcase its noise robustness and superior performance on classification and subspace clustering compared to other state-of-the-art approaches.

Via

Access Paper or Ask Questions