Image Clustering with Optimization Algorithms and Color Space

Adaptive Color Quantization Method with Multi-level Thresholding

In this study, a novel color quantization approach which automatically estimates the number of colors by multi-level thresholding based on the histogram is proposed. The method consists of three stages. First, red–green–blue is clustered by threshold values. Thus, the pixels are positioned in a cluster or sub-prism. Second, the color palette is produced by determining the centroids of the clusters. Finally, the pixels are reassigned to clusters based on their distance from each centroid. The average of the pixels included in each cluster also represents the color of that cluster. While conventional methods are user-dependent, the proposed algorithm automatically generates the number of colors by considering the pixels assigned to the clusters. Additionally, the multi-level thresholding approach is also a solution to the initialization problem, which is another important issue for quantization. Consequently, the experimental results of the method tested with various images show better performance than many frequently used quantization techniques.

Chimp optimization algorithm in multilevel image thresholding and image clustering

Multilevel image thresholding and image clustering, two extensively used image processing techniques, have sparked renewed interest in recent years due to their wide range of applications. The approach of yielding multiple threshold values for each color channel to generate clustered and segmented images appears to be quite efficient and it provides significant performance, although this method is computationally heavy. To ease this complicated process, nature inspired optimization algorithms are quite handy tools. In this paper, the performance of Chimp Optimization Algorithm (ChOA) in image clustering and segmentation has been analyzed, based on multilevel thresholding for each color channel. To evaluate the performance of ChOA in this regard, several performance metrics have been used, namely, Segment evolution function, peak signal-to-noise ratio, Variation of information, Probability Rand Index, global consistency error, Feature Similarity Index and Structural Similarity Index, Blind/Referenceless Image Spatial Quality Evaluatoe, Perception based Image Quality Evaluator, Naturalness Image Quality Evaluator. This performance has been compared with eight other well known metaheuristic algorithms: Particle Swarm Optimization Algorithm, Whale Optimization Algorithm, Salp Swarm Algorithm, Harris Hawks Optimization Algorithm, Moth Flame Optimization Algorithm, Grey Wolf Optimization Algorithm, Archimedes Optimization Algorithm, African Vulture Optimization Algorithm using two popular thresholding techniques-Kapur’s entropy method and Otsu’s class variance method. The results demonstrate the effectiveness and competitive performance of Chimp Optimization Algorithm.

A Review on Atrial Fibrillation (Computer Simulation and Clinical Perspectives)

Atrial fibrillation (AF), a heart condition, has been a well-researched topic for the past few decades. This multidisciplinary field of study deals with signal processing, finite element analysis, mathematical modeling, optimization, and clinical procedure. This article is focused on a comprehensive review of journal articles published in the field of AF. Topics from the age-old fundamental concepts to specialized modern techniques involved in today’s AF research are discussed. It was found that a lot of research articles have already been published in modeling and simulation of AF. In comparison to that, the diagnosis and post-operative procedures for AF patients have not yet been totally understood or explored by the researchers. The simulation and modeling of AF have been investigated by many researchers in this field. Cellular model, tissue model, and geometric model among others have been used to simulate AF. Due to a very complex nature, the causes of AF have not been fully perceived to date, but the simulated results are validated with real-life patient data. Many algorithms have been proposed to detect the source of AF in human atria. There are many ablation strategies for AF patients, but the search for more efficient ablation strategies is still going on. AF management for patients with different stages of AF has been discussed in the literature as well but is somehow limited mostly to the patients with persistent AF. The authors hope that this study helps to find existing research gaps in the analysis and the diagnosis of AF.

An Approach for the Pan Sharpening of Very High Resolution Satellite Images Using a CIELab Color Based Component Substitution Algorithm

