Professor, I-SENSE Fellow, Charles E. Schmidt Eminent Scholar in Engineering and Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, FL 33431, USA
Dr. Dimitris Pados
Professor, I-SENSE Fellow, Charles E. Schmidt Eminent Scholar in Engineering and Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, FL 33431, USA
It was shown recently that the K L1-norm principal components (L1-PCs) of a real-valued data matrix X ∈ R D×N (N data samples of D dimensions) can be exactly calculated with cost O(2 NK ) or, when advantageous, O(N dK - K + 1 ) where d=rank (X), K<;d. In applications where X is large (e.g., “big” data of large N and/or “heavy” data of large d), these costs are prohibitive. In this paper, we present a novel suboptimal algorithm for the calculation of the K <; d L1-PCs of X of cost O (ND min {N, D} + N 2 K 2 (K 2 + d)), which is comparable to that of standard L2-norm PC analysis. Our theoretical and experimental studies show that the proposed algorithm calculates the exact optimal L1-PCs with high frequency and achieves higher value in the L1-PC optimization metric than any known alternative algorithm of comparable computational cost. The superiority of the calculated L1-PCs over standard L2-PCs (singular vectors) in characterizing potentially faulty data/measurements is demonstrated with experiments in data dimensionality reduction and disease diagnosis from genomic data.
30 March 2018 in IEEE Transactions on Signal Processing
L1-norm Principal-Component Analysis (L1-PCA) of real-valued data has attracted significant research interest over the past decade. L1-PCA of complex-valued data remains to date unexplored despite the many possible applications (in communication systems, for example). In this paper, we establish theoretical and algorithmic foundations of L1-PCA of complex-valued data matrices. Specifically, we first show that, in contrast to the real-valued case for which an optimal polynomial-cost algorithm was recently reported by Markopoulos, Karystinos, and Pados, complex L1-PCA is formally NP-hard. Then, casting complex L1-PCA as a unimodular optimization problem, we present the first two suboptimal algorithms in the literature for its solution. Extensive experimental studies included in this paper illustrate the sturdy resistance of complex L1-PCA against faulty measurements/outliers in the processed data.
22 October 2013 in IEEE Transactions on Wireless Communications
We consider a secondary multi-hop cognitive radio network with decentralized control that operates cognitively to coexist with primary users. We propose a new spread-spectrum management paradigm, in which, unlike mainstream dynamic spectrum access research, digital waveforms are designed to occupy the entire available spectrum, and to adaptively track the interference profile at the receiver to maximize the link capacity while avoiding interference to primary users. In this context, we study the problem of maximizing the network throughput of a multi-hop network through joint routing and spread-spectrum channelization. We first propose a centralized formulation of the network control problem. We then propose an algorithm that can be seen as a distributed localized approximation of the throughput-maximizing policy. We refer to the proposed jointly-designed routing and code-division channelization algorithm as ROCH (Routing and cOde-division CHannelization). Specifically, power and spreading code are jointly selected to maximize the pre-detection secondary \mathrm{SINR} while providing quality of service guarantees to on-going primary and secondary transmissions, while the routing algorithm dynamically selects relays based on the network traffic dynamics and on the achievable data rates on different secondary links. We study the throughput and delay performance of ROCH through a extensive simulation experiments, which demonstrate the appeal of the proposed framework through significant performance gains compared to baseline solutions.
1 January 1999 in IEEE Transactions on Vehicular Technology
Standard Principal-Component Analysis (PCA) is known to be sensitive to outliers among the processed data. On the other hand, L1-norm-based PCA (L1-PCA) exhibits sturdy resistance against outliers, while it performs similar to standard PCA when applied to nominal or smoothly corrupted data [1]. Exact calculation of the K L1-norm Principal Components (L1-PCs) of a rank-r datamatrix X ∈ℝ D×N costs O(N (r-1)K+1 ) [1], [2]. In this work, we present reduced-rank L1-PCA (RR L1-PCA): a hybrid approach that approximates the K L1-PCs of X by the L1-PCs of its L2-norm-based rank-d approximation (d ≤ r), calculable exactly with reduced complexity O(N (d-1)K+1 ). The proposed method combines the denoising capabilities and low computation cost of standard PCA with the outlier-resistance of L1-PCA. RR L1-PCA is accompanied by formal performance guarantees as well as thorough numerical studies that corroborate its computational and corruption resistance merits.
25 June 2019 in EURASIP Journal on Advances in Signal Processing
Subspace-based direction-of-arrival (DoA) estimation commonly relies on the Principal-Component Analysis (PCA) of the sensor-array recorded snapshots. Therefore, it naturally inherits the sensitivity of PCA against outliers that may exist among the collected snapshots (e.g., due to unexpected directional jamming). In this work, we present DoA-estimation based on outlier-resistant L1-norm principal component analysis (L1-PCA) of the realified snapshots and a complete algorithmic/theoretical framework for L1-PCA of complex data through realification. Our numerical studies illustrate that the proposed DoA estimation method exhibits (i) similar performance to the conventional L2-PCA-based method, when the processed snapshots are nominal/clean, and (ii) significantly superior performance when the snapshots are faulty/corrupted.