Fetching the paper…
Reading the bibliography…
We consider signal reconstruction from the norms of subspace components generalizing standard phase retrieval problems.
R. W. Gerchberg and W. O. Saxton, A practical algorithm for the determination of the phase from image and diffraction plane pictures , Optik 35
1972
Earlier work this paper cites.
P. Delsarte, J. M. Goethals, and J. J. Seidel, Spherical codes and designs , Geom. Dedicata 6
1977
Earlier work this paper cites.
E. Bannai and R. Damerell, Tight spherical designs I , J. Math. Soc. Japan 31
1979
Earlier work this paper cites.
J. R. Fienup, Phase retrieval algorithms: a comparison , Applied Optics 21
1982
Earlier work this paper cites.
W. Fulton, Intersection theory , Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 2, Springer-Verlag, 1984
1984
Earlier work this paper cites.
M. L. Eaton, Group invariance applications in statistics , Regional Conference Series in Probability and Statistics, Institute of Mathematical Statistics, 1989
1989
Earlier work this paper cites.
P. Elias, Error-correcting codes for list decoding , IEEE Trans. Inform. Theory 37
1991
Earlier work this paper cites.
D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms , Springer, 1996
1996
Earlier work this paper cites.
J. Bochnak, M. Coste, and M. Roy, Real algebraic geometry , Springer-Verlag, 1998
1998
Earlier work this paper cites.
J. Czyzyk, M. Mesnier, and J. Moré, The NEOS server , IEEE Computational Science & Engineering 5
1998
Earlier work this paper cites.
R. Goodman and N. R. Wallach, Representations and invariants of the classical groups , Encyclopedia of Mathematics and its Applications, vol. 68, Cambridge University Press, 1998
1998
Earlier work this paper cites.
A. M. Cohen, H. Cuypers, and H. Sterk (eds.), Some tapas of computer algebra , Algorithms and Computation in Mathematics, vol. 4, Springer, 1999
1999
Earlier work this paper cites.
J. J. Seidel, Definitions for spherical designs , J. Statist. Plann. Inference 95
2001
Earlier work this paper cites.
F. Sottile, From enumerative geometry to solving systems of polynomial equations , vol. 2, Springer-Verlag, 2001
2001
Earlier work this paper cites.
C. Bachoc, R. Coulangeon, and G. Nebe, Designs in Grassmannian spaces and lattices , J. Algebraic Combinatorics 16
2002
Earlier work this paper cites.
H. H. Bauschke, P. L. Combettes, and D. R. Luke, Phase retrieval, error reduction algorithm, and Fienup variants: A view from convex optimization , J. Opt. Soc. Amer. A 19
2002
Earlier work this paper cites.
Y. Chikuse, Statistics on special manifolds , Lecture Notes in Statistics, Springer, New York, 2003
2003
Earlier work this paper cites.
C. Bachoc, E. Bannai, and R. Coulangeon, Codes and designs in Grassmannian spaces , Discrete Mathematics 277
2004
Cited alongside, same era.
R. B. Holmes and V. Paulsen, Optimal frames for erasures , Lin. Alg. Appl. 377
2004
Cited alongside, same era.
C. Bachoc, Designs, groups and lattices , J. Theor. Nombres Bordeaux (2005), 25–44
2005
Cited alongside, same era.
B. G. Bodmann and V. I. Paulsen, Frames, graphs and erasures , Lin. Alg. Appl. 404
2005
Cited alongside, same era.
P. de la Harpe and C. Pache, Cubature formulas, geometrical designs, reproducing kernels, and Markov operators , Infinite groups: geometric, combinatorial and dynamical aspects (Basel), vol. 248, Birkhäuser, 2005, pp. 219–267
2005
Cited alongside, same era.
A. Chai, M. Moscoso, and G. Papanicolaou, Array imaging using intensity-only measurements , Inverse Problems 27
2011
Later among the works it cites.
D. Gross, Recovering low-rank matrices from few coefficients in any basis , IEEE Trans. Inform. Theory 57
2011
Later among the works it cites.
Y. Plan and R. Vershynin, One-bit compressed sensing by linear programming , (2011)
2011
Later among the works it cites.
2012
Closest in time.
M. Ehler and K. Okoudjou, Minimization of the probabilistic p p -frame potential , J. Stat. Plann. Inference 142
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
by same author, Linear programming bounds for codes in Grassmannian spaces , IEEE Trans. Inf. Th. 52
2006
Cited alongside, same era.
R. Balan, P. Casazza, and D. Edidin, On signal reconstruction without phase , Appl. Comput. Harmon. Anal 20
2006
Cited alongside, same era.
P. T. Boufounos and R. G. Baraniuk, 1-bit compressive sensing , Proceedings of Conference on Information Science and Systems (CISS), Princeton, NJ, 2008
2008
Cited alongside, same era.
P. G. Casazza, G. Kutyniok, and S. Li, Fusion frames and distributed processing , Appl. Comput. Harmon. Anal. 25
2008
Cited alongside, same era.
V. Elser and R. P. Millane, Reconstruction of an object from its symmetry-averaged diffraction pattern , Acta Crystallographica Section A 64
2008
Cited alongside, same era.
R. Balan, B. G. Bodmann, P. G. Casazza, and D. Edidin, Painless reconstruction from magnitudes of frame coefficients , J. Fourier Anal. Appl. 15
2009
Cited alongside, same era.
G. Kutyniok, A. Pezeshki, R. Calderbank, and T. Liu, Robust dimension reduction, fusion frames, and Grassmannian packings , Appl. Comput. Harmon. Anal. 26
2009
Cited alongside, same era.
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices , Compressed sensing, Theory and Applications (Y. Eldar and G. Kutyniok, eds.), Cambridge University Press, 2012, pp. 210–268
2012
Closest in time.
2012
Closest in time.
C. Bachoc and M. Ehler, Tight p p -fusion frames , Appl. Comput. Harmon. Anal. 35
2013
Closest in time.
2013
Closest in time.
E. J. Candès, T. Strohmer, and V. Voroninski, PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming , Communications on Pure and Applied Mathematics, DOI:10.1002/cpa.21432 66
2013
Closest in time.
X. Li and V. Voroninski, Sparse signal recovery from quadratic measurements via convex programming , SIAM J. Math. Anal 45
2013
Closest in time.
E. J. Candès and X. Li., Solving quadratic equations via PhaseLift when there are about as many equations as unknowns , Foundations of Computational Mathematics 14
2014
Closest in time.
E. J. Cands̀, X. Li, and M. Soltanolkotabi, Phase retrieval from coded diffraction patterns , to appear in Appl. Comput. Harmon. Anal. (2014)
2014
Closest in time.
L. Demanet and P. Hand, Stable optimizationless recovery from phaseless linear measurements , J. Fourier Anal. Appl. 20
2014
Closest in time.
M. Ehler, M. Gräf, and F. Kiraly, Phase retrieval using cubatures of positive semidefinite matrices , arXiv (2014)
2014
Closest in time.
D. Gross, F. Krahmer, and R. Kueng, A partial derandomization of PhaseLift using spherical designs , to appear in J. Fourier Anal. Appl. (2014)
2014
Closest in time.