- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SpiralFovea, a parameter-free, pre-backbone token selector for fine-grained image recognition. It computes local luminance entropy, divides the image into horizontal strips, and picks one entropy-maximum anchor per active strip (with a distance-based deduplication). Around each anchor it samples crops on four fixed concentric rings with increasing radius and crop size. Only these crops (at most 78 at 224x224, versus 196 grid patches) are passed to the backbone. For frozen ViT/DINO backbones, only a small positional MLP and a linear classifier are trained. For a ResNet-18 + Mamba model, the crops are fed in a fixed center-outward order per anchor, and the anchors are visited top to bottom.
The authors evaluate on WikiArt (genre, style), Flowers-102, PCam, and CUB-200. They report +1.7 to +2.1 mean accuracy over dense backbones, 85.16% on CUB (dense 85.61%, ToMe 84.17%), and +17.8% to +28.9% measured throughput on a T4 GPU. At 518x518 with DINOv2-L, tokens drop from 1,369 to about 120-200 with accuracy changes from +1.90 to -5.86 points. They also analyze anchor overlap with annotated objects and state that the benefit disappears when background entropy exceeds foreground entropy. The paper presents the method as a measured operating point rather than a general claim of superiority.
Critical strengths
-
The authors narrow the scope of their claims and directly test their own assumptions. For example, they measure how often the anchors fall on the object, and analyze a cohort where the background entropy is higher than the foreground.
-
The input-stage method is simple and interpretable: the selector needs no training and finishes before the backbone, so where it fails can be inspected.
Critical weaknesses
- The claim that the spiral order is useful is not supported by the experiments.
- The authors argue that Mamba reads tokens sequentially and updates a single state, so reading the detailed crop at the anchor center first and the coarse surrounding context later should help. However, there is no ablation of the spiral order on the Mamba model. Table 7 is a ViT experiment, and it is not defined what "linear layout" changes.
- It is not separated whether the Mamba gain comes from the different crop positions or from the spiral order. The central claim needs an ablation that separates these two to be supported.
- The order between anchors is simply top to bottom, so the whole sequence is not "center to outside".
- Since scan order may matter for Mamba, it needs an analysis of whether reading the key tokens first and the surrounding tokens later is actually the better choice. There is no analysis of the spiral in reverse order or in random order.
- The core design is not well explained, the selection is restricted, and the comparisons are insufficient.
- There is no figure showing the ring configuration (radii, crop sizes, counts) and the token order. Figure 1 does not visually convey the core ring structure and ordering.
- Anchor selection is not based on a global entropy ranking. Since there is exactly one anchor per strip, if a strip contains two high-entropy locations, only one is used. Anchors are also confirmed from the top strip downward rather than in entropy order, and when two anchors are close, the later one is discarded. So when the lower anchor is the more important one, information is lost.
- There is no experimental comparison with other input-stage tokenizations (Elastic, SPoT, EPOC, DHT), and ToMe is the only properly trained baseline.
Questions for authors
-
(Clarification) In Table 7, what exactly does "linear spatial layout" change? Is it the crop positions or the token order? And does the order matter for the ViT in this ablation?
-
(Suggestion) Is there a comparison on the Mamba model where the same crops are fed in spiral, reversed, and random order? An analysis is needed to show whether reading the key tokens first is actually better.
-
(Clarification/Suggestion) The entropy is computed on grayscale. Is the result the same as with RGB entropy on datasets where color is a distinguishing cue, such as Flowers and WikiArt? Beyond the 0.01-point difference on CUB, did you check whether the anchor positions change (e.g., with the anchor overlap analysis)?
Reason for choosing entropy and Quantization Sensitivity.
Clarification of Entropy-Based Spatial Selection.
We thank the reviewer for raising these concerns. We would first like to clarify an important aspect of our methodology. SpiralFovea does not compute a single histogram entropy for each predefined ViT patch and subsequently rank those patches. Instead, it constructs a spatially resolved local entropy map using overlapping 15 × 15 luminance windows on a downsampled 112 × 112 image. The resulting entropy map is used to identify spatially distributed local maxima, which serve as anchors for subsequent multi-scale crop extraction. Thus, entropy operates before patch projection and determines where the input representation should be sampled, rather than assigning importance scores to an existing sequence of predefined patches.
Role of Histogram Entropy and Spatial Structure.
Regarding the reviewer's concern about edge detection, we agree that first-order histogram entropy does not explicitly encode spatial arrangements or identify edge orientations. Two local windows with identical intensity histograms but different spatial arrangements will indeed receive identical entropy values. Therefore, we do not claim that histogram entropy directly detects edges or captures complete local image structure. Instead, it serves as a computationally inexpensive proxy for local intensity-distribution complexity, helping identify potentially informative regions for allocating spatial sampling density. The subsequent multi-scale ring sampler extracts image crops around the selected anchors. Unlike the histogram representation used for anchor selection, these crops retain their original spatial arrangements and are processed by the visual backbone, allowing the model to learn spatial structures and features from the sampled regions. We acknowledge that high entropy does not necessarily imply semantic importance and may also arise from textured backgrounds or noise. This is an inherent limitation of using local entropy as a sampling heuristic.
Quantization Sensitivity and Choice of Hyperparameters.
We also appreciate the reviewer's observation regarding the sensitivity of histogram entropy to quantization boundaries. We agree that small changes in pixel intensities near quantization thresholds can alter histogram frequencies and, consequently, local entropy values. Since anchor selection depends on local entropy maxima, such variations can potentially influence the selected anchor locations.
In our implementation, we use 16 uniformly spaced intensity bins over normalized luminance values. This choice provides a compact representation of local intensity distributions while keeping histogram computation inexpensive. We use half-resolution entropy computation (112 × 112 for a 224 × 224 input) to reduce preprocessing overhead. The resulting anchor coordinates are mapped back to the original image resolution before multi-scale crop extraction.
Regarding how we address quantization sensitivity, our current implementation uses a fixed, uniform quantization scheme to ensure consistent entropy computation across images. However, we acknowledge that this does not eliminate sensitivity to quantization boundaries. The current manuscript does not establish 16 bins or half-resolution computation as optimal, nor does it quantify the stability of anchor selection under alternative bin counts, quantization boundaries, or entropy-map resolutions. We will clarify that these are engineering hyperparameters rather than theoretically derived optimal values. A systematic sensitivity analysis, potentially including alternative quantization schemes, would provide a more complete characterization of the selector's robustness. We will also explicitly acknowledge this limitation in the revised manuscript.
Evidence Supporting Entropy-Based Anchor Selection.
To further investigate whether entropy-based anchor selection provides an advantage over arbitrary spatial sampling, we conducted an experiment using randomly selected anchors while retaining the same multi-scale ring-sampling strategy. We observed that random-anchor selection resulted in approximately 2.5–4 percentage points lower average accuracy across the evaluated datasets compared with entropy-based selection. This result suggests that the spatial locations identified through local entropy provide a more effective sampling strategy than random anchor placement under the same sampling configuration. While this does not establish entropy as a universally optimal measure of visual importance, it provides empirical evidence supporting its utility as a lightweight spatial proposal mechanism.