《外文翻译及文献：基于DCT变换的水印算法实现.doc》由会员分享，可在线阅读，更多相关《外文翻译及文献：基于DCT变换的水印算法实现.doc（8页珍藏版）》请在三一办公上搜索。
1、毕业论文（设计）外文翻译题目：基于DCT变换的水印算法实现专业：班级：学号：姓名：指导教师：基于子带离散余弦变换DCT应用于图像水印的技术基于子带离散余弦变换DCT应用于图像水印的技术已经被提出并应用。水印是波在所有选定的含有若干系数的四个频带段的1级分解。应用大量的系数使每个波段给出了不同的检测输出结果。其结果是采取平均检测结果的所有频段的值。结果表明，最终的结果是优于所检测输出的每个波段所得的结果的，从而实现了非常强大的水印方案。1、导言数字媒体技术在当今社会已被大范围的使用，从而促使其创立知识产权来保护。就其性质而言，数字媒体是能够100被完整复制的，因此，必须采取有效的标识系统（是显而
2、易见的）。这就是水印的由来。水印技术是指将无法被看见的数据埋入图像中，从而确定合法的创建者/拥有者。水印应当具有健全的可以适用于（抵挡）各种各样的图像攻击的技术。任何尝试从原始图像删除所有权信息的方法（被称为）攻击。一些常见的攻击包括过滤，压缩，直方图修改，剪裁，旋转和缩小。（水印）主要有两个嵌入方向，即空间域和变换域。变换域的技术对普通的图像攻击技术更敏感，如过滤或JPEG压缩。变换域技术在图像水印中是最受欢迎的。在这种情况下，图像技术正在通过某些常见的，频繁发生事情改变着，并且使得水印转换系数被高度完美的应用于图像上。这种转换技术通常使用DCT（离散余弦变换）,DFT（二维傅里叶变换）和D
3、WT（离散沃尔什变换）。发生在现况下的一个问题是各种数量和位置的改变将使其在图像中频繁的变化着。许多有效方法已经被提出，其中大部分是源于科克斯（Coxs）的体系。皮瓦等人扩展了这一方法，从而提出了一种隐藏检测系统（blind detection system）。在这些全部情况中都将图像处理作为一个整体，但一些系数变化不超过16000，通常的图像尺寸是512x512。由于大多数的过程都是在数字统计的背景下（执行的），因此我们宁愿使用越多系数越好。这就是为什么我们建议使用子带离散余弦变换DCT原因。第2节，我们将围绕目前的子带DCT分解层和模型的参数进行讨论。第3节，我们将所阅读到的方案进行测试，
4、并且解释每一个波段的处理后的情况下，最后检测未经过处理的五个通常攻击方法。最后，我们将在最终章节结束这一讨论。2、子带DCT和水印的模型郑和米特拉（Jung and Mitra）已经于1996年介绍了子带DCT。这是一种涉及小波变换和离散余弦变换（DCT）的方法。将原始图像二次抽样后经过高通滤波过滤器和低通滤波过滤器（处理）。结合这两个过滤器的各个方向（横向和纵向）的过滤使四个子带为每个层进行分解。这种过程相当于通过低通滤波器向各个方向透进的频带能够进一步的被二次抽样和过滤，使其能在另一层被分解。最后，使每一个频带都通过使用DCT系数来进行转化。在我们的实验中，我们不得不选取并使用一定数量的的
5、分解方法和小波技术。我们尝试用大量的分解层，即1，2和3层来进行试验。实验结果表明，(分解系数)并没有在某一层的探测结果上有重大的提高，与此同时，图象退化的现象却更容易被发现。因此，我们把已经被分解的原始图像的四个频段放入一层内。这种娴熟的使用最简单的小波技术的方法，是哈尔（Haar）提出的。下一步是将每一频段进行DCT变换。为了解释我们的水印技术，我们使用下列公式：其中ti是正在转化的系数，ti是水印系数，xi是一个被用于水印中的随机序列的高斯分布。参数a是与模型的浓度有关。我们对其使用两种不同的准则，一种是LL-频段，剩下的将使用另一种频段,那就是当a=0.1的时候使用LL-频段，a=0.
6、2时则用另一种。这样做的理由是，低频段更容易变化，也就是说，一些细微的变化更加的明显。i参数的范围是从1到20000，使其在一个令人满意的80000系数间的变化。在每个频段中，我们都将从以5000为系数的锯齿形依次扫描。基于块分类和DCT域的图像水印算法摘要：本文提出了一种基于离散余弦变换（DCT）域图像水印算法。图像水印算法有两个阶段：特征嵌入和特征检测。第一阶段，它将一个标识符号嵌入进图像。第二阶段是被公认（已知）的。该算法有两个处理步骤。第一步无疑是选择像素区块并使用参数进行设置，而第二个步骤是将DCT系数强制的嵌入在选定的区块内。两种不同的参数规则表明修改DCT参数系数出现频率的重要性
7、。第一种方法是将DCT规则嵌入到选定的线性约束内，而第二种方法则是按照所给予的特定参数进行循环检测。上述所提到的水印算法是不能在JGEG压缩和过滤条件下使用的。1、导言数字水印是当今广播电视和密码技术的探讨的大体背景下产生的。为了避免（他人）未经授权就发布图片或其他多媒体资源，已经提出了大量的解决方法。其中多数是提议做一些难以被发现的图片修改以供以后使用。这种图片修改技术被称为水印。水印是将图片做一些不明显的修改（以确定版权所有），从而能够强力的抵制可能出现的各种图像处理技术。水印算法已经被大量的颁布过。他们不是随机性的就是确定性的。这些算法，包含了图像强度域和变换域。在中频范围内DCT的变换
8、系数受嵌入的8*8像素块所约束。将授权信息嵌入DCT系数后应用所得的DCT系数来处理整个图像。图像水印算法有两个阶段：特征嵌入和特征检测。通过特征嵌入来编写绝对代码分配给所有者后让其嵌入图像。在检测阶段用算法来确定所规定的代码。信号检测理论是一种对许多领域都有效的应用技术。水印图像能够用许多不同的处理方法来转变图像和处理运算法则来防止其被摧毁，这就是数字水印技术。图像压缩是每个图像都有可能经历的图像变化过程。标准的静态图像压缩算法是JPEG格式。JPEG格式是基于尽可能减少资源在离散余弦变换（DCT）域上的消耗（而产生的）。受损压缩，即使图像的信息遭受损失的压缩方法是在高频域上发生的。在拟定的
9、水印算法中，图像被分割成类似JPEG算法的8*8像素块。该水印算法包括两个步骤。第一步是依据高斯网来选择某些特定的块。在选定的块中，我们通过修改DCT参数来使其强制完成某一给予的约束。该参数是把高斯函数加在系统规定的DCT系数上使其组成水印代码。在检测阶段我们首先检测DCT参数，然后检测各自的区块的位置来确定是否被篡改。A SUBBAND DCT APPROACH TO IMAGE WATERMARKINGA subband-DCT approach for image watermarking is proposed in this communication. The watermark
10、is casted in a selected number of coefficients of all four bands of a one-level decomposition. A great number of coefficients is being used. Each band gives a different detection output. The result is taken as the average detection result of all bands. It is shown that the final result is better tha
11、n the detection output of each individual band, thus leading to a very robust watermarking scheme.1. INTRODUCTIONThe great spread of digital media in nowadays, has urged for the protection of the intellectual property rights of the creators. By their nature, digital media are 100% reliably copied, s
12、o the need for an effective marking system is obvious. This is where watermarking comes in. Watermarking stands for the embedding of perceptually invisible information into image data that identify the rightful creator/owner. Watermarks should be robust to various image attacks. Every attempt to rem
13、ove the ownership information from the original image is called an attack. Some common attacks include filtering, JPEG compression, histogram modification, cropping, rotation and downscaling. There are two main directions for embedding, namely the spatial and the frequency domain. The spatial domain
14、 techniques are more vulnerable in common image attacks such as filtering or JPEG compression.The frequency-domain approaches are the most popular for image watermarking. In these schemes, the image is being transformed via some common frequency transform and watermarking is achieved by altering the
15、 transform coefficients of the image. The transforms that are usually used are the DCT, DFT and the DWT. A question that occurs in such approaches is the number and the position of the altered coefficients in the frequency representation of the image. Many different ideas have been presented, most o
16、f them originating from Coxs et al system. Piva et al have extended this idea, thus providing a blind detection system. In all these cases the image is being processed as a whole but the number of coefficients altered is not more than 16000, the usual image size being 512x512. Since most of these pr
17、ocesses have a statistical background, we would prefer to use as many coefficients as possible. This is why we suggest the use of subband DCT.In section 2, we present the subband DCT, the decomposition levels and discuss the casting scheme and parameters. In section 3, we test the reading scheme and
18、 examine each bands individual contribution in the case of no processing and also the final detection results for five common attacks. We end with the final conclusions in section 2. SUBBAND DCT AND WATERMARK CASTINGJung and Mitra have introduced the subband DCT in 1996. It is a method that involves
19、 both wavelets and the Discrete Cosine Transform (DCT). The original image is sub sampled and filtered with the use of a high pass and a low pass filter. The combination of the two filters for each direction (horizontal and vertical) of filtering gives four subbands for each level of decomposition.
20、The band that corresponds to low pass filtering in both directions (LL band) can be further subsampled and filtered thus providing another level of decomposition. Finally, each of the bands is transformed with the use of the DCT.For our experiments, we had to select the number of decomposition level
21、s and the wavelet to be used. We tried different numbers of decomposition levels, namely 1, 2 and 3. Experimental results have shown that there wasnt any significant improvement in the detection results for more levels than one, while at the same time, the image degradation was more easily observed.
22、 So we decomposed the original image into one level with four bands. This was accomplished using the simplest wavelet, that is Haar. The next step was to perform a DCT on each of the bands. To cast our watermark we used the following formula:where ti are the transformed coefficients, ti are the wate
23、rmarked coefficients and xi is a random sequence of Gaussian distribution, used as the watermark. The a- parameter has to do with the strength of the casting. We use two different values for it, one for the LL-band and a different one for all other bands, that is a=0.1 for the LL- band and 0.2 for t
24、he others. The reason for this is that the low frequency band is more vulnerable to changes, meaning that slight changes are easily noticeable. The i parameter ranges from 1 to 20000, thus leading in a satisfactory number of 80000 coefficients that are altered. In each band we start from coefficient
25、 5000 in the zig-zag scanning order.Image watermarking using block site selection and DCT domain constraintsAbstract: In this paper we propose an image watermarking algorithm based on constraints in the Discrete Cosine Transform (DCT) domain.An image watermarking algorithm has two stages: signature
26、casting (embedding) and signature detection. In the first stage it embeds an identifying label in the image. This is recognized in the second stage. The proposed algorithm has two processing steps. In the first step certain pixel blocks are selected using a set of parameters while in the second step
27、 a DCT coefficient constraint is embedded in the selected blocks. Two different constraint rules are suggested for the parametric modification of the DCT frequency coefficients. The first one embeds a linear constraint among certain selected DCT coefficients and the second defines circular detection
28、 regions according to the given parameters. The watermarks cast by the proposed algorithm are resistant to JPEG compression and filtering.1. IntroductionDigital watermarks in the general context of TV broadcasting and cryptology were discussed in. To avoid the unauthorized distribution of images or
29、other multimedia property, various solutions have been proposed. Most of them make unobservable modifications to images, that can be detected afterwards . Such image changes are called watermarks. The watermark should not alter visibly the image and it should be robust to alterations which may be ca
30、used by various image processing techniques.Algorithms proposed for watermarking have been reported in various papers. They are either stochastic or deterministic. These algorithms are either in image intensity domain or in frequency domain. In the middle range DCT frequency coefficients from the 8*
31、8 pixel blocks are used for embedding a constraint. In the signature is embedded in the DCT coefficients obtained after applying the DCT transform in the entire image.An watermarking algorithm has two stages: watermarking casting and detection. By means of watermark casting a specific code assigned
32、to the owner is embedded in the image. In the detection stage the algorithm identifies the given code. Signal detection theory is a well-established field with many applications. A watermarked image can be processed by means of various image transformations and processing algorithms which may be abl
33、e to destroy, intentionally or not, the digital watermark. Image compression is the most likely transformation that an image may undergo. The standard still image compression algorithm is JPEG. JPEG is based on the minimization of the energy in the Discrete Cosine Transform (DCT) domain. In the case
34、 of lossy compression, the image suffers information loss in the high frequency domain.In the proposed watermark casting algorithm from, the image is partitioned in 8*8 pixel blocks similar to the JPEG algorithm. The watermarking algorithm consists of two steps. The first step selects certain blocks
35、 according to a Gaussian network. In the selected blocks we modify DCT coefficients such that they fulfill a given constraint. The parameters of the Gaussian functions and of the imposed constraints on the DCT coefficients make up the watermark code. In the detection stage we first check for the DCT
36、 constraints and afterwards for the respective block location.In Section 2 we propose a technique for choosing block sites. The DCT constraint embedding step is explained in Section 3. The detection stage is presented in Section 4. This analysis is necessary in order to determine the suitable watermark parameters such that each watermark is distinctly identified from all the others. The simulation results for applying the proposed algorithms in gray level and color images are provided in Section 6. In Section 7 the conclusions of the present study are drawn.
