AHAbdeslam Hmimid
Abdeslam Hmimid
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abdeslam Hmimid has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hassan Qjidaa
Engineering Sciences Department, Faculty of Engineering Sciences, Private University of Fès, Fez 30000, Morocco
4 shared publications - Mhamed Sayyouri
Engineering, Systems and Applications Laboratory, National School of Applied Sciences, Sidi Mohamed Ben Abdellah University, Fes, Morocco
4 shared publications - Ayoub Azzayani
Finance, Entrepreneurship and Development laboratory, Faculty of Juridical, Economic and Social Sciences of Sale, Mohammed 5 University, Rabat, Morocco
1 shared publication - Hicham Karmouni
National School of Applied Sciences, Cadi Ayyad University, Marrakech, Morocco
1 shared publication
Latest Publications
- 30 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (5) , 7887-7910
A fast and accurate computation of 2D and 3D generalized Laguerre moments for images analysis
- 30 October 2020
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 80 (5) , 7887-7910
A fast and accurate computation of 2D and 3D generalized Laguerre moments for images analysis
- 12 October 2014
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 75 (1) , 547-571
Image analysis using separable discrete moments of Charlier-Hahn
- 12 October 2014
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 75 (1) , 547-571
Image analysis using separable discrete moments of Charlier-Hahn
- 4 September 2014
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (3) , 875-900
A Fast Computation of Novel Set of Meixner Invariant Moments for Image Analysis
- 4 September 2014
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (3) , 875-900
A Fast Computation of Novel Set of Meixner Invariant Moments for Image Analysis
- 25 October 2013
- Published by Optica Publishing Group in Journal of the Optical Society of America A
- Vol. 30 (11) , 2381-2394
Improving the performance of image classification by Hahn moment invariants
The discrete orthogonal moments are powerful descriptors for image analysis and pattern recognition. However, the computation of these moments is a time consuming procedure. To solve this problem, a new approach that permits the fast computation of Hahn’s discrete orthogonal moments is presented in this paper. The proposed method is based, on the one hand, on the computation of Hahn’s discrete orthogonal polynomials using the recurrence relation with respect to the variable instead of the order and the symmetry property of Hahn’s polynomials and, on the other hand, on the application of an innovative image representation where the image is described by a number of homogenous rectangular blocks instead of individual pixels. The paper also proposes a new set of Hahn’s invariant moments under the translation, the scaling, and the rotation of the image. This set of invariant moments is computed as a linear combination of invariant geometric moments from a finite number of image intensity slices. Several experiments are performed to validate the effectiveness of our descriptors in terms of the acceleration of time computation, the reconstruction of the image, the invariability, and the classification. The performance of Hahn’s moment invariants used as pattern features for a pattern classification application is compared with Hu [IRE Trans. Inform. Theory 8, 179 (1962)] and Krawchouk [IEEE Trans. Image Process. 12, 1367 (2003)] moment invariants.- 25 October 2013
- Published by Optica Publishing Group in Journal of the Optical Society of America A
- Vol. 30 (11) , 2381-2394
Improving the performance of image classification by Hahn moment invariants
The discrete orthogonal moments are powerful descriptors for image analysis and pattern recognition. However, the computation of these moments is a time consuming procedure. To solve this problem, a new approach that permits the fast computation of Hahn’s discrete orthogonal moments is presented in this paper. The proposed method is based, on the one hand, on the computation of Hahn’s discrete orthogonal polynomials using the recurrence relation with respect to the variable instead of the order and the symmetry property of Hahn’s polynomials and, on the other hand, on the application of an innovative image representation where the image is described by a number of homogenous rectangular blocks instead of individual pixels. The paper also proposes a new set of Hahn’s invariant moments under the translation, the scaling, and the rotation of the image. This set of invariant moments is computed as a linear combination of invariant geometric moments from a finite number of image intensity slices. Several experiments are performed to validate the effectiveness of our descriptors in terms of the acceleration of time computation, the reconstruction of the image, the invariability, and the classification. The performance of Hahn’s moment invariants used as pattern features for a pattern classification application is compared with Hu [IRE Trans. Inform. Theory 8, 179 (1962)] and Krawchouk [IEEE Trans. Image Process. 12, 1367 (2003)] moment invariants.