Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Article
- DOI: 10.1049/iet-spr.2015.0009
- Publisher: Institution of Engineering and Technology
- Abstract:
- 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
- Keywords:
- Signal processing ; Speech processing ; Speech recognition ; Decision rules ; Detection methods ; Generalisation ; High-efficiency ; Sparse decomposition ; Sparse signal representation ; Union of subspaces ; Voice activity detection ; Signal detection
- Source: IET Signal Processing ; Volume 10, Issue 1 , 2016 , Pages 55-62 ; 17519675 (ISSN)
- URL: http://digital-library.theiet.org/content/journals/10.1049/iet-spr.2015.0009