Name
Abstract | ||
|---|---|---|
Use of large image datasets has become a common occurrence. This, however, makes image searching a highly desired operation in many applications. Most of the content-based image retrieval (CBIR) methods usually adopt machine-learning techniques that take the image content into account. These methods are effective, but they are generally too complex and resource demanding. We propose a framework based on image hashing and random forest, which is fast and offers high performance. The proposed framework consists of a multi-key image hashing technique based on discrete cosine transform (DCT) and discrete wavelet transform (DWT) and random forest based on normalized B+ Tree (NB+ Tree), which reduces the high-dimensional input vectors to one-dimension, which in turn improves the time complexity significantly. We analyze our method empirically and show that it outperforms competitive methods in terms of both accuracy and speed. In addition, the proposed scheme maintains a fast scaling with increasing size of the data sets while preserving high accuracy. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/NEWCAS.2018.8585506 | 2018 16th IEEE International New Circuits and Systems Conference (NEWCAS) |
Keywords | Field | DocType |
Content-Based Image Retrieval,Perceptual Image Hashing,Random Forest,Normalized B+ Tree. | Normalization (statistics),Pattern recognition,Computer science,Discrete cosine transform,Image retrieval,Electronic engineering,Artificial intelligence,Hash function,Discrete wavelet transform,Time complexity,Random forest,Content-based image retrieval | Conference |
ISSN | ISBN | Citations |
2472-467X | 978-1-5386-4860-5 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farzad Sabahi | 1 | 0 | 1.01 |
| M. O. Ahmad | 2 | 1157 | 154.87 |
| M. N. Swamy | 3 | 104 | 18.85 |