<p>In today's video delivery and broadcast networks, issues of copyright protection have become more urgent than in analog times, since the copying of digital video does not result in the decrease in quality that occurs when analog video is copied. </p><p>One method of copyright protection is to embed a digital code, a"watermark", into the video sequence. The watermark can then unambiguously identify the copyright holder of the video sequence. Watermarks can also be used to identify the purchaser of a video sequence, which is called "fingerprinting". </p><p>The objective of this master thesis was to implement a program that would insert watermarks into video sequences and also detect if a given video sequence contains a givenwatermark. </p><p>The video standard I chose to use was the H.264 standard (also known as MPEG4 AVC) as it offers a significant efficiency improvement over the previous video compression standards. </p><p>A couple of tests that can be considered representative for most image manipulations and attacks were performed. The program passed all tests, suggesting that the watermarking mechanism of this thesis can be expected to be rather robust, at least for the video sequence used. By looking at the watermarked video sequences and comparing them to the originals, or measuring the signal to noise ratio, one can also see that the watermarks are unobtrusive. The execution times were also measured. Compared to coding and decoding a H.264 video stream, the time it takes to insert and extract watermarks was much less. Calculating a threshold takes roughly double the time as decoding the sequence, though.</p>

In today's video delivery and broadcast networks, issues of copyright protection have become more urgent than in analog times, since the copying of digital video does not result in the decrease in quality that occurs when analog video is copied. One method of copyright protection is to embed a digital code, a"watermark", into the video sequence. The watermark can then unambiguously identify the copyright holder of the video sequence. Watermarks can also be used to identify the purchaser of a video sequence, which is called "fingerprinting". The objective of this master thesis was to implement a program that would insert watermarks into video sequences and also detect if a given video sequence contains a givenwatermark. The video standard I chose to use was the H.264 standard (also known as MPEG4 AVC) as it offers a significant efficiency improvement over the previous video compression standards. A couple of tests that can be considered representative for most image manipulations and attacks were performed. The program passed all tests, suggesting that the watermarking mechanism of this thesis can be expected to be rather robust, at least for the video sequence used. By looking at the watermarked video sequences and comparing them to the originals, or measuring the signal to noise ratio, one can also see that the watermarks are unobtrusive. The execution times were also measured. Compared to coding and decoding a H.264 video stream, the time it takes to insert and extract watermarks was much less. Calculating a threshold takes roughly double the time as decoding the sequence, though.

Digital watermarking is the way to solve digital image copyright protection problem. Such a solution is quite new and the need for software, which would ensure image authentication, is huge. Image authentication control area and its relevance are analyzed in this work. Digital watermarking theoretical basics are presented; six algorithms – Cox, Kim, Wang, Xia, Dugad and Zhu – are analyzed. The analysis of similar software was performed; it revealed the predominance of such software products that allows only visible (though transparent) watermarking, and the number of software with a possibility of invisible watermarking is small. The work consists of these main parts: analysis, design, user documentation and experimental research. The main objective of this work was to design and implement image authentication control system. This system has such features: PGM and JPEG format images review, digital watermark generation, embedding, extraction.

- / -

- / -

