scholarly journals Content Based Image Clustering Technique Using Statistical Features and Genetic Algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 3892-3895
Author(s):  
B. K. Alsaidi ◽  
B. J. Al-Khafaji ◽  
S. A. A. Wahab
Keyword(s):  
Genetic Algorithm ◽  
Standard Deviation ◽  
Image Data ◽  
One Dimension ◽  
Image Clustering ◽  
Visual Features ◽  
Statistical Features ◽  
Textual Information ◽  
Clustering Technique ◽  
Web Images

Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering. The extraction of features gave a high distinguishability and helped GA reach the solution more accurately and faster.

An Efficient Graph-Based Flickr Photo Clustering Algorithm

2010 ◽  
Vol 29-32 ◽  
pp. 2649-2655
Author(s):  
Zheng Liu ◽  
Hua Yan ◽  
Zhen Li
Keyword(s):  
Clustering Algorithm ◽  
Image Clustering ◽  
Visual Features ◽  
Edge Weight ◽  
Clustering Methods ◽  
Data Types ◽  
Simultaneous Integration ◽  
Web Images ◽  
Photo Clustering ◽  
Traditional Image

Traditional image clustering methods mainly depends on visual features only. Due to the well-known “semantic gap”, visual features can hardly describe the semantics of the images independently. In the case of Web images, apart from visual features, there are rich metadata which could enhance the performance of image clustering, such as time information, GPS coordinate and initial annotations. This paper proposes an efficient Flickr photo clustering algorithm by simultaneous integration information of multiple types which are related to Flickr photos using k-partite graph partitioning. For a personal collection of Flickr, we firstly determine the value of k which means the number of data types we used. Secondly, these heterogeneous metadata are mapped to vertices of a k-partite graph, and relationship between the heterogeneous metadata is represented as edge weight. Finally, Flickr photos could be clustered by partitioning the k-partite graph. Experiments conducted on the photos in Flickr demonstrate the effectiveness of the proposed algorithm.

scholarly journals Image Clustering Using Multi-visual Features

2014 ◽  
pp. 179-189 ◽  
Author(s):  
Bilih Priyogi ◽  
Nungki Selviandro ◽  
Zainal A. Hasibuan ◽  
Mubarik Ahmad
Keyword(s):  
Image Clustering ◽  
Visual Features

Pattern Mining and Clustering on Image Databases

2008 ◽  
pp. 187-212
Author(s):  
Marinette Bouet ◽  
Pierre Gançarski ◽  
Marie-Aude Aufaure ◽  
Omar Boussaïd
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Image Data ◽  
Research Direction ◽  
Relevant Information ◽  
Frequent Pattern ◽  
Image Clustering ◽  
Image Mining ◽  
Clustering Methods ◽  
New Research

Analysing and mining image data to derive potentially useful information is a very challenging task. Image mining concerns the extraction of implicit knowledge, image data relationships, associations between image data and other data or patterns not explicitly stored in the images. Another crucial task is to organize the large image volumes to extract relevant information. In fact, decision support systems are evolving to store and analyse these complex data. This paper presents a survey of the relevant research related to image data processing. We present data warehouse advances that organize large volumes of data linked with images and then, we focus on two techniques largely used in image mining. We present clustering methods applied to image analysis and we introduce the new research direction concerning pattern mining from large collections of images. While considerable advances have been made in image clustering, there is little research dealing with image frequent pattern mining. We shall try to understand why.

Image Fusion in Hyperspectral Image Classification using Genetic Algorithm

2016 ◽  
Vol 2 (3) ◽  
pp. 703 ◽  
Author(s):  
B. Saichandana ◽  
K. Srinivas ◽  
R. KiranKumar
Keyword(s):  
Genetic Algorithm ◽  
Image Fusion ◽  
Image Classification ◽  
Empirical Mode Decomposition ◽  
Hyperspectral Image ◽  
Image Data ◽  
Hyperspectral Data ◽  
Hyperspectral Image Classification ◽  
Mode Decomposition ◽  
Fused Image

<p>Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. This paper presents hyperspectral image classification mechanism using genetic algorithm with empirical mode decomposition and image fusion used in preprocessing stage. 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, image fusion is performed on the hyperspectral bands to selectively merge the maximum possible features from the source images to form a single image. This fused image is classified using genetic algorithm. Different indices, such as K-means (KMI), Davies-Bouldin Index (DBI), and Xie-Beni Index (XBI) are used as objective functions. This method increases classification accuracy of hyperspectral image.</p>

Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm

2016 ◽  
Vol 3 (3) ◽  
pp. 503 ◽  
Author(s):  
R. Kiran Kumar ◽  
B. Saichandana ◽  
K. Srinivas
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Image Data ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Mode Decomposition ◽  
Fused Image

<p>This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.</p>

Sign in / Sign up

Export Citation Format

Share Document