An efficient multistage CBIR based on Squared Krawtchouk-Tchebichef polynomials

Abstract

Image databases are increasing exponentially because of rapid developments in social networking and digital technologies. To search these databases, an efficient search technique is required. CBIR is considered one of these techniques. This paper presents a multistage CBIR to address the computational cost issues while reasonably preserving accuracy. In the presented work, the first stage acts as a filter that passes images to the next stage based on SKTP, which is the first time used in the CBIR domain. While in the second stage, LBP and Canny edge detectors are employed for extracting texture and shape features from the query image and images in the newly constructed database. The proposed CBIR was tested against existing algorithms on well-known database (Wang’s database), where Manhattan distance is used as a similarity metric. The improvement ratio in terms of computation time between the proposed system and existing system achieves 73.99%, which is considered a promising result.