Fast kernel sparse representation
-
Altmetric Citations
Li, Hanxi; Gao, Yongsheng; Sun, Jun
Description
Two efficient algorithms are proposed to seek the sparse representation on high-dimensional Hilbert space. By proving that all the calculations in Orthogonal Match Pursuit (OMP) are essentially inner-product combinations, we modify the OMP algorithm to apply the kernel-trick. The proposed Kernel OMP (KOMP) is much faster than the existing methods, and illustrates higher accuracy in some scenarios. Furthermore, inspired by the success of group-sparsity, we enforce a rigid group-sparsity...[Show more]
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/31766 |
Source: | A Novel Illumination-Invariant Loss for Monocular 3D Pose Estimation |
DOI: | 10.1109/DICTA.2011.20 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Li_Fast_kernel_sparse_2011.pdf | 287.43 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 19 May 2020/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator