The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Creating efficient codebooks for visual recognition
Open accessAbstract
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and scene classification. Codebooks are usually constructed by using a method such as k-means to cluster the descriptor vectors of patches sampled either densely ('textons') or sparsely ('bags of features' based on key-points or salience measures) from a set of training images. This works well for texture analysis in homogeneous images, but the images that arise in natural object recognition tasks have far less uniform statistics. We show that for dense sampling, k-means over-adapts to this, clustering centres almost exclusively around the densest few regions in descriptor space and thus failing to code other informative regions. This gives suboptimal codes that are no better than using randomly selected centres. We describe a scalable acceptance-radius based clusterer that generates better codebooks and study its performance on several image classification tasks. We also show that dense representations outperform equivalent keypoint based ones on these tasks and that SVM or mutual information based feature selection starting from a dense codebook further improves the 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
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
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Visual categorization with bags of keypoints
Csurka, G. (2004) · Cited by 4,379
Object class recognition by unsupervised scale-invariant learning
Fergus, R., Perona, P., & Zisserman, A. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211479 · Cited by 2,023
Textons, the elements of texture perception, and their interactions
Julesz, B. (1981) · Nature · doi:10.1038/290091a0 · Cited by 1,703 · cited 1×
“[13]) we mean a set of representative classes of image patches that suffice to characterize an image object or texture.”
Representing and Recognizing the Visual Appearance of Materials Using Three-Dimensional Textons
Leung, T., & Malik, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011126920638 · Cited by 1,498 · cited 4×
“[18] use Gabor texture features for texture classification.”
InfluentialScatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
An Affine Invariant Interest Point Detector
Mikolajczyk, K., & Schmid, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_9 · Cited by 1,325
A sparse texture representation using local affine regions
Lazebnik, S., Schmid, C., & Ponce, J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.151 · Cited by 1,123
A Multiple Resampling Method for Learning from Imbalanced Data Sets
Estabrooks, A., Jo, T., & Japkowicz, N. (2004) · Computational Intelligence · doi:10.1111/j.0824-7935.2004.t01-1-00228.x · Cited by 1,014
Scatter/Gather: a cluster-based approach to browsing large document collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133214 · Cited by 953
Learning to detect objects in images via a sparse, part-based representation
Agarwal, S., Awan, A., & Roth, D. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.108 · Cited by 848
Selected Studies of the Principle of Relative Frequency in Language
Kingsley Zipf, G. (1932) · Harvard University Press eBooks · doi:10.4159/harvard.9780674434929 · Cited by 686
Unsupervised Learning of Models for Recognition
Weber, M., Welling, M., & Perona, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45054-8_2 · Cited by 594
Sharing features: efficient boosting procedures for multiclass object detection
Torralba, A., Murphy, K. P., & Freeman, W. T. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315241 · Cited by 577
Mean shift based clustering in high dimensions: a texture classification example
Georgescu, Shimshoni, & Meer (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238382 · Cited by 412
Face recognition: component-based versus global approaches
Heisele, B., Ho, P., Wu, J., & Poggio, T. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00073-0 · Cited by 392
Selection of scale-invariant parts for object class recognition
Dorko, & Schmid (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238407 · Cited by 282
Object recognition with informative features and linear classification
Vidal-Naquet, & Ullman (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238356 · Cited by 266
Meyerson, A. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959917 · Cited by 262
Occlusion Models for Natural Images: A Statistical Study of a Scale-Invariant Dead Leaves Model
Lee, A. B., Mumford, D., & Huang, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011109015675 · Cited by 229
Interleaving Object Categorization and Segmentation
Leibe, B., & Schiele, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11414353_10 · Cited by 223
Zhu, S.-C., Guo, C.-E., Wang, Y., & Xu, Z. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-4638-1 · Cited by 204
Scale-invariant shape features for recognition of object categories
Jurie, F., & Schmid, C. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315149 · Cited by 188
Self-citationFeature selection using linear classifier weights: interaction with classification models
Mladenić, D., Brank, J., Grobelnik, M., & Milic-Frayling, N. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009034 · Cited by 185
Interleaved Object Categorization and Segmentation
Leibe, B., & Schiele, B. (2003) · Procedings of the British Machine Vision Conference 2003 · doi:10.5244/c.17.78 · Cited by 172
Categorizing Nine Visual Classes Using Local Appearance Descriptors
Willamowski, J. K., Arregui, D., Csurka, G., Dance, C. R., & Fan, L. (2004) · Cited by 112
A k-Median Algorithm with Running Time Independent of Data Size
Meyerson, A., O'Callaghan, L., & Plotkin, S. A. (2004) · Machine Learning · doi:10.1023/b:mach.0000033115.78247.f0 · Cited by 66
Interaction of Feature Selection Methods and Linear Classification Models
Brank, J., Grobelnik, M., Milic-Frayling, N., & Mladenic, D. (2002) · Cited by 47
Cited by
Locality-constrained Linear Coding for image classification
Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., & Gong, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540018 · Cited by 3,100
Linear spatial pyramid matching using sparse coding for image classification
Yang, J., Yu, K., Gong, Y., & Huang, T. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206757 · Cited by 2,828
Zhang, J., Marszałek, M., Lazebnik, S., & Schmid, C. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-9794-4 · Cited by 1,923
Evaluating Color Descriptors for Object and Scene Recognition
van de Sande, K. E. A., Gevers, T., & Snoek, C. G. M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.154 · Cited by 1,783
Fisher Kernels on Visual Vocabularies for Image Categorization
Perronnin, F., & Dance, C. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383266 · Cited by 1,641
Metadata
- Authors
- Jurie, F., & Triggs, B.
- Venue
- Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
- Publisher
- IEEE
- Published
- 2005
- Pages
- 604-610 Vol. 1
- OpenAlex
- W2151259137
- Cited by
- 713
- References
- 29
- FWCI
- 24.75
- Type
- conference paper
- 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
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.