Abstract

Abstract
Quality inspection is a critical step in ensuring the quality and efficiency of textile production processes. With the increasing complexity and scale of modern textile manufacturing systems, the need for accurate and efficient quality inspection and defect detection techniques has become paramount. This paper compares supervised and unsupervised Machine Learning techniques for defect detection in the context of industrial textile production, in terms of their respective advantages and disadvantages, and their implementation and computational costs. We explore the use of an autoencoder for the detection of defects in textiles. The goal of this preliminary work is to find out if unsupervised methods can successfully train models with good performance without the need for defect labelled data. (c) 2023 The Authors. Published by Elsevier B.V.

Abstract
Quality inspection is crucial in the textile industry as it ensures that the final products meet the required standards. It helps detect and address defects, such as fabric flaws and stitching irregularities, enhancing customer satisfaction, and optimizing production efficiency by identifying areas of improvement, reducing waste, and minimizing rework. In the competitive textile market, it is vital for maintaining customer loyalty, brand reputation, and sustained success. Nonetheless, and despite the importance of quality inspection, it is becoming increasingly harder to hire and train people for such tedious and repetitive tasks. In this context, there is an increased interest in automated quality control techniques that can be used in the industrial domain. In this paper we describe a computer vision model for localizing and classifying different types of defects in textiles. The model developed achieved an mAP@0.5 of 0.96 on the validation dataset. While this model was trained with a publicly available dataset, we will soon use the same architecture with images collected from Jacquard looms in the context of a funded research project. This paper thus represents an initial validation of the model for the purposes of fabric defect detection.

Abstract
Distributed Machine Learning, in which data and learning tasks are scattered across a cluster of computers, is one of the answers of the field to the challenges posed by Big Data. Still, in an era in which data abounds, decisions must still be made regarding which specific data to use on the training of the model, either because the amount of available data is simply too large, or because the training time or complexity of the model must be kept low. Typical approaches include, for example, selection based on data freshness. However, old data are not necessarily outdated and might still contain relevant patterns. Likewise, relying only on recent data may significantly decrease data diversity and representativity, and decrease model quality. The goal of this paper is to compare different heuristics for selecting data in a distributed Machine Learning scenario. Specifically, we ascertain whether selecting data based on their characteristics (meta-features), and optimizing for maximum diversity, improves model quality while, eventually, allowing to reduce model complexity. This will allow to develop more informed data selection strategies in distributed settings, in which the criteria are not only the location of the data or the state of each node in the cluster, but also include intrinsic and relevant characteristics of the data. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

Abstract
As distributed and multi-organization Machine Learning emerges, new challenges must be solved, such as diverse and low-quality data or real-time delivery. In this paper, we use a distributed learning environment to analyze the relationship between block size, parallelism, and predictor quality. Specifically, the goal is to find the optimum block size and the best heuristic to create distributed Ensembles. We evaluated three different heuristics and five block sizes on four publicly available datasets. Results show that using fewer but better base models matches or outperforms a standard Random Forest, and that 32 MB is the best block size.