Next Article in Journal
SLAM–UAV LiDAR Co-Registration for Individual-Tree Carbon Across a Tropical Dry-Forest Canopy Gradient
Previous Article in Journal
Improving Vegetation Mapping from LiDAR Point Clouds Using a Transmissivity-Based Feature
Previous Article in Special Issue
UAV-Based Soil Salinity Estimation Using Stagewise Feature Optimization and Dual-Backbone Deep Learning Fusion
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

FDM-Net: A Multi-Level Feature Aggregation Network Based on Frequency-Decomposition for Hyperspectral Image Classification

Information Science and Technology College, Dalian Maritime University, Dalian 116026, China
*
Author to whom correspondence should be addressed.
Remote Sens. 2026, 18(15), 2603; https://doi.org/10.3390/rs18152603
Submission received: 22 June 2026 / Revised: 30 July 2026 / Accepted: 31 July 2026 / Published: 5 August 2026

Highlights

What are the main findings?
  • Existing CNN–Mamba hybrid models for hyperspectral image classification usually feed the same mixed spectral–spatial features into both branches. This design may weaken the complementary roles of Mamba and convolution, because low-frequency contextual information and high-frequency structural details are not explicitly separated.
  • FDM-Net addresses this issue by introducing a frequency-decomposition strategy before dual-branch feature modeling. Low-frequency features are processed by a Mamba-based branch to capture long-range dependencies, while high-frequency features are enhanced by the proposed Multi-level Feature Aggregation Module to preserve local spatial details.
  • Experiments on five public hyperspectral datasets show that FDM-Net obtains competitive classification results in terms of OA, AA, and Kappa, indicating that separating and recombining frequency-specific features is useful for spectral–spatial representation learning.
What are the implications of the main findings?
  • The results indicate that CNN and Mamba modules should not simply be combined in parallel with identical inputs. A more effective design is to assign different frequency components to the modeling branch that is better suited to them.
  • Frequency Decomposition offers a simple but useful way to reduce feature interference in hybrid hyperspectral classifiers, especially when global context and fine spatial structures need to be preserved at the same time.
  • This finding suggests that future hyperspectral image classification networks can benefit from considering the frequency characteristics of features, rather than only increasing network depth, attention modules, or branch complexity.

Abstract

Recently, integrating convolutional neural networks (CNNs) with Mamba has shown notable advantages in hyperspectral image classification. However, existing Mamba–CNN hybrid frameworks typically adopt a parallel-branch architecture where identical spectral–spatial information is fed into both branches, failing to rectify the inherent frequency-specific bias: Mamba tends to prioritize low-frequency information, while CNNs excel at capturing high-frequency details. Existing convolutional architectures often fail to effectively exploit the multi-level interactions among spectral–spatial features. To handle these limitations, a novel multi-level Aggregation Network based on Frequency Decomposition (FDM-Net) is proposed. Specifically, a Frequency Decomposition Fusion Enhancement (FDE) strategy first splits the features into low- and high-frequency components and then applies spatial-frequency gating and interactive enhancement to refine the decomposed features. A Mamba-based module is then integrated into the low-frequency branch to model long-range spatial dependencies. Meanwhile, a Multi-Level Feature Aggregation Module (MLFA) leverages multi-level depthwise convolutions and gated aggregation to capture complex multi-level interactions in high-frequency features. Finally, an adaptive frequency fusion (AFF) module dynamically reintegrates these features, yielding a discriminative spectral–spatial representation that integrates global semantics and local textures. Extensive experiments on five benchmark HSI datasets demonstrate that FDM-Net consistently surpasses state-of-the-art methods, achieving the highest OA and Kappa across all five datasets and the best AA on QHUP (92.35%) and QHUT (93.86%). Notably, FDM-Net outperforms the second-best method by margins of 0.28–1.01% in OA and 0.33–1.14% in Kappa.

1. Introduction

Hyperspectral images (HSIs) have become an important source in geoscience and remote sensing (RS) due to their ability to capture detailed spectral signatures of ground objects. Compared with conventional remote sensing imagery, HSIs provide hundreds of contiguous spectral bands together with spatial information, enabling fine-grained material discrimination at the pixel level. Consequently, hyperspectral image classification has become a fundamental task, as accurate land-cover mapping supports many practical applications, including military surveillance, urban planning, and environmental monitoring [1,2].
Numerous methods have been proposed for hyperspectral image classification, evolving from convolutional neural networks (CNNs) to Transformers and more recently to state space models (SSMs) such as Mamba. CNNs provide efficient spectral–spatial feature extraction with low computational cost through weight sharing. For example, Chen et al. [3] proposed the 3D CNN framework for HSI classification, verifying CNNs’ core capability of local spectral–spatial pattern learning. Paoletti et al. [4] proposed a deep pyramidal residual network for hyperspectral image classification, which enhances spectral–spatial feature extraction through residual learning and hierarchical channel expansion. Wang et al. [5] proposed NL2Net, which couples non-local and local feature modeling via a dual-branch architecture to capture both local spatial–spectral structures and long-range dependencies.
Recently, Transformers have been introduced to mitigate the limited receptive field of CNNs by modeling global spectral–spatial dependencies via self-attention. For instance, Hong et al. [6] developed SpectralFormer, which leverages Transformer architecture to capture global spectral–spatial dependencies via sequential band modeling. Sun et al. [7] further introduced a spectral–spatial feature tokenization Transformer, enabling more effective global representation learning. However, Transformers are limited by their high computational cost, as their processing requirements grow exponentially with the size of the input data.
In recent studies, the Mamba model [8] has emerged as a computationally efficient alternative to Transformers, particularly for high-resolution HSI processing. By leveraging the selective state space model (SSM) framework [8], Mamba achieves near-linear complexity with respect to input sequence length while maintaining robust global modeling capabilities. Zhu et al. [9] further extended the selective scanning mechanism to vision tasks. This advancement has recently motivated the development of hybrid CNN–Mamba architectures that integrate the local inductive bias of CNNs with the global dependency modeling capability of Mamba. For example, TinyVim [10] uses CNNs for local feature extraction while employing Mamba for global dependency modeling.
Despite these improvements, several limitations remain in hyperspectral image classification. Moreover, conventional hybrid frameworks typically feed homogeneous features into both branches, failing to rectify the frequency-specific biases of CNNs and Mamba. Since Mamba favors low-frequency global modeling while CNNs focus on high-frequency textures, such uniform processing results in significant feature interference and redundant representations. Furthermore, existing frequency-aware methods often adopt static decomposition with unidirectional information flow, limiting their adaptability to diverse scene characteristics. For instance, DFTN [11] separates frequency components via a fixed FFT-based filter, while WaveFormer [12] employs a static Haar wavelet transform; in both cases, the decomposition is predetermined and the two frequency bands cannot exchange complementary information. In addition, existing CNNs often focus on low- or high-order correlations, failing to exploit the complex multi-level interactions among spectral–spatial features. Specifically, low-order interactions mainly capture simple local patterns, whereas high-order interactions tend to model complex global relationships. The existing network structures are implicitly biased toward low- or high-order feature interactions, ignoring the utilization of multi-level information components.
To address these issues, a Multi-Level Aggregation Network based on Frequency Decomposition (FDM-Net) is proposed. To overcome the frequency-specific bias of homogeneous feature feeding, the framework employs an explicit Frequency Decomposition strategy that routes low-frequency features to a Mamba-based branch for global context modeling and high-frequency features to a dedicated CNN branch for spatial detail extraction, thereby eliminating feature interference. Furthermore, unlike static decomposition with unidirectional information flow, the proposed Frequency Decomposition Fusion Enhancement (FDE) strategy introduces input-adaptive multi-level Gaussian filtering with learnable gating and cross-frequency residual enhancement, enabling bidirectional complementary information exchange between frequency bands. In addition, to address the underutilization of multi-level spatial interactions, a Multi-Level Feature Aggregation Module (MLFA) is introduced in the high-frequency branch, which aggregates local and dilated depthwise convolution responses and modulates them through a gating path, capturing complex spatial correlations beyond single-order interactions. Finally, the two branches are fused through an adaptive frequency fusion module, enabling FDM-Net to achieve competitive performance on hyperspectral image classification. Ablation experiments in Section 4.6 confirm that the FDE strategy alone yields consistent OA gains across datasets (0.17–1.09%), with larger contributions on spectrally complex scenes such as QHUP and Houston. The contributions of this paper are summarized as follows:
1.
A novel multi-level Aggregation Network based on Frequency Decomposition is proposed for hyperspectral image classification. Rather than feeding the same mixed-frequency representation to parallel branches, the framework employs a Frequency Decomposition Fusion Enhancement (FDE) strategy to explicitly separate features: low-frequency structural features are routed to a Mamba-based module for modeling global contextual dependencies, while high-frequency detail features are directed to a dedicated convolutional branch to capture fine-grained spatial information. The dominant features of both branches are subsequently integrated through an adaptive frequency fusion (AFF) module, promoting complementary modeling of global context and local spatial details.
2.
Unlike prior methods that rely on static bases and uniform, data-agnostic separation, FDE introduces input-adaptive multi-level Gaussian filtering with learnable gating, integrated with input-dependent channel–spatial calibration and shared cross-frequency residual enhancement. This enables the network to autonomously determine the optimal frequency partition for each input scene, rather than imposing a fixed, one-size-fits-all decomposition. Before branch-specific modeling, the strategy adaptively recalibrates the decomposed frequency responses and compensates for information loss caused by strict frequency separation, yielding a dynamic, scene-aware separation that respects the unique spectral characteristics of each image.
3.
A Multi-Level Feature Aggregation module is introduced in the high-frequency branch to preserve fine-grained spatial structures. This module aggregates multi-scale spatial responses via local and dilated depthwise separable convolutions, adaptively modulates them through a gating path, and achieves effective channel interaction through feature concatenation and nonlinear fusion. As a result, boundary and texture representation are enhanced while maintaining moderate computational complexity.

2. Related Work

2.1. Frequency-Driven Modeling for HSI Classification

Frequency Decomposition has served as an effective paradigm to disentangle heterogeneous feature semantics within visual data. Low-frequency components dominate global structural trends and smooth spectral responses across ground objects, whereas high-frequency signals encode subtle edges, textural variations and locally distinctive spectral signatures that determine inter-class separability [13]. Early hyperspectral analysis relied on wavelet and Fourier transforms for frequency-domain denoising and band reduction; these traditional tools operated solely on raw pixel spectra without deep feature learning, limiting their capacity to extract hierarchical spatial–spectral representations [14].
Recent studies have demonstrated that frequency-aware representation learning can effectively improve hyperspectral image classification by explicitly separating low-frequency contextual information and high-frequency discriminative details [15]. Building upon this idea, several frequency-driven modeling approaches have been proposed for hyperspectral image classification. Fan et al. [16] introduced a Frequency and Topology Interaction Network (FTIN), which integrates frequency-domain representation learning with topology-aware dependency modeling to enhance spectral–spatial feature discrimination. Cheng et al. [17] proposed SAFDNet, which combines stochastic adaptive Fourier decomposition with CNNs to implement unsupervised feature extraction, lowering network parameters and adapting to scenarios with limited labeled data. Wan et al. [18] designed the dual-branch SSFNet, which decomposes spatial–spectral signals into frequency components and fuses features via gating units and attention modules. Qiao et al. [11] constructed the dual-frequency Transformer DFTN, utilizing neighborhood attention and global filtering to mine high- and low-frequency information. Xi et al. [19] proposed a wide and deep Fourier network (WD-FNet) for HSI classification, leveraging FFT-based sliding-window frequency feature extraction with pruning and a least-squares classifier.
Nevertheless, most existing approaches still employ homogeneous backbone architectures for both low- and high-frequency components, overlooking their inherently distinct representation characteristics. Furthermore, cross-frequency communication is typically restricted to simple fusion operations or attention weighting, lacking dedicated bidirectional interaction pathways capable of fully exploiting complementary frequency cues [20].

