Fast parallel algorithms for discrete Gabor expansion and transform based on multirate filtering

The Gabor transform has long been recognized as a very useful tool for the joint time and frequency analysis in signal processing.Its real time applications,however,were limited due to the high computational complexity of the Gabor transform algorithms.In this paper,some novel and fast parallel algorithms for the finite discrete Gabor expansion and transform are presented based on multirate filtering.An analysis filter bank is designed for the finite discrete Gabor transform(DGT)and a synthesis filter bank is designed for the finite discrete Gabor expansion(DGE).Each of the parallel channels in the two filter banks has a unified structure and can apply the FFT and the IFFT to reduce its computational load.The computational complexity of each parallel channel does not change as the oversampling rate increases.In fact,it is very low and depends only on the length of the input discrete signal and the number of the Gabor frequency sampling points.The computational complexity of the proposed parallel algorithms is analyzed and compared with that of the major existing parallel algorithms for the finite DGT and DGE.The results indicate that the proposed parallel algorithms for the finite DGT and DGE based on multirate filtering are very attractive for real time signal processing.     

A new digital algorithm for the velocity translation vector

The error of the conventional sculling correction algorithm under maneuvers is analyzed through Taylor series expansion;a generalized error equation is presented.Using frequency-series sculling algorithms in the digital algorithm for the velocity translation vector will cause the accuracy of the digital algorithm under maneuvers to decrease by one order in iteration time interval.Some New sculling algorithms are developed and evaluated,which are as accurate as frequency-series sculling algorithms under vibrations,and are at least one order more accurate than frequency-series algorithms under maneuvers.Several new digital algorithms are constructed with the presented sculling algorithms for the velocity translation vector,which avoids the loss in accuracy of velocity translation vector under maneuvers.Simulations agree well with the analytical results.     

RST transforms resistant image watermarking based on centroid and sector-shaped partition

A novel digital watermarking scheme featuring centroid-based sectoring is proposed in this paper. To get higher robustness against geometric attacks, such as rotation, scaling, and translation (RST), a delicate synchronization mechanism was developed and incorporated into the proposed approach. During the process of watermark embedding, the original image was partitioned into sectors based on the image centroid. Synchronization information as well as the message bits is then embedded into these sectors. With the help of the centroid-based sectoring and synchronization information, the proposed approach is capable of restoring the correct sectoring even if it has experienced severe geometric distortion. This attribute ensures the correct recovery of embedded watermarks and contributes to the robustness of the proposed scheme. A series of experiments have been conducted to verify the feasibility and effectiveness of the proposed approach. Experimental results show that the proposed scheme possesses good robustness against RST attacks and considerable robustness against other common image processing attacks.     

Modular supervisory control for multi-floor manufacturing processes

Due to space availability limitations and high land costs, there is an increasing development of multi-floor manufacturing (MFM) systems in urban and industrial areas. The problem of coordination in a multi-floor manufacturing process, in the Ramadge Wonham framework, is introduced. The manufacturing chain of each floor and the elevator system are modeled in the form of finite deterministic automata. The models of the multi-floor manufacturing process are parametric with respect to the number of floors and the number of manufacturing machines on each floor. The coordination desired performance is formulated in the form of desired regular languages in analytic forms. The languages are realized by appropriate supervisors in the form of finite deterministic automata. The models of the supervisors are also parametric with respect to the number of floors and the number of manufacturing machines on each floor. The total control of the coordination of the multi-floor manufacturing process is accomplished via a modular supervisory control architecture. The complexity of the supervisors as well as the complexity of the total modular supervisory architecture are determined in analytic forms with respect to the number of floors and the number of manufacturing machines on each floor. The special case of a two floor manufacturing process is presented as an illustrative example.     

数字水印技术

Introduction　　The purpose of digital watermarks is to provide copyright pro-tection for intellectual property that's in digital format. The namecomes from the faintly visible watermarks imprinted on stationery.Digital Watermarking embed a pattern of bit…     

Reduction Algorithms Based on Discernibility Matrix：The Ordered Atributes Method

In this Paper,we present reduction algorithms based on the principle of Skowron‘s discernibility matrix-the ordered attributes method.The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved.Since a discernibility matrix requires the size of the memory of |U|^2,U is a universe of bojects,it would be impossible to apply these algorithms directly to a massive object set.In order to solve the problem,a so=called quasi-discernibility matrix and two reduction algorithms are prpopsed.Although the proposed algorithms are incomplete for Pawlak reduct,their optimal paradigms ensure the completeness as long as they satisfy some conditions.Finally,we consider the problem on the reduction of distributive object sets.     

