The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
An efficient color representation for image retrieval
Abstract
A compact color descriptor and an efficient indexing method for this descriptor are presented. The target application is similarity retrieval in large image databases using color. Colors in a given region are clustered into a small number of representative colors. The feature descriptor consists of the representative colors and their percentages in the region. A similarity measure similar to the quadratic color histogram distance measure is defined for this descriptor. The representative colors can be indexed in the three-dimensional (3-D) color space thus avoiding the high-dimensional indexing problems associated with the traditional color histogram. For similarity retrieval, each representative color in the query image or region is used independently to find regions containing that color. The matches from all of the query colors are then combined to obtain the final retrievals. An efficient indexing scheme for fast retrieval is presented. Experimental results show that this compact descriptor is effective and compares favorably with the traditional color histogram in terms of overall computational complexity.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Swain, M. J., & Ballard, D. H. (1991) · International Journal of Computer Vision · doi:10.1007/bf00130487 · Cited by 5,623
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
The design and analysis of spatial data structures
Samet, H. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,380
Stricker, M. A., & Orengo, M. (1995) · SPIE Proceedings · doi:10.1117/12.205308 · Cited by 1,747
A metric for distributions with applications to image databases
Rubner, Y., Tomasi, C., & Guibas, L. J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710701 · Cited by 1,726
Image indexing using color correlograms
Huang, J., Kumar, S. R., Mitra, M., Zhu, W.-J., & Zabih, R. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609412 · Cited by 1,646
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · ACM SIGMOD Record · doi:10.1145/93605.98741 · Cited by 1,424
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2249-9 · Cited by 880
Efficient color histogram indexing for quadratic form distance functions
Hafner, J., Sawhney, H. S., Equitz, W., Flickner, M., & Niblack, W. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391417 · Cited by 833
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997) · Springer eBooks · doi:10.1007/978-3-662-03427-9 · Cited by 800
Similarity indexing with the SS-tree
White, D. A., & Jain, R. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492202 · Cited by 635
NeTra: a toolbox for navigating large image databases
Ma, W., & Manjunath, B. S. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1997.647976 · Cited by 611
Self-citationHistogram refinement for content-based image retrieval
Pass, G., & Zabih, R. (2002) · Proceedings Third IEEE Workshop on Applications of Computer Vision. WACV'96 · doi:10.1109/acv.1996.572008 · Cited by 484
Tools and techniques for color image retrieval:
Smith, J. R., & Chang, S.-F. (1996) · SPIE Proceedings · doi:10.1117/12.234781 · Cited by 466
The design and analysis of spatial data structures
Egenhofer, M. J. (1991) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/0924-2716(91)90007-i · Cited by 368
Color indexing with weak spatial constraints:
Stricker, M. A., & Dimai, A. (1996) · SPIE Proceedings · doi:10.1117/12.234802 · Cited by 232
Edge flow: A framework of boundary detection and image segmentation
Ma, W. Y., & Manjunath, B. S. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609409 · Cited by 232
Self-citationMukherjee, D., & Mitra, S. K. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1998.723437 · Cited by 15
Cited by
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
Manjunath, B. S., Ohm, J.-R., Vasudevan, V. V., & Yamada, A. (2001) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.927424 · Cited by 1,666
Self-citationContent-based image retrieval: approaches and trends of the new age
Datta, R., Li, J., & Wang, J. Z. (2005) · Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval · doi:10.1145/1101826.1101866 · Cited by 435
Metadata
- Authors
- Deng, Y., Manjunath, B. S., Kenney, C., Moore, M. S., & Shin, H.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2001
- Volume
- 10
- Issue
- 1
- Pages
- 140-147
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2109464092
- Cited by
- 314
- References
- 24
- FWCI
- 16.94
- Type
- journal article
- 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.