基于聚类稀疏表示与图像块自适应聚合的单幅图像超分辨研究

A Single Image Super-Resolution (SISR) reconstruction method that uses clustered sparse representation and adaptive patch aggregation is proposed. First, we randomly extract image patch pairs from the training images, and divide these patch pairs into dif-ferent groups by K-means clustering. Then, we learn an over-complete sub-dictionary pair offline from corresponding group patch pairs. For a given low-resolution patch, we adap-tively select one sub-dictionary to reconstruct the high resolution patch online. In addition, non-local self-similarity and steering kernel regression constraints are integrated into patch aggregation to improve the quality of the re-covered images. Experiments show that the proposed method is able to realize state-of-the-art performance in terms of both objective evaluation and visual perception.     

基于自适应多字典学习的单幅图像超分辨率算法

自适应字典学习利用图像结构自相似性,将图像自身作为训练样本,通过字典学习使图像中的相似块在字典下具有稀疏表示形式.本文将全局字典学习中利用图像库获取附加信息的思想融入到自适应字典学习的过程中,提出了一种基于自适应多字典学习的单幅图像超分辨率算法,从低分辨率图像自身与图像库同时获取附加信息.该算法对低分辨率图像金字塔结构中的图像块进行聚类,在聚类结果的引导下将图像库中的图像块进行分类,利用各类中的样本分别构建针对各类的多个字典,从而确定表达重建图像块的最优字典.实验表明,与ScSR、SISR、NLIBP、CSSS以及mSSIM等算法相比,本文算法具有更好的超分重建效果.     

Text-image super-resolution through anchored neighborhood regression with multiple class-specific dictionaries

In the dictionary-based image super-resolution (SR) methods, the resolution of the input image is enhanced using a dictionary of low-resolution (LR) and high-resolution (HR) image patches. Typically, a single dictionary is learned from all the patches in the training set. Then, the input LR patch is super-resolved using its nearest LR patches and their corresponding HR patches in the dictionary. In this paper, we propose a text-image SR method using multiple class-specific dictionaries. Each dictionary is learned from the patches of images of a specific character in the training set. The input LR image is segmented into text lines and characters, and the characters are preliminarily classified. Likewise, overlapping patches are extracted from the input LR image. Then, each patch is super-resolved through the anchored neighborhood regression, using n class-specific dictionaries corresponding to the top-n classification results of the character containing the patch. The final HR image is generated by aggregating all the super-resolved patches. Our method achieves significant improvements in visual image quality and OCR accuracy, compared to the related dictionary-based SR methods. This confirms the effectiveness of applying the preliminary character classification results and multiple class-specific dictionaries in text-image SR.     

Compression of facial images using the K-SVD algorithm

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.     

图约束字典和加权稀疏表示人脸超分辨率算法

针对低分辨率、低质量人脸图像重建问题,提出了一种新的基于稀疏表示的人脸超分辨率算法。在训练阶段,人脸的位置特征被用于保持人脸块的全局信息,人脸块间的几何结构被用于保持高低分辨率超完备冗余字典的流形结构,从而提高字典的表达能力;在重建阶段,K近邻加权稀疏表示被用于消除稀疏编码噪声,以提高高分辨率人脸图像重建系数的精度。实验结果表明,提出的方法取得了较好的主客观质量。     

Blind single-image super resolution based on compressive sensing

Blind super resolution is an interesting area in image processing that can restore high resolution (HR) image without requiring prior information of the volatile point spread function (PSF). In this paper, a novel framework is proposed for blind single-image super resolution (SISR) problem based on compressive sensing (CS) framework that is one of the first works that considers general PSFs. The fundamental idea in the proposed approach is to use sparsity on a known sparse transform domain as a powerful regularizer in both the image and blur domains. Therefore, a new cost function with respect to the unknown HR image patch and PSF kernel is presented and minimization is performed based on two subproblems that are modeled similar to that of CS. Simulation results demonstrate the effectiveness of the proposed algorithm that is competitive with methods that use multiple LR images to achieve a single HR image.     

Low-Resolution and Low-Quality Face Super-Resolution in Monitoring Scene via Support-Driven Sparse Coding

