A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models

G. E. Bredon, Introduction to compact transformation groups . Academic press, 1972, vol. 46

1972

Earlier work this paper cites.

L. Taylor, “The phase retrieval problem,” IEEE Trans. Antennas Propag. , vol. 29, no. 2, pp. 386–391, Mar 1981

1981

Earlier work this paper cites.

J. R. Fienup, “Phase retrieval algorithms: a comparison,” Appl. Opt. , vol. 21, no. 15, pp. 2758–2769, Aug 1982

1982

Earlier work this paper cites.

A. Paulraj and T. Kailath, “Direction of arrival estimation by eigenstructure methods with unknown sensor gain and phase,” in Proc. Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP) , vol. 10. IEEE, Apr 1985, pp. 640–643

1985

Earlier work this paper cites.

E. Moulines, P. Duhamel, J. Cardoso, and S. Mayrargue, “Subspace methods for the blind identification of multichannel fir filters,” IEEE Trans. Signal Process. , vol. 43, no. 2, pp. 516–525, Feb 1995

1995

Earlier work this paper cites.

V. Sanchez, P. Garcia, A. Peinado, J. Segura, and A. Rubio, “Diagonalizing properties of the discrete cosine transforms,” IEEE Trans. Signal Process. , vol. 43, no. 11, pp. 2631–2641, Nov 1995

1995

Earlier work this paper cites.

D. Kundur and D. Hatzinakos, “Blind image deconvolution,” IEEE Signal Process. Mag. , vol. 13, no. 3, pp. 43–64, May 1996

1996

Earlier work this paper cites.

K. Abed-Meraim, W. Qiu, and Y. Hua, “Blind system identification,” Proc. IEEE , vol. 85, no. 8, pp. 1310–1322, Aug 1997

1997

Earlier work this paper cites.

D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 \ell_{1} minimization,” Proc. Natl. Acad. Sci. , vol. 100, no. 5, pp. 2197–2202, 2003

2003

Cited alongside, same era.

R. Morrison, M. Do, and J. Munson, D.C., “MCA: A multichannel approach to SAR autofocus,” IEEE Trans. Image Process. , vol. 18, no. 4, pp. 840–853, Apr 2009

2009

Cited alongside, same era.

R. Rubinstein, A. Bruckstein, and M. Elad, “Dictionaries for sparse representation modeling,” Proc. IEEE , vol. 98, no. 6, pp. 1045–1057, Jun 2010

2010

Cited alongside, same era.

D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in Proc. 25th Annu. Conf. Learning Theory (COLT) , vol. 23. JMLR, 2012, pp. 37.1–37.18

2012

Cited alongside, same era.

H. Q. Nguyen, S. Liu, and M. N. Do, “Subspace methods for computational relighting,” Proc. SPIE , vol. 8657, pp. 865 703.1–865 703.10, 2013

A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon, “Learning sparsely used overcomplete dictionaries via alternating minimization,” arXiv preprint arXiv:1310.7991 , 2013

Original

2013

Later among the works it cites.

S. Choudhary and U. Mitra, “Identifiability scaling laws in bilinear inverse problems,” arXiv preprint arXiv:1402.2637 , 2014

Original

2014

Later among the works it cites.

A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Trans. Inf. Theory , vol. 60, no. 3, pp. 1711–1732, Mar 2014

2014

Later among the works it cites.

E. J. Candès and X. Li, “Solving quadratic equations via phaselift when there are about as many equations as unknowns,” Found. Comput. Math. , vol. 14, no. 5, pp. 1017–1026, 2014

2014

Later among the works it cites.