2.2. Mamba-Based Dependency Modeling for HSI Classification

Transformers dominated global context modeling for hyperspectral imagery via self-attention, yet their quadratic computational cost hindered deployment on high-dimensional HSI cubes [6]. State space models (SSMs), epitomized by Mamba [8], resolve this bottleneck through linear-complexity selective scanning, dynamically modulating hidden state propagation according to input content rather than computing pairwise token correlations. This efficiency makes Mamba naturally suited for modeling extended spectral in HSI data.
The recent literature has demonstrated the strong capability of Mamba in hyperspectral image classification tasks, particularly in modeling long-range spectral–spatial dependencies with high computational efficiency. Liao et al. [21] proposed a novel hyperspectral image classification method that integrates state space modeling with adaptive recalibration mechanisms, while Zeng et al. [22] demonstrated BioLiteNet to substantially reduce model parameters and computational complexity while maintaining high classification accuracy. Additionally, MambaHSI [23] built disjoint spatial and spectral Mamba blocks to capture cross-dimension long-range interactions, while its upgraded variant MambaHSI+ [24] boosted feature propagation via multi-directional scanning paths. S2Mamba [25] combined structured spatial–spectral traversal with adaptive gating to refine fine-grained sequence embeddings, and SpectralMamba [26] incorporated positional encoding to stabilize spectral sequence modeling.
Despite their strong performance, existing Mamba-centric architectures generally process undifferentiated mixed-frequency feature representations. Owing to its selective state space mechanism and inherent low-pass tendency, Mamba is more effective in modeling low-frequency global structures [10]. In contrast, high-frequency components embedded in the same representation are not sufficiently emphasized, leading to suboptimal utilization of fine-grained discriminative details.

2.3. Hybrid CNN–Mamba Architectures for HSI Classification

Convolutional neural networks (CNNs) have long been a fundamental backbone for hyperspectral image analysis due to their strong capability in capturing local spatial patterns and modeling short-range dependencies. However, their inherently local receptive field limits their ability to effectively model long-range spectral–spatial relationships, which are crucial for complex scene understanding in hyperspectral images. Recently, Mamba-based state space models have emerged as an efficient alternative for long-range dependency modeling. By leveraging selective state space mechanisms, Mamba demonstrates strong capability in capturing global contextual information with linear computational complexity, making it well-suited for modeling long-range spectral–spatial interactions. Nevertheless, its sequence-based formulation tends to prioritize globally smooth structures, which may limit its sensitivity to fine-grained local spatial details.
To address the complementary strengths and limitations of CNNs and Mamba, several hybrid CNN–Mamba architectures have been proposed for hyperspectral image classification. For example, TinyViM [10] adopts a serial design where CNN-based feature extraction is followed by Mamba-based global modeling. DualMamba [27] introduces a parallel dual-branch structure that separately models local spatial features using CNNs and global dependencies using Mamba, and fuses them for final prediction. The SSM-CNN framework [28] uses bidirectional SSM to capture global spectral correlations and shared CNN residual modules to extract spatial features for multisource remote sensing data. It optimizes feature screening via batch normalization and spatial attention and realizes dynamic feature fusion with weighted strategies.
These methods demonstrate the effectiveness of combining convolution-based local modeling with mamba-based modeling. However, they typically operate on mixed spectral–spatial representations without explicitly disentangling low-frequency semantic information from high-frequency structural details. As a result, the complementary strengths of CNNs and Mamba may not be fully exploited, leading to suboptimal utilization of frequency-specific features.

3. Proposed Methodology

Hyperspectral images (HSIs) inherently exhibit multi-frequency characteristics: low-frequency components carry the main structural information and global spectral correlation of ground objects, while high-frequency components contain fine spatial details and discriminative local spectral variations. To fully exploit the complementary information of different frequency components, this paper proposes a frequency-aware dual-branch network named FDM-Net for HSI classification.
As illustrated in Figure 1, the overall pipeline of FDM-Net follows a four-stage architecture: shallow feature embedding, Frequency Decomposition and enhancement, dual-branch feature extraction, and adaptive fusion classification. First, the input HSI patch with size C × H × W is fed into a shallow convolutional embedding module to extract primary spatial–spectral features. Then, the Frequency Decomposition Fusion Enhancement (FDE) strategy decomposes the embedded features into low-frequency structural components and high-frequency detail components via multi-level Gaussian filtering, and further enhances the two components through spatial attention and cross-frequency interaction. Afterwards, two parallel branches perform targeted feature modeling on the frequency components respectively: the low-frequency branch adopts a Mamba-based state space model to capture long-range global dependencies, while the high-frequency branch leverages the Multi-Level Feature Aggregation (MLFA) module to mine multi-level local spatial details. Finally, the complementary features from the two branches are dynamically fused by an adaptive frequency fusion module, and fed into the classification head to output pixel-level classification results.
Before Frequency Decomposition, a shallow convolutional embedding module is introduced to perform preliminary spatial–spectral feature extraction on the input HSI patch. The module consists of two stacked 3 × 3 convolutional layers, each followed by batch normalization (BN) and ReLU activation function. The two convolutional layers maintain the spatial size and channel number of the input feature map and effectively capture local neighborhood spectral–spatial correlations while preserving the original frequency distribution of the input, providing reliable feature basis for subsequent Frequency Decomposition. The calculation process can be expressed as follows:
X e m b e d = Conv 2 BN ReLU Conv 1 ( X i n )
where X i n R C × H × W denotes the input HSI patch, and X e m b e d is the embedded feature output.

3.1. Frequency Decomposition Fusion Enhancement Strategy

To enable each branch to specialize in its corresponding frequency domain, a Frequency Decomposition Fusion Enhancement (FDE) strategy is designed. The strategy decomposes input features into low-frequency and high-frequency components via multi-level Gaussian filtering and introduces adaptive spatial attention and cross-frequency enhancement mechanisms to achieve content-aware frequency separation and complementary information interaction.
First, multi-level Gaussian kernels with different smoothing degrees are constructed to extract low-frequency components at different granularities. The normalized 2D Gaussian kernel with kernel size k and standard deviation σ is defined as
G k ( σ ) = exp x 2 + y 2 2 σ 2 i , j exp i 2 + j 2 2 σ 2
where ( x , y ) denotes the spatial coordinate relative to the kernel center, and the denominator sums over all positions ( i , j ) within the k × k kernel for normalization.
Based on the Gaussian kernels, multi-level low-frequency representations are extracted through depthwise convolution, where each channel is independently filtered to avoid inter-channel information interference. Three kernel sizes of 3 × 3 , 5 × 5 and 7 × 7 are adopted, with corresponding standard deviations of 0.8 , 1.5 and 2.5 , respectively. The convolution process is formulated as
F k = X e m b e d G k ( σ k ) , k { 3 , 5 , 7 }
where denotes depthwise convolution operation.
The multi-level low-frequency features are fused by weighted summation to obtain the base low-frequency representation, with weights (w) set to 0.5, 0.3 and 0.2, corresponding to the three scales from fine to coarse. The base high-frequency component is obtained by subtracting the low-frequency component from the original embedded feature:
Low b a s e = 0.5 · F 3 + 0.3 · F 5 + 0.2 · F 7
High b a s e = X e m b e d Low b a s e
To achieve content-aware frequency separation, two parallel attention mechanisms are introduced from both channel and spatial dimensions to dynamically weight the frequency components. On the channel dimension, a global adaptive predictor is constructed via global average pooling (GAP) and two point-wise convolutional layers, which predicts three global parameters, low-frequency strength s l o w , high-frequency strength s h i g h , and mixing coefficient α , to adjust the overall intensity of the two frequency components adaptively according to the input spectral characteristics. On the spatial dimension, a lightweight spatial attention module generates two complementary spatial attention masks σ l o w and σ h i g h through two convolutional layers followed by Softmax normalization along the channel dimension, enabling pixel-level adaptive weighting of frequency components. The calculation is as follows:
[ σ l o w , σ h i g h ] = Softmax Conv s p a t i a l ( X e m b e d )
The attention-weighted frequency features are then obtained by multiplying the base components with channel strength and spatial attention mask simultaneously:
F ˜ l o w = Low b a s e · s l o w · σ l o w
F ˜ h i g h = High b a s e · s h i g h · σ h i g h
To realize cross-frequency information complementation, a shared enhancement feature f e is generated by concatenating the two weighted frequency features and processing them through a Conv-BN-ReLU module:
f e = Conv 1 × 1 BN ReLU Conv 1 × 1 [ F ˜ l o w , F ˜ h i g h ]
where [ · , · ] denotes channel-wise concatenation along the channel dimension, and Conv 1 × 1 is a 1 × 1 convolutional layer that reduces the concatenated channels back to the original dimension. The enhancement feature is then adaptively distributed back to the two branches according to the mixing coefficient α :
F l o w p r e = F ˜ l o w + α · f e
F h i g h p r e = F ˜ h i g h + ( 1 α ) · f e
Furthermore, multi-level residual connections are introduced to stabilize training and avoid information loss during Frequency Decomposition. First, the concatenated dual-branch features are processed by an additional fusion convolution to generate fusion residual features, which are injected into the two frequency branches with a scaling factor of 0.2. Second, the original embedded features are added to both branches with a small scaling factor as global residual connections. The final output frequency features of the FDE module are
F l o w = F l o w p r e + 0.2 · F f u s i o n + 0.1 · X e m b e d
F h i g h = F h i g h p r e + 0.2 · F f u s i o n + 0.1 · X e m b e d
where F f u s i o n denotes the fusion residual feature. The two frequency features are subsequently fed into the Mamba-based low-frequency branch and MLFA-based high-frequency branch, respectively.

3.2. Multi-Level Feature Aggregation Module (MLFA)

To effectively model multi-level spatial dependencies in high-frequency hyperspectral features and enhance detailed representation, we propose a Multi-Level Feature Aggregation (MLFA) module. As illustrated in Figure 2, the core of the module adopts a dual-path gating design composed of a Value Path v and a Gate Path g , enabling adaptive enhancement and filtering of multi-level spatial features. The entire MLFA block is built upon a PreNorm residual architecture, integrating a multi-level dilated depthwise convolution unit for multi-level spatial feature extraction and a channel aggregation structure for output feature dimension adjustment.
Given the high-frequency input feature F h i g h R B × C × H × W , it first undergoes layer normalization under the PreNorm mechanism and then is fed into the dual-path core computing unit.

3.2.1. Value Path

The Value Path extracts multi-level spatial feature representations via hierarchical dilated depthwise convolutions. First, the normalized input passes through a 5 × 5 depthwise convolution with dilation rate d = 1 to obtain base spatial features:
x 0 = DWConv 5 × 5 , d = 1 Norm ( F h i g h )
On this basis, two parallel 5 × 5 depthwise convolutions with dilation rate d = 2 are adopted to augment the contextual receptive field for high-frequency feature extraction, yielding multi-level spatial representations that balance local detail and moderate spatial context:
x 1 = DWConv 5 × 5 , d = 2 x 0 , x 2 = DWConv 5 × 5 , d = 2 x 0
The base feature and two sets of dilated convolution features are concatenated along the channel dimension and then undergo channel transformation and nonlinear activation via a 1 × 1 convolution and SiLU function:
v = SiLU Conv 1 × 1 x 0 x 1 x 2
where denotes the channel-wise concatenation operation, and SiLU ( x ) = x · σ ( x ) is the Sigmoid Linear Unit activation function that provides smooth, non-monotonic nonlinearity with self-gating properties.

3.2.2. Gate Path

