Slide
Centre Interdisciplinaire
de Recherche et d’Innovation
en Cybersécurité et Société
de Recherche et d’Innovation
en Cybersécurité et Société
1.
Gapski, M. C. B.; Kawai, V. A. S.; Leticio, G. R.; Valem, L. P.; Pedronette, D. C. G.; Allili, M. S.
Graph Neural Networks for Semi-Supervised Image Classification with Multi-Feature Aggregation Journal Article
In: Journal of the Brazilian Computer Society, vol. 32, no. 1, pp. 1731–1754, 2026, ISSN: 01046500 (ISSN).
Abstract | Links | BibTeX | Tags: Classification accuracy, Convolution, Convolutional neural networks, extraction, Feature extraction, Feature extractor, Feature Fusion, Feature representation, Features fusions, Graph Neural Networks, Graph representation, Graph structures, Graph theory, Graphic methods, Image classification, Labeled data, Rank Aggregation, Semi-supervised, Semi-supervised image classification, Supervised image classifications, Textures
@article{gapskiGraphNeuralNetworks2026,
title = {Graph Neural Networks for Semi-Supervised Image Classification with Multi-Feature Aggregation},
author = {M. C. B. Gapski and V. A. S. Kawai and G. R. Leticio and L. P. Valem and D. C. G. Pedronette and M. S. Allili},
url = {https://www.scopus.com/pages/publications/105045179876?origin=resultslist},
doi = {10.5753/jbcs.2026.5880},
issn = {01046500 (ISSN)},
year = {2026},
date = {2026-01-01},
journal = {Journal of the Brazilian Computer Society},
volume = {32},
number = {1},
pages = {1731–1754},
publisher = {Brazilian Computing Society},
abstract = {Feature extraction involves the identification and extraction of salient characteristics or patterns, including edges, textures, shapes, and color attributes. Contemporary feature extractors predominantly leverage deep learning architectures, such as Convolutional Neural Networks (CNNs) and Vision Transformers (VITs). The availability of diverse feature extractors in the literature provides a wide range of feature representations. Features extracted from an image depend on the specific application, the chosen extractor, and its configuration. Therefore, integrating complementary information by combining distinct extractors offers a promising way to enhance performance. Graph Neural Networks (GNNs), particularly Graph Convolutional Networks (GCNs), have emerged as powerful and widely adopted approaches for semi-supervised image classification, as they effectively leverage both labeled and unlabeled data while exploiting the underlying graph structures that capture relationships among samples. This study proposes a novel approach for GNNs in scenarios where labeled data is scarce, by integrating diverse sets of feature and graph representations derived from various extractors in classification scenarios. Experimental investigations were conducted, encompassing combinations of distinct feature and graph extractors, as well as rank aggregation strategies. The primary contributions of this work are underscored by the experimental findings, which demonstrate that the strategic combination of feature and graph representations, coupled with the application of manifold learning for graph processing, leads to significant improvements in classification accuracy across the majority of experimental conditions. Furthermore, the utilization of rank aggregation techniques to integrate features from different extractors was shown to enhance classification accuracy. © 2026, Brazilian Computing Society. All rights reserved.},
keywords = {Classification accuracy, Convolution, Convolutional neural networks, extraction, Feature extraction, Feature extractor, Feature Fusion, Feature representation, Features fusions, Graph Neural Networks, Graph representation, Graph structures, Graph theory, Graphic methods, Image classification, Labeled data, Rank Aggregation, Semi-supervised, Semi-supervised image classification, Supervised image classifications, Textures},
pubstate = {published},
tppubtype = {article}
}
Feature extraction involves the identification and extraction of salient characteristics or patterns, including edges, textures, shapes, and color attributes. Contemporary feature extractors predominantly leverage deep learning architectures, such as Convolutional Neural Networks (CNNs) and Vision Transformers (VITs). The availability of diverse feature extractors in the literature provides a wide range of feature representations. Features extracted from an image depend on the specific application, the chosen extractor, and its configuration. Therefore, integrating complementary information by combining distinct extractors offers a promising way to enhance performance. Graph Neural Networks (GNNs), particularly Graph Convolutional Networks (GCNs), have emerged as powerful and widely adopted approaches for semi-supervised image classification, as they effectively leverage both labeled and unlabeled data while exploiting the underlying graph structures that capture relationships among samples. This study proposes a novel approach for GNNs in scenarios where labeled data is scarce, by integrating diverse sets of feature and graph representations derived from various extractors in classification scenarios. Experimental investigations were conducted, encompassing combinations of distinct feature and graph extractors, as well as rank aggregation strategies. The primary contributions of this work are underscored by the experimental findings, which demonstrate that the strategic combination of feature and graph representations, coupled with the application of manifold learning for graph processing, leads to significant improvements in classification accuracy across the majority of experimental conditions. Furthermore, the utilization of rank aggregation techniques to integrate features from different extractors was shown to enhance classification accuracy. © 2026, Brazilian Computing Society. All rights reserved.
2.
Valem, L. P.; Pedronette, D. C. G.; Allili, M. S.
Contrastive Loss Based on Contextual Similarity for Image Classification Proceedings Article
In: G., Bebis; V., Patel; J., Gu; J., Panetta; Y., Gingold; K., Johnsen; M.S., Arefin; S., Dutta; A., Biswas (Ed.): Lect. Notes Comput. Sci., pp. 58–69, Springer Science and Business Media Deutschland GmbH, 2025, ISBN: 03029743 (ISSN); 978-303177391-4 (ISBN), (Journal Abbreviation: Lect. Notes Comput. Sci.).
Abstract | Links | BibTeX | Tags: Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure
@inproceedings{valem_contrastive_2025,
title = {Contrastive Loss Based on Contextual Similarity for Image Classification},
author = {L. P. Valem and D. C. G. Pedronette and M. S. Allili},
editor = {Bebis G. and Patel V. and Gu J. and Panetta J. and Gingold Y. and Johnsen K. and Arefin M.S. and Dutta S. and Biswas A.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85218461565&doi=10.1007%2f978-3-031-77392-1_5&partnerID=40&md5=cf885303646c3b1a4f4eacb87d02a2b6},
doi = {10.1007/978-3-031-77392-1_5},
isbn = {03029743 (ISSN); 978-303177391-4 (ISBN)},
year = {2025},
date = {2025-01-01},
booktitle = {Lect. Notes Comput. Sci.},
volume = {15046 LNCS},
pages = {58–69},
publisher = {Springer Science and Business Media Deutschland GmbH},
abstract = {Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.},
note = {Journal Abbreviation: Lect. Notes Comput. Sci.},
keywords = {Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure},
pubstate = {published},
tppubtype = {inproceedings}
}
Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
3.
Valem, L. P.; Pedronette, D. C. G.; Allili, M. S.
Contrastive Loss Based on Contextual Similarity for Image Classification Proceedings Article
In: G., Bebis; V., Patel; J., Gu; J., Panetta; Y., Gingold; K., Johnsen; M.S., Arefin; S., Dutta; A., Biswas (Ed.): Lect. Notes Comput. Sci., pp. 58–69, Springer Science and Business Media Deutschland GmbH, 2025, ISBN: 03029743 (ISSN); 978-303177391-4 (ISBN), (Journal Abbreviation: Lect. Notes Comput. Sci.).
Abstract | Links | BibTeX | Tags: Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure
@inproceedings{valemContrastiveLossBased2025a,
title = {Contrastive Loss Based on Contextual Similarity for Image Classification},
author = {L. P. Valem and D. C. G. Pedronette and M. S. Allili},
editor = {Bebis G. and Patel V. and Gu J. and Panetta J. and Gingold Y. and Johnsen K. and Arefin M.S. and Dutta S. and Biswas A.},
url = {https://www.scopus.com/pages/publications/85218461565?origin=resultslist},
doi = {10.1007/978-3-031-77392-1_5},
isbn = {03029743 (ISSN); 978-303177391-4 (ISBN)},
year = {2025},
date = {2025-01-01},
booktitle = {Lect. Notes Comput. Sci.},
volume = {15046 LNCS},
pages = {58–69},
publisher = {Springer Science and Business Media Deutschland GmbH},
abstract = {Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.},
note = {Journal Abbreviation: Lect. Notes Comput. Sci.},
keywords = {Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure},
pubstate = {published},
tppubtype = {inproceedings}
}
Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
4.
Valem, L. P.; Pedronette, D. C. G.; Allili, M. S.
Contrastive Loss Based on Contextual Similarity for Image Classification Proceedings Article
In: G., Bebis; V., Patel; J., Gu; J., Panetta; Y., Gingold; K., Johnsen; M.S., Arefin; S., Dutta; A., Biswas (Ed.): Lect. Notes Comput. Sci., pp. 58–69, Springer Science and Business Media Deutschland GmbH, 2025, ISBN: 03029743 (ISSN); 978-303177391-4 (ISBN), (Journal Abbreviation: Lect. Notes Comput. Sci.).
Abstract | Links | BibTeX | Tags: Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure
@inproceedings{valemContrastiveLossBased2025,
title = {Contrastive Loss Based on Contextual Similarity for Image Classification},
author = {L. P. Valem and D. C. G. Pedronette and M. S. Allili},
editor = {Bebis G. and Patel V. and Gu J. and Panetta J. and Gingold Y. and Johnsen K. and Arefin M.S. and Dutta S. and Biswas A.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85218461565&doi=10.1007%2f978-3-031-77392-1_5&partnerID=40&md5=cf885303646c3b1a4f4eacb87d02a2b6},
doi = {10.1007/978-3-031-77392-1_5},
isbn = {03029743 (ISSN); 978-303177391-4 (ISBN)},
year = {2025},
date = {2025-01-01},
booktitle = {Lect. Notes Comput. Sci.},
volume = {15046 LNCS},
pages = {58–69},
publisher = {Springer Science and Business Media Deutschland GmbH},
abstract = {Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.},
note = {Journal Abbreviation: Lect. Notes Comput. Sci.},
keywords = {Adversarial machine learning, Classification accuracy, Contrastive Learning, Cross entropy, Experimental evaluation, Federated learning, Image classification, Image comparison, Image embedding, Images classification, Model generalization, Model robustness, Neighborhood information, Self-supervised learning, Similarity measure},
pubstate = {published},
tppubtype = {inproceedings}
}
Contrastive learning has been extensively exploited in self-supervised and supervised learning due to its effectiveness in learning representations that distinguish between similar and dissimilar images. It offers a robust alternative to cross-entropy by yielding more semantically meaningful image embeddings. However, most contrastive losses rely on pairwise measures to assess the similarity between elements, ignoring more general neighborhood information that can be leveraged to enhance model robustness and generalization. In this paper, we propose the Contextual Contrastive Loss (CCL) to replace pairwise image comparison by introducing a new contextual similarity measure using neighboring elements. The CCL yields a more semantically meaningful image embedding ensuring better separability of classes in the latent space. Experimental evaluation on three datasets (Food101, MiniImageNet, and CIFAR-100) has shown that CCL yields superior results by achieving up to 10.76% relative gains in classification accuracy, particularly for fewer training epochs and limited training data. This demonstrates the potential of our approach, especially in resource-constrained scenarios. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
5.
Yapi, D.; Mejri, M.; Allili, M. S.; Baaziz, N.
A learning-based approach for automatic defect detection in textile images Proceedings Article
In: A., Zaremba M. Sasiadek J. Dolgui (Ed.): IFAC-PapersOnLine, pp. 2423–2428, 2015, ISBN: 24058963 (ISSN), (Journal Abbreviation: IFAC-PapersOnLine).
Abstract | Links | BibTeX | Tags: Algorithms, Artificial intelligence, Automatic defect detections, Barium compounds, Bayes Classifier, Computational efficiency, Contourlets, Defect detection, Defect detection algorithm, Defects, Detection problems, Feature extraction, Feature extraction and classification, Gaussians, Image classification, Learning algorithms, Learning systems, Learning-based approach, Machine learning approaches, Mixture of generalized gaussians, Mixtures of generalized Gaussians (MoGG), Textile defect detection, Textile images, Textiles, Textures
@inproceedings{yapi_learning-based_2015,
title = {A learning-based approach for automatic defect detection in textile images},
author = {D. Yapi and M. Mejri and M. S. Allili and N. Baaziz},
editor = {Zaremba M. Sasiadek J. Dolgui A.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84953865559&doi=10.1016%2fj.ifacol.2015.06.451&partnerID=40&md5=3dd0ef4c27cbd55700f6511af5f46772},
doi = {10.1016/j.ifacol.2015.06.451},
isbn = {24058963 (ISSN)},
year = {2015},
date = {2015-01-01},
booktitle = {IFAC-PapersOnLine},
volume = {28},
number = {3},
pages = {2423–2428},
abstract = {This paper addresses the textile defect detection problem using a machine-learning approach. We propose a novel algorithm that uses supervised learning to classify textile textures in defect and non-defect classes based on suitable feature extraction and classification. We use statistical modeling of multi-scale contourlet image decomposition to obtain compact and accurate signatures for texture description. Our defect detection algorithm is based on two phases. In the first phase, using a training set of images, we extract reference defect-free signatures for each textile category. Then, we use the Bayes classifier (BC) to learn signatures of defected and non-defected classes. In the second phase, defects are detected on new images using the trained BC and an appropriate decomposition of images into blocks. Our algorithm has the capability to achieve highly accurate defect detection and localisation in textile textures while ensuring an efficient computational time. Compared to recent state-of-the-art methods, our algorithm has yielded better results on the standard TILDA database. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.},
note = {Journal Abbreviation: IFAC-PapersOnLine},
keywords = {Algorithms, Artificial intelligence, Automatic defect detections, Barium compounds, Bayes Classifier, Computational efficiency, Contourlets, Defect detection, Defect detection algorithm, Defects, Detection problems, Feature extraction, Feature extraction and classification, Gaussians, Image classification, Learning algorithms, Learning systems, Learning-based approach, Machine learning approaches, Mixture of generalized gaussians, Mixtures of generalized Gaussians (MoGG), Textile defect detection, Textile images, Textiles, Textures},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper addresses the textile defect detection problem using a machine-learning approach. We propose a novel algorithm that uses supervised learning to classify textile textures in defect and non-defect classes based on suitable feature extraction and classification. We use statistical modeling of multi-scale contourlet image decomposition to obtain compact and accurate signatures for texture description. Our defect detection algorithm is based on two phases. In the first phase, using a training set of images, we extract reference defect-free signatures for each textile category. Then, we use the Bayes classifier (BC) to learn signatures of defected and non-defected classes. In the second phase, defects are detected on new images using the trained BC and an appropriate decomposition of images into blocks. Our algorithm has the capability to achieve highly accurate defect detection and localisation in textile textures while ensuring an efficient computational time. Compared to recent state-of-the-art methods, our algorithm has yielded better results on the standard TILDA database. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
6.
Yapi, D.; Mejri, M.; Allili, M. S.; Baaziz, N.
A learning-based approach for automatic defect detection in textile images Proceedings Article
In: A., Zaremba M. Sasiadek J. Dolgui (Ed.): IFAC-PapersOnLine, pp. 2423–2428, 2015, ISBN: 24058963 (ISSN), (Journal Abbreviation: IFAC-PapersOnLine).
Abstract | Links | BibTeX | Tags: Algorithms, Artificial intelligence, Automatic defect detections, Barium compounds, Bayes Classifier, Computational efficiency, Contourlets, Defect detection, Defect detection algorithm, Defects, Detection problems, Feature extraction, Feature extraction and classification, Gaussians, Image classification, Learning algorithms, Learning systems, Learning-based approach, Machine learning approaches, Mixture of generalized gaussians, Mixtures of generalized Gaussians (MoGG), Textile defect detection, Textile images, Textiles, Textures
@inproceedings{yapiLearningbasedApproachAutomatic2015,
title = {A learning-based approach for automatic defect detection in textile images},
author = {D. Yapi and M. Mejri and M. S. Allili and N. Baaziz},
editor = {Zaremba M. Sasiadek J. Dolgui A.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84953865559&doi=10.1016%2fj.ifacol.2015.06.451&partnerID=40&md5=3dd0ef4c27cbd55700f6511af5f46772},
doi = {10.1016/j.ifacol.2015.06.451},
isbn = {24058963 (ISSN)},
year = {2015},
date = {2015-01-01},
booktitle = {IFAC-PapersOnLine},
volume = {28},
number = {3},
pages = {2423–2428},
abstract = {This paper addresses the textile defect detection problem using a machine-learning approach. We propose a novel algorithm that uses supervised learning to classify textile textures in defect and non-defect classes based on suitable feature extraction and classification. We use statistical modeling of multi-scale contourlet image decomposition to obtain compact and accurate signatures for texture description. Our defect detection algorithm is based on two phases. In the first phase, using a training set of images, we extract reference defect-free signatures for each textile category. Then, we use the Bayes classifier (BC) to learn signatures of defected and non-defected classes. In the second phase, defects are detected on new images using the trained BC and an appropriate decomposition of images into blocks. Our algorithm has the capability to achieve highly accurate defect detection and localisation in textile textures while ensuring an efficient computational time. Compared to recent state-of-the-art methods, our algorithm has yielded better results on the standard TILDA database. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.},
note = {Journal Abbreviation: IFAC-PapersOnLine},
keywords = {Algorithms, Artificial intelligence, Automatic defect detections, Barium compounds, Bayes Classifier, Computational efficiency, Contourlets, Defect detection, Defect detection algorithm, Defects, Detection problems, Feature extraction, Feature extraction and classification, Gaussians, Image classification, Learning algorithms, Learning systems, Learning-based approach, Machine learning approaches, Mixture of generalized gaussians, Mixtures of generalized Gaussians (MoGG), Textile defect detection, Textile images, Textiles, Textures},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper addresses the textile defect detection problem using a machine-learning approach. We propose a novel algorithm that uses supervised learning to classify textile textures in defect and non-defect classes based on suitable feature extraction and classification. We use statistical modeling of multi-scale contourlet image decomposition to obtain compact and accurate signatures for texture description. Our defect detection algorithm is based on two phases. In the first phase, using a training set of images, we extract reference defect-free signatures for each textile category. Then, we use the Bayes classifier (BC) to learn signatures of defected and non-defected classes. In the second phase, defects are detected on new images using the trained BC and an appropriate decomposition of images into blocks. Our algorithm has the capability to achieve highly accurate defect detection and localisation in textile textures while ensuring an efficient computational time. Compared to recent state-of-the-art methods, our algorithm has yielded better results on the standard TILDA database. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.