The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Photometric Method For Determining Surface Orientation From Multiple Images
Woodham, R. J. (1980) · Optical Engineering · doi:10.1117/12.7972479 · Cited by 2,003
Lambertian reflectance and linear subspaces
Basri, R., & Jacobs, D. W. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177153 · Cited by 1,576
Wright, J. N., Ganesh, A., Rao, S., Peng, Y., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1,495
Self-citationToh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
A reflectance model for computer graphics
Cook, R. L., & Torrance, K. E. (1981) · Proceedings of the 8th annual conference on Computer graphics and interactive techniques - SIGGRAPH '81 · doi:10.1145/800224.806819 · Cited by 603
What is the set of images of an object under all possible lighting conditions?
Belhumeur, P. N., & Kriegman, D. J. (1996) · Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1996.517085 · Cited by 379
Hernandez Esteban, C., Vogiatzis, G., & Cipolla, R. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70820 · Cited by 301
Fast algorithms for recovering a corrupted low-rank matrix
Ganesh, A., Lin, Z., Wright, J., Wu, L., Chen, M., & Ma, Y. (2009) · 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) · doi:10.1109/camsap.2009.5413299 · Cited by 211
Self-citationGeometry and Photometry in 3D Visual Recognition
Shashua, A. (1992) · doi:10.21236/ada259443 · Cited by 194
Tolle, J. W. (2003) · Elsevier eBooks · doi:10.1016/b0-12-227410-5/00486-5 · Cited by 156
Dense error correction for low-rank matrices via Principal Component Pursuit
Ganesh, A., Wright, J. N., Li, X., Candès, E. J., & Ma, Y. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513538 · Cited by 87
Self-citationSparse and low-rank matrix decompositions
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2009) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2009.5394889 · Cited by 80
Cited by
Multi-energy CT based on a prior rank, intensity and sparsity model (PRISM)
Gao, H., Yu, H., Osher, S., & Wang, G. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/11/115012 · Cited by 264
Metadata
- Authors
- Wu, L., Ganesh, A., Shi, B., Matsushita, Y., Wang, Y., & Ma, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 703-717
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1487520337
- Cited by
- 298
- References
- 22
- FWCI
- 25.53
- 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
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.