Invertibility and Robustness of Phaseless Reconstruction
Not on the map. Why?
Abstract (arXiv)
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bounds of any reconstruction algorithm. We show that robust and stable reconstruction requires additional redundancy than the critical threshold.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Aug 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1.
3 papers.
- 2022Permutation Invariant Representations with Applications to Graph Deep Learningcited by 20
- 2022Group-invariant max filteringcited by 18
- 2024Stability of sorting based embeddingscited by 3
- 2024Stability of sorting based embeddings7 Oct 2024
- 2022Group-invariant max filtering27 May 2022
- 2022Permutation Invariant Representations with Applications to Graph Deep Learning14 Mar 2022