一种NMF和SVD相结合的鲁棒水印算法

提出了一种非负矩阵变换(NM})和奇异值分解(SVD)相结合的数字水印算法。该算法对宿主图像进行离散小波变换,然后选取低频部分进行非负矩阵变换和奇异值分解,最后在奇异值中嵌入Arnold置乱后的水印。实验表明,该算法在获得良好的视觉效果的同时,又具有很好的鲁棒性,对加噪、滤波、剪切等图像攻击有很好的抵杭能力。     

一种基于非负矩阵分解的鲁棒零水印算法

为了解决现有数字水印中鲁棒性和不可感知性之间的矛盾,设计了一种基于非负矩阵分解和离散小波变换的图像零水印算法。原始图像进行不重叠分块,分别对每子块图像进行3级小波分解得到低频近似分量;对细节分量作非负矩阵分解得到可近似表示子块图像的基矩阵和系数矩阵;将系数矩阵量化得到特征向量,通过特征向量和水印的运算得到原始图像的版权信息。实验结果表明该方案对常见信号处理具有很强的鲁棒性,同时密钥的使用保障了算法的安全性。     

基于NMF和SVD相结合的Contourlet域鲁棒水印算法*

为了提高变换域数字水印技术的鲁棒性,提出了一种在Contourlet域将非负矩阵变换(NMF)与奇异值变换(SVD)相结合的鲁棒水印算法。宿主图像经过Contourlet变换后,对低频子带进行非负矩阵变换,然后对非负基向量组W进行奇异值分解,最后将经过Arnold置乱的水印图像嵌入到奇异值中。实验结果表明,该图像水印算法在获得良好视觉效果的同时,对于加噪声、滤波、剪切等图像攻击有较好的鲁棒性。     

三维非负矩阵因子分解代谢组学数据解析

多维数据解析方法越来越引起人们的重视,非负矩阵因子分解算法已较广泛地用于图像分析。基于PARAFAC模型,将非负矩阵因子分解算法拓展为三维非负矩阵因子分解算法(three dimension non-negative matrix factorization,NMF3)。其原理简明,算法易于执行。与基于向量计算的其他三维化学计量学算法不同,NMF3基于矩阵计算单个元素,所以不必将三维数据平铺处理,就可直接解析,为三维数据解析研究提供了一种全新的思路和方法。应用NMF3解析模拟三维数据和代谢组学数据,结果令人满意。     

基于图正则化的受限非负矩阵分解算法及在图像表示中的应用

非负矩阵分解(NMF)是一种非常有效的图像表示方法,已被广泛应用到模式识别领域.针对NMF算法是无监督学习算法,无法同时考虑样本类别信息和固有几何结构信息的缺点,提出一种基于图正则化的受限非负矩阵分解(GRCNMF)的算法.该算法利用硬约束保持样本的类别信息,增强算法的鉴别能力,同时还利用近邻图来保持样本间固有的几何结构.通过在COIL20和ORL图像库中的聚类实验结果表明GRCNMF优于其它几种算法,说明GRCNMF的有效性.     

A new robust reference watermarking scheme based on DWT-SVD

This paper presents a new semi-blind reference watermarking scheme based on discrete wavelet transform(DWT) and singular value decomposition(SVD) for copyright protection and authenticity. We are using a gray scale logo image as watermark instead of randomly generated Gaussian noise type watermark. For watermark embedding, the original image is transformed into wavelet domain and a reference sub-image is formed using directive contrast and wavelet coefficients. We embed watermark into reference image by modifying the singular values of reference image using the singular values of the watermark. A reliable watermark extraction scheme is developed for the extraction of watermark from distorted image. Experimental evaluation demonstrates that the proposed scheme is able to withstand a variety of attacks. We show that the proposed scheme also stands with the ambiguity attack also.     

支持分辨率渐进码流的无损图像编码方法

针对无损图像压缩编码,提出了一种新颖的图像分解去相关方法。当前的无损图像编码方法主要有CALIC和JPEG-LS,两者都在空域直接作预测,导致编码码流不具有分辨率可伸缩性。结合小波提升模式与边缘自适应预测研究实现了一种比二维小波变换性能更好的分解方法。首先,对图像的每一列样值进行一维小波分解;然后,对高频子带进行边缘自适应预测,减少残留的信息。针对低频子带图像进行同样的两步操作,就完成了对图像的一次二维分解。对低频图像进行多次迭代操作后即形成了对图像的一个多分辨率分解。实验结果表明,与JPEG2000的无损模式相比,由于边缘自适应预测的引入,提出的分解模式获得了明显的编码增益。     

A novel hybrid of DCT and SVD in DWT domain for robust and invisible blind image watermarking with optimal embedding strength

