The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Clustering appearances of objects under varying illumination conditions
Abstract
We introduce two appearance-based methods for clustering a set of images of 3D (three-dimensional) objects, acquired under varying illumination conditions, into disjoint subsets corresponding to individual objects. The first algorithm is based on the concept of illumination cones. According to the theory, the clustering problem is equivalent to finding convex polyhedral cones in the high-dimensional image space. To efficiently determine the conic structures hidden in the image data, we introduce the concept of conic affinity, which measures the likelihood of a pair of images belonging to the same underlying polyhedral cone. For the second method, we introduce another affinity measure based on image gradient comparisons. The algorithm operates directly on the image gradients by comparing the magnitudes and orientations of the image gradient at each pixel. Both methods have clear geometric motivations, and they operate directly on the images without the need for feature extraction or computation of pixel statistics. We demonstrate experimentally that both algorithms are surprisingly effective in clustering images acquired under varying illumination conditions with two large, well-known image data sets.
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
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
Self-citationVisual learning and recognition of 3-d objects from appearance
Murase, H., & Nayar, S. K. (1995) · International Journal of Computer Vision · doi:10.1007/bf01421486 · Cited by 1,881
The CMU Pose, Illumination, and Expression (PIE) database
Sim, T., Baker, S., & Bsat, M. (2003) · Proceedings of Fifth IEEE International Conference on Automatic Face Gesture Recognition · doi:10.1109/afgr.2002.1004130 · Cited by 1,419
Face recognition: the problem of compensating for changes in illumination direction
Adini, Y., Moses, Y., & Ullman, S. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598229 · Cited by 1,059
Cited by
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Elhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Generalized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.244 · Cited by 1,038
Latent Low-Rank Representation for subspace segmentation and feature extraction
Liu, G., & Yan, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126422 · Cited by 679
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Multi-view Subspace Clustering
Gao, H., Nie, F., Li, X., & Huang, H. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.482 · Cited by 614
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1085 · Cited by 481
A geometric analysis of subspace clustering with outliers
Soltanolkotabi, M., & Candés, E. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1034 · Cited by 411
See all by looking at a few: Sparse modeling for finding representative objects
Elhamifar, E., Sapiro, G., & Vidal, R. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247852 · Cited by 394
Bayesian Saliency via Low and Mid Level Cues
Xie, Y., Lu, H., & Yang, M.-H. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2216276 · Cited by 367
Self-citationKernel Sparse Representation for Image Classification and Face Recognition
Gao, S., Tsang, I. W.-H., & Chia, L.-T. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_1 · Cited by 345
Generalized Transfer Subspace Learning Through Low-Rank Constraint
Shao, M., Kit, D., & Fu, Y. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0696-6 · Cited by 298
Exclusivity-Consistency Regularized Multi-view Subspace Clustering
Wang, X., Guo, X., Lei, Z., Zhang, C., & Li, S. Z. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.8 · Cited by 281
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
You, C., Li, C.-G., Robinson, D. P., & Vidal, R. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.426 · Cited by 263
Learning to cluster faces on an affinity graph
Yang, L., Zhan, X., Chen, D., Yan, J., Loy, C. C., & Lin, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00240 · Cited by 142
Grouping with Asymmetric Affinities: A Game-Theoretic Perspective
Torsello, A., Bulo, S. R., & Pelillo, M. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.130 · Cited by 71
Metadata
- Authors
- Ho, J., Yang, M.-H., Lim, J., Lee, K.-C., & Kriegman, D.
- Venue
- 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-11-20
- Pages
- I-11-I-18
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2125742596
- Cited by
- 521
- References
- 27
- FWCI
- 7.12
- 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.