Loading…

Content-based image retrieval using PSO and k-means clustering algorithm

In various application domains such as website, education, crime prevention, commerce, and biomedicine, the volume of digital data is increasing rapidly. The trouble appears when retrieving the data from the storage media because some of the existing methods compare the query image with all images i...

Full description

Saved in:
Bibliographic Details
Published in:Arabian journal of geosciences 2015-08, Vol.8 (8), p.6211-6224
Main Authors: Younus, Zeyad Safaa, Mohamad, Dzulkifli, Saba, Tanzila, Alkawaz, Mohammed Hazim, Rehman, Amjad, Al-Rodhaan, Mznah, Al-Dhelaan, Abdullah
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In various application domains such as website, education, crime prevention, commerce, and biomedicine, the volume of digital data is increasing rapidly. The trouble appears when retrieving the data from the storage media because some of the existing methods compare the query image with all images in the database; as a result, the search space and computational complexity will increase, respectively. The content-based image retrieval (CBIR) methods aim to retrieve images accurately from large image databases similar to the query image based on the similarity between image features. In this study, a new hybrid method has been proposed for image clustering based on combining the particle swarm optimization (PSO) with k-means clustering algorithms. It is presented as a proposed CBIR method that uses the color and texture images as visual features to represent the images. The proposed method is based on four feature extractions for measuring the similarity, which are color histogram, color moment, co-occurrence matrices, and wavelet moment. The experimental results have indicated that the proposed system has a superior performance compared to the other system in terms of accuracy.
ISSN:1866-7511
1866-7538
DOI:10.1007/s12517-014-1584-7