Ammar Mesloub
Ammar Mesloub has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Karim Abed-Meraim
PRISME laboratory, University of Orlans, Orlans, France
5 shared publications - Adel Belouchrani
Electrical Engineering Department, LDCCP, Ecole Nationale Polytechnique, Algiers, Algeria
4 shared publications - Ibrahim Kakouche
Ecole Militaire Polytechnique
3 shared publications - Mohammed Nabil El Korso
L2S, Universit Paris-Saclay, Gif-sur-Yvette, France
3 shared publications - Mohamed Salah Azzaz
LSEN, École Militaire Polytechnique, Algiers, Algeria
2 shared publications - Abadlia Hamza
Ecole Militaire Polytechnique, Bordj El Bahri, Algeria
1 shared publication
Latest Publications
- 25 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 2808-2812
Maximum Likelihood for Logistic Regression Model With Incomplete and Hybrid-Type Covariates
Logistic regression is a fundamental and widely used statistical method for modeling binary outcomes based on covariates. However, the presence of missing data, particularly in settings involving hybrid covariates (a mix of discrete and continuous variables), poses significant challenges. In this paper, we propose a novel Expectation-Maximization based algorithm tailored for parameter estimation in logistic regression models with missing hybrid covariates. The proposed method is specifically designed to handle these complexities, delivering efficient parameter estimates. Through comprehensive simulations and real-world application, we demonstrate that our approach consistently outperforms traditional methods, achieving superior accuracy and reliability.
- 25 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 32 (10709908) , 2808-2812
Maximum Likelihood for Logistic Regression Model With Incomplete and Hybrid-Type Covariates
Logistic regression is a fundamental and widely used statistical method for modeling binary outcomes based on covariates. However, the presence of missing data, particularly in settings involving hybrid covariates (a mix of discrete and continuous variables), poses significant challenges. In this paper, we propose a novel Expectation-Maximization based algorithm tailored for parameter estimation in logistic regression models with missing hybrid covariates. The proposed method is specifically designed to handle these complexities, delivering efficient parameter estimates. Through comprehensive simulations and real-world application, we demonstrate that our approach consistently outperforms traditional methods, achieving superior accuracy and reliability.
- Open Access
- 11 October 2024
- Published by "IMS" Vogosca in Science, Engineering and Technology
- Vol. 4 (2) , 24-38
Motor Bearing Failure Identification Using Multiple Long Short-Term Memory Training Strategies
In the context of condition-based maintenance of rotating machines in manufacturing systems, the early diagnosis of possible faults related to rolling elements of the bearing is mainly based on techniques from artificial intelligence, namely, Machine Learning (ML) and Deep Learning (DL). Approaches based on using Deep Learning methods have been the most coveted in recent years. Among a variety of models, the type of architecture known as Long-Short-Term Memory (LSTM) of Recurrent Neural Network (RNN) has both the ability to capture long-term dependencies and to adapt to sequential data modeling. It is therefore able to work on data without any preprocessing. This paper studies using four types of LSTM networks to diagnose bearing faults in a classification approach. It aims to intervene on both the input parameters and the network architecture, to achieve high performance. The proposed method is carried out in two different ways. In the first case, the data inputs are raw frames of vibration signals. However, in the second case, the network inputs are pre-computed time-frequency features. The results clearly showed that LSTMs are more accurate with the latter.
- 11 October 2024
- Published by "IMS" Vogosca in Science, Engineering and Technology
- Vol. 4 (2) , 24-38
Open AccessMotor Bearing Failure Identification Using Multiple Long Short-Term Memory Training Strategies
In the context of condition-based maintenance of rotating machines in manufacturing systems, the early diagnosis of possible faults related to rolling elements of the bearing is mainly based on techniques from artificial intelligence, namely, Machine Learning (ML) and Deep Learning (DL). Approaches based on using Deep Learning methods have been the most coveted in recent years. Among a variety of models, the type of architecture known as Long-Short-Term Memory (LSTM) of Recurrent Neural Network (RNN) has both the ability to capture long-term dependencies and to adapt to sequential data modeling. It is therefore able to work on data without any preprocessing. This paper studies using four types of LSTM networks to diagnose bearing faults in a classification approach. It aims to intervene on both the input parameters and the network architecture, to achieve high performance. The proposed method is carried out in two different ways. In the first case, the data inputs are raw frames of vibration signals. However, in the second case, the network inputs are pre-computed time-frequency features. The results clearly showed that LSTMs are more accurate with the latter.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2257-2261
Joint Singular Value Decomposition: A New Algorithm for Complex Matrices
The Joint Singular Value Decomposition (JSVD) aims to find a pair of unitary matrices allowing a simultaneous diagonalization of a set of matrices. Based on Givens rotations, this paper proposes two approaches dealing with the JSVD problem in the complex domain. A new criterion is defined to set all diagonal entries to real and non-negative values. An indirect method based on complex to real transformation and a direct method exploiting justified steps of the first one are developed. Numerical simulations show the performance achieved by our algorithm in terms of JSVD quality and convergence rate.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2257-2261
Joint Singular Value Decomposition: A New Algorithm for Complex Matrices
The Joint Singular Value Decomposition (JSVD) aims to find a pair of unitary matrices allowing a simultaneous diagonalization of a set of matrices. Based on Givens rotations, this paper proposes two approaches dealing with the JSVD problem in the complex domain. A new criterion is defined to set all diagonal entries to real and non-negative values. An indirect method based on complex to real transformation and a direct method exploiting justified steps of the first one are developed. Numerical simulations show the performance achieved by our algorithm in terms of JSVD quality and convergence rate.
- 11 June 2024
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 133 (5-6) , 2861-2874
A hybrid approach for gearbox fault diagnosis based on deep learning techniques
- 11 June 2024
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 133 (5-6) , 2861-2874
A hybrid approach for gearbox fault diagnosis based on deep learning techniques
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31 (10709908) , 101-105
Generalized Unitary Joint Diagonalization Algorithm Based on Approximate Givens Rotations
Like the Joint Diagonalization of a unique set of matrices, Generalized Joint Diagonalization is an algebraic problem encountered in different applications such as data fusion and blind source separation. This paper proposes a new generalized unitary joint diagonalization approach based on the Jacobi iterative scheme using Givens rotations and simplified criterion, introducing three approximations. These approximations allowed us to reach a simultaneous estimation of different parameters. The first appears in the simplified criterion composed of entries doubly affected by the Givens rotations. The second approximation is in the Givens parameter using a small amplitude angle. The last approximation resides in keeping only the first order of transformed entries. Numerical experiments, including examples of joint blind audio source separation, are provided. The results show the effectiveness of the developed algorithm as compared to existing ones. The simultaneous estimation of different Givens rotations improves the algorithm's computation complexity and convergence rate
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31 (10709908) , 101-105
Generalized Unitary Joint Diagonalization Algorithm Based on Approximate Givens Rotations
Like the Joint Diagonalization of a unique set of matrices, Generalized Joint Diagonalization is an algebraic problem encountered in different applications such as data fusion and blind source separation. This paper proposes a new generalized unitary joint diagonalization approach based on the Jacobi iterative scheme using Givens rotations and simplified criterion, introducing three approximations. These approximations allowed us to reach a simultaneous estimation of different parameters. The first appears in the simplified criterion composed of entries doubly affected by the Givens rotations. The second approximation is in the Givens parameter using a small amplitude angle. The last approximation resides in keeping only the first order of transformed entries. Numerical experiments, including examples of joint blind audio source separation, are provided. The results show the effectiveness of the developed algorithm as compared to existing ones. The simultaneous estimation of different Givens rotations improves the algorithm's computation complexity and convergence rate
- 12 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 3667-3678
Extended Joint EVD Algorithm for Widely Linear ARMA Source Separation
In this paper, a new approximate joint diagonalization problem is formulated for the blind separation of possibly dependent sources, modelled as widely linear autoregressive moving average (WL-ARMA) signals. The latter modelling gives rise to two sets of matrix parameters, sharing each a specific diagonal structure transform. A new method is proposed to achieve the desired source separation using a novel extended joint eigen value decomposition (JEVD) of both sets of matrices. The separation method proceeds in two steps, the first one identifies the WL-ARMA parameters, while the second step identifies the separation matrix through the extended JEVD of two particular matrix sets. We have developed a new Jacobi-like JEVD algorithm based on Shear and Givens rotations. This algorithm, referred to as Extended Optimal Phase Joint Eigen Value Decomposition, realizes the simultaneous diagonalization of two sets of matrices with different structures and outperforms the existing algorithms in difficult scenarios. Simulation results are provided to illustrate the effectiveness of the proposed algorithm.
- 12 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 3667-3678
Extended Joint EVD Algorithm for Widely Linear ARMA Source Separation
In this paper, a new approximate joint diagonalization problem is formulated for the blind separation of possibly dependent sources, modelled as widely linear autoregressive moving average (WL-ARMA) signals. The latter modelling gives rise to two sets of matrix parameters, sharing each a specific diagonal structure transform. A new method is proposed to achieve the desired source separation using a novel extended joint eigen value decomposition (JEVD) of both sets of matrices. The separation method proceeds in two steps, the first one identifies the WL-ARMA parameters, while the second step identifies the separation matrix through the extended JEVD of two particular matrix sets. We have developed a new Jacobi-like JEVD algorithm based on Shear and Givens rotations. This algorithm, referred to as Extended Optimal Phase Joint Eigen Value Decomposition, realizes the simultaneous diagonalization of two sets of matrices with different structures and outperforms the existing algorithms in difficult scenarios. Simulation results are provided to illustrate the effectiveness of the proposed algorithm.
- 30 September 2022
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (3) , 1663-1684
Coherent Wideband Signals Direction Finding Using Subspace-Based Methods
- 30 September 2022
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 42 (3) , 1663-1684
Coherent Wideband Signals Direction Finding Using Subspace-Based Methods
- Open Access
- 16 November 2021
- Published by MDPI AG in Electronics
- Vol. 10 (22) , 2805
Joint Vital Signs and Position Estimation of Multiple Persons Using SIMO Radar
Respiration rate monitoring using ultra-wideband (UWB) radar is preferred because it provides contactless measurement without restricting the person’s privacy. This study considers a novel non-contact-based solution using a single-input multiple-output (SIMO) UWB impulse radar. In the proposed system, the collected radar data are converted to several narrow-band signals using the generalized Goertzel algorithm (GGA), which are used as the input of the designed phased arrays for position estimation. In this context, we introduce the incoherent signal subspace methods (ISSM) for the direction of arrivals (DOAs) and distance evaluation. Meanwhile, a beam focusing approach is used to determine each individual and estimate their breathing rate automatically based on a linearly constrained minimum variance (LCMV) beamformer. The experimental results prove that the proposed algorithm can achieve high estimation accuracy in a variety of test environments, with an error of 2%, 5%, and 2% for DOA, distance, and respiration rate, respectively.
- 16 November 2021
- Published by MDPI AG in Electronics
- Vol. 10 (22) , 2805
Open AccessJoint Vital Signs and Position Estimation of Multiple Persons Using SIMO Radar
Respiration rate monitoring using ultra-wideband (UWB) radar is preferred because it provides contactless measurement without restricting the person’s privacy. This study considers a novel non-contact-based solution using a single-input multiple-output (SIMO) UWB impulse radar. In the proposed system, the collected radar data are converted to several narrow-band signals using the generalized Goertzel algorithm (GGA), which are used as the input of the designed phased arrays for position estimation. In this context, we introduce the incoherent signal subspace methods (ISSM) for the direction of arrivals (DOAs) and distance evaluation. Meanwhile, a beam focusing approach is used to determine each individual and estimate their breathing rate automatically based on a linearly constrained minimum variance (LCMV) beamformer. The experimental results prove that the proposed algorithm can achieve high estimation accuracy in a variety of test environments, with an error of 2%, 5%, and 2% for DOA, distance, and respiration rate, respectively.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 46-49
Respiration Rate Estimation Using IR-UWB Radar Based on the Second Maximum Eigenvalues
Impulse Radio Ultra-Wide-Band (IR-UWB) radar is a promising technology for contact-less sensing applications, such as Vital Sign (VS) detection of human body. This paper presents a new approach for Respiration Rate (RR) estimation of a stationary person. The particularity of this approach is that does not require any pre-processing techniques. It is based on the estimation of the Second Maximum Eigenvalue (SME) using Singular Value Decomposition (SVD). To extract the VS signal, a packet of eigenvalues is acquired using a moving matrix window over the slow time direction of the radar data. Then applying a Fast Fourier Transform (FFT), the respiration rate can be easily estimated. Experiments are performed using a P440 (IR-UWB) radar. The results are encouraging and show that the proposed method effectively detects the VS with high accuracy even in low Signal to Noise Ratio (SNR) condition, such as in through the wall human detection scenario.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 46-49
Respiration Rate Estimation Using IR-UWB Radar Based on the Second Maximum Eigenvalues
Impulse Radio Ultra-Wide-Band (IR-UWB) radar is a promising technology for contact-less sensing applications, such as Vital Sign (VS) detection of human body. This paper presents a new approach for Respiration Rate (RR) estimation of a stationary person. The particularity of this approach is that does not require any pre-processing techniques. It is based on the estimation of the Second Maximum Eigenvalue (SME) using Singular Value Decomposition (SVD). To extract the VS signal, a packet of eigenvalues is acquired using a moving matrix window over the slow time direction of the radar data. Then applying a Fast Fourier Transform (FFT), the respiration rate can be easily estimated. Experiments are performed using a P440 (IR-UWB) radar. The results are encouraging and show that the proposed method effectively detects the VS with high accuracy even in low Signal to Noise Ratio (SNR) condition, such as in through the wall human detection scenario.
- 3 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 25 (10) , 1580-1584
Hybrid Joint Diagonalization Algorithms
This letter deals with a hybrid joint diagonalization problem considering both Hermitian and transpose congruence. Such problem can be encountered in certain noncircular signal analysis applications including blind source separation. We introduce new Jacobi-like algorithms using Givens or a combination of Givens and hyperbolic rotations. These algorithms are compared with state-of-the-art methods and their performance gain, especially in the high dimensional case, is assessed through simulation experiments including examples related to blind separation of noncircular sources.
- 3 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 25 (10) , 1580-1584
Hybrid Joint Diagonalization Algorithms
This letter deals with a hybrid joint diagonalization problem considering both Hermitian and transpose congruence. Such problem can be encountered in certain noncircular signal analysis applications including blind source separation. We introduce new Jacobi-like algorithms using Givens or a combination of Givens and hyperbolic rotations. These algorithms are compared with state-of-the-art methods and their performance gain, especially in the high dimensional case, is assessed through simulation experiments including examples related to blind separation of noncircular sources.