WO2001054053A1 - Attribution de domaine de transformee destinee au filigranage multimedia - Google Patents

Attribution de domaine de transformee destinee au filigranage multimedia Download PDF

Info

Publication number
WO2001054053A1
WO2001054053A1 PCT/US2001/002280 US0102280W WO0154053A1 WO 2001054053 A1 WO2001054053 A1 WO 2001054053A1 US 0102280 W US0102280 W US 0102280W WO 0154053 A1 WO0154053 A1 WO 0154053A1
Authority
WO
WIPO (PCT)
Prior art keywords
transform
watermark
data
domain
watermarked
Prior art date
Application number
PCT/US2001/002280
Other languages
English (en)
Inventor
Raymond Knopp
Arnaud Robert
Original Assignee
Ecole Polytechnique Federale De Lausanne
Businger, Peter, A.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ecole Polytechnique Federale De Lausanne, Businger, Peter, A. filed Critical Ecole Polytechnique Federale De Lausanne
Priority to AU2001231109A priority Critical patent/AU2001231109A1/en
Publication of WO2001054053A1 publication Critical patent/WO2001054053A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process
    • H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
    • G06T1/0078—Robust watermarking, e.g. average attack or collusion attack resistant using multiple thresholds
    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/018—Audio watermarking, i.e. embedding inaudible data in the audio signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32154—Transform domain methods
    • H04N1/3216—Transform domain methods using Fourier transforms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32154—Transform domain methods
    • H04N1/3217—Transform domain methods using wavelet transforms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32154—Transform domain methods
    • H04N1/32187—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32154—Transform domain methods
    • H04N1/32187—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients
    • H04N1/32192—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients according to calculated or estimated visibility of the additional information in the image
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32154—Transform domain methods
    • H04N1/32187—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients
    • H04N1/32197—Transform domain methods with selective or adaptive application of the additional information, e.g. in selected frequency coefficients according to the spatial domain characteristics of the transform domain components
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H04N21/2389—Multiplex stream processing, e.g. multiplex stream encrypting
    • H04N21/23892—Multiplex stream processing, e.g. multiplex stream encrypting involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/835—Generation of protective data, e.g. certificates
    • H04N21/8358—Generation of protective data, e.g. certificates involving watermark
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0052—Embedding of the watermark in the frequency domain
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3225—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document
    • H04N2201/3233—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document of authentication information, e.g. digital signature, watermark
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3269—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs
    • H04N2201/327—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs which are undetectable to the naked eye, e.g. embedded codes

