arXiv (All)
open access
Recovering linear images of sparse signals from indirect observations
In this paper, we develop and analyze techniques for recovering a linear image $Bx$ of an unknown signal $x$ from indirect noisy observation $ω=Ax+ξ$. It is {\em a priori} known that $x\in \cX$, a given convex compact set, and that $x$ is $s$-sparse---has at most $s$ nonvanishing entries. The propos
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Condition-Number Barrier in Sparse Least Squares#423952
- Rank-One Signal Recovery in Sparse Wishart Noise#1064707
- An Overview of Minimum Convex Cover and Maximum Hidden Set#180512
- An Overview of Minimum Convex Cover and Maximum Hidden Set#179650
- An Overview of Minimum Convex Cover and Maximum Hidden Set#179255
Record · ID 973782
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive