L<inf>p</inf>-norm idf for scalable image retrieval
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Image Processing, 2014, 23 (8), pp. 3604 - 3617
- Issue Date:
- 2014-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 06826564.pdf | Published Version | 2.86 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The inverse document frequency (IDF) is prevalently utilized in the bag-of-words-based image retrieval application. The basic idea is to assign less weight to terms with high frequency, and vice versa. However, in the conventional IDF routine, the estimation of visual word frequency is coarse and heuristic. Therefore, its effectiveness is largely compromised and far from optimal. To address this problem, this paper introduces a novel IDF family by the use of Lp-norm pooling technique. Carefully designed, the proposed IDF considers the term frequency, document frequency, the complexity of images, as well as the codebook information. We further propose a parameter tuning strategy, which helps to produce optimal balancing between TF and pIDF weights, yielding the so-called Lp-norm IDF (pIDF). We show that the conventional IDF is a special case of our generalized version, and two novel IDFs, i.e., the average IDF and the max IDF, can be defined from the concept of pIDF. Further, by counting for the term-frequency in each image, the proposed pIDF helps to alleviate the visual word burstiness phenomenon. © 2014 IEEE.
Please use this identifier to cite or link to this item: