142
Views
0
CrossRef citations to date
0
Altmetric
Articles

Multiple kernel scale invariant feature transform and cross indexing for image search and retrieval

&
Pages 84-97 | Received 14 Mar 2017, Accepted 03 Aug 2017, Published online: 04 Oct 2017
 

ABSTRACT

Image retrieval on large-scale image databases has attained more attention, in which mapping features into binary codes are showing great advancement. This paper proposes a new approach for image retrieval, Multiple Kernel SIFT (MKSIFT) that extracts the features from the pre-processed input image. It utilizes the steps of SIFT to extract the feature points. MKSIFT computes the keypoint descriptor with the introduction of exponential and tangential kernels, in which the weights assigned to the kernels are selected by Particle Swarm-Fractional Bacterial foraging optimization (PS-FBFO) algorithm. Moreover, it performs a cross-indexed image search by converting the feature points of MKSIFT into binary codes. The performance of MKSIFT+ Cross indexing is compared with that of SIFT, BSIFT, BSIFT+ Cross indexing, in which the proposed MKSIFT+ Cross indexing shows maximum performance. The experimental results evaluated the parameter precision, recall and F-measure provided maximum mean precision of 0.89793, recall of 0.8625, and F-measure of 0.87716.

Disclosure statement

No potential conflict of interest was reported by the authors.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.