Abdelati Bourzik
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Abdelati Bourzik has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Belaid Bouikhalene
Laboratory of Innovation in Mathematics and Application in Information Technologies, Polydisciplinary Faculty, Sultan Moulay Slimane University, Beni Mellal, Morocco
4 shared publications Amal Hjouji
Faculty of Science, Sidi Mohamed Ben Abdellah University
2 shared publications- Amal Hjouji
Laboratory of Information, Signals, Automation and Cognitivism, Faculty of Science, Sidi Mohamed Ben Abdellah University, Fez, Morocco
2 shared publications - Amal Hjouji
Mechanical Engineering Department, Sidi Mohamed Ben Abdellah University, Morocco
2 shared publications Belaid Bouikhalene
Polydisciplinary Faculty, Sultan Moulay Slimane University
2 shared publicationsJaouad El-Mekkaoui
Higher School of Technology, Sidi Mohamed Ben Abdellah University
2 shared publications
Latest Publications
- 18 November 2025
- Published by Springer Nature
- p. 27-34
Optimized High-Order Dual Hahn Moments for Image and Signal Reconstruction
- 18 November 2025
- Published by Springer Nature
- p. 27-34
Optimized High-Order Dual Hahn Moments for Image and Signal Reconstruction
- 29 October 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 45 (5) , 3880-3901
Enhancing Object Recognition and Image Classification by New Optimized Invariant Charlier Moments and Machine Learning Techniques
- 29 October 2025
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 45 (5) , 3880-3901
Enhancing Object Recognition and Image Classification by New Optimized Invariant Charlier Moments and Machine Learning Techniques
- Open Access
- 25 July 2025
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 15 (2) , 955-974
Discrete Orthogonal Moment Descriptors Applied In Image Classification And Object Recognition Enhanced By Machine Learning Methods
Orthogonal moments play a crucial role in image analysis, including applications in image reconstruction and the extraction of consistent, robust features, making them essential for modern computational imaging. This study examines the effectiveness and performance evaluation of orthogonal: Tchebichef moments, Krawtchouk moments, Charlier moments, and Hahn moments for image reconstruction, feature description, and their application in image classification and object recognition using advanced machine learning techniques. We present the construction process of orthogonal image moments. Then the deriving of invariant moments based on Tchebichef, Krawtchouk, Charlier, and Hahn polynomials. These moments are then employed to generate feature vectors specifically tailored for image classification and object recognition tasks. To evaluate feature robustness, we conduct extensive classification experiments on two distinct image databases using K-Nearest Neighbors (K-NN) and Support Vector Machine (SVM) classifiers. The results demonstrate that invariant moments are highly effective at capturing discriminative image features and maintain reliable performance under various noise conditions, including salt-and-pepper noise, underscoring their applicability in real-world scenarios.
- 25 July 2025
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 15 (2) , 955-974
Open AccessDiscrete Orthogonal Moment Descriptors Applied In Image Classification And Object Recognition Enhanced By Machine Learning Methods
Orthogonal moments play a crucial role in image analysis, including applications in image reconstruction and the extraction of consistent, robust features, making them essential for modern computational imaging. This study examines the effectiveness and performance evaluation of orthogonal: Tchebichef moments, Krawtchouk moments, Charlier moments, and Hahn moments for image reconstruction, feature description, and their application in image classification and object recognition using advanced machine learning techniques. We present the construction process of orthogonal image moments. Then the deriving of invariant moments based on Tchebichef, Krawtchouk, Charlier, and Hahn polynomials. These moments are then employed to generate feature vectors specifically tailored for image classification and object recognition tasks. To evaluate feature robustness, we conduct extensive classification experiments on two distinct image databases using K-Nearest Neighbors (K-NN) and Support Vector Machine (SVM) classifiers. The results demonstrate that invariant moments are highly effective at capturing discriminative image features and maintain reliable performance under various noise conditions, including salt-and-pepper noise, underscoring their applicability in real-world scenarios.
- 26 June 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (16) , 16083-16104
Accurate image reconstruction by separable krawtchouk-charlier moments with automatic parameter selection using artificial bee colony optimization
- 26 June 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 84 (16) , 16083-16104
Accurate image reconstruction by separable krawtchouk-charlier moments with automatic parameter selection using artificial bee colony optimization
- Open Access
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Invariant Tchebichef And Krawtchouk Moments For Shape Recognition: A Performance Evaluation Study
In the last few decades, orthogonal invariant moments have become a considerable technique used in feature extraction. Thanks to their invariability against geometric transformations such as translation, scale changing, and rotation. This property makes them very useful in shape recognition and image classification tasks. In this paper, an application case and performance evaluation of the invariant moments derived from the known orthogonal Tchebichef and Krawtcouk polynomials are presented. The invariants are computed by creating a relationship between these moments and invariant geometric ones. These invariants are used to form an efficient vector of features. However, for performance evaluation, we adopt two classification models as input. The invariant descriptor vector is considered an input feature vector for classification models. The first model is a k-nearest neighbor, and the second is a neural network model. These models are used for handwritten digit classification in free-noise and different environmental noise types. In addition, the classification with the invariant method is also compared with the convolutional neural network image classifier. The results show the power and efficiency of invariant orthogonal moments in shape and pattern recognition.
- 18 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessInvariant Tchebichef And Krawtchouk Moments For Shape Recognition: A Performance Evaluation Study
In the last few decades, orthogonal invariant moments have become a considerable technique used in feature extraction. Thanks to their invariability against geometric transformations such as translation, scale changing, and rotation. This property makes them very useful in shape recognition and image classification tasks. In this paper, an application case and performance evaluation of the invariant moments derived from the known orthogonal Tchebichef and Krawtcouk polynomials are presented. The invariants are computed by creating a relationship between these moments and invariant geometric ones. These invariants are used to form an efficient vector of features. However, for performance evaluation, we adopt two classification models as input. The invariant descriptor vector is considered an input feature vector for classification models. The first model is a k-nearest neighbor, and the second is a neural network model. These models are used for handwritten digit classification in free-noise and different environmental noise types. In addition, the classification with the invariant method is also compared with the convolutional neural network image classifier. The results show the power and efficiency of invariant orthogonal moments in shape and pattern recognition.
- Open Access
- 24 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
A comparative study and performance evaluation of discrete Tchebichef moments for image analysis
Orthogonal moments seem to be less affected by noise ensuring minimal information redundancy, which leads to a great efficient capability of feature representation, extraction, and reconstruction. Based on discrete Tchebichef’s polynomials the image moments do not require any discretization assumptions like in Legendre moments for example. However, that makes Tchebichef moments more utilized in a wide range of applications (e.g: image analyses and recognition). This paper is a comparative study of such methods for extracting moments from gray-scale and binary images based on Tchebichef polynomials. The methods are compared and evaluated in terms of accuracy and computational time speed. Which is required in real-time applications, where image reconstruction capability from computed moments is analyzed and evaluated under speckle noise and free-noise cases.
- 24 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessA comparative study and performance evaluation of discrete Tchebichef moments for image analysis
Orthogonal moments seem to be less affected by noise ensuring minimal information redundancy, which leads to a great efficient capability of feature representation, extraction, and reconstruction. Based on discrete Tchebichef’s polynomials the image moments do not require any discretization assumptions like in Legendre moments for example. However, that makes Tchebichef moments more utilized in a wide range of applications (e.g: image analyses and recognition). This paper is a comparative study of such methods for extracting moments from gray-scale and binary images based on Tchebichef polynomials. The methods are compared and evaluated in terms of accuracy and computational time speed. Which is required in real-time applications, where image reconstruction capability from computed moments is analyzed and evaluated under speckle noise and free-noise cases.