The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization
Open accessAbstract
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns), which is equivalent to the hyperspectral unmixing problem under the linear mixing model and the pure-pixel assumption. We present a family of fast recursive algorithms and prove they are robust under any small perturbations of the input data matrix. This family generalizes several existing hyperspectral unmixing algorithms and hence provides for the first time a theoretical justification of their better practical performance.
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.
Integrity signals
Registry
Cites
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.
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
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches
Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., & Chanussot, J. (2012) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2012.2194696 · Cited by 2,836
Vertex component analysis: a fast algorithm to unmix hyperspectral data
Nascimento, J. M. P., & Dias, J. M. B. (2005) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2005.844293 · Cited by 2,669
N-FINDR: an algorithm for fast autonomous spectral end-member determination in hyperspectral data:
Winter, M. E. (1999) · SPIE Proceedings · doi:10.1117/12.366289 · Cited by 1,414
Fundamentals of Convex Analysis
Hiriart-Urruty, J.-B., & Lemaréchal, C. (2001) · Springer eBooks · doi:10.1007/978-3-642-56468-0 · Cited by 1,402
The successive projections algorithm for variable selection in spectroscopic multicomponent analysis
Araújo, M. C. U., Saldanha, T. C. B., Galvão, R. K. H., Yoneyama, T., Chame, H. C., & Visani, V. (2001) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(01)00119-8 · Cited by 1,320
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
Donoho, D. L., & Stodden, V. (2004) · doi:10.7916/d88d05n7 · Cited by 685
On the Complexity of Nonnegative Matrix Factorization
Vavasis, S. A. (2010) · SIAM Journal on Optimization · doi:10.1137/070709967 · Cited by 588
Self-citationLinear least squares solutions by householder transformations
Businger, P., & Golub, G. H. (1965) · Numerische Mathematik · doi:10.1007/bf01436084 · Cited by 508
A New Growing Method for Simplex-Based Endmember Extraction Algorithm
Chang, C.-I., Wu, C.-C., Liu, W., & Ouyang, Y.-C. (2006) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2006.881803 · Cited by 500
Minimum-volume transforms for remotely sensed data
Craig, M. D. (1994) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/36.297973 · Cited by 468
Cited by
Hyperspectral remote sensing data analysis and future challenges
Bioucas-Dias, J. M., Plaza, A., Camps-Valls, G., Scheunders, P., Nasrabadi, N., & Chanussot, J. (2013) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2013.2244672 · Cited by 2,223
Metadata
- Authors
- Gillis, N., & Vavasis, S. A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2014-04
- Volume
- 36
- Issue
- 4
- Pages
- 698-714
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2125118959
- Cited by
- 261
- References
- 17
- FWCI
- 55.68
- Type
- journal article
- Language
- en
- Open access
- green
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 and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization. https://app.cochat.ai/papers/10.1109/tpami.2013.226
- The paper
- Gillis, N., & Vavasis, S. A. (2014). Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2013.226
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.