Efficient Sparse Coding using Hierarchical Riemannian Pursuit

1 code implementation • 21 Apr 2021 • Ye Xue, Vincent Lau, Songfu Cai

The proposed scheme leverages the global and local Riemannian geometry of the two-stage optimization problem and facilitates fast implementation for superb dictionary recovery performance by a finite number of samples without atom-by-atom calculation.

Data Compression