首页> 外文学位 >Minimum I-divergence methods for inverse problems.
【24h】

Minimum I-divergence methods for inverse problems.

机译:反问题的最小I-散度方法。

获取原文
获取原文并翻译 | 示例

摘要

Problems of estimating nonnegative functions from nonnegative data induced by nonnegative mappings are ubiquitous in science and engineering. We address such problems by minimizing an information-theoretic discrepancy measure, namely Csiszar's I-divergence, between the collected data and hypothetical data induced by an estimate.; Our applications can be summarized along the following three lines:; 1. Deautocorrelation. Deautocorrelation involves recovering a function from its autocorrelation. Deautocorrelation can be interpreted as phase retrieval in that recovering a function from its autocorrelation is equivalent to retrieving Fourier phases from just the corresponding Fourier magnitudes. Schulz and Snyder invented an minimum I-divergence algorithm for phase retrieval. We perform a numerical study concerning the convergence of their algorithm to local minima.; X-ray crystallography is a method for finding the interatomic structure of a crystallized molecule. X-ray crystallography problems can be viewed as deautocorrelation problems from aliased autocorrelations, due to the periodicity of the crystal structure. We derive a modified version of the Schulz-Snyder algorithm for application to crystallography. Furthermore, we prove that our tweaked version can theoretically preserve special symmorphic group symmetries that some crystals possess.; We quantify noise impact via several error metrics as the signal-to-ratio changes. Furthermore, we propose penalty methods using Good's roughness and total variation for alleviating roughness in estimates caused by noise.; 2. Deautoconvolution. Deautoconvolution involves finding a function from its autoconvolution. We derive an iterative algorithm that attempts to recover a function from its autoconvolution via minimizing I-divergence. Various theoretical properties of our deautoconvolution algorithm are derived.; 3. Linear inverse problems. Various linear inverse problems can be described by the Fredholm integral equation of the first kind. We address two such problems via minimum I-divergence methods, namely the inverse blackbody radiation problem, and the problem of estimating an input distribution to a communication channel (particularly Rician channels) that would create a desired output. Penalty methods are proposed for dealing with the ill-posedness of the inverse blackbody problem.
机译:在科学和工程领域中普遍存在从非负映射导出的非负数据估计非负函数的问题。我们通过最小化信息理论上的差异度量(即Csiszar的I-散度)来解决此类问题,该度量在收集的数据和由估计得出的假设数据之间。我们的应用程序可以概括为以下三行: 1.去自相关。去自相关涉及从其自相关中恢复功能。可以将反自相关解释为相位检索,因为从函数的自相关中恢复功能等效于仅从相应的傅立叶幅度中获取傅立叶相位。 Schulz和Snyder发明了一种用于相位检索的最小I-散度算法。我们对它们的算法收敛到局部极小值进行了数值研究。 X射线晶体学是用于发现结晶分子的原子间结构的方法。由于晶体结构的周期性,X射线晶体学问题可以被视为来自混叠自相关的去自相关问题。我们推导了Schulz-Snyder算法的修改版本,可应用于晶体学。此外,我们证明了经过调整的版本在理论上可以保留某些晶体具有的特殊同构群对称性。随着信噪比的变化,我们通过几个误差度量来量化噪声影响。此外,我们提出了使用古德氏粗糙度和总变化量的惩罚方法,以减轻噪声引起的估计中的粗糙度。 2.去卷积。反自动卷积涉及从其自动卷积中找到一个函数。我们推导了一种迭代算法,该算法试图通过最小化I散度从其自动卷积中恢复一个函数。推导了我们的反卷积算法的各种理论特性。 3.线性反问题。各种线性反问题可以通过第一类Fredholm积分方程来描述。我们通过最小的I-散度方法解决了两个这样的问题,即逆黑体辐射问题和估计将创建所需输出的通信通道(特别是Rician通道)的输入分布的问题。提出了惩罚方法来处理黑体反问题的不适定性。

著录项

  • 作者

    Choi, Kerkil.;

  • 作者单位

    Georgia Institute of Technology.;

  • 授予单位 Georgia Institute of Technology.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 262 p.
  • 总页数 262
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 无线电电子学、电信技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号