- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes PARC, a training-free method for industrial anomaly detection. It combines local appearance scores with regional composition scores to detect both structural and logical anomalies. The method uses frozen visual features, K-means clustering, statistical modeling, and score calibration. The experiments show promising results on several industrial anomaly detection benchmarks.
Critical strengths
-
Strong Performance. The proposed method achieves competitive performance in both structural and logical anomaly detection, outperforming several existing approaches.
-
High Computational Efficiency. PARC achieves strong detection performance with significantly lower computational cost than methods such as LogSAD, without requiring per-category neural network training.
-
Simple and Intuitive Framework. The idea of combining local appearance and regional composition modeling is intuitive and well-motivated. The overall framework is easy to follow.
-
Comprehensive Experiments. The experimental evaluation is relatively thorough, including comparisons with existing methods, evaluations across different feature extractors and datasets, and detailed ablation studies that support the effectiveness of the proposed components.
Critical weaknesses
-
Limited Methodological Novelty. The proposed method mainly combines existing techniques for feature distribution modeling and anomaly score fusion. SFAD [1] already models the distribution of local elements to detect unusual combinations of normal features, while LogSAD explores score calibration and fusion for structural and logical anomaly detection. Although PARC introduces regional pattern statistics, its main components are largely based on existing techniques, raising concerns about its methodological novelty.
-
Potential Limitations of Simplified Composition Modeling. Unlike LogSAD, which explicitly models object-level composition rules, PARC represents logical anomalies through regional distributions of local visual patterns. Although this simplified representation offers significant computational advantages, it does not explicitly model object identities or their relationships. Consequently, valid variations in object arrangements may be incorrectly detected as anomalies, while logical violations that preserve similar regional pattern distributions may remain undetected. Although additional experiments are conducted on MVTec AD, VisA, and CAD-SD, the evaluation remains insufficient to demonstrate the effectiveness of this representation on more complex logical anomalies.
-
Limited Evidence for Spatial Composition Modeling. Although PARC emphasizes regional composition modeling, the ablation results suggest that spatial information contributes relatively modest improvements. Removing regional proportions or permuting patch locations reduces Combined AUROC by only 1.07 and 0.76 points, respectively, whereas replacing soft assignment with hard assignment causes a much larger drop of 4.22 points. These results raise the question of whether the performance gains primarily come from visual pattern statistics rather than spatial composition modeling. Further analysis would help clarify the actual contribution of spatial relationships to logical anomaly detection.
[1] Niv Cohen, et al. Set Features for Anomaly Detection, TMLR, 2024.
Questions for authors
-
Methodological Contribution. How does PARC differ from existing methods such as ComAD, CSAD, SFAD [1], and LogSAD? In particular, what are the key advantages of using implicit visual prototypes and regional statistics instead of explicit component representations or other composition modeling approaches?
-
Robustness to Unseen Normal Arrangements. How well can PARC distinguish unseen but valid object arrangements from genuine logical anomalies? For example, evaluating on unseen normal arrangements alongside abnormal configurations and reporting the corresponding false positive rates would help clarify the robustness of the proposed composition modeling.
-
Contribution of Spatial Information. In Table 5, removing regional proportions or permuting patch locations reduces Combined AUROC by only 1.07 and 0.76 points, respectively, while replacing soft assignment with hard assignment causes a larger drop of 4.22 points. Do these results suggest that PARC primarily benefits from visual pattern statistics rather than spatial composition modeling?
-
Spatial Matching. How does PARC's global nearest-neighbor matching with position-specific normalization compare with conventional feature matching methods such as PatchCore and spatially aware matching methods such as HETMM [2], particularly in handling normal variations in object positions and orientations?
-
Score Fusion. In Table 4, the final fusion improves Combined AUROC but reduces Logical AUROC from 90.88 to 89.42 compared with the composition score alone. What causes this degradation, and how does it affect the effectiveness of PARC for logical anomaly detection?
Overall, the paper demonstrates good experimental results, and I appreciate the efficiency of the proposed approach. However, my main concern is the capability and limitations of the simplified composition modeling, particularly whether it can reliably address the diverse and complex logical anomalies encountered in real-world industrial settings. A convincing clarification or additional evidence addressing this concern would positively influence my overall assessment and potentially lead me to increase my rating.
[2] Zixuan Chen, et al. Hard-Normal Example-Aware Template Mutual Matching for Industrial Anomaly Detection, IJCV, 2025.
7 comments
Author Responses to Reviewer uNTg (Part 2)
A1(part 2):
Advantages of implicit visual prototypes and regional statistics.
Efficiency is the primary practical advantage. Explicit methods generate component masks before measuring or matching objects. Using a large segmenter such as the Segment Anything Model (SAM) can add substantial latency. PARC instead computes prototype similarities, regional summaries, and statistical distances from existing features. To measure the extra computation, we time composition scoring and fusion. They add 1.83 ms/image. The result shows that composition can be added to appearance detection at low computational cost.
To compare full-system accuracy and runtime, Table 1 reports the default complete systems. ComAD and LogSAD use explicit components. None of these three methods requires target-category network training.
| Method | Combined AUROC (%) | Latency (ms/image) |
|---|---|---|
| ComAD | 82.01 | 168.39 |
| LogSAD | 90.24 | 2138.66 |
| PARC | 91.12 | 114.35 |
The results show that PARC has comparable or higher detection performance at lower system cost. LogSAD takes 18.7 times as long per image.
Implicit representation reduces preparation. Prototypes need not correspond to whole semantic parts: several patterns can describe one component, without specifying its name, precise boundary, or instance assignment. This avoids preparing component definitions, object matching, and product-specific rules. To compare detection without explicit rules under shared features and normal data, we use RADIO, DINOv2, and CLIP, with the same backbone weights and normal training images for both methods within each comparison. Neither method uses explicit rules. PARC outperforms LogSAD with all three backbones by 5.31–9.93 percentage points in Logical AUROC. The results show that PARC provides useful composition evidence without explicit rules.
We have clarified PARC's contributions and advantages in the Introduction (Page 2–3 of the revised manuscript). The representation and efficiency details are provided in Sections 3.3 (Page 5 of the revised manuscript) and 4.1 (Page 8 of the revised manuscript).
[1] Niv Cohen, Issar Tzachor, and Yedid Hoshen. Set Features for Anomaly Detection. TMLR, 2024.
Author Responses to Reviewer uNTg (Part 3)
Q2: Unseen valid arrangements and normal-reference coverage.
How well can PARC distinguish unseen but valid object arrangements from genuine logical anomalies? For example, evaluating on unseen normal arrangements alongside abnormal configurations and reporting the corresponding false positive rates would help clarify the robustness of the proposed composition modeling.
A2:
Thank you for suggesting this test.
PARC can accept some unseen valid arrangements consistent with the variation in normal references, but this ability depends largely on the diversity of valid arrangements represented in those references. If the references cover the relevant local position variations and an unseen arrangement merely recombines these known states, it is more likely to be accepted. If reference arrangements are relatively uniform and an unseen valid arrangement substantially changes regional distributions or context, it is more likely to be misclassified as anomalous. The connector and breakfast-box experiments demonstrate these two cases.
Next, we first explain how the mean and covariance can allow the model to accept unseen valid arrangements, then use two experiments to examine the role of normal reference coverage. The connector experiment tests unseen combinations of known local positions. The breakfast-box experiment tests a valid fruit order absent from the fitting references. Both experiments report normal false-positive rates to assess how well PARC accepts unseen valid arrangements and how this depends on normal reference coverage.
Mechanism. The mean describes the typical composition. Covariance describes which statistics vary and which vary together. Positions that vary normally can receive greater tolerance, while departures from stable relationships receive larger Mahalanobis scores. These statistics and the alarm threshold jointly determine acceptance, so every valid combination need not be observed.
We would like to clarify that the distinction between valid arrangements and genuine logical anomalies depends on the inspection requirements. Without explicit rules, normal examples need to reflect the permitted variations.
Splicing connectors: an unseen combination of known local states. We test whether PARC accepts an unseen combination of familiar positions. References include each connector in higher/lower positions, but one complete left–right combination is excluded from the reference bank, statistical fitting, and calibration. In the covered control, that combination replaces 10% of the references without changing their total number. We repeat this over all four combinations, with five-fold evaluation keeping each source group intact.
Both conditions use the same 532 normal test images. Each sets its threshold from normal calibration data at nominal 5% FPR. FPR is the proportion of normal images incorrectly flagged. Results use complete PARC fusion.
| Normal-reference condition | Normal false-positive rate ↓ |
|---|---|
| Target valid position combination not covered | 6.18% |
| Target valid position combination covered | 3.90% |
FPR increases by 2.28 percentage points. Each connector's local position is already represented, so the new combination can remain consistent with normal appearance and composition. The results show that PARC can accept some unseen valid combinations of these known local states.
Breakfast box: insufficiently represented fruit order. To test whether missing examples of a valid fruit order increase false alarms, we compare reference coverage. We fix reference count, final normal calibration images, test images, and the threshold-setting rule. Only coverage of the target valid fruit order in the fitting references changes. Each condition sets its threshold using the same normal calibration images.
| Normal references used to fit the statistics | Normal false-positive rate ↓ |
|---|---|
| Target valid fruit order not covered | 32.88% |
| Target valid fruit order covered | 3.62% |
Coverage lowers FPR by 29.26 percentage points. Fruit reordering can change both regional distributions and contextual features despite unchanged types/counts. Departures along directions that previously varied little can receive high scores. The results show that covering this valid order reduces false alarms by improving the appearance references and composition statistics.
The distinction is known local states versus insufficiently represented distributions. Connector positions recombine previously observed states. Fruit reordering can introduce larger changes not covered by the original references. This explains the different outcomes and supports prioritizing permitted variations missing from normal references.
We have added these experiments to Appendix G (Table 15) (Page 20 of the revised manuscript).
Author Responses to Reviewer uNTg (Part 1)
We would like to sincerely thank you for your efforts and valuable comments to improve our work!
Below we address your concerns.
Q1: Method contribution and implicit composition modeling.
A1(part 1):
Thank you for asking us to clarify the contribution.
PARC adds a composition check to local appearance detection using the same frozen features, without component masks, neural-network training for each product category, or explicit product rules. Position-normalized patch matching checks local defects. Continuous responses to normal prototypes—recurring visual feature patterns—describe regional composition. The two scores are calibrated using normal images and combined.
Differences from prior work.
SFAD describes feature sets using random-projection histograms and then applies nearest-neighbor scoring. Discrete bins ignore within-bin variation, and scoring requires retrieving normal descriptors. PARC jointly describes regions using continuous responses to normal prototypes, avoiding hard binning and nearest-neighbor retrieval of composition descriptors.
ComAD first extracts component regions and then measures their areas, colors, and counts. Errors in component boundaries or instance separation may affect subsequent decisions. PARC directly aggregates visual pattern responses without forming complete component regions, reducing dependence on segmentation quality and the cost of region postprocessing.
CSAD first generates component pseudo-labels and then trains a category-specific segmentation network, requiring additional data preparation and training. PARC builds normal composition statistics directly from frozen features, avoiding component pseudo-labels and category-specific network training and reducing adaptation costs for new products.
LogSAD relies on object segmentation, object matching, and product rules, adding inference cost and rule preparation. PARC computes pattern proportions, regional distributions, and their relationships from normal images, avoiding these steps and reducing inference and deployment costs.
This combination of continuous composition representation, independent local inspection, and shared features changes both the representation and the detection pipeline.