Files in this item

FilesDescriptionFormat

application/pdf

application/pdfLI-THESIS-2015.pdf (598kB)
(no description provided)PDF

Description

Title:A unified framework for identifiability analysis in bilinear inverse problems
Author(s):Li, Yanjun
Advisor(s):Bresler, Yoram
Department / Program:Electrical & Computer Engineering
Discipline:Electrical & Computer Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Bilinear inverse problem
Blind deconvolution
Blind gain and phase calibration
Uniqueness
Transformation group
Abstract: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, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some success in practice. However, there are few results on uniqueness in BIPs. For most BIPs, the fundamental question of under what condition the problem admits a unique solution, is yet to be answered. As an effort to address the question, we propose a unified framework for identifiability analysis in BIPs. We define identifiability of a BIP up to a group of transformations. Then we derive necessary and sufficient conditions for such identifiability, i.e., the conditions under which the solutions can be uniquely determined up to the transformation group. Blind gain and phase calibration (BGPC) is a structured bilinear inverse problem, which arises in many applications, including inverse rendering in computational relighting (albedo estimation with unknown lighting), blind phase and gain calibration in sensor array processing, and multichannel blind deconvolution (MBD). Applying our unified framework to BGPC, we derive sufficient conditions for unique recovery under several scenarios, including subspace, joint sparsity, and sparsity models. For BGPC with joint sparsity or sparsity constraints, we develop a procedure to compute the transformation groups corresponding to inherent ambiguities. We also give necessary conditions in the form of tight lower bounds on sample complexities, and demonstrate the tightness of these bounds by numerical experiments. Blind deconvolution (BD), the resolution of a signal and a filter given their convolution, is another bilinear inverse problem routinely encountered in signal processing and communications. Existing theoretical analysis on uniqueness in BD is rather limited. We derive sufficient conditions under which two vectors can be uniquely identified from their circular convolution, subject to subspace or sparsity constraints. These sufficient conditions provide the first algebraic sample complexities for BD. We first derive a sufficient condition that applies to almost all bases or frames. Then we impose a sub-band structure on one basis, and derive a less demanding sufficient condition, which is essentially optimal, using our unified framework. We present the extensions of these results to BD with sparsity constraints or mixed constraints, with the sparsity level replacing the subspace dimension. The cost for the unknown support in this case is an extra factor of 2 in the sample complexity.
Issue Date:2015-07-08
Type:Thesis
URI:http://hdl.handle.net/2142/87995
Rights Information:Copyright 2015 Yanjun Li
Date Available in IDEALS:2015-09-29
Date Deposited:August 201


This item appears in the following Collection(s)

Item Statistics