Reconstruction of Sparse Signals From [ell] 1 Dimensionality-Reduced Cauchy Random Projections

• Published in: IEEE transactions on signal processing Vol. 60; no. 11; pp. 5725 - 5737
• Main Authors: Ramirez, Ana B, Arce, Gonzalo R, Otero, Daniel, Paredes, Jose-Luis, Sadler, Brian M
• Format: Journal Article
• Language: English
• Published: 01-11-2012
• Subjects: Algorithms; Approximation; Detection; Norms; Projection; Reconstruction; Reduction; Statistics
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2012.2208954

Dimension reduction methods via linear random projections are used in numerous applications including data mining, information retrieval and compressive sensing (CS). While CS has traditionally relied on normal random projections, corresponding to [ell] 2 distance preservation, a large body of work has emerged for applications where [ell] 1 approximate distances may be preferred. Dimensionality reduction in [ell] 1 often use Cauchy random projections that multiply the original data matrix bf B [isin] BBR n D with a Cauchy random matrix bf R [isin] BBR k n ( k [Lt] n ) , resulting in a projected matrix bf C [isin] BBR k D . In this paper, an analogous of the Restricted Isometry Property for dimensionality reduction in [ell] 1 is proposed using explicit tail bounds for the geometric mean of the random projections. A set of signal reconstruction algorithms from the Cauchy random projections are then developed given that the large suite of reconstruction algorithms developed in compressive sensing perform poorly due to the lack of finite second-order statistics in the projections. These algorithms are based on regularized coordinate-descent Myriad estimates using both [ell] 0 and Lorentzian norms as sparsity inducing terms.