Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 414

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Fast ℓ1-minimization algorithms and an application in robust face recognition: A review

Yang, Allen Y., Sastry, S. Shankar, Ganesh, Arvind, Ma, Yi·2010·2010 IEEE International Conference on Image Processing

Abstract

We provide a comprehensive review of five representative ℓ1-minimization methods, i.e., gradient projection, homotopy, iterative shrinkage-thresholding, proximal gradient, and augmented Lagrange multiplier. The repository is intended to fill in a gap in the existing literature to systematically benchmark the performance of these algorithms using a consistent experimental setting. The experiment will be focused on the application of face recognition, where a sparse representation framework has recently been developed to recover human identities from facial images that may be affected by illumination change, occlusion, and facial disguise. The paper also provides useful guidelines to practitioners working in similar fields.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icip.2010.5651522

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 19 references

Cited by

See all 414

Metadata

Authors
Yang, A. Y., Sastry, S. S., Ganesh, A., & Ma, Y.
Venue
2010 IEEE International Conference on Image Processing
Publisher
IEEE
Published
2010-09
Pages
1849-1852
ISSN
1522-4880 (ISSN-L)
OpenAlex
W1983008863
Cited by
414
References
19
FWCI
69.58
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fast ℓ1-minimization algorithms and an application in robust face recognition: A review. https://app.cochat.ai/papers/10.1109/icip.2010.5651522
The paper
Yang, A. Y., Sastry, S. S., Ganesh, A., & Ma, Y. (2010). Fast ℓ1-minimization algorithms and an application in robust face recognition: A review. 2010 IEEE International Conference on Image Processing. https://doi.org/10.1109/icip.2010.5651522

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.