Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/4C554AE2-82C8-4D29-BAF7-74BF048F051C | ||
| Year | 2013 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | P. P. Markopoulos, G. N. Karystinos, and D. A. Pados, “Some options for L1-subspace signal processing,” in Proc. IEEE - International Symposium on Wireless Communication Systems,( ISWCS '13) Aug, pp.1-5 | ||
| Appears in Collections |
We describe ways to define and calculate L1-norm signal subspaces which are less sensitive to outlying data than L2-calculated subspaces. We focus on the computation of the L1 maximum-projection principal component of a data matrix containing N signal samples of dimension D and conclude that the general problem is formally NP-hard in asymptotically large N, D. We prove, however, that the case of engineering interest of fixed dimension D and asymptotically large sample support N is not and we present an optimal algorithm of complexity O(N(exp D)). We generalize to multiple L1-max-projection components and present an explicit optimal L1 subspace calculation algorithm in the form of matrix nuclear-norm evaluations. We conclude with illustrations of L1-subspace signal processing in the fields of data dimensionality reduction and direction-of-arrival estimation
Copyright © DIAS 2013