A Feature-based Robust Digital Image Watermarking Against Desynchronization Attacks

In this paper,a new content-based image watermarking scheme is proposed.The Harris-Laplace detector is adopted to extract feature points,which can survive a variety of attacks.The local characteristic regions (LCRs) are adaptively constructed based on scale-space theory.Then,the LCRs are mapped to geometrically invariant space by using image normalization technique.Finally, several copies of the digital watermark are embedded into the nonoverlapped LCRs by quantizing the magnitude vectors of discrete Fourier transform (DFT) coefficients.By binding a watermark with LCR,resilience against desynchronization attacks can be readily obtained.Simulation results show that the proposed scheme is invisible and robust against various attacks which includes common signals processing and desynchronization attacks.     

Efficient aggregation algorithms on very large compressed data warehouses

Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing(OLAP).Many efficinet algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed.However,to our knowledge,there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in mulitidimensional arrays rather than in tables.This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses.These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them.They are applicable to a variety of data compression methods.The algorithms have different performance behavior as a function of dataset parameters,sizes of out puts and ain memory availability.The algorithms are described and analyzed with respect to the I/O and CPU costs,A decision procedure to select the most efficient algorithm ,given an aggregation request,is also proposed.The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.     

Wavelet Based Image Authentication and Recovery

In this paper, we propose a secure semi-fragile watermarking technique based on integer wavelet transform with a choice of two watermarks to be embedded. A self-recovering algorithm is employed, that hides the image digest into some wavelet subbands for detecting possible illicit object manipulation undergone in the image. The semi-fragility makes the scheme tolerant against JPEG lossy compression with the quality factor as low as 70%, and locates the tampered area accurately. In addition, the system ensures more security because the embedded watermarks are protected with private keys. The computational complexity is reduced by using parameterized integer wavelet transform. Experimental results show that the proposed scheme guarantees safety of a watermark, recovery of image and localization of tampered area.     

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.     

Security analysis of a key based color image watermarking vs. a non-key based technique in telemedicine applications

Recently, digital watermarking has become an important technique to preserve patients’ privacy in telemedicine applications. Since, medical information are highly sensitive, security of watermarked medical images becomes a critical issue in telemedicine applications. In this paper, two targeted attacks have been proposed against a key based color image watermarking scheme and also a non-key based one, in order to evaluate their security in telemedicine applications. The target schemes are SVD-based and QR-based color image watermarking algorithms, which their embedding procedures are quit the same. The proposed attacks exploit the prior knowledge of the watermarking algorithms to make changes in the exact embedding spaces. Thus, these changes would cause disruption in extraction procedure. Our experimental results show that the key based watermarking scheme is more secure than the non-key based one. This is because the proposed targeted attack needs to distort the key based watermarked images more than non-key based ones to remove the embedded watermarks. Our proposed targeted attacks also have more efficient performance in removing watermarks than other general attacks such as JPEG compression, Gaussian noise and etc. Finally, these attacks have been proposed to show the vulnerabilities of watermarking schemes in order to help the designers to implement more secure schemes.     

Perceptual Digital Watermarking for Image Authentication in Electronic Commerce

Digital watermarking has been presented to protect the copyright of electronic multimedia data. The previous proposed watermarking algorithms mostly embed sequences of random numbers or binary images as the watermarks. In this paper, an image accreditation technique by embedding digital gray-level image watermarks in images is proposed. In the proposed method, the host image and the watermark are decomposed into wavelet coefficients. The contextual energies of the host-image wavelet coefficients are computed to select embedding coefficients. The watermark wavelet coefficients are sorted and then embedded in the selected host coefficients. The experiments show that the proposed method provides extra robustness against JPEG-compression, image-processing, and even composite attacks compared to the traditional embedding methods. Moreover, the proposed method has no need of the original image to extract the embedded watermarks. The proposed method facilitates electronic commerce application developers to select adequate digital watermarking techniques for their development systems.     

一种基于zigzag扫描的DCT鲁棒数字盲水印算法

