Reconstruction of signals from magnitudes of redundant representations: the complex case (Q300888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1304.1839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval with Polarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full spark frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: On signal reconstruction without phase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Painless reconstruction from magnitudes of frame coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vectorial Phase Retrieval of 1-D Signals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of signals from magnitudes of redundant representations: the complex case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertibility and robustness of phaseless reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving phase: injectivity and stability for phase retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art of frame theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable phase retrieval with low-redundancy frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic equations via phaselift when there are about as many equations as unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic characterization of injectivity in phase retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable optimizationless recovery from phaseless linear measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase retrieval: stability and recovery guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4775958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for existence of dual certificates in rank-one semidefinite problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal reconstruction from phase or magnitude / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum tomography under prior information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3231492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase recovery, MaxCut and complex semidefinite programming / rank
 
Normal rank

Latest revision as of 05:41, 12 July 2024

scientific article
Language Label Description Also known as
English
Reconstruction of signals from magnitudes of redundant representations: the complex case
scientific article

    Statements

    Reconstruction of signals from magnitudes of redundant representations: the complex case (English)
    0 references
    0 references
    29 June 2016
    0 references
    Novel necessary conditions for complex-valued signal reconstruction from magnitudes of frame coefficients are presented. Deterministic stability bounds (Lipschitz constants) and stochastic performance bounds (Cramer-Rao lower bound) are presented. The entire analysis is done canonically that is independent of a particular choice of basis. Then an optimization algorithm based on the least-square error is proposed and analyzed. The algorithm performance is compared to the theoretical lower bound given by the Cramer-Rao inequality.
    0 references
    frame
    0 references
    phase retrieval
    0 references
    Cramer-Rao lower bound
    0 references
    phaseless reconstruction
    0 references
    signal reconstruction
    0 references
    stability bounds
    0 references
    stochastic performance bounds
    0 references
    optimization algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references