Particle swarm programming-based interactive content-based image retrieval

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Particle structure in particle swarm optimization (PSO) is fixed in initialization and may result in premature or slow convergence. To tackle this problem, an improved PSO approach called particle swarm programming (PSP) is presented. PSP forms flexible nonlinear distribution representation of particles by introducing hierarchical tree structure into PSO. Furthermore, PSP is introduced in relevance feedback (RF) process of interactive content-based image retrieval (CBIR) by constructing a nonlinear updated query vector. Tests with five benchmark functions demonstrate that PSP can indeed increase diversity of initial particles, enhance search power and improve convergence over PSO. Extensive experiments on Corel-1000 and Catch-256 datasets show that the proposed PSP-based CBIR technique outperforms other linear or recent RF methods proposed for CBIR.

Cite

CITATION STYLE

APA

Yang, X. H., Tian, C. X., Lv, F. Y., Zhang, J., & Zha, Z. J. (2018). Particle swarm programming-based interactive content-based image retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11166 LNCS, pp. 99–111). Springer Verlag. https://doi.org/10.1007/978-3-030-00764-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free