Open Access Open Access  Restricted Access Subscription or Fee Access

Efficient Texture Image Retrieval using Prims Algorithm with K-Degree Nearest Neighbor Graph

Pushpa B. Patil, Manesh B. Kokare

Abstract


In this paper, we have tried to improve texture image retrieval performance by introducing post processing based on the greedy technique called Prims algorithm with K-degree Nearest-Neighbor graph (K-DNN). The proposed method uses the sparse representation of K-DNN graph called distance matrix instead of feature database directly, which is the distance between every K nearest images to the every other K images of the database. Due to K-degree Nearest-Neighbor sparse graph representation, the retrieval performance of the proposed method is superior over the traditional CBIR. The proposed system is tested with two different image descriptors. First image descriptors are formed with combination of rotated complex wavelet filters (RCWF) and dual tree complex wavelets (DT-CWT). Second image descriptors are formed with Contourlet Transform (CT).

Keywords


Image retrieval, wavelets, Contourlet transforms, and Prims method.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.