Parallel to the Value Path, the Gate Path directly generates spatial importance weight signals from the normalized input to realize adaptive modulation of features in the Value Path:
g = SiLU Conv 1 × 1 Norm ( F h i g h )
The gate weights encode the importance of each spatial position in the feature map, which can selectively enhance the response of discriminative detail regions and suppress redundant noise and invalid responses.

3.2.3. Gated Aggregation and Residual Output

After obtaining the outputs of the two paths, element-wise multiplication is performed between the Value Path features and gate weights to complete gated feature enhancement. Finally, a 1 × 1 aggregation convolution is applied to adjust the channel dimension and output the enhanced high-frequency features:
F h i g h = Conv 1 × 1 g v
where ⊙ denotes the element-wise multiplication operation.
The entire MLFA module adopts a PreNorm residual connection structure. The output of the core gating unit is added with the original input to form a residual path, which ensures stable network training while preserving the original high-frequency information:
F h i g h o u t = F h i g h + F h i g h

3.3. Mamba-Based Low-Frequency Feature Processing Branch

As illustrated in Figure 1, the low-frequency branch is built upon the Mamba to model long-range global dependencies of low-frequency features with linear computational complexity. The overall pipeline consists of FC embedding, adaptive parameter projection (branches A, B, C, D), and recurrent state space computation.
Given the input low-frequency feature F l o w R B × C × H × W (where B is batch size, C is the number of channels, and H , W denote spatial height and width), we first flatten the 2D spatial feature into a 1D sequence and perform FC embedding via point-wise convolution, obtaining the embedded input sequence:
X = [ x 1 , x 2 , , x L ] , x t R D
where L = H × W denotes the total sequence length, and D is the embedding dimension after channel adaptation.
As marked by the four branches (A, B, C, D) in the figure, four independent linear projections are applied to the embedded sequence to generate input-dependent state space parameters. For the t-th token in the sequence, we first compute the discretized state transition matrix A ¯ t and input matrix B ¯ t from branches A and B, following the selective discretization rule:
A ¯ t = exp ( Δ t A ) , B ¯ t = Δ t B
where A R d s t a t e × d s t a t e and B R d s t a t e × D are learnable base parameters of the state space model; Δ t is the input-adaptive time step that controls the state update rate, and ⊙ denotes element-wise multiplication.
Based on the discretized parameters, we perform recurrent hidden state update along the sequence direction:
h t = A ¯ t h t 1 + B ¯ t x t
where h t 1 R d s t a t e is the hidden state from the previous position, and d s t a t e is the dimension of the state space.
Combined with the projection outputs from branches C and D, the output feature at position t is calculated as
y t = C h t + D x t
where C R D × d s t a t e and D R D are learnable output projection parameters.
Finally, outputs of all positions are concatenated to form the complete output sequence of the low-frequency branch:
y = [ y 1 , y 2 , , y L ]
The output sequence is reshaped back to a 2D spatial tensor for the subsequent frequency fusion operation.

3.4. Adaptive Frequency Fusion Module

The low-frequency branch extracts global structural features, while the high-frequency branch captures local detail features. The two types of features have strong complementarity. To fully fuse the dual-branch information and dynamically adjust the fusion weight according to input characteristics, this paper designs an adaptive frequency fusion module, which performs adaptive weighted fusion from both channel and spatial dimensions.
First, feature alignment is performed on the dual-branch outputs. Since the channel numbers of the two branches may be different, a point-wise convolution is applied to the high-frequency feature to map its channel number to be consistent with the low-frequency feature. If the spatial sizes of the two features do not match, bilinear interpolation is adopted for upsampling alignment to ensure that the two features can be fused element-wise.
The aligned low-frequency feature F l o w and high-frequency feature F h i g h are then input into the dual-attention fusion unit. On the channel dimension, global average pooling and global max pooling are performed on each feature respectively to aggregate global spatial information. The pooled features are fed into a shared multi-layer perceptron (MLP) to generate channel attention weights, which are used to weight the importance of each channel adaptively. On the spatial dimension, the channel mean and channel maximum of the two features are concatenated along the channel dimension, and a convolutional layer is applied to generate a spatial attention map, which dynamically weights the importance of different spatial positions.
The weighted features of the two branches are added element-wise to obtain the final fused feature F f u s e :
F f u s e = M c l o w M s l o w F l o w + M c h i g h M s h i g h F h i g h
where M c R C × 1 × 1 and M s R 1 × H × W denote the channel attention weight and spatial attention weight respectively. This adaptive fusion mechanism can dynamically adjust the fusion ratio of structural information and detail information according to the characteristics of input samples, effectively integrating the advantages of dual-branch features and improving the discriminative ability of the fused features.

3.5. Classification Head and Loss Function

The fused feature is first fed into a global average pooling layer to compress the 2D spatial feature into a channel-wise feature vector, which reduces the number of parameters and preserves global semantic information. Then, a dropout layer with a dropout rate of 0.3 is applied to alleviate overfitting. Finally, the feature vector is mapped to the class dimension through a fully connected layer, and the classification probability is obtained after Softmax normalization.
The network is trained end-to-end with the cross-entropy loss function, which is defined as
L c e = 1 N i = 1 N k = 1 K y i , k log y ^ i , k
where N is the number of samples in a batch, K is the total number of categories, y i , k is the one-hot encoded ground truth label of the i-th sample for the k-th category, and y ^ i , k is the corresponding predicted probability.

4. Experiment Results and Analysis

4.1. Datasets

(1)
QUH-Pingan (QUHP): The QUH-Pingan dataset [14] was acquired from 10:43 to 11:28 on 19 May 2021, over the Huangdao Pingan Passenger Ship Terminal in Qingdao, China. The UAV flew at an altitude of 200 m, yielding a spatial resolution of 0.10 m. The imagery has a spatial size of 1230 × 1000 pixels and covers 176 spectral bands in the wavelength range of 400–1000 nm. It contains 10 land-cover classes, including Ship, Seawater, Trees, Concrete structure building, Floating pier, Brick houses, Steel houses, Wharf construction land, Car, and Road, with large-scale variation: large-scale (Seawater, Road), medium-scale (Trees, Floating pier, Brick houses, Steel houses), and small-scale (Ship, Car) targets, where the latter are the most difficult to identify. Following the spatially disjoint protocol, 1% of the labeled samples per class were used for training, with the remaining samples reserved for testing.
(2)
QUH-Qingyun (QUHQ): The QUH-Qingyun dataset [14] was collected from 14:06 to 14:45 on 18 May 2021, over a residential and primary school area on Qingyun Road, Qingdao, China, at an altitude of 300 m with a spatial resolution of 0.15 m. The image size is 880 × 1360 pixels, covering 270 spectral bands from 400 to 1000 nm. It comprises six land-cover classes: Trees, Concrete building, Car, Ironhide building, Plastic playground, and Asphalt road. A key challenge of this dataset lies in shadow occlusion (affecting Trees, Car, and Asphalt road) and the recognition of small-scale targets (e.g., Car), which can significantly reduce classification accuracy and robustness. Under the spatially disjoint protocol, 1% of the labeled samples per class were used for training.
(3)
QUH-Tangdaowan (QUHT): The QUH-Tangdaowan dataset [14] was acquired from 11:23 to 12:05 on 18 May 2021, over Tangdao Bay National Wetland Park in Qingdao, China, at a flight altitude of 300 m with a spatial resolution of 0.15 m. The data has a spatial size of 1740 × 860 pixels and spans 176 spectral bands in the range of 400–1000 nm. It is the most complex of the three QUH sub-datasets, containing 18 land-cover classes with high intra-class spectral similarity—notably four vegetation species (Coniferous pine, Buxus sinica, Populus, Ulmus pumila L.) and three pavement types (Flagging, Boardwalk, Gravel road) that are spectrally nearly indistinguishable, posing a significant challenge for precise classification. Following the spatially disjoint protocol, 1% of the labeled samples per class were used for training.
(4)
Houston: The Houston dataset [29] was collected in June 2012 via the ITRES CASI-1500 airborne sensor over the University of Houston campus and the neighboring urban area and was officially released for the 2013 IEEE GRSS Data Fusion Contest. The image has a spatial size of 349 × 1905 pixels with a spatial resolution of 2.5 m, covering 144 spectral bands in the wavelength range of 380–1050 nm. It contains 15 urban land-cover classes, including Healthy grass, Stressed grass, Synthetic grass, Tree, Soil, Water, Residential, Commercial, Road, Highway, Railway, Parking lot 1, Parking lot 2, Tennis court, and Running track, with a total of 15,029 labeled samples (2832 for training and 12,197 for testing) under complex urban illumination conditions. In our experiments, 2% of the labeled samples from each class were randomly selected for training, with the remaining samples reserved for testing.
(5)
Indian Pines (IP): The Indian Pines dataset [30] was acquired in 1992 via the AVIRIS (Airborne Visible/Infrared Imaging Spectrometer) sensor over an agricultural and forested test site in Northwestern Indiana, USA. The image consists of 145 × 145 pixels with a spatial resolution of 20 m, spanning 220 spectral bands in the wavelength range of 400–2500 nm. After removing 24 water-absorption and noisy bands (bands 104–108, 150–163, and 220), 200 spectral bands were retained for experiments. The dataset contains 16 land-cover classes with a total of 10,249 labeled samples, covering a variety of agricultural categories such as Corn-notill (1428 samples), Soybean-mintill (2455 samples), and minority classes such as Alfalfa (46 samples) and Oats (20 samples), resulting in a highly imbalanced class distribution that poses significant classification challenges. In this study, 10% of the labeled samples from each class were randomly selected for training, and the remaining 90% were reserved for evaluation.

4.2. Experimental Settings

All experiments were conducted on a single NVIDIA RTX 5060 GPU using PyTorch 2.7.0. The model was trained for 300 epochs with a batch size of 32, using the AdamW optimizer ( l r = 1 × 10 4 ) and a cosine learning rate scheduler, and three widely used metrics in hyperspectral image classification were adopted: Overall Accuracy (OA), Average Accuracy (AA), and the Kappa coefficient ( κ ). OA measures the ratio of correctly classified samples to the total number of test samples, AA computes the mean accuracy across all classes, and κ evaluates the agreement between predicted labels and ground truth.

4.3. Performance Comparison

