Context-aware joint dictionary learning for color image demosaicking

Most digital cameras are overlaid with color filter arrays (CFA) on their electronic sensors, and thus only one particular color value would be captured at every pixel location. When producing the output image, one needs to recover the full color image from such incomplete color samples, and this process is known as demosaicking. In this paper, we propose a novel context-constrained demosaicking algorithm via sparse-representation based joint dictionary learning. Given a single mosaicked image with incomplete color samples, we perform color and texture constrained image segmentation and learn a dictionary with different context categories. A joint sparse representation is employed on different image components for predicting the missing color information in the resulting high-resolution image. During the dictionary learning and sparse coding processes, we advocate a locality constraint in our algorithm, which allows us to locate most relevant image data and thus achieve improved demosaicking performance. Experimental results show that the proposed method outperforms several existing or state-of-the-art techniques in terms of both subjective and objective evaluations.     

SAR target configuration recognition via structure preserving dictionary learning

Learned dictionaries have been validated to perform better than predefined ones in many application areas. Focusing on synthetic aperture radar (SAR) images, a structure preserving dictionary learning (SPDL) algorithm, which can capture and preserve the local and distant structures of the datasets for SAR target configuration recognition is proposed in this paper. Due to the target aspect angle sensitivity characteristic of SAR images, two structure preserving factors are embedded into the proposed SPDL algorithm. One is constructed to preserve the local structure of the datasets, and the other one is established to preserve the distant structure of the datasets. Both the local and distant structures of the datasets are preserved using the learned dictionary to realize target configuration recognition. Experimental results on the moving and stationary target acquisition and recognition (MSTAR) database demonstrate that the proposed algorithm is capable of handling the situations with limited number of training samples and under noise conditions.     

Atom specific multiple kernel dictionary based Sparse Representation Classifier for medium scale image classification

Kernel based Sparse Representation Classifier (KSRC) can classify images with acceptable performance. In addition, Multiple Kernel Learning based SRC (MKL-SRC) computes the weighted sum of multiple kernels in order to construct a unified kernel while the weight of each kernel is calculated as a fixed value in the training phase. In this paper, an MKL-SRC with non-fixed kernel weights for dictionary atoms is proposed. Kernel weights are embedded as new variables to the main KSRC goal function and the resulted optimization problem is solved to find the sparse coefficients and kernel weights simultaneously. As a result, an atom specific multiple kernel dictionary is computed in the training phase which is used by SRC to classify test images. Also, it is proved that the resulting optimization problem is convex and is solvable via common algorithms. The experimental results demonstrate the effectiveness of the proposed approach.     

A novel predual dictionary learning algorithm

Dictionary learning has been a hot topic fascinating many researchers in recent years. Most of existing methods have a common character that the sequences of learned dictionaries are simpler and simpler regularly by minimizing some cost function. This paper presents a novel predual dictionary learning (PDL) algorithm that updates dictionary via a simple gradient descent method after each inner minimization step of Predual Proximal Point Algorithm (PPPA), which was recently presented by Malgouyres and Zeng (2009) [F. Malgouyres, T. Zeng, A predual proximal point algorithm solving a non negative basis pursuit denoising model, Int. J. Comput. Vision 83 (3) (2009) 294-311]. We prove that the dictionary update strategy of the proposed method is different from the current ones because the learned dictionaries become more and more complex regularly. The experimental results on both synthetic data and real images consistently demonstrate that the proposed approach can efficiently remove the noise while maintaining high image quality and presents advantages over the classical dictionary learning algorithms MOD and K-SVD.     

基于判别性降维的字典学习在人脸识别中的应用

针对目前大多数人脸识别方法只能单独实施降维或者字典学习而不能完全利用训练样本判别信息的问题,提出了基于判别性降维的字典学习方法,通过联合降维与字典学习使得投影矩阵和字典更好地相互拟合,从而可以获得更高效的人脸分类系统。所提方法的有效性在AR及MPIE两大通用人脸数据库上得到了验证,实验结果表明,相比于几种先进的线性表示方法,所提算法取得了更高的识别率,特别当训练样本数很少的时候,识别效果更佳。     