To optimize the tradeoff between imperceptibility and robustness properties, this paper proposes a robust and invisible blind image watermarking scheme based on a new combination of discrete cosine transform (DCT) and singular value decomposition (SVD) in discrete wavelet transform (DWT) domain using least-square curve fitting and logistic chaotic map. Firstly cover image is decomposed into four subbands using DWT and the low frequency subband LL is partitioned into non-overlapping blocks. Then DCT is applied to each block and several particular middle frequency DCT coefficients are extracted to form a modulation matrix, which is used to embed watermark signal by modifying its largest singular values in SVD domain. Optimal embedding strength for a specific cover image is obtained from an estimation based on least-square curve fitting and provides a good compromise between transparency and robustness of watermarking scheme. The security of the watermarking scheme is ensured by logistic chaotic map. Experimental results demonstrate the better effectiveness of the proposed watermarking scheme in the perceptual quality and the ability of resisting to conventional signal processing and geometric attacks, in comparison with the related existing methods.     

基于稀疏约束的半监督非负矩阵分解算法

矩阵分解因可以实现大规模数据处理而具有十分广泛的应用。非负矩阵分解(Nonnegative Matrix Factorization,NMF)是一种在约束矩阵元素为非负的条件下进行的分解方法。利用少量已知样本的标注信息和大量未标注样本,并施加稀疏性约束,构造了一种新的算法——基于稀疏约束的半监督非负矩阵分解算法。推导了其有效的更新算法,并证明了该算法的收敛性。在常见的人脸数据库上进行了验证,实验结果表明CNMFS算法相对于NMF和CNMF等算法具有较好的稀疏性和聚类精度。     

Using the genetic algorithm to enhance nonnegative matrix factorization initialization

Nonnegative matrix factorization (NMF) algorithms have been utilized in a wide range of real applications; however, the performance of NMF is highly dependent on three factors including: (1) choosing a problem dependent cost function; (2) using an effective initialization method to start the updating procedure from a near‐optimal point; and (3) determining the rank of factorized matrices prior to decomposition. Due to the nonconvex nature of the NMF cost function, finding an analytical‐based optimal solution is impossible. This paper is aimed at proposing an efficient initialization method to modify the NMF performance. To widely explore the search space for initializing the factorized matrices in NMF, the island genetic algorithm (IGA) is employed as a diverse multiagent search scheme. To adapt IGA for NMF initialization, we present a specific mutation operator. To assess how the proposed IGA initialization method efficiently enhances NMF performance, we have implemented state‐of‐the‐art initialization methods and applied to the Japanese Female Facial Expression dataset to recognize the facial expression states. Experimental results demonstrate the superiority of the proposed approach to the compared methods in terms of relative error and fast convergence.     

双层非负矩阵分解的分形图像压缩算法

分形图像压缩作为一种基于结构的图像压缩技术,在许多图像处理中得到了应用.但是分形图像压缩的编码阶段非常耗时,且重建图像的质量效果不佳.针对这些问题,提出了一种基于双层非负矩阵分解的分形图像压缩编码算法.在传统的非负矩阵分解理论上,将投影非负矩阵分解与L3/2范数约束相结合,可以在较短的时间内提取具有代表性的图像特征.算...     

From computational attention to image fusion

We present in this paper a new fusion image scheme called as “Attention Fusion” (ATF). This scheme, developed in a multiresolution space, uses an attention map to define the level of activity for each one of the coefficients and so, to derive the rules of fusion. The multiresolution decomposition is done by using the dual-tree complex wavelet transform. The fusion method assumes that the highest attention level for the input images to be fused must be one of the main factors to establish the information to put in the fused image. The performance of the method is tested by an axiomatic score function. Two sets of experiments have been carried out: (a) fusion on multi-focus images and (b) fusion on multi-band images. In the first experiment, the proposed method has been compared with PYR, DWT, CWT and SR methods. In this kind of images the ATF method has a good performance. On the other hand, results in the second experiment with multi-band images, demonstrate that the ATF method has the best performance (across several sets of images) in comparison with the CWT, PYR and DWT methods, all of them also based in a multiresolution decomposition.     

Nonnegative matrix factorization in polynomial feature space

Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), independent component analysis (ICA), factor analysis (FA), etc., to mention only a few. A recently investigated approach to decompose a data set with a given dimensionality into a lower dimensional space is the so-called nonnegative matrix factorization (NMF). Its only requirement is that both decomposition factors are nonnegative. To approximate the original data, the minimization of the NMF objective function is performed in the Euclidean space, where the difference between the original data and the factors can be minimized by employing L(2)-norm. In this paper, we propose a generalization of the NMF algorithm by translating the objective function into a Hilbert space (also called feature space) under nonnegativity constraints. With the help of kernel functions, we developed an approach that allows high-order dependencies between the basis images while keeping the nonnegativity constraints on both basis images and coefficients. Two practical applications, namely, facial expression and face recognition, show the potential of the proposed approach.     

Source separation using regularized NMF with MMSE estimates under GMM priors with online learning for the uncertainties