Recent very high spatial resolution (VHR) remote sensing satellites provide high spatial resolution panchromatic (Pan) images in addition to multispectral (MS) images. The pan sharpening process has a critical role in image processing tasks and geospatial information extraction from satellite images. In this research, CIELab color based component substitution Pan sharpening algorithm was proposed for Pan sharpening of the Pleiades VHR images. The proposed method was compared with the state-of-the-art Pan sharpening methods, such as IHS, EHLERS, NNDiffuse and GIHS. The selected study region included ten test sites, each of them representing complex landscapes with various land categories, to evaluate the performance of Pan sharpening methods in varying land surface characteristics. The spatial and spectral performance of the Pan sharpening methods were evaluated by eleven accuracy metrics and visual interpretation. The results of the evaluation indicated that proposed CIELab color-based method reached promising results and improved the spectral and spatial information preservation.

Magnetotelluric Signal-Noise Identification and Separation Based on ApEn-MSE and StOMP

Natural magnetotelluric signals are extremely weak and susceptible to various types of noise pollution. To obtain more useful magnetotelluric data for further analysis and research, effective signal-noise identification and separation is critical. To this end, we propose a novel method of magnetotelluric signal-noise identification and separation based on ApEn-MSE and Stagewise orthogonal matching pursuit (StOMP). Parameters with good irregularity metrics are introduced: Approximate entropy (ApEn) and multiscale entropy (MSE), in combination with k-means clustering, can be used to accurately identify the data segments that are disturbed by noise. Stagewise orthogonal matching pursuit (StOMP) is used for noise suppression only in data segments identified as containing strong interference. Finally, we reconstructed the signal. The results show that the proposed method can better preserve the low-frequency slow-change information of the magnetotelluric signal compared with just using StOMP, thus avoiding the loss of useful information due to over-processing, while producing a smoother and more continuous apparent resistivity curve. Moreover, the results more accurately reflect the inherent electrical structure information of the measured site itself.

A Nonparametric Model for Multi-Manifold Clustering with Mixture of Gaussians and Graph Consistency

Multi-manifold clustering is among the most fundamental tasks in signal processing and machine learning. Although the existing multi-manifold clustering methods are quite powerful, learning the cluster number automatically from data is still a challenge. In this paper, a novel unsupervised generative clustering approach within the Bayesian nonparametric framework has been proposed. Specifically, our manifold method automatically selects the cluster number with a Dirichlet Process (DP) prior. Then, a DP-based mixture model with constrained Mixture of Gaussians (MoG) is constructed to handle the manifold data. Finally, we integrate our model with the k-nearest neighbor graph to capture the manifold geometric information. An efficient optimization algorithm has also been derived to do the model inference and optimization. Experimental results on synthetic datasets and real-world benchmark datasets exhibit the effectiveness of this new DP-based manifold method.

Image Thresholding Segmentation on Quantum State Space

Aiming to implement image segmentation precisely and efficiently, we exploit new ways to encode images and achieve the optimal thresholding on quantum state space. Firstly, the state vector and density matrix are adopted for the representation of pixel intensities and their probability distribution, respectively. Then, the method based on global quantum entropy maximization (GQEM) is proposed, which has an equivalent object function to Otsu’s, but gives a more explicit physical interpretation of image thresholding in the language of quantum mechanics. To reduce the time consumption for searching for optimal thresholds, the method of quantum lossy-encoding-based entropy maximization (QLEEM) is presented, in which the eigenvalues of density matrices can give direct clues for thresholding, and then, the process of optimal searching can be avoided. Meanwhile, the QLEEM algorithm achieves two additional effects: (1) the upper bound of the thresholding level can be implicitly determined according to the eigenvalues; and (2) the proposed approaches ensure that the local information in images is retained as much as possible, and simultaneously, the inter-class separability is maximized in the segmented images. Both of them contribute to the structural characteristics of images, which the human visual system is highly adapted to extract. Experimental results show that the proposed methods are able to achieve a competitive quality of thresholding and the fastest computation speed compared with the state-of-the-art methods.