← Search

Karim Abed-Meraim

13 accepted papers

2024

Joint INDSCAL Decomposition Meets Blind Source Separation

ICASSP 2024accepted

This paper introduces TenSOFO, a novel tensor-based method specifically designed for blind source separation (BSS). Ten-SOFO presents a new efficient alternating direction method of multipliers framework, allowing for simultaneous decomposition of two symmetric third-order tensors under the individu…

Cited by 0SourceScholar
2024

Neural Network-Based Symbolic Regression for Empirical Modeling of the Behavior of a Planetary Gearbox

ICASSP 2024accepted

Gearbox condition monitoring and quality surveillance are crucial techniques to ensure safe and cost-efficient machine operations. In condition monitoring, the interpretation of the different vibration spectrum elements is still an open question, many works show that some predefined vibration models…

Cited by 0SourceScholar
2024

Tensorial Convolutive Blind Source Separation

ICASSP 2024accepted

In this paper, we investigate the problem of convolutive blind source separation (BSS) via tensor decomposition. A fundamental link between convolutive BSS and block-term decomposition (BTD) is established, forming the basis for our novel tensor-based convolutive BSS method, namely TCBSS. Specifical…

Cited by 1SourceScholar
2023

Robust Subspace Tracking with Contamination Mitigation via α-Divergence

ICASSP 2023accepted

We studied the problem of robust subspace tracking (RST) in contaminated environments. Leveraging the fast approximated power iteration and α-divergence, a novel robust algorithm called αFAPI was developed for tracking the underlying principal subspace of streaming data over time. αFAPI is fast and…

Cited by 0SourceScholar
2021

A Fast Randomized Adaptive CP Decomposition For Streaming Tensors

ICASSP 2021accepted

In this paper, we introduce a fast adaptive algorithm for CAN- DECOMP/PARAFAC decomposition of streaming three-way tensors using randomized sketching techniques. By leveraging randomized least-squares regression and approximating matrix multiplication, we propose an efficient first-order estimator t…

Cited by 0SourceScholar
2019

Adaptive Blind Sparse Source Separation Based on Shear and Givens Rotations

ICASSP 2019accepted

This paper addresses the problem of adaptive blind sparse source separation in the time domain of an over-determined instantaneous noisy mixture. A two-step approach is proposed: first, the data are projected on the signal subspace estimated using the principal subspace tracker FAPI. In the second s…

Cited by 0SourceScholar
2019

Decision Feedback Semi-blind Estimation Algorithm for Specular OFDM Channels

ICASSP 2019accepted

This paper deals with semi-blind channel estimation in Single-Input Single-Output (SISO) Orthogonal Frequency Division Multiplexing (OFDM) communications system. The proposed algorithm proceeds in two main stages. The first one addresses the pilot-based Time-Of-Arrival (TOA) estimation using subspac…

Cited by 0SourceScholar
2019

Sequential Structured Dictionary Learning for Block Sparse Representations

ICASSP 2019accepted

Dictionary learning algorithms have been successfully applied to a number of signal and image processing problems. In some applications however, the observed signals may have a multi-subpsace structure that enables block-sparse signal representations. Based on the observation that the observed signa…

Cited by 0SourceScholar
2018

Em-Based Semi-Blind Mimo-Ofdm Channel Estimation

ICASSP 2018accepted

This paper deals with semi-blind (SB) channel estimation of Multiple-Input Multiple-Output Orthogonal Frequency-Division Multiplexing (MIMO-OFDM) wireless communications system in the uplink transmission. Herein, we propose a new channel estimation approach using the well known EM technique. More pr…

Cited by 0SourceScholar
2016

Fast adaptive PARAFAC decomposition algorithm with linear complexity

ICASSP 2016accepted

We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has…

Cited by 0SourceScholar
2015

Multi-Modulus algorithms using hyperbolic and givens rotations for blind deconvolution of mimo systems

ICASSP 2015accepted

The issue of blind Multiple-Input and Multiple-Output (MIMO) deconvolution of communication system is addressed. Two new iterative Blind Source Separation (BSS) algorithms are presented, based on the minimization of Multi-Modulus (MM) criterion. A pre-whitening filter is utilized to transform the pr…

Cited by 0SourceScholar