Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration

Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, the properties of natural signals are exploited to solve BIPs. For example, subspace constrain...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 63; no. 2; pp. 822 - 842
Main Authors:	Yanjun Li, Kiryung Lee, Bresler, Yoram
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Albedo Ambiguity blind gain and phase calibration Calibration Deconvolution Discrete Fourier transforms equivalence class Ill posed problems Information theory Inverse problems inverse rendering Lower bounds Mapping Mathematical models multichannel blind deconvolution Rendering (computer graphics) SAR autofocus sensor array processing Sensor arrays Sparse matrices Sparsity Subspace constraints Subspaces Tightness transformation group Transformations Uniqueness Vector space
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!