Monitoring cameras are now widely used to monitor everything from a room in a house to an entire warehouse. However, in real monitoring scenarios, a variety of factors, such as underexposure, optical blurring, defocusing, have an impact on the quality of images, which leads to low-quality and low-resolution (LR) of the individual of interest. Reconstruction of a high-resolution (HR) face image with detailed facial features, from a LR observation based on a set of HR and LR training image pairs, plays an important role in computer vision and face image analysis applications. To super-resolve an HR face given a LR face image, the key issue is how to effectively encode the LR image patch. However, due to stability and accuracy issues, the coding approaches proposed so far are far from satisfactory. In this paper, we present a novel sparse coding method via exploiting the support information on the coding coefficients. According to the distances between the input patch and bases in the dictionary, we first assign different weights to the coding coefficients and then obtain the coding coefficients by solving a weighted sparse problem. Experiments on commonly used databases and some face images on the real monitoring conditions demonstrate that our method outperforms state-of-the-art.     

基于压缩感知的月球探测器着陆图像超分辨重建

嫦娥工程二期的任务要求中,嫦娥3号的安全降落是最为关键的任务。因此,提出了一种基于压缩感知的超分辨率图像重建方法,根据经过模糊处理并加入噪声的低分辨率图像重建原始的高分辨率图像,实现了月球探测器着陆图像的超分辨率重建。算法采用局部Sparse-Land模型,从美国阿波罗计划获取的月球影像、嫦娥1、2号卫星影像和嫦娥工程二期试验中获取的月球探测器图像中提取了大量训练图块,采用K-SVD算法完成了高、低分辨率过完备字典Al和Ah的学习,通过求解优化问题,获得待处理低分辨率图块的稀疏表示,并将表示系数用于Ah以生成对应的高分辨率图块。最后,运用最小二乘算法,得到满足重构约束的高分辨率图像。实验验证了算法的有效性,表明其在视觉效果及PSNR指标上均优于插值方法和Yang的方法。     

Single face hallucination via local neighbor patches

Based on learning neighborhood patches a new single face hallucination method is proposed in this paper. In the proposed method, each input low-resolution (LR) position-patch and all patches in a local window centered at the same position of training images are used to hallucinate a high-resolution (HR) face patch, meanwhile two local similarity measurements between each input LR patch and all local LR and HR neighborhood patches of training images are computed to constrain the hallucination. Additionally, a residue image is estimated for the further improvement of the reconstructed result. Experimental results show that the proposed method can obtain superior or competitive results.     

基于稀疏编码的鲁棒型人脸超分辨率重建

为了减少人脸超分图像的边缘伪影和图像噪点,利用基于稀疏编码的单幅图像超分辨率重建算法,在字典学习阶段,结合L1范数引入在线字典学习方法,使字典根据当前输入图像块和上次迭代生成的字典逐列更新,得到更加精确的超完备字典对,用于图像重建.实验中进行的仿真结果表明,改进算法超分结果的峰值信噪比(PSNR)和结构相似性(SSIM)比同类型的稀疏编码超分法(SCSR)和应用在线字典学习算法的超分方法(ODLSR)均有较大幅度提升,比后者平均提升0.72 dB和0.0187.同时,视觉上有效地消除了边缘伪影,且在处理含噪人脸图像时,具备更强的去噪能力和更好的鲁棒性.     

Gray-level image denoising with an improved weighted sparse coding

The nonlocal self-similarity of images means that groups of similar patches have low-dimensional property. The property has been previously used for image denoising, with particularly notable success via sparse coding. However, only a few studies have focused on the varying statistics of noise in different similar patches during the iterative denoising process. This has motivated us to introduce an improved weighted sparse coding for gray-level image denoising in this paper. On the basis of traditional sparse coding, we introduce a weight matrix to account for the noise variation characteristics of different similar patches, while introduce another weight matrix to make full use of the sparsity priors of natural images. The Maximum A-Posterior estimation (MAP) is used to obtain the closed-form solution of the proposed method. Experimental results demonstrate the competitiveness of the proposed method compared with that of state-of-the-art methods in both the objective and perceptual quality.     

基于非局部稀疏编码的超分辨率图像复原

基于压缩感知的超分辨率图像复原方法通常采用局部稀疏编码策略,对每一图像块独立编码,易产生人工的分块效应。针对上述问题,该文提出一种基于非局部稀疏编码的超分辨率图像复原方法。该算法在字典训练和图像编码过程中分别运用图像的非局部自相似先验知识,即利用低分辨率图像的插值图像训练字典,并通过计算相似块局部编码的加权平均,得到每一图像块的非局部稀疏编码。仿真实验表明,所提算法能够获得更优的复原效果,并且对于含噪图像具有较强的鲁棒性。     

Image super-resolution with sparse neighbor embedding