Definitions

  • the present invention relates to watermarking of digital information, e.g. audio, image, video and multimedia data.
  • SDMI Secure Digital Music Initiative
  • watermarking In one technique, known as cryptography, original readable content is transformed into information which is useless and meaningless to all except the proprietary user who has a secret key for decrypting.
  • watermarking a special message signal for authorship proofing is embedded in original data such that over-all size or format remains unchanged, and preferably with little or no perceptible distortion as compared with the original.
  • watermarking comprises embedding a watermark signal as well as its extraction. Audio, image and video watermarking have become fields of interest especially in data transfer/copying over the Internet. Digital representations allow for perfect copying, without degradation of quality/content.
  • Watermarking techniques may be divided into three main categories, namely (i) visible watermarks placed on the background of an image so as to be visible in viewing the image, (ii) techniques based on spread-spectrum technologies for spreading information over the entire spectral range of the content, and also on perceptual models for embedding the watermark in a transparent manner, and (iii) techniques based on a communication systems approach.
  • a technique proposed by Wornell and Cheng is based on quantification indexes, with the watermark then being a sequence of quantization operators used to represent a signal.
  • watermarking can be considered as a communication system problem in which the watermark signal is transmitted through a channel, namely the digital content and/or any attack, and is detected/retrieved at a receiver when authorship fraud is suspected in a content.
  • detection theory to determine an optimal watermark signal for a specified model of the channel and of the watermark signal.
  • models are established of the watermark signal and of the channel, both as to the digital content to be watermarked and any potential attack.
  • the watermark is additive to the content.
  • Gaussian statistics can be used to model the digital content to be watermarked, with the digital content being represented in a specified transform domain in which the
  • Gaussian model is valid from the point of view of the watermark detection procedure.
  • detection theory can serve in determining an optimal watermark or, more specifically, an optimal place or optimal components for the watermark signal to be embedded.
  • the components can be selected for maximizing the probability of watermark detection, i.e. maximizing the watermark-to-signal power ratio to countervail an attacker's attempt at minimizing the detection probability and the constraints on the problem.
  • Watermark embedding and extraction can be based on block-by-block processing in which the original content to be watermarked is divided into a succession of blocks of data having length in agreement with signal characteristics. The same block lengths can be used in watermark detection. A decision as to the presence/absence of the watermark signal in the digital content can be based on partial decisions made from the content blocks.
  • a preferred embedding technique comprises obtaining the transform domain representation of both the digital content and the watermark signal, generating a watermark signal using a secret key, determining an optimal place for watermarking in the transform domain by maximizing the probability of detection based on the signal characteristics and the problem constraints, adding the watermark signal at the optimal place, and inverse-transforming to obtain the watermark signal in the original domain.
  • a preferred detection technique for watermarked and possibly attacked received digital content comprises obtaining the transform domain representation of the content, regenerating the watermark signal in the transform domain using the secret key, finding the optimal place for the watermark signal from the content using the technique and parameters of the embedding technique, determining a correlation factor between the regenerated watermark and the received content, and deciding on presence/absence of the watermark depending on whether or not the correlation factor is above a specified threshold.
  • Fig. 1 is a flow diagram for watermark embedding, showing original content, watermark, embedding technique, and watermarked content.
  • Fig. 2 is a flow diagram for watermark detection, showing watermarked content, watermark, extraction technique and decision.
  • Fig. 3 is a communications system diagram for watermarking when the original content is not available at the receiver, showing a transmitter, watermark channel, and receiver.
  • Fig. 4 is a transmitter diagram, showing a complex fast Fourier transform (FFT) module, transform domain allocation module, inverse fast Fourier transform (IFFT) module, complex random generator, and a normalizer.
  • FFT complex fast Fourier transform
  • IFFT inverse fast Fourier transform
  • Fig. 5 is a receiver diagram, showing a complex FFT module, transform domain allocation module, correlator, complex random generator, normalizer, and synchronizer.
  • Fig. 6 is a graphic of signal component power with a large difference between components in a 2-dimensional case.
  • Fig. 7 is a graphic of signal component power with a small difference between components in a 2-dimensional case.
  • Fig. 8 is a graphic illustrating energy bin decomposition of transformed input data.
  • Terms used herein-above and -below include the following: host content - the content to be watermarked; watermark signal - the signal or content used in watermarking as a signature of- the content to be checked for the presence of a watermark; watermarked content — the content that has been watermarked; watermarking - embedding a watermark signal into a host content to enable detection of fraud on copyright; extraction — assessment of the presence/absence of a watermark signal in received content; watermarker - author who intends to embed a watermark signal in a host content; attacker — one who intends to deteriorate or remove a watermark signal from a content known or suspected to be watermarked; DFT— discrete Fourier transform; SNR - signal-to-noise ratio.
  • Fig. 1 illustrates watermark embedding in an original content.
  • Fig. 2 illustrates watermark extraction, wherein a suspected watermark signal is regenerated and extracted from a supposed watermarked content. No use of the original content is required.
  • Fig. 3 illustrates watermarking as a communications system aspect.
  • a watermark signal w is generated using a secret key and the original content s . With the watermark additively embedded there results the signal s bar .
  • embedding can be viewed as an additive noise channel, here called watermark channel.
  • the watermarked signal s bar may be co ⁇ iipted by an attack, resulting in the received signal r .
  • the watermark detector or receiver processes r to determine whether or not w is present.
  • the original signal s is not required in the process.
  • Figs. 4 and 5 illustrate preferred transmitter and receiver embodiments wherein the transform domain is the Fourier transform.
  • the watermarking problem can be interpreted as a communication system problem as follows: optimize the probability of detection of a watermark signal embedded in a digital content, having a model of this content and of the channel, and given some distortion constraints between the original content and the watermarked content, as well as between the original content and the watermarked content that has been attacked. This ia summarized ' by the foll ⁇ wing equations and their corresponding distortion constraints
  • the watermarking is additive, that is the watermark is added to the concent, in a given transform domain.
  • 5 ⁇ + /( ⁇ ) where the watermark is some function of the original content w — /(*). Is our case this function will be determined by the allocation strategy. Therefore, referring to Pig.3, the two detection hypotheses is the absence of an attack are:
  • the optimal attack will choose the hi for which the WSR 01 * (In) . is ⁇ ni ⁇ m ⁇ m while satisfying the distortion constraint Doot OH) ⁇ D ⁇ .
  • the optimal wa ⁇ e ⁇ nark-to-signal power ratio is
  • WSR op ⁇ mia WSR* pt (ft.)
  • N dhnen ⁇ ionB N dhen ⁇ ionB
  • the N dimensions axe split into ⁇ N energy bins, the borders of which are determined by any arbitrary perception-based scheme.
  • the total signal power for a particular bin is the sum of the variances of the components falling in that bin.
  • the allocation scheme then uses these bin owers to place the watermark in the components occupying the optimal bin.
  • the bin borders and their number need not be placed in the public domain. This decomposition into energy bins is shown in. Fig. ⁇ .
  • the embedding technique The block diagram of the embedding process (transmitter) is shown in Fig.
  • the computing algorithm is the following:
  • This invention is not restricted to the block size - used in the preferred embodiment; nor to the transform domain nor to any ar icular «»1« « * ⁇ * ⁇ nfr ⁇ mn ⁇ and ⁇ nari ⁇ pmra[ value la. step 4 of the embedding algorithm-
  • the pacudo- rando real and imaginary parts can. be obtained using other techniques that lead to a complex pseudo-random sequence.
  • the block diagram of the receiver of system B is illuattated in Fig. 5. It is very similar: to the transmitter, and comprises:
  • a correlation operation is used at the receiver to assess the presence of the watermark.
  • a threshold will be necessary to make the decision. All the other elements of the receiver are the same as those in the transmitter.
  • this invention is not restricted to the block size used in the preferred embodiment, nor to the transform domain nor to any particular value of minimum and maximum value in step 4 of the algorithm.
  • a re-synchronization algorithm is used at the receiver.
  • the algorithm is only used if the correlation factor either drops from a high value to a low one, or if the correlation in the first block of content has low value.
  • the algorithm searches for the shift in the transform domain (hi the present case of the FFT, the shift is the phase) that leads to best correlation factor, and uses this shift from, that block, on. If at the end of the search, no "optimal" shift was.f ⁇ und, the block of content is taken as not watermarked, and the extraction of the waie ⁇ nark r ⁇ - ⁇ tarts at the next block of data.
  • the algorith runs as follows any block (starring at Index fe) for which the re-synchronization is necessary:
  • CF is the correlat-on factor
  • CO(x, y) is the correlation between s and y
  • BL is the block length used in the embedding and extraction processes.
  • the actual decision on the presence/absence of the- watermark signal in the digital content is based on the partial decisions (relative to a threshold) taken in each block of the content.
  • the decision Is based on the arithmetic average over all partial decision- s. If the average is above a threshold, the content is said to be watermarked; if the average is close to the threshold, the content is said to be watermarked with a probability given by the de sfon number, and if the average is much below the threshold, the content is said to-be not watermarked.
  • the normalized (to the maximal correlation factor obtained) threshold is equal to 0.9 in the preferred embodiment. Therefore, if DW is the decision on the presence/absence of the watermark signal, DW n the partial decision on any block of content, and N the total amount of blocks over the entire content's length, and 6 the threshold value, we have:

Abstract

L'invention concerne un filigrane appliqué à des données audio, image, vidéo ou multimédia, pouvant servir à vérifier l'authenticité de ces données. Afin que le filigrane soit imperceptible, notamment invisible ou inaudible, il est inséré dans des parties sélectionnées des données, qui ne sont ni significatives ni négligeables d'un point de vue perceptuel. Des exemples du domaine de l'incorporation sont des coefficients complexes de Fourier et des coefficients d'ondelettes. On obtient une représentation spectrale fréquentielle des données, de préférence une transformée complexe de Fourier, et le filigrane est inséré dans les fréquences dont la variance se situe entre un seuil minimum et un seuil maximum. Dans la transformée de Fourier, la longueur de bloc est suffisamment grande pour que les composantes soit approximativement gaussiennes. Les données spectrales filigranées résultantes sont ensuite soumises à une transformée inverse en vue de l'obtention de données filigranées.
PCT/US2001/002280 2000-01-24 2001-01-24 Attribution de domaine de transformee destinee au filigranage multimedia WO2001054053A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2001231109A AU2001231109A1 (en) 2000-01-24 2001-01-24 Transform domain allocation for multimedia watermarking

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US17769300P 2000-01-24 2000-01-24
US60/177,693 2000-01-24

Publications (1)

Publication Number Publication Date
WO2001054053A1 true WO2001054053A1 (fr) 2001-07-26

Family

ID=22649601

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/002280 WO2001054053A1 (fr) 2000-01-24 2001-01-24 Attribution de domaine de transformee destinee au filigranage multimedia

Country Status (2)

Country Link
AU (1) AU2001231109A1 (fr)
WO (1) WO2001054053A1 (fr)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005122080A1 (fr) * 2004-06-08 2005-12-22 Koninklijke Philips Electronics N.V. Variation fondee sur la variance de la profondeur du tatouage numerique dans un signal media
US7574313B2 (en) 2004-04-30 2009-08-11 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Information signal processing by modification in the spectral/modulation spectral range representation
US7676336B2 (en) 2004-04-30 2010-03-09 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Watermark embedding
CN102074237A (zh) * 2010-11-30 2011-05-25 辽宁师范大学 基于直方图不变特性的数字音频水印方法
CN102157154A (zh) * 2011-01-28 2011-08-17 桂林电子科技大学 基于音频内容的非均匀离散余弦变换音频可靠性认证方法
CN110084622A (zh) * 2019-04-18 2019-08-02 西安邮电大学 一种商品溯源区块链系统及秘钥保存与找回方法
US10411888B2 (en) 2016-07-08 2019-09-10 Microsoft Technology Licensing, Llc Cryptography method
US10433166B2 (en) 2016-07-08 2019-10-01 Microsoft Technology Licensing, Llc Cryptography using RF power measurement
US10469260B2 (en) 2016-07-08 2019-11-05 Microsoft Technology Licensing, Llc Multiple cryptographic key generation for two-way communication
US10560264B2 (en) 2016-11-08 2020-02-11 Microsoft Technology Licensing, Llc Cryptographic key creation using optical parameters
CN115831131A (zh) * 2023-01-15 2023-03-21 中国科学技术大学 一种基于深度学习的音频水印嵌入提取的方法

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5930369A (en) * 1995-09-28 1999-07-27 Nec Research Institute, Inc. Secure spread spectrum watermarking for multimedia data

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5930369A (en) * 1995-09-28 1999-07-27 Nec Research Institute, Inc. Secure spread spectrum watermarking for multimedia data

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7574313B2 (en) 2004-04-30 2009-08-11 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Information signal processing by modification in the spectral/modulation spectral range representation
US7676336B2 (en) 2004-04-30 2010-03-09 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Watermark embedding
WO2005122080A1 (fr) * 2004-06-08 2005-12-22 Koninklijke Philips Electronics N.V. Variation fondee sur la variance de la profondeur du tatouage numerique dans un signal media
CN102074237A (zh) * 2010-11-30 2011-05-25 辽宁师范大学 基于直方图不变特性的数字音频水印方法
CN102074237B (zh) * 2010-11-30 2012-07-04 辽宁师范大学 基于直方图不变特性的数字音频水印方法
CN102157154A (zh) * 2011-01-28 2011-08-17 桂林电子科技大学 基于音频内容的非均匀离散余弦变换音频可靠性认证方法
US10411888B2 (en) 2016-07-08 2019-09-10 Microsoft Technology Licensing, Llc Cryptography method
US10433166B2 (en) 2016-07-08 2019-10-01 Microsoft Technology Licensing, Llc Cryptography using RF power measurement
US10469260B2 (en) 2016-07-08 2019-11-05 Microsoft Technology Licensing, Llc Multiple cryptographic key generation for two-way communication
US10560264B2 (en) 2016-11-08 2020-02-11 Microsoft Technology Licensing, Llc Cryptographic key creation using optical parameters
CN110084622A (zh) * 2019-04-18 2019-08-02 西安邮电大学 一种商品溯源区块链系统及秘钥保存与找回方法
CN115831131A (zh) * 2023-01-15 2023-03-21 中国科学技术大学 一种基于深度学习的音频水印嵌入提取的方法

Also Published As

Publication number Publication date
AU2001231109A1 (en) 2001-07-31

Similar Documents

Publication Publication Date Title
Swanson et al. Robust audio watermarking using perceptual masking
US8340348B2 (en) Methods and apparatus for thwarting watermark detection circumvention
US7616776B2 (en) Methods and apparatus for enhancing the robustness of watermark extraction from digital host content
Cox et al. Watermarking as communications with side information
US7020775B2 (en) Derivation and quantization of robust non-local characteristics for blind watermarking
EP1376466B1 (fr) Filigranage par la quantification des statistiques des régions de recouvrement
EP0828372A2 (fr) Filigrame à spectre étalé pour signalisation intégré
US20060239503A1 (en) System reactions to the detection of embedded watermarks in a digital host content
CA2605641A1 (fr) Ameliorations en terme de securite apportees a des filigranes numeriques pour contenu multimedia
Radharani et al. A study on watermarking schemes for image authentication
Sequeira et al. Communication and information theory in watermarking: A survey
US20090172404A1 (en) Method and Apparatus for Hybrid Watermarking
WO2001054053A1 (fr) Attribution de domaine de transformee destinee au filigranage multimedia
Liu et al. Steganalysis of data hiding techniques in wavelet domain
Cacciaguerra et al. Data hiding: steganography and copyright marking
KR100692566B1 (ko) 불법복제 방지 및 추적 시스템
Holliman et al. Watermark extimation through local pixel correlation
Ramkumar et al. A robust oblivious watermarking scheme
KR100638583B1 (ko) 불법복제 방지 및 추적 방법
Gökozan Template based image watermarking in the fractional fourier domain
Daham Encryption Based Watermarking Technique For Security Of Medical Image
KR100484230B1 (ko) 안전성이 개선된 비대칭 디지털 워터마킹 방법
Balcı Robust watermarking of images
Karabat Robust blind and non-blind detection for digital watermarking
Fallahpour Reza High capacity data embedding schemes for digital media

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP