- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a training-free method for industrial anomaly detection that retrieves a small set of references for each query image from the full normal image pool. It combines CLS-based retrieval with coarse patch-similarity reranking, then scores anomalies using spatially constrained nearest-neighbor distances and local subspace reconstruction residuals. Experiments cover single-class and multi-class detection on MVTec AD and VisA, with additional evaluations on 3CAD and mixed reference pools. Component ablations and experiments integrating the retrieval strategy into other detectors examine the individual designs and the strategy’s applicability across methods.
Critical strengths
- Combining global and patch-level similarity makes reference selection less dependent on either signal alone. The two-stage design uses global similarity to identify relevant candidates and patch similarity to distinguish references with similar overall appearances but different local content. The ranking ablation supports this design.
- The retrieval strategy is useful beyond the proposed detector: it improves AnomalyDINO and SubspaceAD without changes to their scoring procedures. Its benefits across MVTec AD, VisA, and 3CAD provide evidence of practical value across different detectors and datasets.
Critical weaknesses
The main pipeline closely resembles RAD, which already retrieves query-relevant normal images and performs spatially constrained patch matching across multiple layers. The paper discusses RAD, but emphasizing reference selection as a separate stage does not clearly explain the distinction. The ranking and subspace ablations support parts of the proposed design, yet the overall advance over this existing approach remains insufficiently demonstrated.
The evaluation leaves several important questions unresolved. Several score adjustments and the one-sided refinement are not separately evaluated, so their contributions to the localization gains remain unclear. The authors report their own inference times but provide no matched comparison with other methods or full-reference scoring. The paper also does not explain how α = 0.25 and β = 0.1 were selected or whether independent validation data were used.
Questions for authors
-
The paper discusses its differences from RAD, but the main retrieval and matching pipeline remains similar. Could the authors explain more clearly what the proposed changes improve and compare the methods using the same reference budgets, such as 4, 8, and 16 images, with the same backbone and input resolution?
-
Can the authors compare inference time and memory usage with representative methods under the same conditions? This would help assess the computational cost alongside the reported accuracy.
-
How much does the one-sided refinement contribute to PRO? Please report the localization results without this operation.
-
How were α = 0.25 and β = 0.1 selected? Please describe the validation data and selection procedure, and clarify their relationship to the results in Figures 4 and 5.
7 comments
2. We measured online query latency and peak memory in three runs over all 1,725 MVTec-AD test images using the same RTX 3090 (24 GB), DINOv3-B/16 and inputs. Online latency excludes offline preparation of the normal reference bank. For our method, it includes reference retrieval, access to reference features, and anomaly scoring. The budgets are shown explicitly because RAD uses its default 150 references in this timing experiment.
\hline \text{Method} & \text{Setting} & \begin{array}{c}\text{Online latency} \\\\ \text{(ms/image, mean ± SD)}\end{array} & \begin{array}{c}\text{End-to-end time} \\\\ \text{(ms/image, mean ± SD)}\end{array} & \begin{array}{c}\text{Peak GPU memory} \\\\ \text{(MiB)}\end{array} & \begin{array}{c}\text{Peak memory} \\\\ \text{(MiB)}\end{array} \\\\ \hline & \text{1 retrieved} & 89.32 \pm 6.43 & 89.32 \pm 6.43 & 480.46 & 3298.00 \\\\ \text{Ours} & \text{8 retrieved} & 388.49 \pm 9.51 & 388.49 \pm 9.51 & 1251.06 & 3800.49 \\\\ & \text{16 retrieved} & 773.38 \pm 31.38 & 773.38 \pm 31.38 & 2126.19 & 4011.20 \\\\ & \text{1-shot} & 68.45 \pm 0.63 & 72.50 \pm 0.63 & 395.73 & 1475.17 \\\\ \text{AnomalyDINO} & \text{4-shot} & 75.27 \pm 0.46 & 91.12 \pm 0.46 & 467.82 & 1549.79 \\\\ & \text{full-shot} & 478.08 \pm 1.54 & 1614.92 \pm 1.54 & 9767.91 & 11487.38 \\\\ & \text{1-shot} & 22.38 \pm 0.13 & 34.85 \pm 0.13 & 381.36 & 1836.00 \\\\ \text{SubspaceAD} & \text{4-shot} & 22.42 \pm 0.15 & 71.02 \pm 0.15 & 381.36 & 1926.40 \\\\ & \text{full-shot} & 21.74 \pm 0.12 & 2580.33 \pm 0.12 & 381.36 & 2650.43 \\\\ \text{RAD} & \text{150 retrieved} & 2034.63 \pm 198.30 & 2034.63 \pm 198.30 & 414.63 & 1707.95 \\\\ \hline \end{array}$$ SubspaceAD takes about 22 ms/image online at all three reference budgets. AnomalyDINO’s online latency increases from 68.45 ms/image at 1-shot to 478.08 at full-shot. Our method takes 89.32, 388.49 and 773.38 ms/image at 1-, 8- and 16-Ref, respectively. RAD takes 2,034.63 ms/image at its default budget of 150 references. **3.** We repeated the localization experiment with one-sided refinement disabled, holding all other settings fixed. Each entry gives the pixel-level result with **refinement off / on** (%). $$\begin{array}{cccc} \hline \text{Dataset} & \text{References} & \text{P-AUROC (\\%)} & \text{PRO (\\%)} \\\\ \hline & 4 & 98.32 / 98.45 & 96.81 / 96.78 \\\\ \text{MVTec-AD} & 8 & 98.43 / 98.55 & 96.97 / 96.93 \\\\ & 16 & 98.47 / 98.59 & 97.03 / 96.98 \\\\ & 4 & 99.00 / 99.01 & 95.09 / 95.55 \\\\ \text{VisA} & 8 & 99.11 / 99.12 & 95.46 / 95.86 \\\\ & 16 & 99.19 / 99.19 & 95.69 / 96.03 \\\\ \hline \end{array}$$ Image-level scores are identical because they are computed before this operation. On VisA, which includes scenes with complex backgrounds, refinement improves PRO at all three budgets. On MVTec-AD, it slightly improves P-AUROC but slightly lowers PRO. We therefore view one-sided refinement as a lightweight way to improve regional continuity. It fills locally depressed responses and may help when complex structures or dispersed defect regions produce fragmented anomaly maps. Its overall contribution to localization is modest. The anomaly maps produced by reference retrieval and patch scoring already achieve most of the reported localization performance before refinement.4. We selected and empirically on MVTec-AD and VisA without an independent validation split. Figures 4 and 5 show the corresponding ablations at 1-Ref and 2-Ref, respectively. We used the same parameter settings across datasets and reference budgets.
The coefficient sets the weight of the CLS ranking when reranking the candidate pool. To evaluate the role of patch correspondence where category confusion occurs, we additionally varied on 3CAD, a real-world industrial dataset. The table reports same-category retrieval precision (%).
\hline \alpha\text{ in reranking} & \text{1 reference} & \text{2 references} & \text{4 references} \\\\ \hline \text{0.00 (patch only)} & 97.165 & 97.045 & 96.797 \\\\ \textbf{0.25 (default)} & 97.111 & 96.984 & 96.791 \\\\ 0.50 & 97.057 & 96.999 & 96.715 \\\\ 0.75 & 97.027 & 96.942 & 96.690 \\\\ \text{1.00 (CLS only)} & 96.869 & 96.745 & 96.582 \\\\ \hline \end{array}$$ Patch-only reranking gives the highest category precision on 3CAD. The default setting $\alpha=0.25$ also improves on CLS alone at every budget, by 0.21–0.24 percentage points. For the original parameter choice, Figure 4 evaluates detection performance on MVTec-AD and VisA. It shows that emphasizing patch correspondence benefits localization, while retaining some CLS information can help image-level detection. We chose $\alpha=0.25$ to retain global appearance while giving greater weight to patch-level correspondence. Figure 5 examines $\beta$ at 2-Ref. To check whether that setting is representative, we also evaluated the fusion weight at $K \in \lbrace 1, 2, 4, 8, 16 \rbrace$. The table gives mean performance across the five budgets for all seven tested weights (%). $$\begin{array}{cccccc} \hline \text{Dataset} & \beta & \text{I-AUROC (\\%)} & \text{I-AUPR (\\%)} & \text{P-AUROC (\\%)} & \text{PRO (\\%)} \\\\ \hline & 0 & 99.09 & 99.56 & 98.35 & 96.63 \\\\ & \mathbf{0.1} & 99.09 & 99.56 & 98.39 & 96.70 \\\\ & 0.3 & 99.06 & 99.54 & 98.44 & 96.76 \\\\ \text{MVTec-AD} & 0.5 & 99.02 & 99.51 & 98.47 & 96.77 \\\\ & 0.7 & 98.99 & 99.49 & 98.48 & 96.77 \\\\ & 0.9 & 98.97 & 99.47 & 98.48 & 96.76 \\\\ & 1 & 98.95 & 99.46 & 98.49 & 96.75 \\\\ & 0 & 94.88 & 94.90 & 98.93 & 95.10 \\\\ & \mathbf{0.1} & 94.73 & 94.73 & 98.95 & 95.16 \\\\ & 0.3 & 94.43 & 94.37 & 98.97 & 95.18 \\\\ \text{VisA} & 0.5 & 94.10 & 93.97 & 98.97 & 95.15 \\\\ & 0.7 & 93.79 & 93.59 & 98.97 & 95.10 \\\\ & 0.9 & 93.48 & 93.27 & 98.96 & 95.04 \\\\ & 1 & 93.33 & 93.11 & 98.96 & 95.01 \\\\ \hline \end{array}$$ In Eq. (15), $\beta$ balances nearest-neighbor distance (weight $1-\beta$) and the local subspace residual (weight $\beta$). Increasing $\beta$ generally favors pixel-level localization at the expense of image-level discrimination. We chose $\beta=0.1$ as a compromise. In addition, a coefficient of 0.1 still gives the subspace term substantially more than 10% of the mean fused patch score because the two distances have different scales. Across the five reference budgets, the mean raw subspace residual is 4.87–5.34 times the mean corrected NN distance on MVTec-AD and 5.85–6.14 times on VisA. After weighting and the dispersion adjustment in Eq. (15), the subspace term accounts for **35.74–37.25%** of the mean fused patch score on MVTec-AD and **39.94–40.99%** on VisA. We thank the reviewer again and hope these responses address their concerns. We would be glad to clarify anything further and we hope the reviewer will consider raising their score.
Thank you for the questions.
1. Although our method and RAD retrieve normal references before scoring anomalies, they differ in how they select the references, what the retrieval module passes to the detector, and how the detector scores each query patch.
First, our retrieval has two stages. We use CLS-token similarity to retrieve the top T normal images as candidates, then compare each candidate’s patch tokens with patch tokens from the query image. We combine the CLS and patch rankings to select the final K references. RAD selects its K reference images directly from CLS-token similarity alone.
Second, our retrieval module returns a set of normal images. Any few-shot detector that accepts reference images can use these normal images with its own scoring procedure, as we demonstrate with AnomalyDINO and SubspaceAD. In RAD’s pipeline, retrieval gives the scorer direct access to stored patch tokens from the selected images for feature matching. Reusing that pipeline with a detector that expects images as input would require adapting what it passes to the detector. Therefore, our plug-and-play module offers greater flexibility.
Finally, RAD scores each query patch by its similarity to the closest reference patch within a local spatial neighborhood. Our similarity score also considers matches elsewhere in the retrieved images. A better global patch match reduces the local nearest-neighbor distance according to the similarity gap. In addition, we use the locally matched patches from the K references to fit a low-rank subspace. The query patch’s reconstruction residual provides a second anomaly score that captures deviations from the local normal variation (Eqs. 8–15).
We evaluated both methods at the requested budgets, using DINOv2-B/14 with 518×518 input resolution and DINOv3-B/16 with 512×512 input resolution. Each entry is RAD / ours (%).
\hline \text{Backbone} & \text{Dataset} & \text{References} & \text{I-AUROC (\\%)} & \text{I-AUPR (\\%)} & \text{P-AUROC (\\%)} & \text{PRO (\\%)} \\\\ \hline & & 4 & 98.4 / 99.0 & 99.3 / 99.5 & 98.0 / 98.4 & 95.9 / 96.5 \\\\ & \text{MVTec-AD} & 8 & 98.9 / 99.2 & 99.6 / 99.6 & 98.2 / 98.5 & 96.4 / 96.7 \\\\ & & 16 & 99.2 / 99.3 & 99.7 / 99.7 & 98.4 / 98.5 & 96.7 / 96.7 \\\\ \smash{\raise{0.65em}{\text{DINOv2-B/14}}} & & 4 & 91.1 / 94.0 & 91.0 / 94.4 & 98.4 / 98.8 & 93.1 / 95.5 \\\\ & \text{VisA} & 8 & 92.2 / 95.1 & 92.3 / 95.2 & 98.7 / 98.9 & 94.2 / 96.0 \\\\ & & 16 & 93.7 / 95.7 & 93.3 / 95.6 & 98.9 / 99.0 & 95.0 / 96.2 \\\\ & & 4 & 98.3 / 99.2 & 99.3 / 99.6 & 98.4 / 98.4 & 96.4 / 96.8 \\\\ & \text{MVTec-AD} & 8 & 99.0 / 99.3 & 99.6 / 99.7 & 98.5 / 98.6 & 96.7 / 96.9 \\\\ & & 16 & 99.2 / 99.4 & 99.7 / 99.8 & 98.6 / 98.6 & 96.9 / 97.0 \\\\ \smash{\raise{0.65em}{\text{DINOv3-B/16}}} & & 4 & 93.0 / 94.7 & 93.1 / 94.6 & 98.7 / 99.0 & 93.0 / 95.5 \\\\ & \text{VisA} & 8 & 94.2 / 95.3 & 93.8 / 95.0 & 99.0 / 99.1 & 94.2 / 95.9 \\\\ & & 16 & 94.9 / 95.9 & 94.3 / 95.8 & 99.1 / 99.2 & 95.0 / 96.0 \\\\ \hline \end{array}$$ The largest localization gains occur on VisA at 4-Ref, where PRO increases by 2.4 points with DINOv2 and 2.5 with DINOv3. On MVTec-AD, the gap narrows with more references. At 16-Ref, the two methods tie on PRO with DINOv2 and differ by 0.1 points with DINOv3. We also measured the percentage of retrieved references that belong to the query category. Each entry is **RAD / ours** (%). $$\begin{array}{ccccc} \hline \text{Backbone} & \text{Dataset} & \text{4 references} & \text{8 references} & \text{16 references} \\\\ \hline & \text{MVTec-AD} & 100.00 / 100.00 & 99.98 / 100.00 & 99.99 / 100.00 \\\\ \smash{\raise{0.65em}{\text{DINOv2-B/14}}} & \text{VisA} & 99.94 / 99.95 & 99.93 / 99.95 & 99.92 / 99.93 \\\\ & \text{MVTec-AD} & 100.00 / 100.00 & 100.00 / 100.00 & 100.00 / 100.00 \\\\ \smash{\raise{0.65em}{\text{DINOv3-B/16}}} & \text{VisA} & 100.00 / 100.00 & 100.00 / 100.00 & 100.00 / 100.00 \\\\ \hline \end{array}$$ With DINOv2, our two-stage retrieval improves same-category precision in five of the six settings by 0.01–0.02 percentage points. With DINOv3, both methods reach 100% at every budget. In conclusion, under the same visual encoder backbones, input resolutions and reference budgets, our method outperforms RAD overall in anomaly detection and localization. Across all 12 comparisons, I-AUROC is higher in every case, and each of the other three metrics matches or exceeds RAD at the reported precision. Our retrieval module slightly improves on RAD in same-category retrieval precision across the tested settings.