Send to

Choose Destination

Links from PubMed

  • PMID: 23712994 was deleted because it is a duplicate of PMID: 24356348
See comment in PubMed Commons below
IEEE Trans Pattern Anal Mach Intell. 2014 Feb;36(2):261-75. doi: 10.1109/TPAMI.2013.102.

Half-quadratic-based iterative minimization for robust sparse representation.

Author information

Institute of Automation, Chinese Academy of Sciences, Beijing.
Sun Yat-sen University, Guangzhou.


Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explores their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an ℓ1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an ℓ1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the ℓ1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings.

[Indexed for MEDLINE]
PubMed Commons home

PubMed Commons

How to join PubMed Commons

    Supplemental Content

    Loading ...
    Support Center