Compressive Classification: Where Wireless Communications Meets Machine Learning

DOI10.1007/978-3-319-16042-9_15zbMath1332.94011OpenAlexW1017739138MaRDI QIDQ3460843

Miguel R. D. Rodrigues, Matthew Nokleby, Robert Calderbank, Francesco Renna

Publication date: 8 January 2016

Published in: Compressed Sensing and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16042-9_15

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A group-theoretic framework for the construction of packings in Grassmannian spaces
• A geometric analysis of subspace clustering with outliers
• Quantum computation in quantum-Hall systems.
• Robust subspace clustering
• Discrimination on the Grassmann Manifold: Fundamental Limits of Subspace Classifiers
• Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds
• Some Techniques for Assessing Multivarate Normality Based on the Shapiro- Wilk W
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
• Systematic design of unitary space-time constellations
• Reconstruction of Signals Drawn From a Gaussian Mixture Via Noisy Compressive Measurements
• Bounds on the Number of Measurements for Reliable Compressive Classification
• Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
• Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
• Communications-Inspired Projection Design with Application to Compressive Sensing
• Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
• Grassmannian Packings From Operator Reed–Muller Codes
• Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• Metrics and models for handwritten character recognition

This page was built for publication: Compressive Classification: Where Wireless Communications Meets Machine Learning