The capacity of color histogram indexing
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 704-708
- https://doi.org/10.1109/cvpr.1994.323774
Abstract
Color histogram matching has been shown to be a promising way of quickly indexing into a large image database. Yet, few experiments have been done to test the method on truly large databases, and even if they were performed, they would give little guidance to a user wondering if the technique would be useful with his or her database. In this paper we define and analyze a measure relevant to extending color histogram indexing to large databases: capacity (how many distinguishable histograms can be stored).Keywords
This publication has 7 references indexed in Scilit:
- QBIC project: querying images by content, using color, texture, and shapePublished by SPIE-Intl Soc Optical Eng ,1993
- Introduction to Coding TheoryPublished by Springer Nature ,1992
- Color indexingInternational Journal of Computer Vision, 1991
- Visual homing using an associative memoryBiological Cybernetics, 1991
- Lower bounds for constant weight codesIEEE Transactions on Information Theory, 1980
- Bounds for binary codes of length less than 25IEEE Transactions on Information Theory, 1978