Mohsen Joneidi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohsen Joneidi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Alireza Zaeemzadeh
School of Electrical Engineering and Computer Science University of Central Florida
1 shared publication - Behzad Shahrasbi
School of Electrical Engineering and Computer Science University of Central Florida 32816 Orlando FL
1 shared publication Mostafa Sadeghi
Department of Electrical Engineering Sharif University of Technology Tehran 145888‐9694 Islamic Republic of Iran
1 shared publicationNazanin Rahnavard
Department of Electrical Engineering and Computer Science University of Central Florida Orlando 32826 USA
1 shared publication- Nazanin Rahnavard
Electrical Engineering and Computer Science, University of Central Florida, Orlando, Florida United States 32816
1 shared publication Parvin Ahmadi
Department of Electrical Engineering Sharif University of Technology Tehran 145888‐9694 Islamic Republic of Iran
1 shared publication
Latest Publications
- Open Access
- 1 February 2016
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 10 (1) , 55-62
Union of low‐rank subspaces detector
The problem of signal detection using a flexible and general model is considered. Owing to applicability and flexibility of sparse signal representation and approximation, it has attracted a lot of attention in many signal processing areas. In this study, the authors propose a new detection method based on sparse decomposition in a union of subspaces model. Their proposed detector uses a dictionary that can be interpreted as a bank of matched subspaces. This improves the performance of signal detection, as it is a generalisation for detectors. Low‐rank assumption for the desired signals implies that the representations of these signals in terms of some proper bases would be sparse. Their proposed detector exploits sparsity in its decision rule. They demonstrate the high efficiency of their method in the cases of voice activity detection in speech processing.
- 1 February 2016
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 10 (1) , 55-62
Open AccessUnion of low‐rank subspaces detector
The problem of signal detection using a flexible and general model is considered. Owing to applicability and flexibility of sparse signal representation and approximation, it has attracted a lot of attention in many signal processing areas. In this study, the authors propose a new detection method based on sparse decomposition in a union of subspaces model. Their proposed detector uses a dictionary that can be interpreted as a bank of matched subspaces. This improves the performance of signal detection, as it is a generalisation for detectors. Low‐rank assumption for the desired signals implies that the representations of these signals in terms of some proper bases would be sparse. Their proposed detector exploits sparsity in its decision rule. They demonstrate the high efficiency of their method in the cases of voice activity detection in speech processing.
- Open Access
Missing Spectrum-Data Recovery in Cognitive Radio Networks Using Piecewise Constant Nonnegative Matrix Factorization
In this paper, we propose a missing spectrum data recovery technique for cognitive radio (CR) networks using Nonnegative Matrix Factorization (NMF). It is shown that the spectrum measurements collected from secondary users (SUs) can be factorized as product of a channel gain matrix times an activation matrix. Then, an NMF method with piecewise constant activation coefficients is introduced to analyze the measurements and estimate the missing spectrum data. The proposed optimization problem is solved by a Majorization-Minimization technique. The numerical simulation verifies that the proposed technique is able to accurately estimate the missing spectrum data in the presence of noise and fading.
Open AccessMissing Spectrum-Data Recovery in Cognitive Radio Networks Using Piecewise Constant Nonnegative Matrix Factorization
In this paper, we propose a missing spectrum data recovery technique for cognitive radio (CR) networks using Nonnegative Matrix Factorization (NMF). It is shown that the spectrum measurements collected from secondary users (SUs) can be factorized as product of a channel gain matrix times an activation matrix. Then, an NMF method with piecewise constant activation coefficients is introduced to analyze the measurements and estimate the missing spectrum data. The proposed optimization problem is solved by a Majorization-Minimization technique. The numerical simulation verifies that the proposed technique is able to accurately estimate the missing spectrum data in the presence of noise and fading.