To validate the effectiveness of the proposed method, comprehensive experiments were conducted on the five mentioned benchmark datasets. Several state-of-the-art hyperspectral image classification methods were selected as comparison models, including Lite-HCNet [31], LSSAN [32], MSDAN [33], SimPoolFormer [34], SpectralFormer [6], CacfNet [35], GSCViT [36], and SSFTT [7].
(1) Results on QHUP Dataset:
As shown in Table 1, FDM-Net achieves the best overall performance on the QHUP dataset, with an OA of 97.58%, AA of 92.35% and Kappa coefficient of 96.39%, all ranking first among the compared methods. Specifically, compared with the second-best method Lite-HCNet in terms of OA, FDM-Net yields an improvement of 0.54%. For AA and Kappa metrics, it outperforms the runner-up Lite-HCNet by 0.52% and 0.80% respectively, verifying its strong classification capability for complex land-cover scenes. The gains are particularly evident on challenging categories: for spectrally heterogeneous classes with large intra-class variance (e.g., Class 1 and Class 4), FDM-Net attains 91.50% and 96.93% respectively, benefiting from its frequency-adaptive feature decomposition that enhances robustness to intra-class spectral variations. On the most challenging Class 9, which suffers from limited training samples and severe spectral confusion, FDM-Net achieves a competitive 75.12% with higher stability.
Figure 3 presents the classification maps of all methods on the QHUP dataset for visual verification. Most competing methods produce scattered salt-and-pepper misclassification noise in homogeneous ground object regions, with blurred and jagged boundaries between different categories. Especially for methods like LSSAN and CacfNet, misclassification noise is more prominent in fine-grained local regions, and the structural morphology of small ground objects deviates obviously from the ground truth. In contrast, FDM-Net generates classification maps with significantly higher spatial consistency: it effectively suppresses random noise, retains the complete structure of ground objects, and renders smoother and more accurate category boundaries. Its overall visual effect is highly consistent with the ground truth map, which matches the quantitative evaluation conclusions.
(2) Results on QHUQ Dataset: As shown in Table 2, FDM-Net achieves the best OA (95.07%) and Kappa (93.47%) on the QHUQ dataset, with a competitive AA of 88.57%. Compared with CacfNet, it yields a 0.73% OA improvement and a 0.97% Kappa gain. Even for challenging categories with limited training samples and severe spectral confusion (e.g., Class 3), FDM-Net maintains competitive accuracy, verifying its robust classification capability and balanced recognition performance across all land-cover classes. These results demonstrate the effectiveness of the proposed Frequency Decomposition Fusion Enhancement (FDE) strategy in extracting discriminative spectral–spatial representations through explicit Frequency Decomposition and complementary integration of low-frequency and high-frequency components. At the class-wise level, FDM-Net achieves optimal accuracy on three of the six categories (Class 1, Class 2, and Class 6), attaining 96.16%, 97.16%, and 94.44% respectively, which demonstrates the effectiveness of the proposed FDE strategy in extracting discriminative representations for spectrally homogeneous classes.
Figure 4 presents the classification maps of all methods. Most methods produce obvious scattered misclassifications in homogeneous regions, with blurred object boundaries and degraded spatial consistency; LSSAN and SpectralFormer suffer from more misclassified pixels in fine-grained local areas. In contrast, FDM-Net generates classification maps closest to the ground truth: it effectively suppresses isolated noise, preserves the structural integrity of ground objects, and outputs clearer category boundaries. These visual findings align with the quantitative results, which benefit from the collaborative modeling of low-frequency semantic information and high-frequency structural details, achieving both global consistency and local discriminability. The superior preservation of fine-grained spatial structures and sharp boundaries further validates the effectiveness of the MLFA module in capturing multi-level spatial details within the high-frequency branch.
(3) Results on QHUT Dataset: The QHUT dataset poses greater classification challenges due to its abundant land-cover categories and serious spectral overlap between similar ground objects. As recorded in Table 3, FDM-Net ranks first on OA (97.58%), AA (93.86%) and Kappa (97.25%). Relative to CacfNet, our method gains 0.76% OA and 0.87% Kappa improvements. Many existing algorithms suffer from unstable per-class performance here—for example, SpectralFormer delivers an extremely low AA of 76.72% with a large deviation. In contrast, our frequency-decoupled framework achieves balanced, stable classification across all categories, demonstrating strong robustness against complex spectral interference. Notably, competing methods collapse on the most challenging categories where training samples are extremely limited. For instance, SpectralFormer drops to 0.08% and 10.35% on Class 12 and Class 14, as its Transformer-based architecture suffers from insufficient data for learning discriminative token representations. In contrast, FDM-Net still retains 72.44% and 79.70% on these same categories. Equally telling is the stability gap: competing methods show deviations up to 36.90%, while FDM-Net delivers consistent performance across all categories.
As displayed in Figure 5, fragmented land parcels and numerous linear features such as roads lead to severe structural distortion and widespread misclassification noise for most compared models, and several methods even generate large-scale wrong predictions for spectrally similar land covers. By separately modeling low-frequency global context and high-frequency details, FDM-Net effectively suppresses intra-region noise, maintains the morphological continuity of linear terrain features, and reconstructs precise, smooth classification boundaries, thus delivering the most visually faithful prediction against the ground truth. The notable fidelity in reconstructing fine linear structures and intricate land parcel boundaries further underscores the effectiveness of the MLFA module in preserving detailed spatial information through multi-level feature aggregation within the high-frequency branch.
(4) Results on Houston Dataset:
As a typical urban scene with finely distributed diverse ground objects, the Houston dataset demands strong fine-grained feature discrimination capability. As shown in Table 4, FDM-Net ranks first in OA and Kappa (94.79% and 94.39%), and second in AA (94.24%, slightly behind Lite-HCNet at 94.28%). Compared with the runner-up Lite-HCNet, it yields an OA improvement of 0.28% and a Kappa gain of 0.33%. Many compared methods suffer from severe performance degradation in this complex scene—CacfNet, for instance, only achieves an OA of 79.20%. FDM-Net additionally avoids the severe collapses seen in competing methods, while CacfNet and SimPoolFormer fall below 40% on Class 13. For fine-grained urban classes, FDM-Net surpasses competitors by up to 16.91 %, with consistently lower per-class variance, confirming the robustness of the frequency-decoupled design.
The classification maps for visual verification are shown in Figure 6. It is evident that most compared methods suffer from degraded spatial consistency in homogeneous regions, as well as structural fracture and misclassification on narrow linear features such as roads. Some methods even exhibit large-area classification errors on spectrally similar urban objects, which is consistent with their poor quantitative performance. In contrast, FDM-Net produces classification maps that are significantly closer to the ground truth, with markedly clearer boundaries and higher spatial consistency. It effectively preserves the integrity of small urban targets and maintains the morphological continuity of linear features. These visual results confirm the effectiveness of FDM-Net. This advantage stems from the collaborative modeling of high-frequency edge details through the MLFA module and low-frequency global semantics through the FDE strategy, which well accommodates the fine-grained classification demands of complex urban scenarios.
(5) Results on Indian Pines Dataset: The Indian Pines dataset poses severe few-shot classification challenges due to extreme sample imbalance and heavy spectral overlap across various crop types. As summarized in Table 5, our FDM-Net achieves SOTA results with 98.78% OA, 94.55% AA and 98.60% Kappa, surpassing the second-best GSCViT by 1.01% in OA. Compared algorithms suffer from dramatic accuracy degradation on minority crop classes with scarce training samples, whereas our frequency-domain feature mining framework achieves steady high recognition accuracy across all categories, demonstrating strong robustness against imbalanced data distribution. On minority classes, the advantage is pronounced: FDM-Net reaches 96.58% on Class 1 where MSDAN drops to 49.78%, and attains 80.00% on Class 9 where competing methods exhibit deviations exceeding 43%, confirming the robustness of the frequency-decoupled design under extreme sample scarcity.
The classification maps of various methods are shown in Figure 7, their classification maps exhibit noticeable misclassified regions within large farmland areas, along with blurred field edges and distorted outlines of tiny cropland parcels. These errors arise because compared methods focus primarily on local pixel relationships and struggle to capture both global context and fine boundary details simultaneously. In contrast, FDM-Net produces classification maps that are significantly closer to the ground truth. Benefiting from the decoupled modeling of low-frequency global contextual information and high-frequency boundary features, FDM-Net retains the complete geometric shape of scattered small farm plots and maintains high spatial consistency across homogeneous regions. These visual results confirm that FDM-Net effectively accommodates the fine-grained classification demands of complex agricultural landscapes.

4.4. Visual Radar Chart Analysis

As shown in Figure 8a, FDM-Net achieves the optimal OA across all five datasets, obtaining 97.58% (QHUP), 95.07% (QHUQ), 97.58% (QHUT), 94.79% (Houston), and 98.78% (IP). It outperforms the best method on each dataset by 0.54%, 0.57%, 0.76%, 0.28%, and 1.01%, respectively, demonstrating outstanding overall classification generality under diverse scene distributions. The AA radar chart in Figure 8b further validates the balanced class-level performance of FDM-Net. Our method achieves leading AA values on QHUP (92.35%) and QHUT (93.86%), along with competitive AA on QHUQ (88.57%), Houston (94.24%), and IP (94.55%). It surpasses Lite-HCNet by up to 2.57%, showing superior capability in handling hard and minority classes. Consistent performance gains are also observed in the Kappa metric in Figure 8c. FDM-Net achieves the highest Kappa scores on all datasets (96.39%, 93.47%, 97.25%, 94.39%, 98.60%), with consistent improvements over Lite-HCNet. Its fuller and more balanced radar coverage demonstrates stronger cross-dataset generalization. Collectively, the consistent OA, AA and Kappa superiority verifies that the collaborative design of FDE for frequency-aware decomposition and MLFA for multi-level spatial aggregation effectively enhances spectral–spatial feature discrimination and overall classification robustness.

4.5. Sensitivity Analysis

A sensitivity analysis evaluated the impact of multi-scale fusion weights ( w 0 , w 1 , w 2 for fine to coarse scales, summing to 1) on classification accuracy, as reported in Table 6. Results show that fine-scale information dominates performance: the optimal configuration R3 ( w 0 = 0.50 , w 1 = 0.30 , w 2 = 0.20 ) achieved the highest OA of 94.12%, confirming that a descending weight distribution ( w 0 > w 1 > w 2 ) yields the most discriminative representation. Overemphasizing fine details R1 ( w 0 = 0.70 ) reduced OA to 91.42% due to noise amplification, while moderate coarse-scale emphasis (R7, w 0 = 0.20 , w 1 = 0.30 , w 2 = 0.50 ) gave the second-best OA of 93.68%, but further increasing w 2 to 0.60 in R8 lowered it to 92.91%. The uniform allocation R5 ( w 0 = 0.33 , w 1 = 0.33 , w 2 = 0.34 ) performed poorly (84.23%), about 9.9% below the optimum, indicating asymmetric contributions and feature dilution. Excluding R5, the other seven configurations showed OA within a narrow 91.42–94.12% range (2.70% spread), demonstrating robustness to weight variations across a broad operational range.

4.6. Ablation Study

4.6.1. Effectiveness of FDE and MLFA

The proposed FDM-Net contains two core modules: the Frequency Decomposition Enhancement (FDE) module and the Multi-Level Feature Aggregation (MLFA) module. To quantitatively verify the individual effectiveness of the two designs, we conduct ablation experiments by removing each module separately while keeping other network settings unchanged. Experimental results across five datasets consistently validate that both FDE and MLFA positively boost classification performance and model stability. Specifically, the FDE module addresses the frequency-specific bias problem in hybrid frameworks by explicitly decoupling input features into low-frequency global semantic information and high-frequency local detail features, thereby eliminating feature interference and enabling discriminative spectral–spatial representation learning. Meanwhile, the MLFA module tackles the insufficient exploitation of multi-level feature interactions by adaptively aggregating multi-level spatial details within the high-frequency branch, effectively preserving fine-grained structures that are critical for distinguishing spectrally similar and sample-scarce categories. Moreover, the two modules are mutually reinforcing: FDE supplies MLFA with spectrally purified high-frequency features via frequency decoupling, while MLFA preserves fine-grained spatial structures that complement the low-frequency global semantics, together yielding consistent gains over each module in isolation.
Taking the QHUP dataset as an example, as shown in Table 7, removing MLFA reduces OA, AA, and Kappa to 96.52%, 91.40%, and 95.41% (drops of 1.06%, 0.95%, and 0.98%), while removing FDE yields 96.49%, 91.29%, and 95.20% (drops of 1.09%, 1.06%, and 1.19%). Similar trends are observed on QHUQ and QHUT, where both variants consistently underperform the full model in OA and Kappa, confirming the effectiveness of MLFA and FDE in improving discriminative feature learning. On Houston and Indian Pines, the full model also achieves the best OA, with clear margins over both ablated variants, highlighting their importance for complex and imbalanced scenes.

4.6.2. Ablation Study on the Gate Path in MLFA