Image super-resolution reconstruction based on sparse representation and deep learning

Super-resolution reconstruction technology has important scientific significance and application value in the field of image processing by performing image restoration processing on one or more low-resolution images to improve image spatial resolution. Based on the SCSR algorithm and VDSR network, in order to further improve the image reconstruction quality, an image super-resolution reconstruction algorithm combined with multi-residual network and multi-feature SCSR(MRMFSCSR) is proposed. Firstly, at the sparse reconstruction stage, according to the characteristics of image blocks, our algorithm extracts the contour features of non-flat blocks by NSCT transform, extracts the texture features of flat blocks by Gabor transform, then obtains the reconstructed high-resolution (HR) images by using sparse models. Secondly, according to improve the VDSR deep network and introduce the feature fusion idea, the multi-residual network structure (MR) is designed. The reconstructed HR image obtained by the sparse reconstruction stage is used as the input of the MR network structure to optimize the high-frequency detail residual information. Finally, we can obtain a higher quality super-resolution image compared with the SCSR algorithm and the VDSR algorithm.     

基于核Fisher判别字典学习的稀疏表示分类

在基于稀疏表示分类的模式识别中,字典学习(DL) 可以为稀疏表示获得更为精简的数据表示。最近的基于Fisher判别的字典学习(FDDL)可以学 习到更加判别的稀疏字典,使得稀疏表示分类具有很强的识别性能。核空间变换可以学习到 非线性结构信息,这对判别分类非常有用。为了充分利用 核空间特性以学习更加判别的稀疏字典来提升最终的识别性能,在FDDL的基础上,提出了两 种核化的稀疏表示DL方法。首先原始训练数据被投影到高维核空间,进行基于Fisher 判别的核稀 疏表示DLFDKDL;其次在稀疏系数上附加核Fisher约束,进行基于核Fisher判别的核稀疏表 示DL(KFDKDL),使得所学习的字典具有更强的判别能力。在多个公开的图像数据库上的稀疏 表示分类实验结果验证了所提出的FDKDL和KFDKDL方法的有效性。     

Sparse representation for robust face recognition by dictionary decomposition

Sparse representation-based classification (SRC) method has gained great success in face recognition due to its encouraging and impressive performance. However, in SRC the data used to train or test are usually corrupted, and hence the performance is affected. This paper proposes a robust face recognition approach by means of learning a class-specific dictionary and a projection matrix. Firstly, the training data are decomposed into class-specific dictionary, non-class-specific dictionary, and sparse error matrix. Secondly, in order to correct the corrupted test data, the data are projected onto their corresponding underlying subspace, and a projection matrix between the original training data and the class-specific dictionary is learned. Then, the features of the class-specific dictionary and the corrected test data are extracted by using Eigenface method. Finally, the SRC is performed to classify. Extensive experiments conducted on publicly available data sets show that the proposed algorithm performs better than some state-of-the-art methods.     

PCA-based dictionary building for accurate facial expression recognition via sparse representation

Sparse representation is a new approach that has received significant attention for image classification and recognition. This paper presents a PCA-based dictionary building for sparse representation and classification of universal facial expressions. In our method, expressive facials images of each subject are subtracted from a neutral facial image of the same subject. Then the PCA is applied to these difference images to model the variations within each class of facial expressions. The learned principal components are used as the atoms of the dictionary. In the classification step, a given test image is sparsely represented as a linear combination of the principal components of six basic facial expressions. Our extensive experiments on several publicly available face datasets (CK+, MMI, and Bosphorus datasets) show that our framework outperforms the recognition rate of the state-of-the-art techniques by about 6%. This approach is promising and can further be applied to visual object recognition.     

