---
title: 'MixerSENet: Lightweight HSI Classifier'
url: https://www.emergentmind.com/topics/mixersenet
type: topic
---

# MixerSENet: Lightweight HSI Classifier

Searching arXiv for MixerSENet and closely related mixer/SE references.
I’ll look up the cited arXiv entries to ground the article in current paper metadata.
MixerSENet is a lightweight framework for hyperspectral image (HSI) classification that is designed to address computational efficiency and limited labeled data by processing fixed-size hyperspectral patches, explicitly decoupling spatial and channel mixing, and incorporating a squeeze-and-excitation (SE) block for channel-wise recalibration [2606.01700]. In the reported formulation, the model operates on PCA-reduced HSI patches of size \(9 \times 9 \times 15\), preserves spatial resolution throughout the network, and combines \(1\times1\) point-wise convolutions with multi-scale depth-wise convolutions to model spectral–spatial structure while keeping the parameter count low [2606.01700].

## 1. Problem formulation and design rationale

An HSI is represented as a 3D data cube
\[
\mathbf{I}_{\text{Original} \in \mathbb{R}^{H \times W \times C},
\]
where \(H\) and \(W\) denote spatial dimensions and \(C\) denotes the number of spectral bands, often exceeding 100 [2606.01700]. The classification task assigns a land-cover class label to each pixel. In the patch-based setting used by MixerSENet, a spatial neighborhood around a target pixel, such as a \(9 \times 9\) patch, is extracted and used to predict the central pixel’s label [2606.01700].

The motivation for MixerSENet is grounded in four stated difficulties of HSI classification: the spectral dimension is very high; labeled data are scarce and expensive to obtain; models must capture joint spectral–spatial structure; and computational resources may be limited in airborne, satellite, or edge-device deployments [2606.01700]. The paper positions existing model families accordingly. It states that 1D-CNNs focus only on spectral sequences, 2D-CNNs on spatial context, and 3D-CNNs and hybrids can capture joint spectral–spatial information but tend to be parameter- and compute-heavy and to overfit on small HSI datasets [2606.01700]. Transformer-based HSI models such as HSIFormer and SimPoolFormer are described as having high parameter counts, long inference times, and substantial labeled-data requirements, while Mamba-like models such as MorphMamba are characterized as computationally intensive in token processing and morphological operations, with relatively high inference time despite moderate parameter counts [2606.01700].

Within that context, MixerSENet is presented as a mixer-style network inspired by MLP-Mixer and PolSARConvMixer, with efficient decoupling of spatial and channel mixing, depth-wise convolutions for inexpensive spatial mixing, point-wise convolutions for spectral mixing, and an SE block to emphasize informative spectral channels [2606.01700]. A plausible implication is that the architecture is intended not merely as a smaller substitute for 3D-CNNs or transformers, but as a reformulation of HSI classification around fixed-resolution local context and low-cost spectral–spatial operators.

## 2. Architectural organization

The reported high-level pipeline begins with PCA along the spectral dimension:
\[
\mathbf{I}_{\text{Reduced} \in \mathbb{R}^{H \times W \times P}, \quad P \ll C,
\]
with \(P=15\) in the experiments [2606.01700]. Overlapping patches of size \(S \times S\), here \(9 \times 9\), are then extracted around each labeled pixel to form
\[
\mathbf{X} \in \mathbb{R}^{S \times S \times P}.
\]
This tensor is passed through a stack of repeated Mixer blocks, followed by an SE block and a classification head that outputs class probabilities for the central pixel [2606.01700].

A central architectural property is constant spatial resolution. Depth-wise convolutions use padding, and there are no pooling or strided operations, so all intermediate feature maps retain spatial size \(S \times S\) [2606.01700]. The paper explicitly links this choice to preservation of spatial locality and continued access by the classifier to the full spatial neighborhood around the target pixel [2606.01700]. This suggests that MixerSENet prioritizes local structural fidelity over the hierarchical spatial abstraction commonly used in encoder-style vision backbones.

The model also explicitly separates channel and spatial processing. Channel mixing is performed by \(1\times1\) point-wise convolutions acting as per-pixel affine transformations across channels, in spirit similar to the channel MLP of MLP-Mixer; spatial mixing is performed by depth-wise convolutions per channel, with kernel sizes \(3 \times 3\), \(5 \times 5\), and \(7 \times 7\) to provide multi-scale receptive fields [2606.01700]. The paper describes this as analogous to alternating token-MLPs and channel-MLPs in MLP-Mixer, but implemented through convolutional operators that are more efficient on images and more natural for HSI data [2606.01700].

## 3. Constituent blocks and mathematical formulation

After PCA and patch extraction, the initial tensor is
\[
\mathbf{X}_0 \in \mathbb{R}^{S \times S \times P}.
\]
An initial point-wise convolution produces
\[
\mathbf{Y} = \text{Conv}_{1\times1}(\mathbf{X}_0),
\]
with per-location affine transformation
\[
\mathbf{Y}(i,j,:) = W \,\mathbf{X}_0(i,j,:) + b,
\]
where \(W \in \mathbb{R}^{D \times P}\) and \(b \in \mathbb{R}^{D}\) [2606.01700]. The paper interprets this operation as a learnable spectral projection into a feature space of dimension \(D\) [2606.01700].

Spatial mixing is performed by depth-wise convolution. For channel \(c\),
\[
u_c = F_{tr}(\mathbf{X}) \in \mathbb{R}^{S \times S},
\]
and with kernel \(k_c\) of size \(k\times k\),
\[
u'_c(i,j) = \sum_{m=-\lfloor k/2 \rfloor}^{\lfloor k/2 \rfloor} \sum_{n=-\lfloor k/2 \rfloor}^{\lfloor k/2 \rfloor}
k_c(m,n)\, u_c(i-m, j-n).
\]
In MixerSENet, depth-wise convolutions with kernel sizes \(3 \times 3\), \(5 \times 5\), and \(7 \times 7\) are applied as multi-scale spatial filters, while preserving the number of channels \(D\) because each input channel has its own filter [2606.01700]. The paper emphasizes that this extracts channel-specific spatial patterns at multiple scales with substantially fewer parameters than full 2D convolution [2606.01700].

After spatial mixing, a second \(1\times1\) convolution performs channel fusion:
\[
\mathbf{X}_{\text{mixed} = \text{Conv}_{1\times1}\big(\mathbf{X}_{\text{dw}\big).
\]
A Mixer block is therefore summarized as
\[
\mathbf{X}^{(1)} = \text{Conv}_{1\times1}(\mathbf{X}),
\]
\[
\mathbf{X}^{(2)} = \text{DWConv}_{3\times3,5\times5,7\times7}(\mathbf{X}^{(1)}),
\]
\[
\mathbf{X}^{(3)} = \text{Conv}_{1\times1}(\mathbf{X}^{(2)}),
\]
and the network applies this transformation repeatedly:
\[
\mathbf{X}_{L} = \underbrace{\mathcal{M} \circ \mathcal{M} \circ \dots \circ \mathcal{M}}_{L\ \text{times}} (\mathbf{X}_0),
\]
with \(L\) treated as a key hyperparameter in the ablation study [2606.01700].

The SE block refines the output feature maps by channel-wise attention. For each channel \(u_c \in \mathbb{R}^{H \times W}\), with \(H=W=S\) and \(C=D\), the squeeze operation is global average pooling:
\[
z_c = F_{sq}(u_c) = \frac{1}{H \times W}\sum_{i=1}^H\sum_{j=1}^W u_c(i,j),
\]
yielding
\[
\mathbf{z} \in \mathbb{R}^{C}.
\]
The excitation stage is
\[
s = F_{ex}(z, W) = \sigma\big(W_2 \,\text{ReLU}(W_1 z)\big),
\]
where \(W_1 \in \mathbb{R}^{\frac{C}{r} \times C}\), \(W_2 \in \mathbb{R}^{C \times \frac{C}{r}}\), \(r\) is a reduction ratio, and \(\sigma\) is sigmoid [2606.01700]. Recalibration then applies
\[
\tilde{u}_c(i,j) = s_c \cdot u_c(i,j),
\]
or
\[
\tilde{\mathbf{U} = \mathbf{s} \odot \mathbf{U}.
\]
The paper states that this emphasizes channels that contribute more to discrimination and suppresses noisy or redundant spectral bands; for HSIs, where many bands are correlated, the SE block helps focus on informative spectral combinations learned by earlier convolutions [2606.01700].

The variant without the SE block is termed MixerNet, while the full model is MixerSENet [2606.01700]. After SE recalibration, the final tensor
\[
\tilde{\mathbf{X} \in \mathbb{R}^{S \times S \times D}
\]
is flattened and passed to a dense classifier:
\[
\mathbf{h} = \text{Flatten}(\tilde{\mathbf{X}) \in \mathbb{R}^{S^2 D},
\]
\[
\mathbf{o} = W_{\text{cls}\mathbf{h} + b_{\text{cls} \in \mathbb{R}^{K},
\]
\[
\hat{\mathbf{y} = \text{softmax}(\mathbf{o}),
\]
with standard cross-entropy loss against ground-truth labels [2606.01700].

## 4. Efficiency profile and training protocol

MixerSENet is explicitly characterized as lightweight. The paper reports 53,146 parameters for MixerSENet and 52,050 for MixerNet [2606.01700]. Comparative parameter counts are given as 397,586 for 3D-CNN, 142,690 for HybridKAN, 1,373,084 for HSIFormer, 771,122 for SimPoolFormer, and 67,650 for MorphMamba [2606.01700]. The interpretation provided in the paper is that MixerSENet is one of the smallest models among the baselines, with only MorphMamba in a similar range but with higher inference time and lower accuracy [2606.01700].

The complexity table reports for MixerSENet: FLOPs \(7.894 \times 10^6\), MACs \(3.890 \times 10^6\), and inference time 2:32 [2606.01700]. The comparison values listed in the paper include 3D-CNN with FLOPs \(0.682\times10^6\) and inference time 1:37; HSIFormer with FLOPs \(18.392\times10^6\) and inference time 11:00; SimPoolFormer with FLOPs \(57.497\times10^6\) and inference time 4:52; MorphMamba with FLOPs \(8.592\times10^6\) and inference time 7:32; and HybridKAN with FLOPs \(20.2\times10^6\) and inference time 3:25 [2606.01700]. All reported inference times were measured on Windows 10 with 64 GB RAM and an NVIDIA GeForce RTX 2080 GPU with 8 GB VRAM [2606.01700].

The paper attributes efficiency to several specific architectural choices: depth-wise convolutions in place of full 2D or 3D convolutions, \(1\times1\) convolutions for linear-cost channel mixing, constant spatial resolution without pyramid or down/up-sampling machinery, shallow depth with diminishing returns beyond modest \(L\), and PCA preprocessing that reduces spectral dimensionality from \(C\) to \(P=15\) [2606.01700]. A plausible implication is that the architecture is optimized around fixed local windows rather than global scene modeling, which is consistent with the patch-based workflow.

Training uses \(9 \times 9\) patches and 15 PCA components, Adam optimizer, learning rate \(1 \times 10^{-3}\), batch size 32, and up to 100 epochs with early stopping based on validation accuracy [2606.01700]. The early-stopping rule checks validation accuracy after each epoch, stops training if validation accuracy does not improve for 10 consecutive epochs, and restores the weights with best validation accuracy [2606.01700]. The implementation is reported in Keras with TensorFlow backend [2606.01700]. The paper notes PCA, small model size, early stopping, and patch-based sampling as the effective overfitting controls, and explicitly states that dropout, weight decay, and normalization layers are not mentioned [2606.01700].

## 5. Experimental protocol and empirical performance

The experiments use two benchmark datasets. Houston13 is the 2013 IEEE GRSS Data Fusion Contest dataset, used here in HSI-only form, with 15 land-cover classes including Healthy grass, Stressed grass, Synthetic grass, Tree, Soil, Water, Residential, Commercial, Road, Highway, Railway, Parking Lot1, Parking Lot2, Tennis court, and Running track [2606.01700]. Available training data are evenly split into training and validation, while the provided test set remains unchanged, giving approximate proportions of about 9% training, 9% validation, and 82% testing [2606.01700]. The QUH-Qingyun dataset is an urban HSI dataset with 6 classes: Trees, Concrete building, Car, Ironhide building, Plastic playground, and Asphalt road [2606.01700]. Its patches are randomly split into 5% training, 5% validation, and 90% testing [2606.01700].

Evaluation uses Overall Accuracy (OA),
\[
\text{OA} = \frac{\text{number of correctly classified pixels}}{\text{total number of test pixels}},
\]
Average Accuracy (AA),
\[
\text{AA} = \frac{1}{K} \sum_{k=1}^K \text{Acc}_k,
\]
and the Kappa coefficient,
\[
\kappa = \frac{p_o - p_e}{1 - p_e},
\]
reported as \(\kappa \times 100\) [2606.01700]. Experiments are repeated 10 times with random splits, and mean \(\pm\) standard deviation are reported; the best single run’s per-class accuracies are also tabulated [2606.01700].

On Houston13, MixerSENet achieves OA \(82.47\% \pm 0.25\), AA \(85.21\% \pm 0.33\), and Kappa \(\times 100\) \(81.03 \pm 0.27\) [2606.01700]. The reported baseline values are OA \(80.13\%\) for 3D-CNN, \(75.27\%\) for HybridKAN, \(77.38\%\) for HSIFormer, \(77.82\%\) for SimPoolFormer, \(76.04\%\) for MorphMamba, and \(81.23\%\) for MixerNet [2606.01700]. The paper therefore states that MixerSENet improves OA over 3D-CNN by about 2.3 percentage points, outperforms the listed transformer-based baselines and MorphMamba, and improves over MixerNet by +1.24 OA, +0.79 AA, and +1.40 Kappa [2606.01700]. Reported class-wise highlights for MixerSENet include Synthetic Grass at 99.80%, Soil at 100.00%, Residential at 94.31%, Commercial at 78.35%, Road at 77.43%, Parking Lot1 at 86.07%, and Running Track at 99.37% [2606.01700].

On QUH-Qingyun, MixerSENet achieves OA \(96.70\% \pm 0.21\), AA \(95.46\% \pm 0.24\), and Kappa \(\times 100\) \(95.64 \pm 0.20\) [2606.01700]. The comparison values are OA \(95.91\%\) for 3D-CNN, \(93.52\%\) for HybridKAN, \(95.10\%\) for HSIFormer, \(95.67\%\) for SimPoolFormer, \(91.64\%\) for MorphMamba, and \(96.04\%\) for MixerNet [2606.01700]. The paper states that MixerSENet achieves the best OA, AA, and Kappa among the compared methods on Qingyun [2606.01700]. Class-wise results noted in the paper include Car at 83.32% versus 61.53% for 3D-CNN and 50.80% for MorphMamba, Ironhide building at 99.81%, and Asphalt road at 96.06% [2606.01700].

A concise summary of the headline results is as follows.

| Dataset | MixerSENet result | Reported comparison context |
|---|---:|---|
| Houston13 | OA \(82.47\% \pm 0.25\); AA \(85.21\% \pm 0.33\); Kappa \(81.03 \pm 0.27\) | Higher OA than 3D-CNN, HybridKAN, HSIFormer, SimPoolFormer, MorphMamba, and MixerNet |
| QUH-Qingyun | OA \(96.70\% \pm 0.21\); AA \(95.46\% \pm 0.24\); Kappa \(95.64 \pm 0.20\) | Best OA, AA, and Kappa among the compared methods |

The paper also reports qualitative classification maps for Houston13 and Qingyun. It states that MixerSENet produces smoother and more coherent maps, cleaner class boundaries, and fewer salt-and-pepper artifacts than the baselines, especially in residential and commercial areas in Houston13 and in roads, cars, and building roofs in Qingyun [2606.01700]. In Houston13, clouds obscure some regions in the RGB image, yet the paper reports relatively consistent labeling in cloud-affected areas [2606.01700].

## 6. Ablations, interpretation, and relation to similarly named work

The principal ablations concern network depth \(L\) and the SE block. On Qingyun with 1% training data, the depth study reports: \(L=1\) gives OA 92.80, AA 86.08, Kappa 90.46, with 11,590 parameters; \(L=5\) gives OA 93.96, AA 89.45, Kappa 92.18, with 51,270 parameters; and \(L=6\) gives a slight drop to OA 93.85, AA 89.18, Kappa 91.93, with 61,190 parameters [2606.01700]. The paper’s interpretation is that increasing depth up to \(L=5\) steadily improves performance, while \(L=6\) shows mild overfitting, and parameter count grows linearly with \(L\) [2606.01700].

The SE ablation compares MixerNet and MixerSENet directly. On Houston13, the SE-equipped model gains +1.24 OA, +0.79 AA, and +1.40 Kappa; on Qingyun, it gains +0.66 OA, +0.92 AA, and +0.88 Kappa [2606.01700]. The paper interprets these results as evidence that channel reweighting is valuable in hyperspectral spectral–spatial modeling [2606.01700]. It further attributes the overall performance of MixerSENet to effective spectral–spatial feature modeling via decoupled mixing, reduced overfitting due to compact architecture and PCA, and channel attention that mitigates redundancy in spectral bands and highlights subtle spectral signatures [2606.01700].

A common point of confusion is the resemblance between the names *MixerSENet* and *SEMixer*. These are distinct architectures for different modalities and tasks. MixerSENet is an HSI classification model based on point-wise and depth-wise convolutions plus an SE block [2606.01700]. By contrast, SEMixer is a long-term time series forecasting architecture built around an all-MLP mixer backbone with a Random Attention Mechanism (RAM) and a Multiscale Progressive Mixing Chain (MPMC) [2602.16220]. The similarity lies chiefly in the shared mixer-oriented design vocabulary and in the use of a semantics-enhancing component: in MixerSENet this role is played by channel-wise SE recalibration, whereas in SEMixer it is played by RAM operating over time patches [2606.01700] [2602.16220]. This suggests a broader pattern in contemporary mixer-style architectures, namely the augmentation of efficient mixing backbones with lightweight reweighting or semantics-enhancement modules tailored to the structure of the target modality.

Reported limitations of MixerSENet are also specific. The paper notes that depth-wise convolution can still struggle with highly correlated spectral bands, despite point-wise convolution and SE alleviating some issues; that the model is patch-based and scales to large scenes by sliding window, which is standard but may be slow for very large images; and that future work may investigate more expressive spectral mixing strategies, carefully controlled efficient transformers, and applications to multi-temporal HSI, other sensors, and fusion scenarios [2606.01700]. These points delimit the scope of the method: its contribution is an efficient local spectral–spatial classifier, not a complete solution to large-scene or globally contextual HSI modeling.

Source: https://www.emergentmind.com/topics/mixersenet