The MLFA module adopts a dual-path design comprising a Gate Path and a Value Path. To verify the effectiveness of this gating mechanism, we construct a variant that removes the Gate Path entirely while retaining the Value Path and the FDE module. Table 8 reports the comparison across all five datasets.
Removing the Gate Path leads to consistent performance degradation across all five datasets. On IP, OA drops sharply from 98.78% to 93.64% (−5.14%); on Houston and QHUT, the declines are 1.82% and 1.37%; on QHUP, OA falls by 0.90% with AA decreasing by 10.19%. Even on QHUQ (6 classes), the full model achieves slightly higher OA (95.07% vs. 95.06%). These results conclusively demonstrate that the Gate Path, despite its simple form, proves essential for adaptively modulating multi-scale spatial features.
Notably, its contribution is more pronounced on datasets with higher intra-class variability and more categories (e.g., IP with 16 classes, Houston with 15 classes), consistent with the expectation that gating-based feature selection becomes increasingly critical as feature space complexity grows.

4.6.3. Superiority of Mamba over Alternative Architectures

The low-frequency branch of FDM-Net employs a Mamba-based state space model for long-range dependency modeling. To justify this design choice, we replace the Mamba module with a Transformer Encoder of comparable parameter count while keeping all other components (FDE, MLFA with Gate Path) unchanged. Table 9 reports the comparison.
Across all five datasets, the Mamba-based branch consistently outperforms the Transformer-based alternative. On QHUT and IP, Mamba achieves OA improvements of 1.67% and 2.54%, respectively; on QHUP, the AA gap reaches 13.86%, demonstrating that Mamba’s state-space formulation is more effective than self-attention at capturing long-range spectral–spatial dependencies in hyperspectral data. This advantage stems from Mamba’s linear complexity and selective scan mechanism, which efficiently models global context without the quadratic overhead of Transformer self-attention, making it particularly suitable for the low-frequency branch where global semantic reasoning is required.

4.6.4. t-SNE Visualization

For qualitative analysis, t-SNE visualization is conducted on the Houston dataset (Figure 9) to compare the full FDM-Net, the FDE-only branch, and the MLFA-only branch. The FDE-only variant, which relies primarily on frequency-decomposed global context without multi-level spatial aggregation, exhibits noticeable inter-class overlap, particularly among spectrally similar categories. The MLFA-only variant improves local compactness through multi-level spatial feature aggregation but still suffers from scattered intra-class distributions due to the absence of explicit Frequency Decomposition. In contrast, the full FDM-Net produces the most compact intra-class clusters and the clearest inter-class separation, demonstrating that the FDE strategy and the MLFA module are complementary and jointly enhance feature discriminability.
Overall, both quantitative ablation results and qualitative t-SNE visualizations demonstrate that the Gate Path, Mamba branch, FDE, and MLFA modules are indispensable and mutually complementary. The cooperative integration of explicit Frequency Decomposition, gated multi-level spatial aggregation, and Mamba-based global context modeling enables FDM-Net to fully exploit spectral–spatial cues, thereby achieving superior and stable classification performance in complex hyperspectral scenarios.

4.7. Analysis of Model Complexity and Inference Efficiency

Experiments on the Houston dataset use an 11 × 11 input patch size, batch size 256, and PCA-reduced spectral dimension from 144 to 16. All models are evaluated under identical settings in terms of parameters, FLOPs, and inference time (Table 10).
MSDAN exhibits the highest complexity (12.75 MB, 442.135 M FLOPs, 43.611 ms) due to its multi-scale convolutional branches. SimPoolFormer also incurs relatively high cost (5.45 MB, 55.967 M FLOPs) owing to its Transformer-based architecture. In contrast, Lite-HCNet, CacfNet, SpectralFormer, and SSFTT are extremely lightweight (≤0.44 MB, ≤2.04 M FLOPs), with SSFTT achieving the fastest inference (2.386 ms) thanks to its efficient tokenization and compact Transformer design. GSCViT maintains moderate complexity (0.50 MB, 4.625 M FLOPs) with competitive inference speed (4.098 ms).
Our FDM-Net achieves the best overall classification performance while maintaining low model complexity (0.19 MB, 2.302 M FLOPs), using only 1.49% of MSDAN and 3.49% of SimPoolFormer parameters. Although its inference time (15.322 ms) is higher than some extremely lightweight models due to multi-branch frequency-domain fusion, it remains 64.9% faster than MSDAN. Overall, FDM-Net strikes a favorable balance between state-of-the-art accuracy and acceptable computational cost by combining frequency-domain enhancement with multi-level spatial aggregation, making it suitable for resource-constrained hyperspectral applications.

5. Discussion

Several conclusions can be drawn regarding the role of the Frequency Decomposition Fusion Enhancement (FDE) strategy and the Multi-Level Feature Aggregation Module (MLFA). First, the classification results of these experiments on multiple public HSI benchmarks demonstrate that FDM-Net can effectively separate and process low-frequency global semantics and high-frequency spatial details through the proposed frequency-aware framework, leading to superior classification performance. Furthermore, these experiments reveal that conventional hybrid CNN–Mamba methods suffer from the frequency-specific feature preference mismatch. This can be verified by the fact that feeding homogeneous features into both branches results in significant feature interference and redundant representations, whereas FDM-Net explicitly routes frequency-decomposed components to their most suitable modeling branch, thereby resolving this fundamental limitation. Notably, FDE’s contribution varies with dataset characteristics: 0.97% and 0.92% on Houston and IP (spectrally driven) versus 1.09% on QHUP. This is because on spectrally dominated scenes, FDE mainly suppresses high-frequency noise, while on QHUP, where rich spatial structures coexist with spectral cues, both branches benefit more evenly, yielding the largest combined gain.
What is more, the MLFA module is introduced into the high-frequency branch to capture multi-level frequency interactions. Through depthwise and dilated convolutions followed by feature concatenation and nonlinear fusion, the MLFA module enables effective channel interaction and contextual modeling across multiple receptive field scales. This design addresses the limitation of CNNs that are inherently biased toward single-scale spatial interactions, allowing FDM-Net to exploit complex multi-level information components that would otherwise be underutilized. The contribution of MLFA also varies across datasets. The OA drop is largest on QHUQ (1.04%) and QHUT (0.52%), whose dense urban structures and fine-grained textures, respectively, benefit from spatial detail preservation. On Houston and IP, the drop is smaller (0.88% and 0.83%), likely because these datasets rely more on spectral cues than on fine spatial structures. The ablation studies further confirm that both the FDE strategy and the MLFA module contribute substantially to the overall performance, validating that the holistic frequency-aware design—rather than any single module in isolation—distinguishes FDM-Net from existing approaches. Nevertheless, FDM-Net exhibits limitations tied to its decomposition strategy. On QHUT Class 12 and Class 14, it trails GSCViT by 8.80% and 0.06%, and on Houston Class 13, it lags SSFTT by 22.79%. These cases suggest that Gaussian filtering may fragment discriminative features spanning multiple frequency bands, pointing toward learned, class-adaptive decomposition as a future direction.
Although the proposed Frequency Decomposition framework achieves significant improvements on the evaluated benchmarks, it is worth noting that the current Gaussian filtering-based decomposition introduces additional hyperparameters, such as the kernel size and the number of filtering levels, which may require task-specific tuning. Moreover, the multi-branch design increases model complexity, and the isotropic Gaussian kernel may not capture anisotropic frequency patterns in complex scenes. Furthermore, the GAP-based predictor in FDE computes channel-wise weights via global average pooling, which may become unstable for minority classes as the pooled statistics are biased toward dominant classes; class-balanced pooling could mitigate this issue. Furthermore, the multi-level Gaussian filtering is achieved through depthwise separable convolution, which can be directly computed in parallel on the GPU and does not introduce additional learnable parameters. Although increasing the decomposition levels will bring certain computational load and inference delay, the overall increase in cost is relatively limited. Finally, the actual range of the fixed-scale Gaussian kernel varies in different spatial resolution images, so its cross-resolution applicability still needs to be further verified. In the future, the filtering scale can be adaptively adjusted according to the ground sampling distance of the image to improve the model’s adaptability to different resolution data.
Future work could explore learnable, class-adaptive Frequency Decomposition to reduce feature fragmentation, lightweight filtering substitutes and more compact branch designs to lower model complexity, and GSD-aware decomposition for multi-resolution generalization. Additionally, while this work focuses on the integration of Mamba and CNNs under the frequency-aware paradigm, the proposed FDE strategy is potentially applicable to other hybrid architectures. The work in this paper provides certain reference values for subsequent research into frequency-aware feature learning and multi-level aggregation in hyperspectral image classification.

6. Conclusions

In this article, a novel Multi-Level Feature Aggregation Network based on Frequency Decomposition is proposed for hyperspectral image classification. Considering the homogeneous feature preferences across branches and insufficient multi-level information interaction modeling in existing HSI methods, the proposed FDM-Net uses a Frequency Decomposition Fusion Enhancement (FDE) strategy to decompose information into high and low frequencies and then sends this information to the corresponding high- and low-frequency-sensitive branches and a Multi-Level Feature Aggregation Module (MLFA) that effectively addresses the constraints of CNNs in capturing deep multi-level interactions. Extensive experiments conducted on five public HSI datasets demonstrate that FDM-Net achieves state-of-the-art performance, validating its effectiveness and superiority over existing counterparts.
This work advances HSI classification by establishing a frequency-aware feature learning paradigm that resolves branch-wise feature preference mismatches and captures high-order spatial interactions. The proposed components are adaptable to other remote sensing tasks such as semantic segmentation and object detection, with practical value in precision agriculture, mineral exploration, and environmental monitoring. Future work includes extending FDM-Net to multi-source data fusion, developing lightweight variants for real-time deployment, and exploring semi-supervised learning to mitigate label scarcity.

Author Contributions

Conceptualization, Y.S.; methodology, Y.S.; validation, Y.S.; formal analysis, Y.S.; investigation, Y.S.; data curation, Y.S.; writing—original draft preparation, Y.S.; writing—review and editing, X.S. and Y.S.; visualization, Y.S.; supervision, X.S.; project administration, X.S.; funding acquisition, X.S. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the China Scholarship Council Fund of China [grant number 202403210006].

Data Availability Statement

The datasets analyzed during the current study are publicly available open benchmarks. The QHUP, QHUQ, and QHUT datasets can be downloaded at https://github.com/RsAI-lab/QUH-classification-dataset (accessed on 21 March 2025). The Houston dataset is available from the University of Houston Hyperspectral Remote Sensing Laboratory via https://www.grss-ieee.org/community/technical-committees/data-fusion/2013-ieee-grss-data-fusion-contest/ (accessed on 14 February 2025). The Indian Pines dataset is provided by the Purdue AVIRIS archive at https://engineering.purdue.edu/~biehl/MultiSpec/hyperspectral.html (accessed on 12 February 2025).

Acknowledgments

