Abstract
The exhaustive histogram matching is usually the most computational intensive part for any query in most large image database retrieval systems. In this paper, we introduce a histogram-biasing factor (HBF) to measure the biased-behavior of ordered-bins in a sorted histogram. The proposed HBF can be used to increase the early rejection rate of unreliable or impossible candidate reference images based on one of the sorted histograms. Moreover, it can be treated as a color-histogram descriptor. Only images with very closed HBFs are taken into account, searching speed can thus be increased without loss of accuracy. Experimental results show that the proposed factor results in up to 13 times speedup meanwhile providing the exhaustive retrieval performance.
| Original language | English |
|---|---|
| Pages (from-to) | 601-604 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 3 |
| DOIs | |
| Publication status | Published - 2003 |
| Event | 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong, China Duration: 6 Apr 2003 → 10 Apr 2003 |
Fingerprint
Dive into the research topics of 'A Novel Histogram-biasing Factor for Fast Sorted Histogram-based Measurement in Large Image Database Retrieval System'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver