Non-metric affinity propagation for unsupervised image categorization
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
Unsupervised categorization of images or image parts is often needed for image and video summarization or as a preprocessing step in supervised methods for classification, tracking and segmentation. While many metric-based techniques have been applied to this problem in the vision community, often, the most natural measures of similarity (e.g., number of matching SIFT features) between pairs of images or image parts is non-metric. Unsupervised categorization by identifying a subset of representative exemplars can be efficiently performed with the recently-proposed 'affinity propagation' algorithm. In contrast to k-centers clustering, which iteratively refines an initial randomly-chosen set of exemplars, affinity propagation simultaneously considers all data points as potential exemplars and iteratively exchanges messages between data points until a good solution emerges. When applied to the Olivetti face data set using a translation-invariant non-metric similarity, affinity propagation achieves a much lower reconstruction error and nearly halves the classification error rate, compared to state-of-the-art techniques. For the more challenging problem of unsupervised categorization of images from the CaltechlOl data set, we derived non-metric similarities between pairs of images by matching SIFT features. Affinity propagation successfully identifies meaningful categories, which provide a natural summarization of the training images and can be used to classify new input images.
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
(1967) · Cited by 23,719
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Self-citationTexture synthesis by non-parametric sampling
Efros, A. A., & Leung, T. K. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790383 · Cited by 3,023
Fei-Fei, L., Fergus, R., & Perona, P. (2005) · 2004 Conference on Computer Vision and Pattern Recognition Workshop · doi:10.1109/cvpr.2004.383 · Cited by 2,502
Real-time object detection for "smart" vehicles
Gavrila, D. M., & Philomin, V. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.791202 · Cited by 630
Wexler, Y., Shechtman, E., & Irani, M. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315022 · Cited by 347
Shechtman, E., Caspi, Y., & Irani, M. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.85 · Cited by 245
Tracking non-rigid objects in complex scenes
Huttenlocher, D. P., Noh, J. J., & Rucklidge, W. J. (2002) · 1993 (4th) International Conference on Computer Vision · doi:10.1109/iccv.1993.378231 · Cited by 222
Cited by
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
Machine learning for medical imaging
Erickson, B. J., Korfiatis, P., Akkus, Z., & Kline, T. L. (2017) · RadioGraphics · doi:10.1148/rg.2017160130 · Cited by 1,672
Co-occurring genomic alterations in non-small-cell lung cancer biology and therapy
Skoulidis, F., & Heymach, J. V. (2019) · Nature Reviews Cancer · doi:10.1038/s41568-019-0179-8 · Cited by 1,019
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
Large-Scale Multi-View Spectral Clustering via Bipartite Graph
Li, Y., Nie, F., Huang, H., & Huang, J. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9598 · Cited by 585
Streaming submodular maximization: massive data summarization on the fly
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., & Krause, A. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623637 · Cited by 300
A brief survey of automatic methods for author name disambiguation
Ferreira, A. A., Gonçalves, M. A., & Laender, A. H. F. (2012) · ACM SIGMOD Record · doi:10.1145/2350036.2350040 · Cited by 293
Heterogeneous image feature integration via multi-modal spectral clustering
Cai, X., Nie, F., Huang, H., & Kamangar, F. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995740 · Cited by 260
Multiple Kernel Learning for Dimensionality Reduction
Lin, Y.-Y., Liu, T.-L., & Fuh, C.-S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.183 · Cited by 245
“We follow the setting in [12], where affinity propagation [15] is used for unsupervised image categorization, and select the same twenty categories from Caltech-101 for the image clustering experiments.”
MethodNon-maximum Suppression for Object Detection by Passing Messages Between Windows
Rothe, R., Guillaumin, M., & Van Gool, L. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-16865-4_19 · Cited by 218
Teghipco, A., Newman-Norlund, R., Fridriksson, J., Rorden, C., & Bonilha, L. (2024) · Communications Medicine · doi:10.1038/s43856-024-00541-8 · Cited by 11
“Clusters for the selected solution were extracted by applying af fi nity propagation 90 to the corresponding consensus matrix.”
Vo-Phamhi, J. M., Yamauchi, K. A., & Gómez-Sjöberg, R. (2021) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1009274 · Cited by 1
Metadata
- Authors
- Dueck, D., & Frey, B. J.
- Venue
- 2007 IEEE 11th International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2007
- Pages
- 1-8
- OpenAlex
- W2130623086
- Cited by
- 297
- References
- 19
- FWCI
- 6.94
- 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.