Project details for Sparse representation L1 minimization via half quadratic minimization

Logo Sparse representation L1 minimization via half quadratic minimization 1.0

by openpr_nlpr - June 5, 2012, 11:33:58 CET [ Project Homepage BibTeX Download ]

view (3 today), download ( 0 today ), 1 subscription

Description:

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 detection or error correction, and learning a general framework that systematically unifies these two concepts is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve robust sparse coding problems. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to perform both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction algorithm by iteratively recovering corrupted data from errors incurred by noise and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection algorithm by learning from uncorrupted data iteratively.

These published codes are the algorithms in the appendix of our submitted TPAMI paper.

Changes to previous version:

Initial Announcement on mloss.org.

BibTeX Entry: Download
URL: Project Homepage
Supported Operating Systems: Windows
Data Formats: None
Tags: Half Quadratic Minimization, L1 Minimization, Sparse Representation
Archive: download here

Comments

No one has posted any comments yet. Perhaps you'd like to be the first?

Leave a comment

You must be logged in to post comments.