Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints

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.

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.

T. Chan and C.-K. Wong, “Total variation blind deconvolution,” IEEE Trans. Image Process. , vol. 7, no. 3, pp. 370–375, Mar 1998

1998

Earlier work this paper cites.

G. Harikumar and Y. Bresler, “FIR perfect signal reconstruction from multiple convolutions: minimum deconvolver orders,” IEEE Trans. Signal Process. , vol. 46, no. 1, pp. 215–218, Jan 1998

1998

Earlier work this paper cites.

J. Litwin, L.R., “Blind channel equalization,” IEEE Potentials , vol. 18, no. 4, pp. 9–12, Oct 1999

1999

Earlier work this paper cites.

O. Yilmaz, Seismic Data Analysis: Processing, Inversion, and Interpretation of Seismic Data . Society of Exploration Geophysicists, 2001

2001

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.

K. Herrity, R. Raich, and A. O. Hero III, “Blind reconstruction of sparse images with unknown point spread function,” Proc. SPIE , vol. 6814, pp. 68 140K.1–68 140K.11, 2008

2008

Cited alongside, same era.

M. Salman Asif, W. Mantzel, and J. Romberg, “Random channel coding and blind deconvolution,” in Proc. 47th Annu. Allerton Conf. Commun., Control, and Computing , Sept 2009, pp. 1021–1025

2009

Cited alongside, same era.

P. A. Naylor and N. D. Gaubitch, Speech Dereverberation , 1st ed. Springer, 2010

2010

Cited alongside, same era.

D. Krishnan, T. Tay, and R. Fergus, “Blind deconvolution using a normalized sparsity measure,” in Proc. Conf. Comput. Vision and Pattern Recognition (CVPR) . IEEE, June 2011, pp. 233–240

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.

——, “Sparse blind deconvolution: What cannot be done,” in Proc. Int. Symp. Inform. Theory (ISIT) . IEEE, June 2014, pp. 3002–3006

2014

Later among the works it cites.

Y. Li, K. Lee, and Y. Bresler, “Identifiability of blind deconvolution with subspace or sparsity constraints,” in Signal Process. with Adaptive Sparse Structured Representations (SPARS) , 2015

2015

Closest in time.

A. Repetti, M. Pham, L. Duval, E. Chouzenoux, and J.-C. Pesquet, “Euclid in a taxicab: Sparse blind deconvolution with smoothed ℓ 1 \ell_{1} / ℓ 2 \ell_{2} regularization,” IEEE Signal Process. Lett. , vol. 22, no. 5, pp. 539–543, May 2015

2015

Closest in time.

S. Ling and T. Strohmer, “Self-calibration and biconvex compressive sensing,” arXiv preprint arXiv:1501.06864 , 2015