{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/87995"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/87995","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A unified framework for identifiability analysis in bilinear inverse problems","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Li, Yanjun"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engineering","degree_department":null,"school":null,"contributors":["Bresler, Yoram"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-29T20:38:00Z","date_published":"2015-09-29T20:38:00Z","updated_at":"2026-07-22T22:26:31Z","subjects":["Bilinear inverse problem","Blind deconvolution","Blind gain and phase calibration","Uniqueness","Transformation group"],"languages":["en"],"rights":["Copyright 2015 Yanjun Li"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/87995","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bresler, Yoram"]},{"key":"dc:creator","label":"Author","values":["Li, Yanjun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-29T20:38:00Z","2015-08","2015-07-08","2015-8"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bilinear inverse problem","Blind deconvolution","Blind gain and phase calibration","Uniqueness","Transformation group"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Yanjun Li"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/87995"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Yanjun Li, accepted the attached license on 2015-07-03 at 13:22.","The student, Yanjun Li, submitted this Thesis for approval on 2015-07-03 at 13:45.","This Thesis was approved for publication on 2015-07-08 at 13:49.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8340 on 2015-09-29 at 13:21:55","Made available in DSpace on 2015-09-29T20:38:00Z (GMT). No. of bitstreams: 25 LI-THESIS-2015.pdf: 597999 bytes, checksum: 58da81f8ae2c4f9e224e58602f7a31e6 (MD5) 2dperiodic-1.png: 298 bytes, checksum: 33fd467777bb3802c4528ad1bb168baa (MD5) 2dperiodic-2.png: 301 bytes, checksum: bcee3a9eeb1fe4e4a55f48f205f9f13a (MD5) 2dperiodic.tex: 3493 bytes, checksum: 205faec2f83af4541e97c931cc1d0edd (MD5) abs.tex: 2771 bytes, checksum: 0511c48c2b968d4d1aa7cb40c8e6c6ef (MD5) ack.tex: 839 bytes, checksum: 47a9862f381fbb8a11853f22ed6e411b (MD5) apx.tex: 20581 bytes, checksum: 2e8f3f9dd1a676e565f0114843c2045b (MD5) chap1.tex: 19570 bytes, checksum: 790937268ca29f7be19b6bc564260b58 (MD5) chap2.tex: 18331 bytes, checksum: fda5c694a458fc40091ea66bf76556a7 (MD5) chap3.tex: 76068 bytes, checksum: 59faf558b57a0fae3a9f05c3f91f0da8 (MD5) chap4.tex: 36980 bytes, checksum: 63d9931d04a50638b0f50e81c251cdb7 (MD5) chap5.tex: 4223 bytes, checksum: b2f916fb85f5d0044891524b99a52ccb (MD5) filterbank.png: 19036 bytes, checksum: 23615fc78b2f90379c6d8908ded61384 (MD5) idbip.tex: 6582 bytes, checksum: 702394472e46a3cf10d6009ee14e0aea (MD5) ideal_a.tex: 9595 bytes, checksum: c575713c1094e814f472ab177dedceb1 (MD5) ideal_b.tex: 9830 bytes, checksum: f81d82a381ed08af680e28b63ea76579 (MD5) msthesis.bbl: 11621 bytes, checksum: d79c4219058fe2b5e4ca50829a000eed (MD5) ptjs-1.png: 319 bytes, checksum: ed97cacec1aca8ff5525f8da19fe248f (MD5) ptjs.tex: 29326 bytes, checksum: 66a7178e019421f54d48bfdc1c5b2cde (MD5) ptss-1.png: 305 bytes, checksum: 8dd2b991ce65a08004abcc040e08e7ad (MD5) ptss.tex: 29326 bytes, checksum: 3db95365ee3a83b7928036e6a161e3dc (MD5) sbsb_a.tex: 16831 bytes, checksum: db6940b3e4a3bb3ac5b27e1e0086ca2a (MD5) sbsb_b.tex: 17333 bytes, checksum: b63944ea389e6ff6f0629ca5d786061a (MD5) uiucecethesis09.cls: 22309 bytes, checksum: dbfcb6ce43781de390491449cbb14480 (MD5) LICENSE.txt: 4206 bytes, checksum: b0c3dc3e6e2ad5ca0b5570144988d2ed (MD5) Previous issue date: 2015-07-08"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A unified framework for identifiability analysis in bilinear inverse problems"]}]}],"canonical_facts":{"dc:contributor":["Bresler, Yoram"],"dc:creator":["Li, Yanjun"],"dc:date":["2015-09-29T20:38:00Z","2015-08","2015-07-08","2015-8"],"dc:description":["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.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-09-29 without embargo terms","The student, Yanjun Li, accepted the attached license on 2015-07-03 at 13:22.","The student, Yanjun Li, submitted this Thesis for approval on 2015-07-03 at 13:45.","This Thesis was approved for publication on 2015-07-08 at 13:49.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8340 on 2015-09-29 at 13:21:55","Made available in DSpace on 2015-09-29T20:38:00Z (GMT). No. of bitstreams: 25 LI-THESIS-2015.pdf: 597999 bytes, checksum: 58da81f8ae2c4f9e224e58602f7a31e6 (MD5) 2dperiodic-1.png: 298 bytes, checksum: 33fd467777bb3802c4528ad1bb168baa (MD5) 2dperiodic-2.png: 301 bytes, checksum: bcee3a9eeb1fe4e4a55f48f205f9f13a (MD5) 2dperiodic.tex: 3493 bytes, checksum: 205faec2f83af4541e97c931cc1d0edd (MD5) abs.tex: 2771 bytes, checksum: 0511c48c2b968d4d1aa7cb40c8e6c6ef (MD5) ack.tex: 839 bytes, checksum: 47a9862f381fbb8a11853f22ed6e411b (MD5) apx.tex: 20581 bytes, checksum: 2e8f3f9dd1a676e565f0114843c2045b (MD5) chap1.tex: 19570 bytes, checksum: 790937268ca29f7be19b6bc564260b58 (MD5) chap2.tex: 18331 bytes, checksum: fda5c694a458fc40091ea66bf76556a7 (MD5) chap3.tex: 76068 bytes, checksum: 59faf558b57a0fae3a9f05c3f91f0da8 (MD5) chap4.tex: 36980 bytes, checksum: 63d9931d04a50638b0f50e81c251cdb7 (MD5) chap5.tex: 4223 bytes, checksum: b2f916fb85f5d0044891524b99a52ccb (MD5) filterbank.png: 19036 bytes, checksum: 23615fc78b2f90379c6d8908ded61384 (MD5) idbip.tex: 6582 bytes, checksum: 702394472e46a3cf10d6009ee14e0aea (MD5) ideal_a.tex: 9595 bytes, checksum: c575713c1094e814f472ab177dedceb1 (MD5) ideal_b.tex: 9830 bytes, checksum: f81d82a381ed08af680e28b63ea76579 (MD5) msthesis.bbl: 11621 bytes, checksum: d79c4219058fe2b5e4ca50829a000eed (MD5) ptjs-1.png: 319 bytes, checksum: ed97cacec1aca8ff5525f8da19fe248f (MD5) ptjs.tex: 29326 bytes, checksum: 66a7178e019421f54d48bfdc1c5b2cde (MD5) ptss-1.png: 305 bytes, checksum: 8dd2b991ce65a08004abcc040e08e7ad (MD5) ptss.tex: 29326 bytes, checksum: 3db95365ee3a83b7928036e6a161e3dc (MD5) sbsb_a.tex: 16831 bytes, checksum: db6940b3e4a3bb3ac5b27e1e0086ca2a (MD5) sbsb_b.tex: 17333 bytes, checksum: b63944ea389e6ff6f0629ca5d786061a (MD5) uiucecethesis09.cls: 22309 bytes, checksum: dbfcb6ce43781de390491449cbb14480 (MD5) LICENSE.txt: 4206 bytes, checksum: b0c3dc3e6e2ad5ca0b5570144988d2ed (MD5) Previous issue date: 2015-07-08"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/87995"],"dc:language":["en"],"dc:rights":["Copyright 2015 Yanjun Li"],"dc:subject":["Bilinear inverse problem","Blind deconvolution","Blind gain and phase calibration","Uniqueness","Transformation group"],"dc:title":["A unified framework for identifiability analysis in bilinear inverse problems"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:31Z"}