The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Mean shift based clustering in high dimensions: a texture classification example
Abstract
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are constrained to be spherically symmetric and their number has to be known a priori. In nonparametric clustering methods, like the one based on mean shift, these limitations are eliminated but the amount of computation becomes prohibitively large as the dimension of the space increases. We exploit a recently proposed approximation technique, locality-sensitive hashing (LSH), to reduce the computational complexity of adaptive mean shift. In our implementation of LSH the optimal parameters of the data structure are determined by a pilot learning procedure, and the partitions are data driven. As an application, the performance of mode and k-means based textons are compared in a texture classification study.
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
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
Density Estimation for Statistics and Data Analysis
(1986) · Springer eBooks · doi:10.1007/978-1-4899-3324-9 · Cited by 8,525
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
(1999) · Cited by 3,186
Barker, L. (2002) · Technometrics · doi:10.1198/tech.2002.s659 · Cited by 2,477
Computational geometry: Algorithms and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90095-5 · Cited by 1,523
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×
“– LM: A combination of 48 anisotropic and isotropic filters were used by Leung and Malik [12] and Cula and Dana [3].”
BackgroundMethodInfluentialFast pose estimation with parameter-sensitive hashing
Shakhnarovich, Viola, & Darrell (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238424 · Cited by 758
Cited by
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
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
Region Covariance: A Fast Descriptor for Detection and Classification
Tuzel, O., Porikli, F., & Meer, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744047_45 · Cited by 1,115
Avidan, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.35 · Cited by 1,112
Eitz, M., Hays, J., & Alexa, M. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185540 · Cited by 868
Fast pose estimation with parameter-sensitive hashing
Shakhnarovich, Viola, & Darrell (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238424 · Cited by 758
Creating efficient codebooks for visual recognition
Jurie, F., & Triggs, B. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.66 · Cited by 713
A Statistical Approach to Material Classification Using Image Patch Exemplars
Varma, M., & Zisserman, A. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.182 · Cited by 607
Sketch2Photo: internet image montage
Chen, T., Cheng, M.-M., Tan, P., Shamir, A., & Hu, S.-M. (2009) · ACM Transactions on Graphics · doi:10.1145/1618452.1618470 · Cited by 574
Automated mapping of phenotype space with single-cell data
Samusik, N., Good, Z., Spitzer, M. H., Davis, K. L., & Nolan, G. P. (2016) · Nature Methods · doi:10.1038/nmeth.3863 · Cited by 419
From BoW to CNN: Two Decades of Texture Representation for Texture Classification
Liu, L., Chen, J., Fieguth, P., Zhao, G., Chellappa, R., & Pietikäinen, M. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-018-1125-z · Cited by 375
James, D. L., & Twigg, C. D. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073206 · Cited by 361
Avidan, S. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.144 · Cited by 320
Fast image search for learned metrics
Jain, P., Kulis, B., & Grauman, K. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587841 · Cited by 279
Fast Similarity Search for Learned Metrics
Kulis, B., Jain, P., & Grauman, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.151 · Cited by 256
Foran, D. J., Yang, L., Chen, W., Hu, J., Goodell, L. A., Reiss, M., Wang, F., Kurc, T., Pan, T., Sharma, A., et al. (2011) · Journal of the American Medical Informatics Association · doi:10.1136/amiajnl-2011-000170 · Cited by 65
Metadata
- Authors
- Georgescu, Shimshoni, & Meer
- Venue
- Proceedings Ninth IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2003
- Pages
- 456-463 vol.1
- OpenAlex
- W2117658559
- Cited by
- 412
- References
- 19
- FWCI
- 12.52
- 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.