嫦娥一号卫星CCD立体相机影像超分辨率重建算法

针对嫦娥一号卫星CCD立体相机空间分辨率不足的问题,运用最大后验概率估计法(MAP)实现了月表影像的超分辨率重建。介绍了嫦娥一号卫星CCD立体相机的成像模型,分析了图像获取过程中的主要影响因素,并建立了相应的超分辨率重建模型。基于该模型,首先采用误差-参数分析法估计嫦娥一号卫星CCD立体相机动态成像光学系统的点扩散函数(PSF);然后将估计的PSF应用到MAP算法所建立的目标函数中,采用共轭梯度法对目标函数进行最值求解;再通过VC软件平台编程实现了对单帧正视月表影像的超分辨率重建;最后从信息熵、清晰度和频谱等方面对重建图像进行评价,结果表明重建图像像质优良。     

基于边缘保持的航拍图像凸集投影超分辨率重建算法

针对传统的凸集投影(POCS)超分辨率图像重建算法经常出现的边缘模糊问题,在传统POCS算法原理基础上,文章使用基于梯度插值的算法生成POCS重建的初始估计图像,然后对中心点为边缘像素的空间点扩散函数(PSF)进行修正,使其系数沿梯度大的方向减小,梯度小的方向保持不变。利用改进的POCS算法进行了超分辨率图像重建实验,结果表明,图像峰值信噪比由原来的27.29dB达到28.12dB。该方法有效地保持了边缘特性,改善了超分辨率图像重建质量。     

基于全变差的加权最小二乘法PET图像重建

传统的加权最小二乘法、惩罚项加权最小二乘法虽然能够重建得到较好质量的图像,但在欠采样的条件下不能很好的拟制噪声.全变差作为正则项已广泛用于图像重建中,利用图像稀疏的先验知识能够在欠采样的条件下很好的重建图像.本文结合加权最小二乘法和全变差的优点,构造了基于全变差正则项的加权最小二乘法目标函数,运用交替求解的方法,将目标函数分解为求解二次优化和全变差正则化的优化问题,并分别用超松弛迭代方法和梯度下降法求解这两个优化问题.采用Zubal模型对该算法与传统算法进行仿真验证比较,并用相关系数、方差、信噪比等参数描述图像重建质量.结果表明在欠采样条件下,该算法能够更好的拟制噪声,重构效果比传统的有明显地提高.     

一种改进的TV图像重建算法

针对当前稀疏角度下有限角图像重建过程中,边界部分出现伪影,降低了图像重建质量的缺陷。文中提出了一种新的ART+TV算法,该方法是在原始TV算法的基础上进行改进。原始TV梯度下降算法求解目标函数最小值时,使用固定函数作为目标函数,文中对其进行更改,采用带参数的目标函数,并对TV重建后的结果进行自适应步长修正,加速图像收敛。与传统的ART+TV算法相比,文中算法在不改变重建速度的基础上,且在少量迭代次数下,能重建出质量更高的图像,抑制图像伪影。     

基于专家场先验模型的图像超分辨重建算法

为了进一步提高图像超分辨率重建的质量,针对非局部集中稀疏表示算法中重建图像的噪声问题,提出了一种基于专家场先验模型的图像超分辨率重建改进算法。首先,利用专家场模型从图像训练集中学习整幅图像的先验知识建立全局先验模型;然后将学习到的先验信息用于非局部集中稀疏表示模型求解最优稀疏表示系数;最后,得到高分辨率图像估计。该算法在超分辨率重建迭代运算的同时,同步更新专家场模型参数,因此在不显著增加运算复杂度的情况下,通过选取合适的先验约束,有效地增强了图像重建的效果。实验结果表明:相比非局部集中稀疏表示算法,文中算法对无噪和有噪降质图像均能取得较好的峰值信噪比结果,并且能够进一步提高有噪图像的去噪效果。     

基于在线字典学习的人脸超分辨率重建

针对基于学习的人脸超分辨率算法噪点、伪影较多,且噪声鲁棒性较差的问题,提出一种基于在线字典学习的人脸超分辨率重建算法。以人脸图集作为训练图库,运用在线字典学习方法提高字典训练的精度。独立调整字典学习阶段的正则化参数λt和求解重建稀疏系数阶段的λr,以获取最优的超完备字典和稀疏系数用于图像重建。实验结果表明,目标图像峰值信噪比比同一类型的稀疏编码超分法平均提高了0.85 d B,结构相似性增加了0.013 3,有效地抑制了噪点和伪影。在含噪人脸图像应用中,噪声水平提高时,峰值信噪比下降相对较平缓,提升人脸超分效果的同时改善了算法的噪声鲁棒性。     

基于耦合梯度神经网络的光学层析图像重建

为克服光学层析图像重建的病态性,通常在重建过程中加入先验信息.本文采用含有二值线过程的Gibbs分布作为图像的先验模型,该模型具有保留清晰边缘的全局平滑特性.由于重建目标函数是连续变量和二值离散变量的混合体,常规的优化算法无法实现.为此,提出了一种基于耦合梯度神经网络的优化方法.优化过程中,能量函数关于光学参数的梯度计算是关键,本文提出一种基于梯度树的梯度求解方法.对吸收系数和散射系数的重建结果表明:该方法可高效地重建光学层析图像;线过程的引入可以改善重建的病态特性,提高图像的重建质量.     