The nonparametric Bayesian dictionary learning based interpolation method for WSNs missing data

The conventional data interpolation methods based on sparse representation usually assume that the signal is sparse under the overcomplete dictionary. Specially, they must confirm the dimensions of dictionary and the signal sparse level in advance. However, it is hard to know them if the signal is complicated or dynamically changing. In this paper, we proposed a nonparametric Bayesian dictionary learning based interpolation method for WSNs missing data, which is the combination of sparse representation and data interpolation. This method need not preset sparse degrees and dictionary dimensions, and our dictionary atoms are drawn from a multivariate normal distribution. In this case, the dictionary size will be learned adaptively by the nonparametric Bayesian method. In addition, we implement the Dirichlet process to exploit the spatial similarity of the sensing data in WSNs, thus to improve the interpolation accuracy. The interpolation model parameters, the optimal dictionary and sparse coefficients, can be inferred by the means of Gibbs sampling. The missing data will be estimated commendably through the derived parameters. The experimental results show that the data interpolation method we proposed outperforms the conventional methods in terms of interpolation accuracy and robustness.     

Multi-modality medical image fusion based on separable dictionary learning and Gabor filtering

Sparse representation (SR) has been widely used in image fusion in recent years. However, source image, segmented into vectors, reduces correlation and structural information of texture with conventional SR methods, and extracting texture with the sliding window technology is more likely to cause spatial inconsistency in flat regions of multi-modality medical fusion image. To solve these problems, a novel fusion method that combines separable dictionary optimization with Gabor filter in non-subsampled contourlet transform (NSCT) domain is proposed. Firstly, source images are decomposed into high frequency (HF) and low frequency (LF) components by NSCT. Then the HF components are reconstructed sparsely by separable dictionaries with iterative updating sparse coding and dictionary training. In the process, sparse coefficients and separable dictionaries are updated by orthogonal matching pursuit (OMP) and manifold-based conjugate gradient method, respectively. Meanwhile, the Gabor energy as weighting factor is utilized to guide the LF components fusion, and this further improves the fusion degree of low-significant feature in the flat regions. Finally, the fusion components are transformed to obtain fusion image by inverse NSCT. Experimental results demonstrate the more competitive results of the proposal, leading to the state-of-art performance on both visual quality and objective assessment.     

基于稀疏稠密结构表示与在线鲁棒字典学习的视觉跟踪

L1跟踪对适度的遮挡具有鲁棒性,但是存在速度慢和易产生模型漂移的不足。为了解决上述两个问题,该文首先提出一种基于稀疏稠密结构的鲁棒表示模型。该模型对目标模板系数和小模板系数分别进行L2范数和L1范数正则化增强了对离群模板的鲁棒性。为了提高目标跟踪速度,基于块坐标优化原理,用岭回归和软阈值操作建立了该模型的快速算法。其次,为降低模型漂移的发生,该文提出一种在线鲁棒的字典学习算法用于模板更新。在粒子滤波框架下,用该表示模型和字典学习算法实现了鲁棒快速的跟踪方法。在多个具有挑战性的图像序列上的实验结果表明：与现有跟踪方法相比,所提跟踪方法具有较优的跟踪性能。     

A joint dictionary learning and regression model for intensity estimation of facial AUs

Automated intensity estimation of spontaneous Facial Action Units (AUs) defined by Facial Action Coding System (FACS) is a relatively new and challenging problem. This paper presents a joint supervised dictionary learning (SDL) and regression model for solving this problem. The model is casted as an optimization function consisting of two terms. The first term in the optimization concerns representing the facial images in a sparse domain using dictionary learning whereas the second term concerns estimating AU intensities using a linear regression model in the sparse domain. The regression model is designed in a way that considers disagreement between raters by a constant biasing factor in measuring the AU intensity values. Furthermore, since the intensity of facial AU is a non-negative value (i.e., the intensity values are between 0 and 5), we impose a non-negative constraint on the estimated intensities by restricting the search space for the dictionary learning and the regression function. Our experimental results on DISFA and FERA2015 databases show that this approach is very promising for automated measurement of spontaneous facial AUs.     