针对提高水印算法的鲁棒性进行研究,提出一种基于zigzag扫描的DCT鲁棒数字盲水印算法。算法对分块后DCT域的中、低频系数进行zigzag扫描得到一维数列,利用每个数列数学范数比值和量化索引调制原理实现数字水印的嵌入,然后通过最小距离公式对水印提取。与其他算法相比,实验结果显示算法能够抵抗多种攻击,具有较好的透明性与鲁棒性。水印提取过程不需要原载体图像,实现水印信息盲提取。     

基于DWT域的混沌置乱二值图像数字水印新算法

提出了一种基于DWT(Discrete Wavelet Transform)域有意义二值图像数字水印新算法．利用广义猫映射产生的混沌序列对水印序列的嵌入位置进行置乱，增加了嵌入水印的安全性；并利用改正的二值运算方法将水印嵌入到图像深层小波域的低频子图中．水印的检测不需要原始图像．大量仿真结果证明了该算法嵌入的数字水印既具有很好的隐蔽性，又具有很理想的鲁棒性．     

基于线性空间隐藏模型的可逆图像水印算法

提出一种基于线性空间隐藏模型的可逆图像水印算法.通 过对原始图像载体互不重叠的划分形成图像块序列,对其进行整数小波变换,获取待嵌水印子带.根据0/1水印序列和线性空间隐藏模型,将水印不可感知地嵌入到图像的小波域中,提高水印鲁棒性和不可见性. 只需判断奇偶性提取水印,并且通过简单逆向平移恢复原始.线性空间隐藏模型的提出实现了水印间相互独立,从而 使该算法能扩展到多著作权的无损水印领域.投票原则的使用又进一步提高水印的 鲁棒性和降低了误检率.在无外界干扰的条件下,拥有密 钥和其他秘密参数的用户能够无损恢复原始图像.仿真实验表明,与相关工作比较该算 法能应对一定程度的有损压缩和高斯噪声攻击,表现出 较高的鲁棒性、安全性和不可见性.     

自适应数字水印中的可反向性以及相关的欺骗和对策

为进一步加强当前数字水印的安全性,对得到广泛研究的自适应水印中的可反向性问题进行了探讨.首先对水印体制进行了分类和抽象.随后基于自适应水印对植入水印和调节因子的形成没有约束的前提,对存在的可反向性和半可反向性问题,以及由此引起的反向工程攻击和半反向工程攻击进行了定义、分析和实验,指出了它们对相关数字所有权验证的干扰甚至否定作用.最后得出了对植入水印和调节因子的形成都必须进行约束的结论,指出了一些自适应技术本身的不可反向性对安全性的增强作用.让植入水印和调节因子的形成单向依赖于原始媒体,并充分利用人类感知系统,使水印体制对上述攻击具备抵抗性,增强了数字所有权验证的可靠性.     

基于角点检测和奇异值分解的多重数字水印算法

针对多媒体数据的版权保护和完整性认证的多方性,提出一种基于角点检测和奇异值分解的多重数字水印算法．本算法将鲁棒水印嵌入到小波域低频子带角点中,将半脆弱水印嵌入到小波域分块细节子带奇异值中,实验仿真结果表明,水印算法能够抵抗剪切、涂改、滤波、压缩等常见攻击,同时也能够抵抗旋转、缩放等几何攻击,具有较好的鲁棒性和脆弱敏感性,且准确定位篡改区域,可谓一种有效的多重数字水印方案．     

一种基于倒谱变换的自同步音频水印算法

本文提出了一种基于倒谱变换的自同步数字音频水印算法。算法对音频载体分段后,将同步码嵌入到时域上,将水印信息嵌入到变换域上。水印的提取不需要原始音频信号,是一种盲水印算法。实验结果表明,嵌入后的水印不仅具有很好的不可感知性,而且对添加噪声、重新采样、低通滤波、重新量化和剪切攻击也具有很好的稳健性。     

基于混沌序列的多重数字图像水印算法

采用一维混沌映射，根据不同的混沌初始条件生成多个互不相关的混沌实值序列，进而得到性能良好的多重数字图像水印信号，有效地解决了多重数字图像水印信号的构造问题．同时采用二维混沌映射将各水印信号置乱，随机均匀地叠加在图像小波变换的中低频系数上，各水印信号的嵌入和提取可以互不干扰，解决了多重数字图像水印的嵌入问题．实验结果表明，该算法对各种常见的攻击均具备了一定的抵抗能力，可有效地解决数字图像产品的多著作权问题．