ComputingComputer ScienceComputer VisionData StructuresDatabasesColor RepresentationImage RetrievalColor IndexingHistogram AnalysisHistogram MatchingHistogramsImage Database Design
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).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
Michael J. Swain, Dana H. Ballard · International Journal of Computer Vision · 1991 · 5.6K citations
Lower bounds for constant weight codes
R. L. Graham, N. J. A. Sloane · IEEE Transactions on Information Theory · 1980 · 272 citations
Visual homing using an associative memory
Randal C. Nelson · Biological Cybernetics · 1991 · 58 citations