首页> 外文学位 >Minimum cross-entropy formulations in image super-resolution.
【24h】

Minimum cross-entropy formulations in image super-resolution.

机译:图像超分辨率中的最小交叉熵公式。

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

摘要

Super-resolution is defined as the ability to algorithmically or physically form an image with meaningful spatial frequency content at spatial frequencies for which the optical instrument has an optical transfer function equal to zero. Historically, the method of least-squares has played a significant role in numerous estimation problems including the super-resolution problem. A viable alternative for the recovery of non-negative signals is the minimum cross-entropy principle. This principle is a generalization of minimum discrimination information in statistics and information theory. In the first part of the dissertation, various minimum cross-entropy methods for super-resolution are presented. Alternating Projections, a special case of which is the class of Expectation-Maximization (EM) algorithms, and Picard-type iterations are employed in our investigations. A cross-entropic Projection-Onto-Convex-Sets (POCS) formulation is developed to provide an alternate interpretation of the minimum cross-entropy based EM-type algorithms. This interpretation provides a theoretical basis for including some a priori object constraints in iterative super-resolution algorithms.; The performance of signal recovery algorithms is dependent on the sparsity of the signal. This fact has been observed empirically and theoretically by several researchers. Indeed, the Gerchberg-Papoulis (GP) algorithm achieves bandwidth extrapolation primarily from the finite spatial extent a priori knowledge, a special form of signal sparsity. Unfortunately, in real-world applications, objects are rarely sparse. In the second part of the dissertation, some approximately sparse representations of signals, viz., background-foreground, trend-fluctuations and wavelet representations are proposed to circumvent the sparsity requirement. Multigrid methods and wavelet decompositions are two closely related concepts. Multigrid methods were proposed to improve the convergence rates of iterative smoothers by appending corrections from coarse grids to an approximate estimate at the fine grid. Wavelet representation schemes, on the other hand, show great promise in alternatively representing an object as sparse components. A wavelet-subspace based multigrid formulation for recovery of nonsparse objects is proposed. A unified space-decomposition formulation that ties related concepts found in varied application areas, viz., Grenander's method of sieves in statistical inference, intrinsic correlation functions in astronomy, method of resolution kernels, wavelet-based space-decompositions, space-decompositions in multigrid methods etc., is presented.
机译:超分辨率被定义为在光学仪器具有等于零的光学传递函数的空间频率处以算法或物理方式形成具有有意义的空间频率含量的图像的能力。从历史上看,最小二乘法在包括超分辨率问题在内的众多估计问题中都发挥了重要作用。恢复非负信号的可行选择是最小交叉熵原理。该原理是统计和信息论中最小歧视信息的概括。在论文的第一部分,提出了用于超分辨率的各种最小交叉熵方法。交替投影,一种特殊情况是期望最大化(EM)算法,在我们的研究中采用了Picard型迭代。开发了跨熵凸集投影(POCS)公式,以提供对基于最小交叉熵的EM类型算法的替代解释。这种解释为在迭代超分辨率算法中包括一些先验对象约束提供了理论基础。信号恢复算法的性能取决于信号的稀疏性。一些研究人员从经验和理论上都观察到了这一事实。实际上,Gerchberg-Papoulis(GP)算法主要从有限空间范围内获得先验知识(一种信号稀疏性的特殊形式)来实现带宽外推。不幸的是,在实际应用中,对象很少是稀疏的。在论文的第二部分中,提出了一些信号的稀疏表示,即背景前景,趋势波动和小波表示,以避开稀疏性要求。多重网格方法和小波分解是两个紧密相关的概念。通过将粗网格的校正值附加到细网格的近似估计值,提出了多网格方法来提高迭代平滑器的收敛速度。另一方面,小波表示方案在将对象交替表示为稀疏分量方面显示出很大的希望。提出了一种基于小波子空间的多网格非稀疏对象恢复方法。统一的空间分解公式,将在不同应用领域中发现的相关概念联系在一起,例如,Grenander的筛分方法在统计推断中的应用,天文学中的固有相关函数,分辨核的方法,基于小波的空间分解,多网格中的空间分解方法等。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号