Two-dimensional random projection

DOI10.1016/J.SIGPRO.2011.01.002zbMATH Open1213.94032OpenAlexW2150335228MaRDI QIDQ537260FDOQ537260

Hamid Abrishami Moghaddam, Massoud Babaie-Zadeh, Armin Eftekhari

Publication date: 19 May 2011

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.01.002

zbMATH Keywords

random projectionconcentration of measuresparse signal reconstruction

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probing the Pareto Frontier for Basis Pursuit Solutions
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• A simple proof of the restricted isometry property for random matrices
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Compressed sensing
• Random projections of smooth manifolds
• Concentration of measure and isoperimetric inequalities in product spaces
• The restricted isometry property and its implications for compressed sensing
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Atomic decomposition by basis pursuit
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Embeddings of surfaces, curves, and moving points in euclidean space
• Sampling signals with finite rate of innovation
• Extensions of compressed sensing
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• Underdetermined blind source separation using sparse representations
• On the stability of the basis pursuit in the presence of noise
• Generalized low rank approximations of matrices
• Compressive sensing for subsurface imaging using ground penetrating radar
• A simple test to check the optimality of a sparse signal approximation
• Two dictionaries matching pursuit for sparse decomposition of signals
• The Kantorovich and Some Related Inequalities
• A novel retinal identification system
• Incremental local linear fuzzy classifier in Fisher space

Cited In (4)

• Title not available (Why is that?)
• A two-dimensional sideways problem with random discrete data
• Probabilistic Two-dimensional Principal Component Analysis
• Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two

Uses Software

• PDCO
• SPGL1

This page was built for publication: Two-dimensional random projection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537260)