基于核回归正则项的图像超分辨率重建

讨论了图像成像的基本模型,并提出了一种基于调整核回归函数作为正则项的序列图像重建算法。该算法是对已经提出的核回归算法的改进,减少其在超分辨率图像重建时的运算量。而且在图像配准过程中针对图像间只存在平移和旋转变换,采用了基于矩形像素值的亚像素配准方法,以提高配准的速度和精度。利用此算法对序列图像进行重建仿真,并通过结论得出其在噪声严重的情况下具有更好的边缘保留特性。     

一种基于自适应正则化的图像超分辨率重建模型

为了解决图像超分辨率重建中稀疏系数解的不精确问题,提出了一种自适应正则化级联稀疏矩阵的超分辨率重建算法。根据图像自身的特性,采用自适应正则化项对图像局部进行处理,实现图像的局部约束,构建基于自适应正则化的稀疏矩阵函数。另外,为了提高图像的可清晰性,采用基于全局约束的退化模型改进处理结构。测试结果表明,与其他常用算法相比,提出的自适应正则化的图像超分辨率重建算法能够构建更清晰的超分辨率图像。     

遥感图像的MAP超分辨重建

遥感根本目的就是获得清晰的高空间分辨率的图像,从而可以进一步地分析处理。为了在遥感测量中获得更高空间分辨率、更高信噪比、更清晰的图像,本文对图像处理领域超分辨算法进行了研究。建立了一套拟合模拟现实的成像系统模型,在这种模型的基础之上,利用最大后验概率系统理论,讨论了现实情况中的运动模糊,噪声等情况,改进了MAP超分辨算法。实验结果表明:使用本文改进的基于MAP理论的Markov随机场约束的多帧超分辨重建算法,可以较好提高超分辨效果,与三次立方插值方法相比,PSNR至少提高约5.1dB左右,与未改进的MAP方法相比,PSNR提高约0.2dB左右。本文提出了动态的先验约束方法,给约束函数添加与迭代次数相关的约束项,该改进创新可以加快收敛并且更加逼近真实图像,实验表明该方法收敛速度更快,约束效果良好,更适合实际应用。     

Markov随机场方法在灰度图象恢复中的应用

本文在叙述了Markov随机场（MRF）及Gibbs随机场的基本概念之后，综述了这种随机模型在灰度图象的恢复中的应用，其中包括模型的选择，及使用最大后验（MSAP）估计方法进行图象恢复。最后对给出的实例进行了计算，对使用不同的MRF模型及计算方法的恢复结果进行了对比。     

基于广义Gibbs先验的优质PET成像

 最大后验方法(Maximum a posteriori, MAP)已经广泛应用于解决图像重建中的病态问题,正电子发射成像(Positron emission tomography, PET)便是其中之一。本文基于MAP方法,针对PET成像提出一新的基于图像相似结构信息的广义Gibbs先验形式,新先验能在有效地抑制噪声的同时,鲁棒地保持锐利的边缘信息。但由于新先验的引入,使得重建模型的求解趋于复杂。为解决模型解的收敛性问题,我们提出两步式的局部线化优化迭代重建策略,并结合抛物线替代坐标上升(Paraboloidal surrogate coordinate ascent,PSCA)算法进行求解。新算法分别对PET模拟数据和真实数据进行重建实验,结果表明本文提出的基于广义Gibbs先验的PET成像可以获得优质的重建图像。     

Statistic-based MAP image-reconstruction from Poisson data usingGibbs priors

A statistical method for selecting the Gibbs parameter in MAP image restoration from Poisson data using Gibbs priors is presented. The Gibbs parameter determines the degree to which the prior influences the restoration. The presented method yields a MAP restored image, minimally influenced by the prior, for which a statistic falls within an appropriate confidence interval. The method assumes that a close approximation to the blurring function is known. A simple iterative feedback algorithm is presented to statistically select the parameter as the MAP image restoration is being performed. This algorithm is heuristically based on a model reference control formulation, but it requires only a minimal number of iterations for the parameter to settle to its statistically specified value. The performance of the statistical method for selecting the prior parameter and that of the iterative feedback algorithm are demonstrated using both 2-D and 3-D images     

Segmentation of Gabor-filtered textures using deterministicrelaxation

A supervised texture segmentation scheme is proposed in this article. The texture features are extracted by filtering the given image using a filter bank consisting of a number of Gabor filters with different frequencies, resolutions, and orientations. The segmentation model consists of feature formation, partition, and competition processes. In the feature formation process, the texture features from the Gabor filter bank are modeled as a Gaussian distribution. The image partition is represented as a noncausal Markov random field (MRF) by means of the partition process. The competition process constrains the overall system to have a single label for each pixel. Using these three random processes, the a posteriori probability of each pixel label is expressed as a Gibbs distribution. The corresponding Gibbs energy function is implemented as a set of constraints on each pixel by using a neural network model based on Hopfield network. A deterministic relaxation strategy is used to evolve the minimum energy state of the network, corresponding to a maximum a posteriori (MAP) probability. This results in an optimal segmentation of the textured image. The performance of the scheme is demonstrated on a variety of images including images from remote sensing.     

