Research Repository

Matched detection in union of low-rank subspaces

Joneidi, M and Sadeghi, M and Ahmadi, P and Golesani, HB and Ghanbari, M (2014) Matched detection in union of low-rank subspaces. In: 2014 7th International Symposium on Telecommunications (IST), 2014-09-09 - 2014-09-11, Tehran, Iran.

Full text not available from this repository.


In his paper, a new detection approach based on sparse decomposition in terms of a union of learned subspaces is presented. It uses a dictionary that can be interpreted as a bank of matched subspaces. This improves the performance of signal detection, as it is a generalization for detectors and also exploits sparsity in its decision rule. The proposed detector shows a new trade-off for designing a suitable detector. We demonstrate the high efficiency of our method in the case of voice activity detection in speech processing.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: 7'th International Symposium on Telecommunications (IST'2014)
Uncontrolled Keywords: Union of subspaces model; sparse representation; signal detection; dictionary learning
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 31 Jul 2019 08:55
Last Modified: 15 Jan 2022 01:24

Actions (login required)

View Item View Item