During the preparation of this manuscript, the authors used ChatGPT (GPT-5.5, OpenAI) for language refinement, sentence structure optimization, and reference formatting assistance. All AI-assisted content was carefully reviewed, revised, and verified by the authors. The authors take full responsibility for all interpretations, conclusions, and the final content of this manuscript. The authors would also like to thank the researchers and developers who generously provided publicly available codes associated with the experiments.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zhuang, L.; Ng, M.K.; Gao, L.; Wang, Z. Eigen-CNN: Eigenimages Plus Eigennoise Level Maps Guided Network for Hyperspectral Image Denoising. IEEE Trans. Geosci. Remote Sens. 2024, 62, 5512018. [Google Scholar] [CrossRef]
  2. Wang, D.; Zhuang, L.; Gao, L.; Sun, X.; Zhao, X. Global Feature-Injected Blind-Spot Network for Hyperspectral Anomaly Detection. IEEE Geosci. Remote Sens. Lett. 2024, 21, 5509305. [Google Scholar] [CrossRef]
  3. Chen, Y.; Jiang, H.; Li, C.; Jia, X.; Ghamisi, P. Deep Feature Extraction and Classification of Hyperspectral Images Based on Convolutional Neural Networks. IEEE Trans. Geosci. Remote Sens. 2016, 54, 6232–6251. [Google Scholar] [CrossRef]
  4. Paoletti, M.E.; Haut, J.M.; Fernandez-Beltran, R.; Plaza, J.; Plaza, A.J.; Pla, F. Deep Pyramidal Residual Networks for Spectral–Spatial Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2019, 57, 740–754. [Google Scholar] [CrossRef]
  5. Wang, D.; Ren, L.; Sun, X.; Gao, L.; Chanussot, J. Nonlocal and Local Feature-Coupled Self-Supervised Network for Hyperspectral Anomaly Detection. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2025, 18, 6981–6993. [Google Scholar] [CrossRef]
  6. Hong, D.; Han, Z.; Yao, J.; Gao, L.; Zhang, B.; Plaza, A.; Chanussot, J. SpectralFormer: Rethinking Hyperspectral Image Classification with Transformers. IEEE Trans. Geosci. Remote Sens. 2022, 60, 5518615. [Google Scholar] [CrossRef]
  7. Sun, L.; Zhao, G.; Zheng, Y.; Wu, Z. Spectral–spatial feature tokenization transformer for hyperspectral image classification. IEEE Trans. Geosci. Remote Sens. 2022, 60, 5522214. [Google Scholar] [CrossRef]
  8. Gu, A.; Dao, T. Mamba: Linear-Time Sequence Modeling with Selective State Spaces. arXiv 2024, arXiv:2312.00752. [Google Scholar]
  9. Zhu, L.; Liao, B.; Zhang, Q.; Wang, X.; Liu, W.; Wang, X. Vision Mamba: Efficient Visual Representation Learning with Bidirectional State Space Model. arXiv 2024, arXiv:2401.09417. [Google Scholar]
  10. Ma, X.; Ni, Z.; Chen, X. TinyViM: Frequency Decoupling for Tiny Hybrid Vision Mamba. arXiv 2024, arXiv:2411.17473. [Google Scholar] [CrossRef]
  11. Qiao, X.; Huang, W. A Dual Frequency Transformer Network for Hyperspectral Image Classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2023, 16, 10344–10358. [Google Scholar] [CrossRef]
  12. Ahmad, M.; Ghous, U.; Usama, M.; Mazzara, M. WaveFormer: Spectral–Spatial Wavelet Transformer for Hyperspectral Image Classification. IEEE Geosci. Remote Sens. Lett. 2024, 21, 5502405. [Google Scholar] [CrossRef]
  13. Qin, X.; Wang, Z.; Bai, Y.; Xie, X.; Jia, H. FFA-Net: Feature Fusion Attention Network for Single Image Dehazing. arXiv 2019, arXiv:cs.CV/1911.07559. [Google Scholar]
  14. Fu, H.; Sun, G.; Zhang, L.; Zhang, A.; Ren, J.; Jia, X.; Li, F. Three-dimensional singular spectrum analysis for precise land cover classification from UAV-borne hyperspectral benchmark datasets. ISPRS J. Photogramm. Remote Sens. 2023, 203, 115–134. [Google Scholar] [CrossRef]
  15. Liu, D.; Han, G.; Liu, P.; Yang, H.; Chen, D.; Li, Q.; Wu, J.; Wang, Y. A Discriminative Spectral-Spatial-Semantic Feature Network Based on Shuffle and Frequency Attention Mechanisms for Hyperspectral Image Classification. Remote Sens. 2022, 14, 2678. [Google Scholar] [CrossRef]
  16. Fan, S.; Liu, Q.; Li, W.; Bai, H. A frequency and topology interaction network for hyperspectral image classification. Eng. Appl. Artif. Intell. 2024, 133, 108234. [Google Scholar] [CrossRef]
  17. Cheng, C.; Zhang, L.; Li, H.; Dai, L.; Cui, W. A Deep Stochastic Adaptive Fourier Decomposition Network for Hyperspectral Image Classification. IEEE Trans. Image Process. 2024, 33, 1080–1094. [Google Scholar] [CrossRef] [PubMed]
  18. Wan, G.; Liu, D.; Liu, Y.; Yang, T.; Guo, Y. SSFNet: Spatial–Spectral Frequency-Aware Network for Hyperspectral Image Classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2026, 19, 15392–15410. [Google Scholar] [CrossRef]
  19. Xi, J.; Ersoy, O.K.; Cong, M.; Zhao, C.; Qu, W.; Wu, T. Wide and Deep Fourier Neural Network for Hyperspectral Remote Sensing Image Classification. Remote Sens. 2022, 14, 2931. [Google Scholar] [CrossRef]
  20. Pan, H.; Yan, H.; Ge, H.; Liu, M.; Shi, C. Transformer-enhanced two-stream complementary convolutional neural network for hyperspectral image classification. J. Frankl. Inst. 2024, 361, 106973. [Google Scholar] [CrossRef]
  21. Liao, J.; Wang, L. HyperspectralMamba: A Novel State Space Model Architecture for Hyperspectral Image Classification. Remote Sens. 2025, 17, 2577. [Google Scholar] [CrossRef]
  22. Zeng, B.; Su, W.; Liu, J.; Guo, Y.; Wei, Y.; Yi, H.; Xie, B.; Hu, Y.; Li, L. BioLiteNet: A Biomimetic Lightweight Hyperspectral Image Classification Model. Remote Sens. 2025, 17, 2833. [Google Scholar] [CrossRef]
  23. Li, Y.; Luo, Y.; Zhang, L.; Wang, Z.; Du, B. MambaHSI: Spatial–Spectral Mamba for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2024, 62, 5524216. [Google Scholar] [CrossRef]
  24. Wang, Y.; Liu, L.; Xiao, J.; Yu, D.; Tao, Y.; Zhang, W. MambaHSI+: Multidirectional State Propagation for Efficient Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2025, 63, 4411414. [Google Scholar] [CrossRef]
  25. Wang, G.; Zhang, X.; Peng, Z.; Zhang, T.; Jiao, L. S2Mamba: A Spatial–Spectral State Space Model for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2025, 63, 5511413. [Google Scholar] [CrossRef]
  26. Yao, J.; Hong, D.; Li, C.; Chanussot, J. SpectralMamba: Efficient Mamba for Hyperspectral Image Classification. arXiv 2024, arXiv:2404.08489. [Google Scholar]
  27. Sheng, J.; Zhou, J.; Wang, J.; Ye, P.; Fan, J. DualMamba: A Lightweight Spectral-Spatial Mamba-Convolution Network for Hyperspectral Image Classification. arXiv 2024, arXiv:2406.07050. [Google Scholar]
  28. Wang, Q.; Fan, X.; Huang, J.; Li, S.; Shen, T. Spectral–Spatial Feature Extraction Network with SSM–CNN for Hyperspectral–Multispectral Image Collaborative Classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2024, 17, 17555–17566. [Google Scholar] [CrossRef]
  29. Debes, C.; Merentitis, A.; Heremans, R.; Hahn, J.; Frangiadakis, N.; van Kasteren, T.; Liao, W.; Bellens, R.; Pizurica, A.; Gautama, S.; et al. Hyperspectral and LiDAR Data Fusion: Outcome of the 2013 GRSS Data Fusion Contest. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2014, 7, 2405–2418. [Google Scholar] [CrossRef]
  30. Baumgardner, M.F.; Biehl, L.L.; Landgrebe, D.A. 220 Band AVIRIS Hyperspectral Image Data Set: June 12, 1992 Indian Pine Test Site 3. 2015. Purdue University Research Repository. 2015. Available online: https://engineering.purdue.edu/~biehl/MultiSpec/hyperspectral.html (accessed on 12 February 2025).
  31. Jia, S.; Lin, Z.; Xu, M.; Huang, Q.; Zhou, J.; Jia, X.; Li, Q. A Lightweight Convolutional Neural Network for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2021, 59, 4150–4163. [Google Scholar] [CrossRef]
  32. Cui, Y.; Xia, J.; Wang, Z.; Gao, S.; Wang, L. Lightweight Spectral–Spatial Attention Network for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2022, 60, 5510114. [Google Scholar] [CrossRef]
  33. Wang, X.; Fan, Y. Multiscale Densely Connected Attention Network for Hyperspectral Image Classification. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 2022, 15, 1617–1628. [Google Scholar] [CrossRef]
  34. Roy, S.K.; Jamali, A.; Chanussot, J.; Ghamisi, P.; Ghaderpour, E.; Shahabi, H. SimPoolFormer: A two-stream vision transformer for hyperspectral image classification. Remote Sens. Appl. Soc. Environ. 2025, 37, 101478. [Google Scholar] [CrossRef]
  35. Cheng, S.; Chan, R.; Du, A. CACFTNet: A Hybrid Cov-Attention and Cross-Layer Fusion Transformer Network for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote Sens. 2024, 62, 1–17. [Google Scholar] [CrossRef]
  36. Zhao, Z.; Xu, X.; Li, S.; Plaza, A. Hyperspectral Image Classification Using Groupwise Separable Convolutional Vision Transformer Network. IEEE Trans. Geosci. Remote Sens. 2024, 62, 5511817. [Google Scholar] [CrossRef]
