共查询到19条相似文献,搜索用时 171 毫秒
1.
针对目前基于字典学习的图像超分辨率重建效果欠佳或字典训练时间过长的问题,本文提出了一种耦合特征空间下改进字典学习的图像超分辨率重建算法.该算法首先利用高斯混合模型聚类算法对训练图像块进行聚类,然后使用更改字典更新方式的改进KSVD字典学习算法来快速获得高、低分辨率特征空间下字典对和映射矩阵.重建时根据测试样本与各个类别的似然概率自适应地选择最匹配的字典对和映射矩阵进行高分辨率重建.最后利用图像非局部相似性,将其与迭代反向投影算法相结合对重建后的图像进行后处理获得最佳重建效果.实验结果表明了本文方法的有效性. 相似文献
2.
经典的基于稀疏表示和字典学习的超分辨率算法在图像重建质量和计算复杂度上都具备较好的表现。然而,基于外部样本训练得到的字典和待重建图像缺少相关性,会伴随算法鲁棒性较差的问题。为克服这一缺点,提出了一种基于自学习的新型单幅图像超分辨率高质量重建算法。该算法无需引入外部训练图像,即完全通过待重建图像自身构建的样本进行字典学习和图像重建;这一机制增强了训练字典与待重建图像的相关性。具体而言,在字典训练阶段,针对输入的待重建图像,基于二维经验模态分解进行高频修复预处理,以增强样本源的高频特征;随后构建训练样本集,使用K-奇异值分解算法获得自学习主字典和自学习残差字典,构成双字典。在图像重建阶段,将双字典结构与自学习相结合,先通过主字典实现主高频恢复,再进一步通过残差字典恢复图像的残差高频信息。实验结果表明,所提算法在重建图像的主观视觉效果以及专业质量评价指标上,相对于传统插值算法及经典的字典学习算法具有显著优势。 相似文献
3.
4.
5.
简要介绍了基于稀疏字典约束的超分辨力重建算法,提出了具有低复杂度的基于K均值聚类的自适应稀疏约束图像超分辨力重建算法.所提算法从两个方面降低其计算复杂度:分类训练字典,对图像块归类重建,降低每个图像块所用字典的大小;对图像块的特征进行分析,自适应地选择重建方法.实验结果表明,提出的快速重建方法在重建质量与原算法相当的前提下,可以较大程度地降低重建时间. 相似文献
6.
简要介绍了基于稀疏字典约束的超分辨力重建算法,提出了具有低复杂度的基于K均值聚类的自适应稀疏约束图像超分辨力重建算法。所提算法从两个方面降低其计算复杂度:分类训练字典,对图像块归类重建,降低每个图像块所用字典的大小;对图像块的特征进行分析,自适应地选择重建方法。实验结果表明,提出的快速重建方法在重建质量与原算法相当的前提下,可以较大程度地降低重建时间。 相似文献
7.
为了有效地重建压缩低分辨率图像,提出一种基于针对性字典的压缩图像稀疏超分辨率重建算法.首先,根据压缩低分辨率图像的形成特点,对训练库图像进行针对性的下采样压缩编码处理,进行超完备字典的训练;然后,通过训练所得的针对性字典对压缩低分辨率图像进行稀疏表示的超分辨率重建.为进一步恢复图像的高频信息,进行了针对性残差字典训练,并对图像进行高频信息补偿,得到稀疏重建后的图像主观效果更加突出,客观评价参数也得到较大提升.实验结果表明,该算法对压缩图像的超分辨率重建更具针对性,具有良好鲁棒性和高效性. 相似文献
8.
在信号的稀疏表示方法中,传统的基于变换基的稀疏逼近不能自适应性地提取图像的纹理特征,而基于过完备字典的稀疏逼近算法复杂度过高.针对该问题,文章提出了一种基于小波变换稀疏字典优化的图像稀疏表示方法.该算法在图像小波变换的基础上构建图像过完备字典,利用同一场景图像的小波变换在纹理上具有内部和外部相似的属性,对过完备字典进行灰色关联度的分类,有效提高了图像表示的稀疏性.将该新算法应用于图像信号进行稀疏表示,以及基于压缩感知理论的图像采样和重建实验,结果表明新算法总体上提升了重建图像的峰值信噪比与结构相似度,并能有效缩短图像重建时间. 相似文献
9.
图像的超分辨率重建技术可以提升图像质量,改善图像视觉效果,在现实中具有很高的实用价值。针对基于K-SVD的超分辨率重建算法的不足,本文提出一种基于稀疏K-SVD的单幅图像超分辨率重建算法。首先,采用稀疏K-SVD方法进行训练获得高低分辨率字典对,以待重建的低分辨率图像及其降采样作为字典训练的样本,提高了字典和待重建的低分辨率图像的相关性;然后,采用逐级放大的思想进行重建;最后,利用非局部均值的方法,进一步提高重建效果。实验表明,与基于K-SVD的超分辨率重建算法相比,本文算法重建图像的峰值信噪比平均提高了0.6dB左右。重建图像在视觉效果上,也有一定程度的提升。 相似文献
10.
11.
基于学习的超分辨率算法通过一组训练样例来学习一个字典,并从该字典中合成低分辨率图像中丢失的高频信息,最终得到相应的高分辨率图像。介绍了几种常用的基于学习的超分辨率算法,并提出了一种新的算法:基于自适应字典稀疏表示的超分辨率算法。实验结果表明,该方法在主观与客观上均具有较好的重建效果。 相似文献
12.
针对目前存在的压缩感知(CS)重建算法计算复杂度过高的问题,该文提出一种基于最佳线性估计的快速CS图像重建算法。该算法在编码端进行分块自适应CS随机测量,在解码端根据图像块不同的统计特性,估计出统计自相关函数矩阵,进而构造出最佳线性算子用于重建出各个图像块。由于该算法用线性投影的方式替代了传统CS重建算法的非线性迭代过程,使得其大大缩短了图像重建时间。仿真实验结果表明,对于纹理细节不复杂的图像,所提出的算法并没有因为其计算复杂度的减少而影响到重建质量,仍优于目前流行的CS重建算法。 相似文献
13.
Inverse halftoning is a challenging problem in image processing. Traditionally, this operation is known to introduce visible distortions into reconstructed images. This paper presents a learning-based method that performs a quality enhancement procedure on images reconstructed using inverse halftoning algorithms. The proposed method is implemented using a coupled dictionary learning algorithm, which is based on a patchwise sparse representation. Specifically, the training is performed using image pairs composed by images restored using an inverse halftoning algorithm and their corresponding originals. The learning model, which is based on a sparse representation of these images, is used to construct two dictionaries. One of these dictionaries represents the original images and the other dictionary represents the distorted images. Using these dictionaries, the method generates images with a smaller number of distortions than what is produced by regular inverse halftone algorithms. Experimental results show that images generated by the proposed method have a high quality, with less chromatic aberrations, blur, and white noise distortions. 相似文献
14.
《Journal of Visual Communication and Image Representation》2008,19(4):270-282
The use of sparse representations in signal and image processing is gradually increasing in the past several years. Obtaining an overcomplete dictionary from a set of signals allows us to represent them as a sparse linear combination of dictionary atoms. Pursuit algorithms are then used for signal decomposition. A recent work introduced the K-SVD algorithm, which is a novel method for training overcomplete dictionaries that lead to sparse signal representation. In this work we propose a new method for compressing facial images, based on the K-SVD algorithm. We train K-SVD dictionaries for predefined image patches, and compress each new image according to these dictionaries. The encoding is based on sparse coding of each image patch using the relevant trained dictionary, and the decoding is a simple reconstruction of the patches by linear combination of atoms. An essential pre-process stage for this method is an image alignment procedure, where several facial features are detected and geometrically warped into a canonical spatial location. We present this new method, analyze its results and compare it to several competing compression techniques. 相似文献
15.
POCS超分辨率图像重构的快速算法 总被引:3,自引:0,他引:3
超分辨率图像重构是将多帧低分辨率图像重构成一幅高分辨率图像的过程。由于其求解是一大型病态求逆问题,计算量随着放大倍数的增加而急剧上升,如何降低计算复杂度是超分辨率成像所面临的一个急需解决的课题。提出了一个基于PoCs的高分辨率图像重构的快速算法。其原理是利用各低分辨率图像之间位移的关系将所有的低分辨率图像进行重组,然后对每个组进行PoCs超分辨图象重构。实验结果表明。该快速算法较大地提高了超分辨图像重构的速度。 相似文献
16.
17.
In order to improve the visual appearance of defogged of aerial images, in this work, a novel defogging algorithm based on conditional generative adversarial network is proposed. More specifically, the training process is carried out through an end-to-end trainable deep neural network. In detail, we upgrade the traditional adversarial loss function by incorporating an L1-regularized gradient to encode a rich set of detailed visual information inside each aerial image. In practice, to our best knowledge, existing image quality assessment algorithms might have deviation and supersaturation distortion on aerial images. To alleviate this problem, we leverage a random forest classification model to learn the mapping relationship between aerial image features and the quality ranking results. Subsequently, we transform the objective of defogged image quality assessment into a classification problem. Comprehensive experimental results on our compiled fogged aerial images quality data set have clearly demonstrated the effectiveness of our proposed algorithm. 相似文献
18.
Single-Image Super-Resolution Reconstruction via Learned Geometric Dictionaries and Clustered Sparse Coding 总被引:7,自引:0,他引:7
Recently, single image super-resolution reconstruction (SISR) via sparse coding has attracted increasing interest. In this paper, we proposed a multiple-geometric-dictionaries-based clustered sparse coding scheme for SISR. Firstly, a large number of high-resolution (HR) image patches are randomly extracted from a set of example training images and clustered into several groups of "geometric patches," from which the corresponding "geometric dictionaries" are learned to further sparsely code each local patch in a low-resolution image. A clustering aggregation is performed on the HR patches recovered by different dictionaries, followed by a subsequent patch aggregation to estimate the HR image. Considering that there are often many repetitive image structures in an image, we add a self-similarity constraint on the recovered image in patch aggregation to reveal new features and details. Finally, the HR residual image is estimated by the proposed recovery method and compensated to better preserve the subtle details of the images. Some experiments test the proposed method on natural images, and the results show that the proposed method outperforms its counterparts in both visual fidelity and numerical measures. 相似文献
19.
A new algorithm for single-image super-resolution based on selective sparse representation over a set of coupled dictionary pairs is proposed. Patch sharpness measure for high- and low-resolution patch pairs defined via the magnitude of the gradient operator is shown to be approximately invariant to the patch resolution. This measure is employed in the training stage for clustering the training patch pairs and in the reconstruction stage for model selection. For each cluster, a pair of low- and high-resolution dictionaries is learned. In the reconstruction stage, the sharpness measure of a low-resolution patch is used to select the cluster it belongs to. The sparse coding coefficients of the patch over the selected low-resolution cluster dictionary are calculated. The underlying high-resolution patch is reconstructed by multiplying the high-resolution cluster dictionary with the calculated coefficients. The performance of the proposed algorithm is tested over a set of natural images. PSNR and SSIM results show that the proposed algorithm is competitive with the state-of-the-art super-resolution algorithms. In particular, it significantly out-performs the state-of-the-art algorithms for images with sharp edges and corners. Visual comparison results also support the quantitative results. 相似文献