Expectation-maximization algorithms, null spaces, and MAP imagerestoration

A computationally efficient, easily implementable algorithm for MAP restoration of images degraded by blur and additive correlated Gaussian noise using Gibbs prior density functions is derived. This algorithm is valid for a variety of complete data spaces. The constraints upon the complete data space arising from the Gaussian image formation model are analyzed and a motivation is provided for the choice of the complete data, based upon the ease of computation of the resulting EM algorithms. The overlooked role of the null space of the blur operator in image restoration is introduced. An examination of this role reveals an important drawback to the use of the simulated annealing algorithm in maximizing a specific class of functionals. An alternative iterative method for computing the nullspace component of a vector is given. The ability of a simple Gibbs prior density function to enable partial recovery of the component of an image within the nullspace of the blur operator is demonstrated.     

Approximate maximum likelihood hyperparameter estimation for Gibbspriors

The parameters of the prior, the hyperparameters, play an important role in Bayesian image estimation. Of particular importance for the case of Gibbs priors is the global hyperparameter, beta, which multiplies the Hamiltonian. Here we consider maximum likelihood (ML) estimation of beta from incomplete data, i.e., problems in which the image, which is drawn from a Gibbs prior, is observed indirectly through some degradation or blurring process. Important applications include image restoration and image reconstruction from projections. Exact ML estimation of beta from incomplete data is intractable for most image processing. Here we present an approximate ML estimator that is computed simultaneously with a maximum a posteriori (MAP) image estimate. The algorithm is based on a mean field approximation technique through which multidimensional Gibbs distributions are approximated by a separable function equal to a product of one-dimensional (1-D) densities. We show how this approach can be used to simplify the ML estimation problem. We also show how the Gibbs-Bogoliubov-Feynman (GBF) bound can be used to optimize the approximation for a restricted class of problems. We present the results of a Monte Carlo study that examines the bias and variance of this estimator when applied to image restoration.     

An adaptive clustering algorithm for image segmentation

The problem of segmenting images of objects with smooth surfaces is considered. The algorithm that is presented is a generalization of the K-means clustering algorithm to include spatial constraints and to account for local intensity variations in the image. Spatial constraints are included by the use of a Gibbs random field model. Local intensity variations are accounted for in an iterative procedure involving averaging over a sliding window whose size decreases as the algorithm progresses. Results with an 8-neighbor Gibbs random field model applied to pictures of industrial objects, buildings, aerial photographs, optical characters, and faces show that the algorithm performs better than the K-means algorithm and its nonadaptive extensions that incorporate spatial constraints by the use of Gibbs random fields. A hierarchical implementation is also presented that results in better performance and faster speed of execution. The segmented images are caricatures of the originals which preserve the most significant features, while removing unimportant details. They can be used in image recognition and as crude representations of the image     

基于Gibbs模型的提高图像分辨率方法

在提高图像分辨率过程中,选择合适的成像模型是获得高分辨率图像的一个关键因素。提出一种基于最大后验概率、采用Gibbs成像模型,并利用多帧序列图像重构高分辨率图像的方法,充分利用序列图像之间的累加信息,从而快速地获得较其他方法更优的高分辨率图像。     

泊松噪声模糊图像的边缘保持变分复原算法

从贝叶斯估计出发,构造了一种新的变分模型,用于复原被泊松噪声污染的模糊图像.首先讨论了模型正则化项中具有边缘保持能力的函数选取以及模型求解的相关问题,然后将变分模型的求解转化为可快速求解的非线性扩散方程,给出了正则化参数选取的初步空间自适应方法,可以区分平滑区域和图像边缘自适应的调节参数.实验结果表明,本文方法的复原效果整体上优于传统的迭代正则化方法,复原图像的边缘得到了有效的保护,泊松噪声的抑制效果明显,复原图像提高的改进信噪比(ISNR)要比迭代正则化方法平均提高1 dB以上.     

一种新的基于MAP的纹理自适应超分辨率图像复原算法

 本文论证了超分辨率图像复原计算中的两个性质,并基于此在MAP(Maximum A Posteriori)框架下提出了一种新的纹理自适应算法.算法首先根据低分辨率图像和高分辨率图像近似计算的可类比性质计算初始图像,使初始图像的质量更高,并根据超分辨率复原图像阶跃边缘的陡坡性质,将三边滤波正则化应用于迭代运算中,更好地保护了图像的陡坡和屋顶边缘.算法可根据图像的纹理自动计算初始图像融合参数以及正则化函数中的梯度阈值等参数,解决了以往超分辨率图像复原算法参数调整复杂的问题.实验结果表明,本文算法在没有人工参与的情况下,重建图像的客观评价和主观质量均有明显提高.