The capacity of color histogram indexing (1994) [33 citations — 0 self]
by Markus Stricker, Michael Swain
In Proceedings 1994 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
ftp://ftp.vision.ee.ethz.ch/publications/1994/postscripts/StrickerCVPR94.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Stricker94thecapacity,author = {Markus Stricker and Michael Swain},
title = {The capacity of color histogram indexing},
booktitle = {In Proceedings 1994 IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
year = {1994},
pages = {704--708}
}
Years of Citing Articles
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). 1
Citations
| 926 | Color indexing – Swain, Ballard - 1991 |
| 441 | The QBIC Project: Querying Images by Content Using Color, Texture, and Shape,”Proc. Storage and Retrievalfor Image and Video – Niblack - 1993 |
| 176 | Color constant color indexing – Funt, Finlayson - 1995 |
| 37 | Visual homing using an associative memory – Nelson - 1989 |
| 27 | Lower bounds for constant weight codes – Graham, Sloane - 1980 |
| 25 | Introduction to coding theory, Graduate Texts – Lint - 1982 |
| 21 | The capacity and the sensitivity of color histogram indexing – Stricker, Swain - 1994 |
| 15 | Image signatures for place recognition and map construction – Engelson, McDermott - 1991 |
| 9 | Color and geometry as cues for indexing – Stricker - 1992 |
| 3 | et al. Bounds for binary codes of length less than 25 – Best, Brouwer - 1978 |
