22 March 2023 in IEEE Transactions on Image Processing
With the increasing spectral dimension of hyperspectral images (HSI), how correctly choose bands based on band correlation and information has become more significant, but also complicated. Band selection is a combinatorial optimization problem, and intelligent optimization algorithms have been shown to be crucial in solving combinatorial optimization problems. However, major of them only use a single objective as the selection index, while neglecting the overall features of hyperspectral images, which may lead to inaccuracy in object detection. To tackle this, we propose a band selection method based on a multi-objective cuckoo search algorithm (MOCS) when constructing a multi-objective unsupervised band selection model based on the amount of information and correlation of the bands (MOCS-BS). Specifically, an adaptive strategy based on population crowding degree is first proposed to assist Lévy flight in overcoming the influence of the parameter constancy. Then, an information-sharing strategy based on grouping and crossover is designed to balance the search ability between global exploration and local exploitation, which can overcome the shortcomings caused by the lack of information interaction between individuals. Finally, the HSI classification experiments are performed by Random Forest and KNN classifiers based on the subset of bands selected by the proposed MOCS-BS method. The proposed method is compared with state-of-the-art algorithms including neighborhood grouping normalized matched filter (NGNMF) and multi-objective artificial bee colony with band selection (MABC-BS) on four HSI datasets. The experimental results demonstrate that MOCS-BS is more effective and robust than other methods.
5 December 2023 in IEEE Transactions on Geoscience and Remote Sensing
Hyperspectral image (HSI) characteristics of the abundant spectral information are favores by many scholars, but the challenge is how to select relevant features from such high dimensional data. Band selection (BS), one of the most fundamental dimensionality reduction (DR) techniques, removes redundant bands while providing a subset of bands that can preserve high information content and low noise for further HSI classification. Cuckoo search algorithm (CS) is well-known for its high performance of searching relevant features but struggles to get rid of local extremes in the late iteration. Therefore, in this paper, an unsupervised band selection method based on the heterogeneous cuckoo search algorithm with matched filter (HCS-MF) is proposed for hyperspectral image classification, in which an optimization model is constructed based on the sensitivity of the matching filter to noise. To reduce the similarity between selected bands, a mapping method based on neighborhood band grouping is proposed. In addition, an automatic recommendation strategy based on sliding spectrum decomposition (SSD) is proposed to determine the minimum recommended number of selected bands in different scenes. The superiority of the selected subset of bands is verified by Random Forest, Support Vector Machine (SVM) and Edge-Preserving Filtering-based SVM (EPF-SVM) classifiers. Experimental results on three well-known datasets demonstrate the robustness and superiority of the proposed HCS-MF algorithm compared with the state-of-the-art methods, such as marginalized graph self-representation (MGSR), neighborhood grouping normalized matched filter (NGNMF), and region-wise multiple graph fusion (RMGF).
1 July 2023 in Chinese Journal of Electronics
Making house calls is very crucial to deal with the competitive pressures of the service business and to improve service quality. We design a model called service routing problem with time windows and stochastic service time (SRPTW-SST) that is based on vehicle routing problem with time windows. A self-adaptive discrete cuckoo search algorithm with genetic mechanism (sDCS-GM) is proposed for the model SRPTW-SST. Moreover, we design a selection mechanism to improve the logicality of the algorithm based on the strong randomness of the Lévy flight. We introduce a genetic mechanism and design a neighborhood search mechanism for improving the robustness of the algorithm. In addition, an adaptive parameter adjustment method is designed to eliminate the impact of fixed parameters. The experimental results show that the sDCS-GM algorithm is more robust and effective than the state-of-the-art methods.