Binary sparse phase retrieval via simulated annealing (Q1793640): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Phase Retrieval via Matrix Completion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compressive Phase Retrieval via Generalized Approximate Message Passing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GESPAR: Efficient Phase Retrieval of Sparse Signals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2743942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of simulated annealing cooling strategies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Latest revision as of 20:41, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary sparse phase retrieval via simulated annealing |
scientific article |
Statements
Binary sparse phase retrieval via simulated annealing (English)
0 references
12 October 2018
0 references
Summary: This paper presents the Simulated Annealing Sparse PhAse Recovery (SASPAR) algorithm for reconstructing sparse binary signals from their phaseless magnitudes of the Fourier transform. The greedy strategy version is also proposed for a comparison, which is a parameter-free algorithm. Sufficient numeric simulations indicate that our method is quite effective and suggest the binary model is robust. The SASPAR algorithm seems competitive to the existing methods for its efficiency and high recovery rate even with fewer Fourier measurements.
0 references
