Large-scale image retrieval using local binary patterns and iterative quantization

Hashing algorithm is an efficient approximate searching algorithm for large-scale image retrieval. Learning binary code is a key step to improve its performance and it is still an ongoing challenge. The inputs of Hashing affects its performance. This paper proposes a method to improve the efficiency of learning binary code by improving the suitableness of the Hashing algorithms inputs by employing local binary patterns in extracting image features. This approach results in more compact code, less memory and computational requirement and higher performance. The reasons behind these achievements are the binary nature and high efficiency in feature generation of local binary pattern. The performance analysis consists of using CIFAR-10 and precision vs. recall rate as dataset and evaluation criteria respectively. The simulations compare the new algorithm with three state of the art and along the line algorithms from three points of view; the hashing code size, memory space and computational cost, and the results demonstrate the effectiveness of the new approach