Enforced clustering for zero-to-one-shot texture anomaly detection
摘要
Recent studies on anomaly detection (AD) for industrial products typically address the problem in an unsupervised manner, requiring only normal data for training. This approach alleviates the need for anomalous data but still requires a set of normal samples and often involves demanding computations. More recent methods aim to solve this problem in zero-, one-, or few-shot settings but suffer from performance drops or rely on additional contexts, such as language guidance and text encoding, which add overhead. This paper focuses on homogeneous textures and demonstrates how the problem can be addressed without any training samples or additional training (zero-shot), only requiring one normal sample (one-shot) for hyperparameter selection, which is an additional challenge in unsupervised settings. This is achieved by enforcing K-means clustering with