Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We describe ways to define and calculate L1-norm signal subspaces that are less sensitive to outlying data than L2-calculated subspaces. We start with the computation of the L1maximum-projection principal component of a data matrix containing N signal samples of dimension D. We show that while the general problem is formally NP-hard in asymptotically large N, D, the case of engineering interest of fixed dimension D and asymptotically large sample size N is not. In particular, for the case where the sample size is less than the fixed dimension , we present in explicit form an optimal algorithm of computational cost 2N. For the case N ≥ D, we present an optimal algorithm of complexity O(ND). We generalize to multiple L1-max-projection components and present an explicit optimal L1subspace calculation algorithm of complexity O(NDK-K+1) where K is the desired number of L1principal components (subspace rank). We conclude with illustrations of L1-subspace signal processing in the fields of data dimensionality reduction, direction-of-arrival estimation, and image conditioning/restoration.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718
Stanley, R. P. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058520 · Cited by 676
Metadata
- Authors
- Markopoulos, P. P., Karystinos, G. N., & Pados, D. A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-10
- Volume
- 62
- Issue
- 19
- Pages
- 5046-5058
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1539726260
- Cited by
- 173
- References
- 2
- FWCI
- 15.45
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing. https://app.cochat.ai/papers/10.1109/tsp.2014.2338077
- The paper
- Markopoulos, P. P., Karystinos, G. N., & Pados, D. A. (2014). Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2014.2338077
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.