We propose a new method to incorporate priors on the solution of nonnegative matrix factorization (NMF). The NMF solution is guided to follow the minimum mean square error (MMSE) estimates of the weight combinations under a Gaussian mixture model (GMM) prior. The proposed algorithm can be used for denoising or single-channel source separation (SCSS) applications. NMF is used in SCSS in two main stages, the training stage and the separation stage. In the training stage, NMF is used to decompose the training data spectrogram for each source into a multiplication of a trained basis and gains matrices. In the separation stage, the mixed signal spectrogram is decomposed as a weighted linear combination of the trained basis matrices for the source signals. In this work, to improve the separation performance of NMF, the trained gains matrices are used to guide the solution of the NMF weights during the separation stage. The trained gains matrix is used to train a prior GMM that captures the statistics of the valid weight combinations that the columns of the basis matrix can receive for a given source signal. In the separation stage, the prior GMMs are used to guide the NMF solution of the gains/weights matrices using MMSE estimation. The NMF decomposition weights matrix is treated as a distorted image by a distortion operator, which is learned directly from the observed signals. The MMSE estimate of the weights matrix under the trained GMM prior and log-normal distribution for the distortion is then found to improve the NMF decomposition results. The MMSE estimate is embedded within the optimization objective to form a novel regularized NMF cost function. The corresponding update rules for the new objectives are derived in this paper. The proposed MMSE estimates based regularization avoids the problem of computing the hyper-parameters and the regularization parameters. MMSE also provides a better estimate for the valid gains matrix. Experimental results show that the proposed regularized NMF algorithm improves the source separation performance compared with using NMF without a prior or with other prior models.     

An SVD-based image watermarking in wavelet domain using SVR and PSO

The paper presents a novel blind watermarking scheme for image copyright protection, which is developed in the discrete wavelet transform (DWT) and is based on the singular value decomposition (SVD) and the support vector regression (SVR). Its embedding algorithm hides a watermark bit in the low–low (LL) subband of a target non-overlap block of the host image by modifying a coefficient of U component on SVD version of the block. A blind watermark-extraction is designed using a trained SVR to estimate original coefficients. Subsequently, the watermark bit can be computed using the watermarked coefficient and its corresponding estimate coefficient. Additionally, the particle swarm optimization (PSO) is further utilized to optimize the proposed scheme. Experimental results show the proposed scheme possesses significant improvements in both transparency and robustness, and is superior to existing methods under consideration here.     

非负矩阵分解和新轮廓波变换的图像融合

为提高融合图像保留源图像的信息量和边缘特征,提出了非负矩阵分解和新轮廓波变换的图像融合算法。以具有尖锐频率局部化特征的新轮廓波对循环平移后的源图像进行分解;运用非负矩阵分解实现低通子带融合,采用能量方差测度函数和匹配度函数实现带通子带融合;对各子带信号重构并逆循环平移,得到融合图像。实验结果分析表明,该方法保留了更多的信息量和边缘细节特征,应用效果较好。     

基于小波—奇异值分解的数字水印新算法*

为了有效地保护数字作品的版权,提出了一种以离散小波多级分解与奇异值分解相结合的数字水印新算法。该算法充分利用小波与奇异值的固有性质,对原始图像进行多级小波分解,并对部分子带作奇异值分解。将水印置乱来保证一定的安全性,再对其进行分块离散余弦变换,然后将它嵌入到中间奇异值及其周围的部分矩阵块中。实验表明,该方法不仅有较好的透明性,而且能抗大多数处理攻击,有较好的鲁棒性。     

一种新的基于DWT、DCT和SVD的鲁棒水印算法

本文提出一种新的基于离散小波变换(DWT)、离散余弦变换(DCT)和矩阵奇异值分解(SVD)的鲁棒水印算法.首先按照本文提出的小波分解准则对载体图像进行四层小波分解,取第四层的低频子图与三个高频子图;同样对水印图像进行小波分解得到低频子图与三个高频子图.然后用DCT、SVD方法,结合本文提出的相互嵌入准则将水印图像的低...     

一种基于DWT的多重混合数字图像水印方案

针对数字图像DWT系数的分布特点,该文分别对在DWT的不同频段系数中嵌入和检测水印进行了研究与试验,并在此基础上实现了一种基于DWT的多重混合数字图像水印方案。在小波域低频部分使用扩频的方法将m_序列作为水印加入图像,同时在小波域中、高频部分将满足标准正态分布N（0,1）的实数伪随机序列作为水印加入图像,而且每种水印都实现了盲检测。实验结果表明,这种多重混合水印方案兼顾了各频段水印嵌入检测的不同特性,在满足透明性要求的前提下,比单重水印方案在鲁棒性方面有了较大的提高。     

Non-negative Matrix Factorization with Symmetric Manifold Regularization

Non-negative matrix factorization (NMF) is becoming an important tool for information retrieval and pattern recognition. However, in the applications of image decomposition, it is not enough to discover the intrinsic geometrical structure of the observation samples by only considering the similarity of different images. In this paper, symmetric manifold regularized objective functions are proposed to develop NMF based learning algorithms (called SMNMF), which explore both the global and local features of the manifold structures for image clustering and at the same time improve the convergence of the graph regularized NMF algorithms. For different initializations, simulations are utilized to confirm the theoretical results obtained in the convergence analysis of the new algorithms. Experimental results on COIL20, ORL, and JAFFE data sets demonstrate the clustering effectiveness of the proposed algorithms by comparing with the state-of-the-art algorithms.