# An Enhanced Jaya Algorithm with Mutation and Diversity-Preserving Strategies for Hyperspectral Band Selection

## TL;DR

This paper introduces a new algorithm for selecting optimal bands in hyperspectral images, which improves classification performance and reduces redundancy.

## Contribution

The novel approach combines a binary Jaya algorithm with mutation and diversity-preserving strategies for better band selection.

## Key findings

- The proposed method outperforms recent metaheuristic-based band selection techniques on benchmark datasets.
- The algorithm maintains solution diversity and balances exploration and exploitation effectively.

## Abstract

Hyperspectral band selection has become a key focus in hyperspectral image processing as it reduces the spectral redundancy and computational overhead, thereby improving classification performance. However, optimal band selection remains challenging due to its combinatorial nature. Although numerous metaheuristic algorithms have been introduced in recent years to address this problem, achieving an effective balance between exploration and exploitation continues to pose a major challenge. This paper proposes a novel approach that combines a parameter-free binary Jaya algorithm with a mutation operator to enhance exploration and maintain solution diversity within the search space. We employ Opposition-based Leaning (OBL) for population initialization and Quasi-Reflection reinitialization strategy to add diversity whenever fitness stagnation occurs. To simultaneously improve classification performance and band reduction we adopt weighted sum multi-objective fitness function that minimizes redundancy and enhances model generalization. Our proposed method is evaluated using three benchmark datasets, namely Indian Pines, Pavia University, and Salinas. Experimental results demonstrate that the pro-posed method outperforms recent metaheuristic-based band selection techniques. Its superior performance makes it well suited for various HSI applications.