Figure 1. Framework of the proposed FDM-Net.
Figure 1. Framework of the proposed FDM-Net.
Remotesensing 18 02603 g001
Figure 2. Framework of the proposed MLFA.
Figure 2. Framework of the proposed MLFA.
Remotesensing 18 02603 g002
Figure 3. Classification maps on the QHUP dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Figure 3. Classification maps on the QHUP dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Remotesensing 18 02603 g003
Figure 4. Classification maps on the QHUQ dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Figure 4. Classification maps on the QHUQ dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Remotesensing 18 02603 g004
Figure 5. Classification maps on the QHUT dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Figure 5. Classification maps on the QHUT dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Remotesensing 18 02603 g005
Figure 6. Classification maps on the Houston dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Figure 6. Classification maps on the Houston dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Remotesensing 18 02603 g006
Figure 7. Classification maps on the IP dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Figure 7. Classification maps on the IP dataset. (a) Ground truth; (b) Lite-HCNet; (c) LSSAN; (d) MSDAN; (e) SimPoolFormer; (f) CacfNet; (g) SpectralFormer; (h) GSCViT; (i) SSFTT; (j) FDM-Net (ours).
Remotesensing 18 02603 g007
Figure 8. Radar map comparison of different methods across five datasets.
Figure 8. Radar map comparison of different methods across five datasets.
Remotesensing 18 02603 g008
Figure 9. t-SN E visualization of feature distributions obtained by different ablation architectures on the Houston dataset. (a) Full FDM-Net; (b) FDE-only branch; (c) MLFA-only branch.
Figure 9. t-SN E visualization of feature distributions obtained by different ablation architectures on the Houston dataset. (a) Full FDM-Net; (b) FDE-only branch; (c) MLFA-only branch.
Remotesensing 18 02603 g009
Table 1. Class-wise classification accuracies (%) on the QHUP dataset. The best results are shown in bold.
Table 1. Class-wise classification accuracies (%) on the QHUP dataset. The best results are shown in bold.
ClassLite-HCNetLSSANSimPoolFormerCacfNetMSDANSpectralFormerGSCViTSSFTTOur Method
Class 183.86 ± 3.6590.51 ± 3.1779.16 ± 5.3185.68 ± 5.5588.97 ± 2.4783.84 ± 1.5583.20 ± 7.0984.26 ± 3.2491.50 ± 4.08
Class 299.06 ± 0.2698.78 ± 0.4098.98 ± 0.4099.08 ± 0.3498.60 ± 0.3699.01 ± 0.1299.30 ± 0.3998.53 ± 0.1098.88 ± 0.46
Class 396.10 ± 2.4592.75 ± 3.1585.79 ± 16.5882.37 ± 14.5392.09 ± 1.6694.34 ± 2.2692.27 ± 3.8589.38 ± 2.5094.23 ± 4.86
Class 496.42 ± 1.1793.56 ± 1.0394.10 ± 3.1492.63 ± 1.4694.50 ± 1.6990.23 ± 1.3191.09 ± 3.2285.94 ± 2.0696.93 ± 0.50
Class 587.58 ± 3.1778.10 ± 3.8588.32 ± 2.6476.85 ± 7.2986.51 ± 4.3884.75 ± 1.5578.85 ± 0.4567.71 ± 5.9385.49 ± 7.85
Class 696.11 ± 1.3689.03 ± 7.7790.63 ± 11.0595.15 ± 1.9494.18 ± 1.6089.27 ± 1.5891.78 ± 0.5090.54 ± 2.7495.10 ± 3.39
Class 789.96 ± 6.2991.57 ± 3.0190.29 ± 3.4286.20 ± 6.0490.07 ± 3.0989.47 ± 2.6392.36 ± 4.7283.33 ± 2.1790.87 ± 3.48
Class 896.14 ± 1.4495.26 ± 0.9792.86 ± 7.0592.46 ± 1.6295.36 ± 2.2592.05 ± 1.1694.14 ± 1.0085.01 ± 1.2096.99 ± 0.46
Class 975.68 ± 8.7159.98 ± 11.6963.26 ± 16.1357.02 ± 19.1068.63 ± 6.8753.99 ± 7.7776.03 ± 2.0252.35 ± 6.3775.12 ± 12.07
Class 1097.41 ± 0.7397.46 ± 0.3898.19 ± 1.6697.17 ± 1.3897.81 ± 0.3497.92 ± 0.1596.70 ± 0.0094.61 ± 0.7098.43 ± 0.51
OA (%)97.04 ± 0.1196.54 ± 0.1996.36 ± 0.5096.03 ± 0.4396.80 ± 0.1896.05 ± 0.0796.18 ± 0.1393.76 ± 0.0697.58 ± 0.07
AA (%)91.83 ± 0.9588.70 ± 0.9088.16 ± 2.1486.46 ± 2.5190.67 ± 1.3987.49 ± 0.8488.49 ± 1.4583.17 ± 0.1992.35 ± 0.75
Kappa (%)95.59 ± 0.1694.85 ± 0.2894.55 ± 0.7494.06 ± 0.6495.23 ± 0.2894.10 ± 0.1194.30 ± 0.2190.71 ± 0.0796.39 ± 0.11
Table 2. Class-wise classification accuracies (%) on the QHUQ dataset. The best results are shown in bold.
Table 2. Class-wise classification accuracies (%) on the QHUQ dataset. The best results are shown in bold.
ClassLite-HCNetLSSANMSDANSimPoolFormerCacfNetSpectralFormerGSCViTSSFTTOur Method
Class 196.02 ± 0.3095.42 ± 0.4494.10 ± 1.2295.50 ± 0.7293.17 ± 0.9194.79 ± 0.3395.54 ± 1.4495.89 ± 0.6396.16 ± 0.50
Class 295.03 ± 1.4196.06 ± 0.2693.88 ± 2.3395.46 ± 1.4695.61 ± 2.2693.02 ± 1.3695.04 ± 1.5795.08 ± 0.9897.16 ± 0.60
Class 351.81 ± 5.4849.65 ± 2.6750.64 ± 17.6853.43 ± 5.5053.87 ± 11.3336.92 ± 3.6555.59 ± 5.5156.42 ± 5.7751.10 ± 9.97
Class 497.99 ± 0.3898.08 ± 0.1797.60 ± 1.7797.66 ± 0.1298.06 ± 0.9897.97 ± 0.1297.74 ± 1.3898.86 ± 0.6797.14 ± 0.44
Class 594.89 ± 0.6895.78 ± 0.4295.51 ± 1.3695.35 ± 0.6295.99 ± 1.0294.99 ± 0.3395.94 ± 0.6095.80 ± 0.2695.40 ± 0.65
Class 693.55 ± 0.8292.64 ± 1.0593.89 ± 0.9193.50 ± 0.6292.57 ± 2.3292.02 ± 0.7593.35 ± 1.6493.35 ± 0.7194.44 ± 0.76
OA (%)94.30 ± 0.1094.24 ± 0.1593.59 ± 0.2193.73 ± 0.6194.34 ± 0.1692.95 ± 0.1494.40 ± 0.1494.50 ± 0.0995.07 ± 0.08
AA (%)88.22 ± 0.8887.94 ± 0.4388.21 ± 1.8487.60 ± 3.3388.48 ± 0.7684.95 ± 0.5988.87 ± 0.8789.23± 0.9588.57 ± 1.54
Kappa (%)92.43 ± 0.1392.37 ± 0.2091.52 ± 0.2891.69 ± 0.8292.50 ± 0.2190.65 ± 0.1992.58 ± 0.1892.71 ± 0.1193.47 ± 0.10
Table 3. Class-wise classification accuracies (%) on the QHUT dataset. The best results are shown in bold.
Table 3. Class-wise classification accuracies (%) on the QHUT dataset. The best results are shown in bold.
ClassLite-HCNetLSSANMSDANSimPoolFormerCacfNetSpectralFormerGSCViTSSFTTOur Method
Class 198.97 ± 0.3399.12 ± 0.3898.94 ± 0.5999.66 ± 0.3498.86 ± 0.6199.45 ± 0.3499.37 ± 0.7399.78 ± 0.0799.84 ± 0.11
Class 299.06 ± 0.3696.12 ± 1.7897.29 ± 2.0898.31 ± 1.0998.19 ± 0.7798.21 ± 0.9099.07 ± 0.2198.35 ± 0.5099.46 ± 0.22
Class 393.53 ± 3.5194.13 ± 3.2994.24 ± 4.3790.86 ± 7.6594.99 ± 2.7096.03 ± 1.6796.94 ± 0.4593.59 ± 2.2395.83 ± 1.16
Class 498.89 ± 0.7198.87 ± 0.5298.80 ± 0.3598.91 ± 1.0599.28 ± 0.1899.20 ± 0.3798.92 ± 0.4999.40 ± 0.2399.71 ± 0.22
Class 592.90 ± 2.3780.16 ± 8.4784.38 ± 9.2590.90 ± 6.4985.07 ± 8.5723.08 ± 22.8083.71 ± 9.0288.89 ± 4.6792.11 ± 9.27
Class 691.80 ± 3.8686.81 ± 3.6390.10 ± 4.5089.07 ± 6.4695.50 ± 2.5585.70 ± 3.0889.11 ± 1.1491.60 ± 2.3493.46 ± 1.19
Class 781.97 ± 5.4672.99 ± 4.1077.75 ± 4.7282.04 ± 3.0785.40 ± 3.1563.32 ± 13.1081.74 ± 1.8079.12 ± 4.3585.64 ± 3.11
Class 899.81 ± 0.0899.63 ± 0.4298.96 ± 1.0999.71 ± 0.2199.86 ± 0.0899.64 ± 0.0699.67 ± 0.1799.70 ± 0.1499.80 ± 0.14
Class 997.96 ± 1.2298.96 ± 0.3698.89 ± 1.0698.66 ± 1.2899.34 ± 0.6598.03 ± 1.6299.02 ± 1.3499.21 ± 0.3699.54 ± 0.33
Class 1082.59 ± 33.8091.02 ± 5.1481.06 ± 16.2791.95 ± 5.5295.61 ± 2.9965.85 ± 36.9094.63 ± 3.9790.89 ± 3.7096.65 ± 2.16
Class 1188.47 ± 3.1985.65 ± 3.9379.31 ± 5.1275.33 ± 8.1794.97 ± 2.1780.22 ± 6.8091.71 ± 3.9588.41 ± 3.8394.07 ± 1.84
Class 1281.67 ± 15.8860.54 ± 22.3056.92 ± 34.4771.85 ± 16.6242.37 ± 35.970.08 ± 0.1881.24 ± 4.9178.71 ± 5.6972.44 ± 22.47
Class 1398.68 ± 0.2896.09 ± 2.6289.45 ± 16.2383.43 ± 30.2294.88 ± 2.7694.26 ± 5.2999.40 ± 1.0897.18 ± 1.3299.53 ± 0.43
Class 1486.57 ± 6.1460.69 ± 13.3278.93 ± 17.0443.92 ± 40.8180.02 ± 12.6010.35 ± 12.5379.76 ± 16.2477.45 ± 12.9579.70 ± 14.49
Class 1589.00 ± 3.2183.90 ± 2.5790.09 ± 2.6984.35 ± 3.3792.15 ± 1.3286.63 ± 3.7584.51 ± 2.3785.50 ± 2.1792.36 ± 2.21
Class 1695.47 ± 1.3094.83 ± 0.9595.31 ± 1.8495.10 ± 1.2595.50 ± 1.3993.35 ± 1.4496.07 ± 1.2396.39 ± 0.8997.88 ± 0.73
Class 1788.73 ± 6.1286.66 ± 2.4888.97 ± 3.8488.97 ± 1.6393.16 ± 3.0187.64 ± 4.6684.73 ± 5.9089.38 ± 1.5991.63 ± 1.74
Class 1899.64 ± 0.1899.68 ± 0.3398.97 ± 0.8299.68 ± 0.2799.88 ± 0.0999.87 ± 0.0999.92 ± 0.0999.91 ± 0.0799.85 ± 0.23
OA (%)95.99 ± 0.1094.69 ± 0.1495.07 ± 0.6394.83 ± 0.1196.82 ± 0.2093.78 ± 0.9096.19 ± 0.0996.15 ± 0.0597.58 ± 0.14
AA (%)92.54 ± 2.1188.10 ± 1.1788.80 ± 2.9987.93 ± 3.3491.39 ± 3.1576.72 ± 5.1492.20 ± 2.0191.86 ± 0.7893.86 ± 0.87
Kappa (%)95.44 ± 0.1293.95 ± 0.1694.38 ± 0.7094.10 ± 0.1396.38 ± 0.2292.91 ± 1.0495.78 ± 0.2395.61 ± 0.0697.25 ± 0.16
Table 4. Class-wise classification accuracies (%) on the Houston dataset. The best results are shown in bold.
Table 4. Class-wise classification accuracies (%) on the Houston dataset. The best results are shown in bold.
ClassLite-HCNetLSSANMSDANSimPoolFormerCacfNetSpectralFormerGSCViTSSFTTFDM-Net
Class 197.44 ± 0.5596.54 ± 0.5995.77 ± 0.7496.77 ± 0.6991.66 ± 4.0796.79 ± 0.7293.68 ± 1.4294.67 ± 0.2597.38 ± 0.29
Class 298.13 ± 0.8397.22 ± 1.7396.05 ± 1.4595.51 ± 2.0191.49 ± 4.3596.63 ± 1.0995.87 ± 0.9595.70 ± 0.3298.32 ± 0.62
Class 399.85 ± 0.1098.71 ± 1.44100.00 ± 0.0097.86 ± 1.6593.65 ± 1.9799.27 ± 0.9497.82 ± 0.3396.40 ± 0.2999.84 ± 0.15
Class 497.26 ± 1.2495.57 ± 3.6195.21 ± 3.0397.77 ± 1.4993.31 ± 2.4098.85 ± 1.7096.81 ± 0.8495.54 ± 1.1299.67 ± 0.36
Class 598.95 ± 0.4399.13 ± 0.8699.98 ± 0.0497.72 ± 3.3997.39 ± 0.8299.84 ± 0.1797.77 ± 0.0797.48 ± 0.2499.93 ± 0.07
Class 697.37 ± 3.1587.65 ± 5.3597.05 ± 2.2089.59 ± 3.3448.28 ± 13.7184.58 ± 5.9693.77 ± 2.3294.54 ± 3.8695.77 ± 2.54
Class 791.36 ± 0.6884.83 ± 3.1589.27 ± 1.1489.37 ± 5.5567.00 ± 6.9988.66 ± 3.1190.03 ± 3.0291.47 ± 0.4393.06 ± 3.03
Class 885.09 ± 1.5976.14 ± 8.6689.94 ± 2.5884.48 ± 0.5966.48 ± 4.9780.36 ± 4.1885.90 ± 2.8282.76 ± 1.4488.00 ± 2.99
Class 987.69 ± 0.5873.66 ± 6.6680.69 ± 3.1883.00 ± 2.3671.16 ± 6.3285.17 ± 5.3985.72 ± 2.4884.63 ± 2.0390.57 ± 1.28
Class 1096.33 ± 1.6190.74 ± 1.8993.19 ± 1.8892.20 ± 1.3178.85 ± 4.3596.46 ± 1.4295.42 ± 1.2393.57 ± 0.7696.03 ± 1.05
Class 1198.02 ± 0.9493.75 ± 3.3395.74 ± 2.8193.97 ± 2.1171.07 ± 5.4297.97 ± 1.1693.82 ± 3.2294.57 ± 0.9695.82 ± 1.79
Class 1294.96 ± 1.7989.49 ± 5.7896.21 ± 1.6391.01 ± 5.9874.82 ± 10.4596.01 ± 2.1195.13 ± 1.3291.09 ± 2.0194.52 ± 3.03
Class 1374.20 ± 7.0964.82 ± 4.3681.09 ± 9.0439.30 ± 19.4922.56 ± 13.8744.30 ± 9.5285.34 ± 7.1591.72 ± 1.7768.93 ± 12.14
Class 1497.85 ± 1.1588.45 ± 11.7299.86 ± 0.2193.32 ± 6.8687.88 ± 7.6396.28 ± 6.3697.51 ± 0.2196.06 ± 0.5797.52 ± 2.18
Class 1599.75 ± 0.2899.17 ± 1.4697.16 ± 1.6799.29 ± 1.5992.77 ± 1.6698.86 ± 0.6297.63 ± 0.3896.79 ± 1.2799.20 ± 1.02
OA (%)94.51 ± 0.3589.67 ± 1.0193.56 ± 0.2591.07 ± 0.7779.20 ± 2.7892.48 ± 0.6393.54 ± 0.1393.69 ± 0.2594.79 ± 0.27
AA (%)94.28 ± 0.5689.06 ± 1.3493.80 ± 0.6189.41 ± 1.3776.56 ± 2.3190.67 ± 0.6893.55 ± 0.2493.31 ± 0.3594.24 ± 0.50
Kappa (%)94.06 ± 0.3888.83 ± 1.0993.04 ± 0.2790.34 ± 0.8377.48 ± 3.0191.86 ± 0.6992.98 ± 0.1493.18 ± 0.2794.39 ± 0.27
Table 5. Class-wise classification accuracies (%) on the Indian Pines (IP) dataset. The best results are shown in bold.
Table 5. Class-wise classification accuracies (%) on the Indian Pines (IP) dataset. The best results are shown in bold.
ClassLite-HCNetLSSANMSDANSimPoolFormerCacfNetSpectralFormerGSCViTSSFTTFDM-Net
Class 189.27 ± 12.5171.71 ± 15.4849.78 ± 4.0495.12 ± 4.2391.27 ± 2.1693.66 ± 1.34100.00 ± 0.0099.02 ± 1.3496.58 ± 5.35
Class 293.01 ± 0.9085.54 ± 3.1181.33 ± 4.3584.08 ± 3.6594.99 ± 0.3981.90 ± 4.3496.00 ± 1.9994.18 ± 2.1595.67 ± 1.35
Class 398.18 ± 1.2683.13 ± 3.1092.27 ± 3.3983.96 ± 6.4598.32 ± 1.1688.49 ± 2.4598.79 ± 0.9397.59 ± 0.6399.04 ± 0.67
Class 492.02 ± 7.5974.08 ± 8.8188.18 ± 1.6172.68 ± 12.1899.28 ± 0.4169.76 ± 7.9399.34 ± 0.6398.78 ± 1.7198.22 ± 2.26
Class 596.27 ± 1.4690.07 ± 3.3294.92 ± 3.9092.23 ± 4.7798.74 ± 1.3591.54 ± 1.5196.69 ± 2.2297.01 ± 2.0996.73 ± 0.72
Class 698.20 ± 1.4794.46 ± 2.5298.87 ± 0.7397.32 ± 1.8998.20 ± 0.0698.36 ± 0.7098.17 ± 0.5198.20 ± 0.4698.42 ± 1.01
Class 7100.00 ± 0.0088.80 ± 15.3497.04 ± 6.6283.20 ± 17.75100.00 ± 0.0084.80 ± 7.1698.40 ± 3.58100.00 ± 0.0088.00 ± 12.45
Class 899.11 ± 1.0598.84 ± 1.2599.01 ± 0.9398.14 ± 1.5697.80 ± 1.2399.58 ± 0.45100.00 ± 0.0098.37 ± 3.6499.81 ± 0.42
Class 942.22 ± 43.5066.67 ± 6.8076.84 ± 8.8145.56 ± 47.5390.03 ± 9.9663.33 ± 12.7977.78 ± 17.1271.11 ± 24.3480.00 ± 18.35
Class 1096.89 ± 1.6886.99 ± 2.0392.32 ± 1.8985.28 ± 6.9597.64 ± 0.2590.17 ± 1.1196.98 ± 2.1198.79 ± 1.7297.44 ± 0.59
Class 1198.71 ± 0.7996.61 ± 1.2696.73 ± 0.9893.84 ± 3.4298.67 ± 0.2093.80 ± 0.9698.83 ± 1.4199.09 ± 0.8899.52 ± 0.28
Class 1292.99 ± 2.2785.73 ± 4.8982.02 ± 2.7382.47 ± 3.1891.43 ± 0.4077.64 ± 5.6094.53 ± 3.7688.28 ± 6.7894.94 ± 1.92
Class 1396.97 ± 2.9388.76 ± 4.8183.11 ± 11.2194.49 ± 5.8393.22 ± 0.4798.60 ± 1.2498.27 ± 2.3799.57 ± 0.2498.16 ± 1.82
Class 1499.54 ± 0.8396.58 ± 1.1099.64 ± 0.3598.98 ± 1.1999.86 ± 0.3197.57 ± 1.3499.73 ± 0.3599.58 ± 0.4899.77 ± 0.15
Class 1597.75 ± 1.9183.17 ± 5.7992.25 ± 1.7988.82 ± 5.8096.24 ± 0.5082.65 ± 2.2697.18 ± 1.6598.73 ± 1.2099.65 ± 0.24
Class 1680.48 ± 14.9374.53 ± 8.6574.67 ± 6.8786.90 ± 10.5174.26 ± 1.4189.76 ± 2.1781.43 ± 3.1071.19 ± 10.8288.10 ± 6.43
OA (%)96.80 ± 0.1690.50 ± 0.4492.40 ± 0.6090.37 ± 1.7297.22 ± 0.0890.39 ± 0.7397.77 ± 0.3597.18 ± 0.6098.78 ± 0.17
AA (%)91.98 ± 3.1585.35 ± 0.8887.44 ± 1.2686.44 ± 4.7795.81 ± 1.1987.60 ± 0.7395.76 ± 0.8094.34 ± 1.9594.55 ± 1.98
Kappa (%)96.35 ± 0.1989.15 ± 0.5291.32 ± 0.6889.04 ± 1.9296.78 ± 0.0789.01 ± 0.8397.46 ± 0.3996.78 ± 0.6998.60 ± 0.19
Table 6. Sensitivity analysis of multi-scale fusion weights.
Table 6. Sensitivity analysis of multi-scale fusion weights.
Row w 0 w 1 w 2 OA (%)
R10.700.200.1091.42
R20.600.250.1593.51
R30.500.300.2094.12
R40.400.400.2093.13
R50.330.330.3484.23
R60.300.500.2093.36
R70.200.300.5093.68
R80.150.250.6092.91
Bold value indicates the best result.
Table 7. Ablation study of the proposed FDM-Net on all datasets.
Table 7. Ablation study of the proposed FDM-Net on all datasets.
DatasetMLFAFDEOA (%)AA (%)Kappa (%)
QHUP97.5892.3596.39
96.4991.2995.20
96.5291.4095.41
QHUQ95.0788.5793.47
94.1187.6392.17
94.0387.5892.54
QHUT97.5893.8697.25
97.4192.5696.08
97.0692.8596.29
Houston94.7994.2494.39
93.8293.2593.41
93.9193.3493.49
IP98.7894.5598.60
97.8693.7497.71
97.9593.8897.83
✓ indicates the module is included; Bold values indicate the best results.
Table 8. Ablation study of the Gate Path on all datasets.
Table 8. Ablation study of the Gate Path on all datasets.
DatasetGate PathOA (%)AA (%)Kappa (%)
QHUP97.5892.3596.39
×96.6882.1695.05
QHUQ95.0788.5793.47
×95.0688.8693.45
QHUT97.5893.8697.25
×96.2191.8695.68
Houston94.7994.2494.39
×92.9791.0792.40
IP98.7894.5598.60
×93.6483.0292.73
✓ indicates the module is included; × indicates the module is not included. Bold values indicate the best results.
Table 9. Ablation study of the Mamba module on all datasets.
Table 9. Ablation study of the Mamba module on all datasets.
DatasetMambaTransformerOA (%)AA (%)Kappa (%)
QHUP 97.5892.3596.39
96.1778.4994.28
QHUQ 95.0788.5793.47
94.3886.3992.55
QHUT 97.5893.8697.25
95.9187.9895.34
Houston 94.7994.2494.39
93.9193.3493.49
IP 98.7894.5598.60
96.2494.3695.71
✓ indicates the module is used. Bold values indicate the best results.
Table 10. Comparison of model complexity and inference efficiency on the Houston dataset.
Table 10. Comparison of model complexity and inference efficiency on the Houston dataset.
Model NameParams (MB)FLOPs (M)Inference Time (ms/Batch)
Lite-HCNet0.010.32017.466
LSSAN0.155.99015.873
MSDAN12.75442.13543.611
SimPoolFormer5.4555.9678.812
CacfNet0.442.0396.699
SpectralFormer0.401.7492.845
GSCViT0.504.6254.098
SSFTT0.341.9252.386
FDM-Net (our)0.192.30215.322
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shen, Y.; Shi, X. FDM-Net: A Multi-Level Feature Aggregation Network Based on Frequency-Decomposition for Hyperspectral Image Classification. Remote Sens. 2026, 18, 2603. https://doi.org/10.3390/rs18152603

AMA Style

Shen Y, Shi X. FDM-Net: A Multi-Level Feature Aggregation Network Based on Frequency-Decomposition for Hyperspectral Image Classification. Remote Sensing. 2026; 18(15):2603. https://doi.org/10.3390/rs18152603

Chicago/Turabian Style

Shen, Yuhan, and Xiaofei Shi. 2026. "FDM-Net: A Multi-Level Feature Aggregation Network Based on Frequency-Decomposition for Hyperspectral Image Classification" Remote Sensing 18, no. 15: 2603. https://doi.org/10.3390/rs18152603

APA Style

Shen, Y., & Shi, X. (2026). FDM-Net: A Multi-Level Feature Aggregation Network Based on Frequency-Decomposition for Hyperspectral Image Classification. Remote Sensing, 18(15), 2603. https://doi.org/10.3390/rs18152603

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop