Fast sparse representation with prototypes

Jia Bin Huang, Ming Hsuan Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Citations (Scopus)

Abstract

Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the ℓ0-norm minimization for sparse coding (i.e., the ℓ1-norm minimization). Nevertheless, the time and space complexities of these algorithms remain significantly high for large-scale problems. As signals in most problems can be modeled by a small set of prototypes, we propose an algorithm that exploits this property and show that the ℓ1-norm minimization problem can be reduced to a much smaller problem, thereby gaining significant speed-ups with much less memory requirements. Experimental results demonstrate that our algorithm is able to achieve double-digit gain in speed with much less memory requirement than the state-of-the-art algorithms.

Original languageEnglish
Title of host publication2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010
Pages3618-3625
Number of pages8
DOIs
Publication statusPublished - 2010 Aug 31
Event2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010 - San Francisco, CA, United States
Duration: 2010 Jun 132010 Jun 18

Publication series

NameProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
ISSN (Print)1063-6919

Conference

Conference2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010
CountryUnited States
CitySan Francisco, CA
Period10/6/1310/6/18

Fingerprint

Data storage equipment

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Vision and Pattern Recognition

Cite this

Huang, J. B., & Yang, M. H. (2010). Fast sparse representation with prototypes. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010 (pp. 3618-3625). [5539919] (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition). https://doi.org/10.1109/CVPR.2010.5539919
Huang, Jia Bin ; Yang, Ming Hsuan. / Fast sparse representation with prototypes. 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010. 2010. pp. 3618-3625 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition).
@inproceedings{0bee91a6ba88499aa380bb88c95ce305,
title = "Fast sparse representation with prototypes",
abstract = "Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the ℓ0-norm minimization for sparse coding (i.e., the ℓ1-norm minimization). Nevertheless, the time and space complexities of these algorithms remain significantly high for large-scale problems. As signals in most problems can be modeled by a small set of prototypes, we propose an algorithm that exploits this property and show that the ℓ1-norm minimization problem can be reduced to a much smaller problem, thereby gaining significant speed-ups with much less memory requirements. Experimental results demonstrate that our algorithm is able to achieve double-digit gain in speed with much less memory requirement than the state-of-the-art algorithms.",
author = "Huang, {Jia Bin} and Yang, {Ming Hsuan}",
year = "2010",
month = "8",
day = "31",
doi = "10.1109/CVPR.2010.5539919",
language = "English",
isbn = "9781424469840",
series = "Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
pages = "3618--3625",
booktitle = "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010",

}

Huang, JB & Yang, MH 2010, Fast sparse representation with prototypes. in 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010., 5539919, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 3618-3625, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010, San Francisco, CA, United States, 10/6/13. https://doi.org/10.1109/CVPR.2010.5539919

Fast sparse representation with prototypes. / Huang, Jia Bin; Yang, Ming Hsuan.

2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010. 2010. p. 3618-3625 5539919 (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Fast sparse representation with prototypes

AU - Huang, Jia Bin

AU - Yang, Ming Hsuan

PY - 2010/8/31

Y1 - 2010/8/31

N2 - Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the ℓ0-norm minimization for sparse coding (i.e., the ℓ1-norm minimization). Nevertheless, the time and space complexities of these algorithms remain significantly high for large-scale problems. As signals in most problems can be modeled by a small set of prototypes, we propose an algorithm that exploits this property and show that the ℓ1-norm minimization problem can be reduced to a much smaller problem, thereby gaining significant speed-ups with much less memory requirements. Experimental results demonstrate that our algorithm is able to achieve double-digit gain in speed with much less memory requirement than the state-of-the-art algorithms.

AB - Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the ℓ0-norm minimization for sparse coding (i.e., the ℓ1-norm minimization). Nevertheless, the time and space complexities of these algorithms remain significantly high for large-scale problems. As signals in most problems can be modeled by a small set of prototypes, we propose an algorithm that exploits this property and show that the ℓ1-norm minimization problem can be reduced to a much smaller problem, thereby gaining significant speed-ups with much less memory requirements. Experimental results demonstrate that our algorithm is able to achieve double-digit gain in speed with much less memory requirement than the state-of-the-art algorithms.

UR - http://www.scopus.com/inward/record.url?scp=77955985602&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955985602&partnerID=8YFLogxK

U2 - 10.1109/CVPR.2010.5539919

DO - 10.1109/CVPR.2010.5539919

M3 - Conference contribution

AN - SCOPUS:77955985602

SN - 9781424469840

T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

SP - 3618

EP - 3625

BT - 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010

ER -

Huang JB, Yang MH. Fast sparse representation with prototypes. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010. 2010. p. 3618-3625. 5539919. (Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition). https://doi.org/10.1109/CVPR.2010.5539919