default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNasser Mourad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Nasser Mourad
:
Multivariate group-sparse mode decomposition. Digit. Signal Process. 137: 104024 (2023)- 2022
- [j9]Nasser Mourad:
ECG denoising based on successive local filtering. Biomed. Signal Process. Control. 73: 103431 (2022) - [j8]Nasser Mourad:
Group-sparse mode decomposition: A signal decomposition algorithm based on group-sparsity in the frequency domain. Digit. Signal Process. 122: 103375 (2022) - 2021
- [j7]Nasser Mourad:
Robust smoothing of one-dimensional data with missing and/or outlier values. IET Signal Process. 15(5): 323-336 (2021) - 2020
- [j6]Nasser Mourad:
New algorithm based on group sparsity for correcting wideband noise in ECG recordings. Biomed. Signal Process. Control. 59: 101935 (2020)
2010 – 2019
- 2019
- [j5]Nasser Mourad:
ECG denoising algorithm based on group sparsity and singular spectrum analysis. Biomed. Signal Process. Control. 50: 62-71 (2019) - [j4]Nasser Mourad:
New two-stage approach to ECG denoising. IET Signal Process. 13(6): 596-605 (2019) - 2018
- [j3]Nasser Mourad:
Automatic correction of short-duration artefacts in single-channel EEG recording: a group-sparse signal denoising algorithm. IET Signal Process. 12(4): 549-557 (2018) - 2017
- [j2]Nasser Mourad, James P. Reilly, Thia Kirubarajan:
Majorization-minimization for blind source separation of sparse sources. Signal Process. 131: 120-133 (2017) - 2013
- [c8]Nasser Mourad, Rami K. Niazy:
Automatic correction of eye blink artifact in single channel EEG recording using EMD and OMP. EUSIPCO 2013: 1-5 - 2012
- [c7]Nasser Mourad, James P. Reilly:
Automatic threshold estimation for Iterative Shrinkage Algorithms used with compressed sensing. ICASSP 2012: 2721-2724 - 2010
- [j1]Nasser Mourad, James P. Reilly:
Minimizing nonconvex functions for sparse vector reconstruction. IEEE Trans. Signal Process. 58(7): 3485-3496 (2010) - [c6]Nasser Mourad, James P. Reilly:
Blind extraction of sparse sources. ICASSP 2010: 2666-2669 - [c5]Nasser Mourad, James P. Reilly:
Modified hierarchical clustering for sparse component analysis. ICASSP 2010: 2674-2677 - [c4]Nasser Mourad, James P. Reilly, Gary Hasey, Duncan MacCrimmon:
Temporally constrained SCA with applications to EEG data. ICASSP 2010: 4138-4141
2000 – 2009
- 2009
- [c3]Nasser Mourad, James P. Reilly:
lP minimization for sparse vector reconstruction. ICASSP 2009: 3345-3348 - 2008
- [c2]Nasser Mourad, James P. Reilly, Laurel J. Trainor, Bernhard Ross:
Iterative enhancement of event related potentials through sparsity constraints. EUSIPCO 2008: 1-5 - 2007
- [c1]Nasser Mourad, James P. Reilly, Hubert de Bruin, Gary Hasey, Duncan MacCrimmon:
A Simple and Fast Algorithm for Automatic Suppression of High-Amplitude Artifacts in EEG Data. ICASSP (1) 2007: 393-396
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