Discriminative dictionary learning algorithm based on sample diversity and locality of atoms for face recognition

Dictionary learning is one of the most important algorithms for face recognition. However, many dictionary learning algorithms for face recognition have the problems of small sample and weak discriminability. In this paper, a novel discriminative dictionary learning algorithm based on sample diversity and locality of atoms is proposed to solve the problems. The rational sample diversity is implemented by alternative samples and new error model to alleviate the small sample size problem. Moreover, locality can leads to sparsity and strong discriminability. In this paper, to enhance the dictionary discrimination and to reduce the influence of noise, the graph Laplacian matrix of atoms is used to keep the local information of the data. At the same, the relational theory is presented. A large number of experiments prove that the proposed algorithm can achieve more high performance than some state-of-the-art algorithms.     

基于字典学习的雷达高分辨距离像目标识别

提出一种基于字典学习的雷达高分辨距离像(HRRP)目标识别算法。该算法依据对测试样本的信噪比估计,可以自适应地确定测试阶段稀疏分解的稀疏度系数。相比于传统识别算法,文中算法对目标的识别性能更好,且对噪声的鲁棒性更强。另外,文中算法可以在只训练部分角域数据(不完备训练集)的条件下较好地识别全角域数据,可应用于HRRP数据库的扩展。基于实测数据的识别试验验证了该算法的有效性。     

Multi-stage image denoising based on correlation coefficient matching and sparse dictionary pruning

We present a novel image denoising method based on multiscale sparse representations. In tackling the conflicting problems of structure extraction and artifact suppression, we introduce a correlation coefficient matching criterion for sparse coding so as to extract more meaningful structures from the noisy image. On the other hand, we propose a dictionary pruning method to suppress noise. Based on the above techniques, an effective dictionary training method is developed. To further improve the denoising performance, we propose a multi-stage sparse coding framework where sparse representations are obtained in different scales to capture multiscale image features for effective denoising. The multi-stage coding scheme not only reduces the computational burden of previous multiscale denoising approaches, but more importantly, it also contributes to artifact suppression. Experimental results show that the proposed method achieves a state-of-the-art denoising performance in terms of both objective and subjective quality and provides significant improvements over other methods at high noise levels.     

Complex SAR Image Compression Using Entropy-Constrained Dictionary Learning and Universal Trellis Co ded Quantization

In this paper, an Entropy-constrained dic-tionary learning algorithm (ECDLA) is introduced for e?-cient compression of Synthetic aperture radar (SAR) com-plex images. ECDLA RI encodes the Real and imaginary parts of the images using ECDLA and sparse representa-tion, and ECDLA AP encodes the Amplitude and phase parts respectively. When compared with the compression method based on the traditional Dictionary learning al-gorithm (DLA), ECDLA RI improves the Signal-to-noise ratio (SNR) up to 0.66dB and reduces the Mean phase error (MPE) up to 0.0735 than DLA RI. With the same MPE, ECDLA AP outperforms DLA AP by up to 0.87dB in SNR. Furthermore, the proposed method is also suitable for real-time applications.     

A dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition

Facial expression recognition (FER) is an active research area that has attracted much attention from both academics and practitioners of different fields. In this paper, we investigate an interesting and challenging issue in FER, where the training and testing samples are from a cross-domain dictionary. In this context, the data and feature distribution are inconsistent, and thus most of the existing recognition methods may not perform well. Given this, we propose an effective dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition. The proposed approach aims to dynamically represent testing samples from source and target domains, thereby fully considering the feature elasticity in a cross-domain dictionary. We are therefore able to use the proposed approach to predict class information of unlabeled testing samples. Comprehensive experiments carried out using several public datasets confirm that the proposed approach is superior compared to some state-of-the-art methods.