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.
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
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
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
Understanding bag-of-words model: a statistical framework
Zhang, Y., Jin, R., & Zhou, Z.-H. (2010) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-010-0001-0 · Cited by 1,384
“A method based on mean-shift is proposed in [ 7 ] for vector quantization to resolve the problem that K-means tends to ‘starve’ medium density regions in feature space and each key point is allocated to the first visual word similar to it. Moosmann et al. [12] use extremely randomized clustering forests to efficiently…”
BackgroundMethodInfluentialEvaluation of local spatio-temporal features for action recognition
Wang, H., Ullah, M. M., Klaser, A., Laptev, I., & Schmid, C. (2009) · Procedings of the British Machine Vision Conference 2009 · doi:10.5244/c.23.124 · Cited by 1,296
Local Invariant Feature Detectors: A Survey
Tuytelaars, T., & Mikolajczyk, K. (2007) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000017 · Cited by 1,186
Recognizing realistic actions from videos “in the wild”
Liu, J., Luo, J., & Shah, M. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206744 · Cited by 1,075
In defense of Nearest-Neighbor based image classification
Boiman, O., Shechtman, E., & Irani, M. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587598 · Cited by 1,072
Semantic texton forests for image categorization and segmentation
Shotton, J., Johnson, M., & Cipolla, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587503 · Cited by 1,014
Sampling Strategies for Bag-of-Features Image Classification
Nowak, E., Jurie, F., & Triggs, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744085_38 · Cited by 927
Self-citationThe 2005 PASCAL Visual Object Classes Challenge
Everingham, M., Zisserman, A., Williams, C. K. I., Van Gool, L., Allan, M., Bishop, C. M., Chapelle, O., Dalal, N., Deselaers, T., Dorkó, G., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11736790_8 · Cited by 765
Self-citationvan Gemert, J. C., Veenman, C. J., Smeulders, A. W. M., & Geusebroek, J.-M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.132 · Cited by 737
Appearance-only SLAM at large scale with FAB-MAP 2.0
Cummins, M., & Newman, P. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910385483 · Cited by 609
Kernel Codebooks for Scene Categorization
van Gemert, J. C., Geusebroek, J.-M., Veenman, C. J., & Smeulders, A. W. M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_52 · Cited by 585
Hough Forests for Object Detection, Tracking, and Action Recognition
Gall, J., Yao, A., Razavi, N., Van Gool, L., & Lempitsky, V. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.70 · Cited by 583
Groups of Adjacent Contour Segments for Object Detection
Ferrari, V., Fevrier, L., Jurie, F., & Schmid, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1144 · Cited by 563
Self-citationFast Discriminative Visual Codebooks using Randomized Clustering Forests
Moosmann, F., Triggs, B., & Jurie, F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0128 · Cited by 467
Self-citationIn defense of soft-assignment coding
Liu, L., Wang, L., & Liu, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126534 · Cited by 443
Detecting Irregularities in Images and in Video
Boiman, O., & Irani, M. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0009-9 · Cited by 439
Coupled information-theoretic encoding for face photo-sketch recognition
Zhang, W., Wang, X., & Tang, X. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995324 · Cited by 403
Learning Sparse Representations for Human Action Recognition
Guha, T., & Ward, R. K. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.253 · Cited by 349
50 Years of object recognition: Directions forward
Andreopoulos, A., & Tsotsos, J. K. (2013) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.04.005 · Cited by 347
“They represent an attempt to compensate for the simplicity of localfeature-based representations, by using them to form dictionaries of more complex and compact object representations [195, 196, 179, 177, 176, 197, 178, 180, 198, 199, 100, 174, 200, 201, 202, 203].”
BackgroundAutomatic fruit and vegetable classification from images
Rocha, A., Hauagge, D. C., Wainer, J., & Goldenstein, S. (2010) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2009.09.002 · Cited by 310
Performance evaluation of local colour invariants
Burghouts, G. J., & Geusebroek, J.-M. (2009) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2008.07.003 · Cited by 295
Gao, D., Han, S., & Vasconcelos, N. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.27 · Cited by 294
Randomized Clustering Forests for Image Classification
Moosmann, F., Nowak, E., & Jurie, F. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70822 · Cited by 287
Self-citationNo-Reference Image Quality Assessment Using Visual Codebooks
Ye, P., & Doermann, D. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2190086 · Cited by 270
Texture Description Through Histograms of Equivalent Patterns
Fernández, A., Álvarez, M. X., & Bianconi, F. (2013) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-012-0349-8 · Cited by 128
Material recognition using tactile sensing
Kerr, E., McGinnity, T., & Coleman, S. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.10.045 · Cited by 67
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.