Until now, neighbor-embedding-based (NE) algorithms for super-resolution (SR) have carried out two independent processes to synthesize high-resolution (HR) image patches. In the first process, neighbor search is performed using the Euclidean distance metric, and in the second process, the optimal weights are determined by solving a constrained least squares problem. However, the separate processes are not optimal. In this paper, we propose a sparse neighbor selection scheme for SR reconstruction. We first predetermine a larger number of neighbors as potential candidates and develop an extended Robust-SL0 algorithm to simultaneously find the neighbors and to solve the reconstruction weights. Recognizing that the k-nearest neighbor (k-NN) for reconstruction should have similar local geometric structures based on clustering, we employ a local statistical feature, namely histograms of oriented gradients (HoG) of low-resolution (LR) image patches, to perform such clustering. By conveying local structural information of HoG in the synthesis stage, the k-NN of each LR input patch is adaptively chosen from their associated subset, which significantly improves the speed of synthesizing the HR image while preserving the quality of reconstruction. Experimental results suggest that the proposed method can achieve competitive SR quality compared with other state-of-the-art baselines.     

可见光与红外图像结构组双稀疏融合方法研究

传统的可见光与红外稀疏表示融合方法,采用图像块构造解析字典或者学习字典,利用字典的原子表征图像的显著特征.这类方法存在两个问题,一是没有考虑图像块与块之间的联系,二是字典的适应能力不够并且复杂度高.针对这两个问题,本文提出可见光与红外图像结构组双稀疏融合方法.该方法首先利用图像的非局部相似性,将图像块构建成图像相似结构组,然后对图像相似结构组进行字典训练,采用双稀疏分解模型,有效结合解析字典和学习字典的优势,降低了字典训练的复杂度,得到的结构字典更加灵活,适应性提高.该方法能够有效提高红外与可见光融合图像的视觉效果,经对比实验分析,在主观和客观评价上都优于传统的稀疏表示融合方法.     

Image super-resolution via sparse representation over multiple learned dictionaries based on edge sharpness

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.     

基于稀疏表示的立体图像客观质量评价方法

提出了一种基于稀疏表示的立体图像质量评价方法 ,分为训练和测试两个部分。在训练部 分,通过训练不同频带的立体图像获得立体图像的稀疏字典;在测试部分,根据稀疏字典计 算得到立体图 像的稀疏特征,定义了稀疏特征相似度衡量原始和失真图像信息的差异,并根据稀疏字典计 算了频带增益和左右视点的融合权值,最后融合稀疏特征相似度作为立体图像质量的 客观评价值。在立体图像测试库上的实验结果表明,本文方法的评价结果与主观评价结果有 较好的相关性,符合人类视觉系统的感知。     

Enhancing inverse halftoning via coupled dictionary training

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.     

基于分块过完备稀疏表示的多聚焦图像融合

提出一种基于分块过完备稀疏表示的多聚焦图像融合算法。该方法将多聚焦源图像对应分块,采用稀疏模型进行分解,得到每个块的稀疏表示系数。考虑到稀疏系数向量的l1范数越大,带的信息量就越多,采用此因子对稀疏系数加权,求得融合系数,结合过完备字典重构融合图像。实验结果表明该图像融合方法取得较好的融合效果且优于传统小波分解融合方法。同时探讨了字典维数对所提出方法的影响。     

自适应稀疏约束图像超分辨力重建方法

简要介绍了基于稀疏字典约束的超分辨力重建算法,提出了具有低复杂度的基于K均值聚类的自适应稀疏约束图像超分辨力重建算法。所提算法从两个方面降低其计算复杂度:分类训练字典,对图像块归类重建,降低每个图像块所用字典的大小;对图像块的特征进行分析,自适应地选择重建方法。实验结果表明,提出的快速重建方法在重建质量与原算法相当的前提下,可以较大程度地降低重建时间。     

结合字典稀疏表示和非局部相似性的自适应压缩成像算法

如何以较少的观测值重构出高质量的图像是压缩成像系统的一个关键问题.本文根据图像块随机投影能量大小分布特点,提出了一种新的自适应采样方式以及针对自适应采样的有效重构算法.重构时利用了图像在字典下的稀疏表示原理和图像的非局部相似性先验知识.为实现图像的稀疏表示,文中构造了由多个方向字典和一个正交DCT字典组成的冗余字典,并用l1范数作为约束条件求解稀疏优化问题.由于充分利用了图像块的局部特性和图像的非局部特性,本文的压缩成像算法在低采样率下能重构出较高质量的图像.