Dissertação (mestrado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2016. / Submitted by Camila Duarte (camiladias@bce.unb.br) on 2017-01-16T12:52:56Z No. of bitstreams: 1 2016_FelippePiresFerreira.pdf: 5509946 bytes, checksum: 5ff89a0c4b973f8f4e9b9d66d74e9845 (MD5) / Approved for entry into archive by Raquel Viana(raquelviana@bce.unb.br) on 2017-02-13T21:19:04Z (GMT) No. of bitstreams: 1 2016_FelippePiresFerreira.pdf: 5509946 bytes, checksum: 5ff89a0c4b973f8f4e9b9d66d74e9845 (MD5) / Made available in DSpace on 2017-02-13T21:19:04Z (GMT). No. of bitstreams: 1 2016_FelippePiresFerreira.pdf: 5509946 bytes, checksum: 5ff89a0c4b973f8f4e9b9d66d74e9845 (MD5) / Neste trabalho é proposto um método para disponibilização de documentos sigilosos durante inquéritos policiais, processos judiciais, ou que exijam compartimentalização das informações, introduzindo o elemento de segurança conhecido como watermark nas cópias dos documentos. O principal objetivo é permitir vincular este elemento a uma cópia de documento a seu destinatário inicial, e em casos de vazamento de informação permitirá identificar a origem da cópia. O método é baseado na semelhança entre caracteres de diferentes fontes de texto, os quais serão utilizados para criação de uma codificação identificadora da origem do documento, e possibilitar a inclusão de uma watermark em um documento eletrônico editável, bem como recuperá-la em documentos impressos ou digitalizados, bastando apenas um fragmento do texto. / This work proposed a method for available classified documents during the police investigation, judicial proceedings, or requiring compartmentalization of information, introducing the security element known as watermarking in copies of documents. This element will link a document copy to its initial recipient, and in cases of information leakage will identify the origin of the copy. The method is based on the similarity between characters of different fonts of text, which will be used to create a code identifying of the origin document, and include a watermark in an editable electronic document and retrieve it in printed or scanned documents, just by a fragment of text.

The main aim of this project is to implement two different types of the watermarking algorithm in frequency (transforamtion) domain. Because of the huge amount of the watermarking algorithms is this thesis dedicated to the watermarking methods in the frequency domain. These methods use kind of transformation implemented on the original data, the second step is modification of transformation coeficients. This project is dedicated to the methods which use discrete wavelet transformation. Nowdays the most popular transformation, which meets the best efforts. The aim of every method is to embeed the watermark into the original data so precisly, that none observer can recognize any change between the original and watermarked data. On the contrary, watermarked picture should be as resistant to the attacks as possible. By the term of attack, we understand all the ways, that disable watermark extraction. The watermark method robustness will be tested with the use of Checkmark program.

This diploma thesis is concerned in static pictures Security problems. That means, additional informations (watermark) are embedded to the original picture in a specific way. This complex picture structure (watermark) should be unremoval by different attacks runing processes. The main goal of this diploma thesis is realize two separated methods digital data watermarking in MATLAB program. For reason of a quite large scale of different watermarking methods are chosen at this time only two of take were choosen. First of the methods is Watermark injection in the spatial domain and the second in the freuquency domain. Both methods are set up in a special way and finish goals of the process. Expected result are, that digital picture user doesn't know about the watermarking technique was aplied on this picture and the watermarking data are the most resistant as possible as can be. These attacks were simulated in Checkmark program.

In spreads pectrum (SS)watermarking of audio signals, since the watermark acts as an additive noise to the host audio signal, the most important challenge is to maintain perceptual transparency. Human perception is a very sensitive apparatus, yet can be exploited to hide some information, reliably. SS watermark embedding has been proposed, in which psycho-acoustically shaped pseudo-random sequences are embedded directly into the time domain audio signal. However, these watermarking schemes use informed detection, in which the original signal is assumed available to the watermark detector. Blind detection of psycho-acoustically shaped SS watermarking is not well addressed in the literature. The problem is still interesting, because, blind detection is more practical for audio signals and, psycho-acoustically shaped watermarks embedding offers the maximum possible watermark energy under requirements of perceptual transparency. In this thesis we study the blind detection of psycho-acoustically shaped SS watermarks in time domain audio signals. We focus on a class of watermark sequences known as random phase watermarks, where the watermark magnitude spectrum is defined by the perceptual criteria and the randomness of the sequence lies in their phase spectrum. Blind watermark detectors, which do not have access to the original host signal, may seem handicapped, because an approximate watermark has to be re-derived from the watermarked signal. Since the comparison of blind detection with fully informed detection is unfair, a hypothetical detection scheme, denoted as semi-blind detection, is used as a reference benchmark. In semi-blind detection, the host signal as such is not available for detection, but it is assumed that sufficient information is available for deriving the exact watermark, which could be embedded in the given signal. Some reduction in performance is anticipated in blind detection over the semi-blind detection. Our experiments revealed that the statistical performance of the blind detector is better than that of the semi-blind detector. We analyze the watermark-to-host correlation (WHC) of random phase watermarks, and the results indicate that WHC is higher when a legitimate watermark is present in the audio signal, which leads to better detection performance. Based on these findings, we attempt to harness this increased correlation in order to further improve the performance. The analysis shows that uniformly distributed phase difference (between the host signal and the watermark) provides maximum advantage. This property is verified through experimentation over a variety of audio signals. In the second part, the correlated nature of audio signals is identified as a potential threat to reliable blind watermark detection, and audio pre-whitening methods are suggested as a possible remedy. A direct deterministic whitening (DDW) scheme is derived, from the frequency domain analysis of the time domain correlation process. Our experimental studies reveal that, the Savitzky-Golay Whitening (SGW), which is otherwise inferior to DDW technique, performs better when the audio signal is predominantly low pass. The novelty of this work lies in exploiting the complementary nature of the two whitening techniques and combining them to obtain a hybrid whitening (HbW) scheme. In the hybrid scheme the DDW and SGW techniques are selectively applied, based on short time spectral characteristics of the audio signal. The hybrid scheme extends the reliability of watermark detection to a wider range of audio signals. We also discuss enhancements to the HbW technique for robustness to temporal offsets and filtering. Robustness of SS watermark blind detection, with hybrid whitening, is determined through a set of experiments and the results are presented. It is seen that the watermarking scheme is robust to common signal processing operations such as additive noise, filtering, lossy compression, etc.

Esteganografia é uma técnica utilizada para ocultar uma informação secreta dentro de outro tipo de informação sem perda de qualidade da informação hospedeira e com o objetivo de extrair a informação posteriormente. Esteganografia reversível permite a exata restauração (sem perda) do sinal hospedeiro original após a extração da informação oculta. Várias ténicas reversíveis têm sido desenvolvidas, mas nenhuma delas parece ser apropriada para imagens binárias. Uma técnica de marca d\'água faz uso de técnicas esteganográficas para inserir informação em uma imagem hospedeira, com o intuito de fazer uma asserção sobre a imagem no futuro. Uma marca d\'água de autenticação (AWT) insere uma informação oculta na imagem com a intenção de detectar qualquer alteração acidental ou maliciosa na imagem. Uma AWT normalmente usa criptografia de chave secreta ou chave pública para computar a assinatura de autenticação da imagem, inserindo-a na própria imagem. JBIG2 é um padrão internacional para compressão de imagens binárias (com ou sem perda). Ele decompõe a imagem em várias regiões (texto, meio-tom e genérica) e codifica cada região usando o método mais apropriado. A criação de AWTs seguras para imagens binárias comprimidas é um importante problema prático. Porém, parece que nenhuma AWT para JBIG2 já foi proposta. Este trabalho propõe algumas técnicas esteganográficas para arquivos JBIG2. Então, estas técnicas são usadas para criar AWTs para imagens codificadas como JBIG2. As imagens marcadas são visualmente agradáveis, sem ruídos do tipo sal-e-pimenta. Este trabalho também propõe uma técnica esteganográfica reversível para imagens binárias. A técnica proposta seleciona um conjunto de pixels de baixa visibilidade e utiliza o algoritmo de Golomb para comprimir as previsões desses pixels. Então, a informação comprimida e a informação a ser oculta são inseridas na imagem. Imagens marcadas com a técnica proposta possuem excelente qualidade visual, pois apenas pixels de baixa visibilidade são modificados. Então, a técnica proposta é utilizada para autenticar imagens binárias e documentos de maneira reversível. / Data-hiding is a technique to hide secret information inside another group of information data, without loss of quality of the host information, and the means to extract the secret information afterwards. Reversible data-hiding enable the exact restoration (lossless) of the original host signal after extracting the embedded information. Several reversible data hiding techniques have been developed, but none of them seems to be appropriate for binary images. A watermarking technique makes use of data-hiding to insert some information into the host image, in order to make a posterior assertion about the image. An authentication watermarking technique (AWT) inserts hidden data into an image in order to detect any accidental or malicious alteration to the image. AWT normally makes use of secret- or publickey cryptographic ciphers to compute the authentication signature of the image, and inserts it into the image itself. JBIG2 is an international standard for compressing bilevel images in both lossy and lossless modes. JBIG2 decomposes the image into several regions (text, halftone and generic) and encodes each one using the most appropriate method. The creation of secure AWTs for compressed binary images is an important practical problem. However, it seems that no AWT for JBIG2 has ever been proposed. This work proposes some data-hiding techniques for JBIG2 files. Then, these techniques are used to design AWTs for JBIG2-encoded images. The resulting watermarked images are visually pleasant, without visible salt and pepper noise. This work also proposes a reversible data hiding technique for binary images. The proposed technique selects a set of low-visibility pixels and uses Golomb codes to compress the predictions of these pixels. Then, this compressed data and the net payload data are embedded into the image. Images watermarked by the proposed technique have excellent visual quality, because only low-visibility pixels are flipped. Then, the proposed data hiding is used to reversibly authenticate binary images and documents.