TW460851B - A digital watermarking technique using neural networks - Google Patents

A digital watermarking technique using neural networks Download PDF

Info

Publication number
TW460851B
TW460851B TW88115524A TW88115524A TW460851B TW 460851 B TW460851 B TW 460851B TW 88115524 A TW88115524 A TW 88115524A TW 88115524 A TW88115524 A TW 88115524A TW 460851 B TW460851 B TW 460851B
Authority
TW
Taiwan
Prior art keywords
watermark
image
digital
media
value
Prior art date
Application number
TW88115524A
Other languages
Chinese (zh)
Inventor
Jen-Cheng Jang
Guo-Feng Huang
Ming-Shiang Huang
Original Assignee
Jang Jen Cheng
Huang Guo Feng
Huang Ming Shiang
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 Jang Jen Cheng, Huang Guo Feng, Huang Ming Shiang filed Critical Jang Jen Cheng
Priority to TW88115524A priority Critical patent/TW460851B/en
Application granted granted Critical
Publication of TW460851B publication Critical patent/TW460851B/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/0021Image watermarking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00General purpose image data processing
    • G06T2201/005Image watermarking
    • G06T2201/0083Image watermarking whereby only watermarked image required at decoder, e.g. source-based, blind, oblivious

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

Watermarking techniques are primarily used for copyright protection. We invented a digital watermarking technique which is based on neural networks, cryptography, and image processing techniques. Our scheme can achieve the following two goals. One is that the illegal users do not know the locations of an embedded watermark in the image. The other is that a legal user can retrieve the embedded watermark from an altered (filtering, lossy compression, and scaling) image. In particular, the original image is not necessary for watermarking retrieving.

Description

460851 -------- 五、發明説明(、) A7 B7 經濟部中央標準局ικ Η消費合作社印裂 <發明背景> 麻由於網際網路之蓬勃發展,使得許多企業意圖將之 舌動上以爭取商機,例如:電子購物、電子文件交換、 告大的ί隨選視訊等。如此,將可為公司企業及其顧客帶來相 性’但在此—病也衍生出了許多資訊安全上的問題 二目ί交易、竊取、篡改等。這其中有許多問題可運用密碼 傳送ϋί * ’但有關有價媒體(如影像、聲音、影片等)在網路上 古服、口果’其智慧財產所有權(著作權)之認證及驗證問題則有待 數位半= 轉水㈣是麟此___瞧術,我們可以把 在盆所創數位簽章(digitalsignature)的一種’類似晝家 ::於數位:體上自己的簽章一樣,但最大的不嶋 使得人遭不法人士利用#訊科技技術加以篡改,這 符以ίΐ慧財產權的目的’數位浮水印技術必須至少 h:::(註冊商標)加入後之媒體與原媒體的差異性,必須 …、法讓人用肉眼辨識出來,也就是品質要高。、 2·除。法者外’他人無法偵測出該影像有數位浮水印的存在。 公’,換句話說,不能把 設前提下。 結破壞者不知道系統是如何運作的假 1._r|_r.---— iI — c (請先閱讀背面之注意事項再填寫本頁) 、1T, j _— Μ氏張尺度適用中 460851 五、發明説明(460851 -------- V. Description of the invention (,) A7 B7 Central Bureau of Standards of the Ministry of Economy ικ ΗConsumer cooperative print < Background of invention > Hemp Due to the booming Internet, many companies intend to make it Move your tongue to win business opportunities, such as: electronic shopping, electronic file exchange, large video on demand, etc. In this way, it will bring similarity to the company and its customers. But here, the disease also generates many information security problems. Binocular transactions, theft, tampering, etc. Many of these issues can be transmitted using passwords. 'But the question of the authentication and verification of intellectual property ownership (copyright) of valuable media (such as images, sounds, videos, etc.) on the Internet, and their fruit and fruits, remains to be digital and half = Zhuan Shui Zhuan is this ___ Seeing the art, we can use a digital signature created in the basin (similar to the day family :: 于 Digital: the same as your own signature, but the biggest is not Makes people be tampered with by lawless people using # 讯 科技 技术, which is for the purpose of the property rights of the digital media. The digital watermarking technology must have at least h :: :( registered trademark). The difference between the media and the original media after joining, must ... The method allows people to identify with the naked eye, which means that the quality is higher. 2. Divide. Outside of the law ’others cannot detect the presence of a digital watermark in the image. Public ’, in other words, ca n’t set the premise. Breakers who do n’t know how the system works are fake 1._r | _r .----- iI — c (please read the precautions on the back before filling this page), 1T, j _—M's Zhang scale is applicable 460851 5. Description of the invention (

2即省儲存d ’在取出浮水印時,不必藉由原媒體之辅=可完成。也就是不料了取出浮水印而翻時儲存兩份 螺體。 5·經 經濟部中央標準局員工消費合作社印製 經訊號處理技術處理(如flltering、⑹sy — eQmprcssiQn、 crop-and-paste等)後’其品質仍在可接受的範圍内時,該浮水 印仍然可以被顯示出來。 曰浮水印的藏入多半是利甩數位麵具有可失真的特性,也就 疋把數位資__似後使其對人_射不致有太大的影響 。圖一是數位浮水印的一般架構圖(以影像來說明)。在技術上,浮 水印技術可时為兩域,第—_spatialdQmain,係直接藉由 改變數位舰絲達餅水印之藏人,這财法具錢速運算的 優點,但通常比較難以有效抵抗各類型訊號處理的破壞, Voyatzis及Pitas兩位學者於1996年首先提出了將環形曲線自構 (torus automorphism)理論應用在數位浮水印技術上,他們先把浮 水印經環形曲線自構理論處理(打亂)後再直接將之藏入影像中較不 重要的部份(least significant bits, LSB),而不法人士只要把LSB隨 便改填任意的數值,即可將藏入的浮水印移除,因此他們的方法 極容易遭人破禳,1997年他們又提出了改良的方法,但也只可以 抵抗失真性影像壓縮(JPEG)及影像模糊處理的攻擊,所以仍無法 達到實用性的要求。Kutter等學者於1998年提出了 一個利用頻率 調整法(amplitude modulation)把浮水印藏入彩色影像中的藍色頻道 (blue channel)中,Kutter等人宣稱他們的方法可以抵擋失真性影像 壓縮(JPEG)、影像模糊處理及影像旋轉(rotation)的攻擊,然而他 (請先聞讀背面之注意事項再填寫本頁) .裝·2 That is to save the storage d 'When removing the watermark, it can be done without the assistance of the original media. That is, unexpectedly remove the watermark and store two copies of the spiral body when turning it over. 5. After printing by signal processing technology (such as flltering, ⑹sy — eQmprcssiQn, crop-and-paste, etc.) printed by the consumer cooperative of the Central Bureau of Standards of the Ministry of Economic Affairs, the watermark is still in the range of acceptable quality Can be displayed. It is said that the hiding of the watermark is mostly because the digital surface has a distortable characteristic, which means that the digital data can be used to make the digital image not have a great impact on people. Figure 1 is a general architecture diagram of a digital watermark (illustrated with an image). Technically, the floating watermark technology can be two domains. The first _spatialdQmain is a Tibetan that directly changes the digital ship silk cake watermark. This financial method has the advantage of speedy operation, but it is usually difficult to effectively resist various types. For the destruction of signal processing, two scholars, Voyatzis and Pitas, first proposed to apply the torus automorphism theory to digital watermarking technology in 1996. They first processed the watermark through the toroidal curve self-construction theory (disrupting) ) And then directly hide it in the least significant bits (LSB) of the image. Unauthorized people can just replace the LSB with any value, and then they can remove the hidden watermark, so they The method is very easy to be broken. In 1997, they proposed an improved method, but they can only resist the attacks of distorted image compression (JPEG) and image blur processing, so they still cannot meet the practical requirements. Kutter et al. (1998) proposed a method of using amplitude modulation to hide watermarks in the blue channel of color images. Kutter et al. Claimed that their method can resist distortion image compression (JPEG ), Image blurring and image rotation attacks, but he (please read the precautions on the back before filling this page).

、1T ,線 本紙張尺度適用中國國家標準(CNS ) A4規格(210X297公釐)‘ 4 460851 A7 Γ ----— B7__ - 五、發明説明(3 ) ~ ----1 =的缺點除了僅可適鎌彩色影像之外,安全性也不夠高,破壞j 者可以用他們的方法,依樣晝的把浮水印給移除。另一類浮i 水印技術則是先將數位資料轉至frequency d〇main,如傅立葉轉換丨 (F_er transformation)、離散餘弦轉換(discrete | 丨_ transformation)及微波轉換(wavdet transf〇_i〇n)等,轉換後,則〗| j 藉由改變、_換後麟_缝縣藏人浮水印,再狀獅為| | 原先的spatial domain ’如此即完成浮水印的藏入動作。與上一類| | 方法比較,通常較具有抵抗峨處理破壞之能力。和Wu兩|〔丄 位學者在1999提出了 -個利用離散餘弦轉換pcT)的數位浮水印技意丁 術’他們的方法可以抵抗失真性影像壓縮(jpEG)及影像切割丨丨 (cropping)的攻擊’可惜的是他們的方法在取出浮水印時必須要配 j 合原始影像才可以達成,也就是說—張影像,為了加人浮水印,^ 需要同時儲存兩份’其中-份為未藏人浮水印的原始影像,如此| 一來對儲存空間會造成相當大的浪費。因此他們的方法實用性較 f 為有限。 * I 線 輕濟部中央榡準局員工消費合作社印製 迄今為止,已被展出來的浮水印技術均是由使用者自行作 藏入以及驗證的工作,因此canvas等學者提出了其他人也可以聲 稱其具有該媒體之所有權,也就是任何人都可以在已被加入浮水 印的媒體上再加入自己的浮水印,如此一來在同一份媒體上存在 了二份浮水印,因此到底誰是真正且合法的該媒體之擁有者便無 法禮認了,之後便有許多學者,如Voyatzis及Pitas等提出數位浮| 水印必須透過可信賴的第三者(類似公開金匙系統中的認證中心)來 協助’才能夠真正的解決保護智慧財產的問題,然而這通常會使 本紙張尺度適用中關家襟準(CNS) M規格(2】σχ297公董) 46085 1 A7 B7 五、發明説明(4 ) 得此一可信賴的第三者對於運算與儲存空間之負荷過大,因為他 必須面對廣大的使用大眾。 我們所發明的方法是一種全新的方法,屬於第二類ftequency domain技術’藉由離散餘弦轉換來取出重要的係數值,並經由類 神經網路之訓練來完成浮水印的藏入,並且能夠符合前述數位浮 水印技術的要求,尤其是我們的方法僅須透過可信賴的第三者針 對秘密金匙及由類神經網路所產生的權重值簽署一份時戳簽章即 可,此-可信㈣第三者不讀_者齡任何資訊,因此㈣ 會造成大量的辑貞擔,確實賴兼具實祕與安全㈣= 法者之智慧財產權。 的保護σ (請先閱讀背面之注意事項再填寫本頁) -裝· 訂 線' 經濟部中央標準局員Η消費合作社印製 本紙張尺度適财酬料縳(CNS ) Α4規格 (21 ΟΧ297公釐~) 6 460851 五、發明説明( A7 B7 <發明目的> 水印基於類神、_路之_ _ itvf 賴由可信賴的第三者以數位簽章簽署 時藉進一步證明其為該影像合法之著作權擁有者。 t發明之另-目的係在提供—種植基於轉經網路之數位浮 =帽人浮水顿_像經各種触峨處理(如模糊 處理、清晰處理、失真壓縮以及影 等 浮水印仍财⑽抑來。 之後〜像上的 本發明之又-目的係在提供一種植基於類神經網路之數位 其於影像中藏入浮水印的演算法完全可以公開;且不 須為了取出浮水印而儲存兩張影像。 請 先 閲 讀 背 面 之 注、 1T, the size of the paper is applicable to the Chinese National Standard (CNS) A4 specification (210X297 mm) '4 460851 A7 Γ -------- B7__-V. Description of the invention (3) ~ ---- 1 = In addition to the disadvantages In addition to being suitable for sickle color images, the security is not high enough. Those who destroy j can use their methods to remove the watermark in the same way. Another type of floating i watermarking technology is to first transfer digital data to frequency domain, such as Fourier transformation (F_er transformation), discrete cosine transformation (discrete | 丨 _ transformation), and microwave transformation (wavdet transf〇_i〇n) Wait, after the conversion, then | j By changing, _ changing back Lin_ seam county Tibetan watermark, and then resembling a lion as | | The original spatial domain 'This completes the watermark hiding action. Compared with the previous | | method, it is usually more capable of resisting E. And Wu | [A scholar proposed a digital watermarking technique using discrete cosine transform (pcT) in 1999 '. Their method can resist distortion image compression (jpEG) and image cutting. Attack 'Unfortunately, their method must be matched with the original image when removing the watermark, that is to say-for the image, in order to add a watermark, ^ need to store two copies at the same time, of which-copies are not hidden The original image of the human watermark, so | it will cause a considerable waste of storage space. Therefore, their method is less practical than f. * Printed by the Consumers' Cooperative of the Central Government Bureau of the Ministry of Light Industry of the Ministry of I-Line. So far, the watermarking technologies that have been exhibited are hidden and verified by the users themselves. Therefore, scholars such as canvas have proposed that others can also Claims that it owns the media, that is, anyone can add their own watermark to the media that has been added with the watermark, so that there are two watermarks on the same media, so who is the real And the legal owner of the media ca n’t be acknowledged. Later, many scholars, such as Voyatzis and Pitas, proposed digital floating | watermarks must be passed through a trusted third party (similar to the authentication center in the public key system). "Assistance" can really solve the problem of protecting intellectual property, but this usually makes this paper standard applicable to the Zhongguan Jiajin Standard (CNS) M specification (2) σχ297 公 董 46085 1 A7 B7 V. Description of the invention (4) This trusted third party has too much load on computing and storage space, because he has to face a large number of users. The method we invented is a brand-new method, belonging to the second type of ftequency domain technology, which uses discrete cosine transform to extract important coefficient values, and completes the embedding of the watermark through the training of neural network-like, and can meet the The requirements of the aforementioned digital watermarking technology, especially our method, only need to sign a time stamp signature on the secret key and the weight value generated by the neural network through a trusted third party. The third party believes that the third party does not read any information about _ person's age. Therefore, it will cause a lot of burdens. It really depends on both the secret and the security. Protection σ (Please read the precautions on the back before filling this page)-Binding and Threading 'Printed on a paper size suitable for financial compensation (CNS) Α4 size (21 〇 × 297 mm) ~) 6 460851 V. Description of the invention (A7 B7 < Purpose of the invention > The watermark is based on the god-like, _ 路 之 _ _ itvf when it is signed by a trusted third party with a digital signature to further prove that it is legal for the image The copyright owner of t. Another invention-the purpose is to provide-planting digital floating based on the retransmission network = hat man floating-like through various tactile processing (such as blurring, clear processing, distortion compression and shadow floating) The watermark is still frustrated. Afterwards, the present invention on the image-the purpose is to provide an algorithm for planting digital watermarks based on neural-like networks, which can hide the watermark in the image, and it is not necessary to remove it. Watermark while storing two images. Please read the note on the back first

II

I 裝 經濟部中央橾準局員工消費合作社印製 規 一釐 4 6085 1I Installed printed by the Central Consumers Association of the Ministry of Economic Affairs, Consumer Cooperatives, 1% 4 6085 1

---I 裝-- (請先聞讀背面之注意事項再填寫本頁) 訂--- I Pack-(Please read the precautions on the back before filling this page) Order

-線-------------- HI I. J 1- I :fN4 608 5 1-Line -------------- HI I. J 1- I: fN4 608 5 1

五、發明説明( AM ΛΜ f(x,y) = SS«(«)«(v)C(w,v)cos (2x + \)un ~~ 2N (2y + \)νπ ~~2 N 'V. Description of the invention (AM ΛΜ f (x, y) = SS «(«) «(v) C (w, v) cos (2x + \) un ~~ 2N (2y + \) νπ ~~ 2 N '

Jt=0 ys〇 cos 式中’ iV為二維矩陣的維度,在一般的應用中,㈣常設為’ /…”尉,細為在原矩陣座標㈣的值,乂㈣為轉換後在座標hvj的值,α肉為: 指 fork=0 福 f〇rk=l,2,“.,N-l. ----r.-----1¾衣-- '/_\ (請先閱讀背面之注意事項再填寫本頁) 經濟部中央標準局®:工消費合作社印製 由DCT的定義中,可以發現在轉換前後,其資料量並無變化 ’但是在轉換後的矩陣中,位於左上角的係數值最大,即⑺, 我們稱之為DC Component,其餘的係數,由DC周圍開始,愈向右 下角的係數其重要性愈低,這些係數稱之為AC C〇mp〇nent,這也 就是說,能量往矩陣的左上角集中。 倒傳遞類神經網路是屬於一種監督式的學習網路模式,其基 本原理是利用最陡坡降法(the gradient steepest descent method)的觀 念,用以最小化函數的誤差值,倒傳遞類神經網路的架構如圖二 所示’在輸入層的神經元(neuron)或單元(unit),用來代表輸入的變 數’隱藏層用以表達輸入層的各單元間的交互影響,輸出層則用 來表現輸出的變數。輸入層及輸出層的單元數目視應用之實際需 要而定’至於隱藏層的層數及單元數則一般採用實驗方式來決定 ,層與嘐間的單元為全連結(fUll connection)方式,每個連結有一 本紙張尺度適用中國國家標準(CNS ) A4规格(210 X 297公釐) 訂 -線_ ^80851 A7 B7 經濟部中央標準局員工消費合作社印製 L; 五、發明説明(8 ) — 權重值(weight) ’用來表示兩個單元間的關連程度,求得 重值即是我們根據已知的輸人及輸出向量加以訓練、學/的權 目標。每解元的運算方式如圖三解,_般式麵的主要 叫(,) = Σ、柳-义, i% (,+ 1) 〇,〆,)),(0 = /〇«. («;(0)♦ 式中: j 某一單元的編號或索引(index) z' 與單元/連結的前一層中的某一單元編號 α·/0單元y在第/次疊代(step)的作用值 •^9 作用函數(activation function) ”的⑺單元/在第ί次疊代的輸入值 尽單元y·的門檻值(threshold or bias) WiJ連結單元ΰ·間的權重值 巧®單元/在第ί次疊代的輸出值 ’。ut〇 輪出函數(output fimction) 其中最常被使用的作用函數及輸出函數分另 facXX)= \ + e 0 if x < 〇, f〇utix)~^ ifjoO, λ: otherwise. k紙張尺度適财規格 (21 OX297公釐) 10 〈靖先聞讀背面之注意事項再填寫本耳』 .裝 -訂 線 丨J為: • HI · 4 60 8 51 五、發明説明( 9 A7 B7 δ. 气中的又稱為雙‘彎曲函數如扣行⑽),在疊代過程 中正權重值1^時’需要用到作用函數的微分式/如W,而 /⑽句等於/如句(1·乂〆尤刀’因此在計算過程中,並不需要真正計 算/ D這也疋雙’署曲函數常被用來當作八也恤丨⑽如^⑽的原 因之一 ’修正W的修正量之計算為:Jt = 0 ys〇cos where 'iV is the dimension of the two-dimensional matrix. In general applications, ㈣ is always' /… ”Wei, the value is in the original matrix coordinate ㈣, and 乂 ㈣ is the value in the coordinate hvj after conversion. Value, α meat is: Refers to fork = 0 Fokrk = 1, 2, "., Nl. ---- r .----- 1¾ clothing-'/ _ \ (Please read the note on the back first Please fill in this page again) The Central Standards Bureau of the Ministry of Economic Affairs®: Printed by the definition of the DCT of the Industrial and Consumer Cooperatives, it can be found that the amount of data has not changed before and after the conversion ', but in the converted matrix, the coefficient in the upper left corner The value is the largest, that is, we call it DC Component. The remaining coefficients start from around DC. The coefficients that are more toward the lower right corner are less important. These coefficients are called AC C〇mp〇nent, which means that The energy is concentrated towards the upper left corner of the matrix. The backward transitive neural network is a supervised learning network model. The basic principle is to use the concept of the gradient steepest descent method to minimize the error value of the function. The backward transitive neural network The architecture of the circuit is shown in Figure 2. 'The neuron or unit at the input layer is used to represent the input variables.' The hidden layer is used to express the interaction between the units of the input layer, and the output layer is used. To represent output variables. The number of units in the input layer and output layer depends on the actual needs of the application. As for the number of layers and the number of units in the hidden layer, it is generally determined experimentally. The units between the layer and the frame are fUll connection. Each Linked to a paper size applicable to the Chinese National Standard (CNS) A4 specification (210 X 297 mm) Order-line_ ^ 80851 A7 B7 Printed by the Consumer Cooperatives of the Central Standards Bureau of the Ministry of Economic Affairs; printed by L; V. Invention Description (8)-Weight The value 'weight' is used to indicate the degree of connection between the two units. Finding the weight value is the weight goal we train and learn based on the known input and output vectors. The calculation method of each solution element is shown in the third solution. The main name of the _ formula is (,) = Σ, Liu-yi, i% (, + 1) 〇, 〆,)), (0 = / 〇 «. ( «; (0) ♦ where: j the number or index of a unit z 'and the unit number in the previous layer connected to the unit / α α / 0 unit y in the / th iteration ^ 9 activation function ⑺ unit / threshold value of unit y · threshold value (threshold or bias) of WiJ link unit 巧 · unit weight / The output value of the iteration '.ut〇 round out function (output fimction) The most commonly used function and output function are divided into facXX) = \ + e 0 if x < 〇, f〇utix ) ~ ^ ifjoO, λ: otherwise. k Paper size suitable financial specifications (21 OX297 mm) 10 〈Jingxian first read the precautions on the back before filling in this ear ''. Binding-line 丨 J is: • HI · 4 60 8 51 V. Description of the invention (9 A7 B7 δ. Also known as double 'bending function such as withholding line' in the air, when the positive weight value is 1 ^ during the iteration process, a differential expression of the action function is needed / such as W And / haiku equals / Sentence (1 · 乂 〆 尤 刀 'Therefore, in the calculation process, there is no need to really calculate / D. This is also a double' signature function is often used as one of the reasons for the eight ya 丨 ⑽ ⑽ ⑽ 修正 'correction The correction amount of W is calculated as:

Aw.., = ηδ.ο. fact {netj ){t. - 〇.) if unj^ j is m output unit fm{net.Skif unit jis a hidden unit 式中: η學習參數(learning factor),為一常數值 h單元J已知或斯望的輸出值 k單元)連結到下一層中某一單元的編號 巧單元y·經由輸出函數所得到的輸出值 〜的初始值,一般是以亂數值給定,之後便以上述方法,又 稱為generalizeddelta_rule來修正%·, 一直疊代到收斂為止,將來 便可以利用這些觀值’配合已知的輸人向量綠測其對應的結 果值’上述方法又稱之為標準倒傳遞網路,以區別其他改良的^ 法。特別的是,在我們發明的方法中所使角的類神經網路並不 限於此一標準倒傳遞網路模式。 ° 本紙張尺度適用中國國家標準(CNS ) A4規格(210'〆297公釐) 11 I-ΓI-Γ.---— ItII (請先聞讀背面之注意事項再填寫本頁)Aw .., = ηδ.ο. fact (netj) {t.-〇.) If unj ^ j is m output unit fm {net.Skif unit jis a hidden unit where: η learning parameter is A constant value h unit J is known or the expected output value k unit) is a numbered unit connected to a unit in the next layer. The initial value of the output value ~ obtained through the output function is generally given as a random value. Then, the above method, also called generalizeddelta_rule, is used to modify the%. Iteratively iterates until convergence. In the future, you can use these observations to 'match the known input vector to measure the corresponding result value'. It is called a standard inverted delivery network to distinguish it from other improved methods. In particular, the horn-like neural network used in our invented method is not limited to this standard inverted transfer network model. ° This paper size applies Chinese National Standard (CNS) A4 specification (210'〆297 mm) 11 I-ΓI-Γ .---— ItII (Please read the precautions on the back before filling this page)

、1T 經濟部中央標準局員工消費合作社印製 46085Ί A7 B7 五、發明説明(10 ) 接著開始定義本發明數位浮水印技術相關的符號及其詳細的 演算法,設0為原始灰階影像,每個pixel需8 bits, W為二階浮水 印’即每個pixel以1 bit來表示,定義如下:〇 &lt;(¾ 0句·〈呢^,⑴ 1 式中⑽、or分職原始影的高度及寬度。 Wk==wQ&gt;j),k = i+j xww, (2) I 本 頁 經濟部中央標準局員工消費合作杜印製 (3)㈣的高度及寬度,為位於座標(/,力的 水印的主要秘密金匙,決定藏人位置的作法如種下子’來取回+ (¾½) =Rand(s, k\(4) 之座標點’其_免任:座標點相同,總共 塊Μ,其作法如下: :乃取出_的&amp;1.1T printed by the Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs 46085Ί A7 B7 V. Description of the invention (10) Then start to define the symbols and detailed algorithms related to the digital watermarking technology of the present invention. Let 0 be the original grayscale image. Each pixel requires 8 bits, and W is a second-order watermark. That is, each pixel is represented by 1 bit, which is defined as follows: 〇 (¾ 0 sentence · <? ^, Where ⑴ 1 where ⑽, or the height of the original shadow And width. Wk == wQ &gt; j), k = i + j xww, (2) I Printed on the page of the Central Standards Bureau of the Ministry of Economic Affairs (3) The height and width of ㈣ are in the coordinates (/, The main secret golden spoon of the force's watermark, the method of determining the position of the Tibetans is to plant seeds to retrieve the coordinates of + (¾½) = Rand (s, k \ (4) ', its _ removal: the same coordinates, a total of Block M, the method is as follows:: is to take out the &amp;

Mk = Submatrix(〇, Xk&gt; Xk+7&gt; yh yj&amp;7), (5) 訂 線Mk = Submatrix (〇, Xk &gt; Xk + 7 &gt; yh yj &amp; 7), (5) Order

^ n4608b A7 B7 五、發明説明(11 接著將Μ作DCT轉換,轉換之後,從第一到第九個AC components 3(¾…,,如圖四所示)中取若干個 components作為BPN的輸入向量,但至少應有五個以上;BpN的 輸出向量則是從第十到第十四個中取出若干個來,在稍後的實驗 結果中是以JCUCP*作為輸入向量,而jcy厶作為輸出 向量,而隱藏層包含有四個單元,BPN之架構如圖五所示。由於 BPN中作用函數(Aptivation function)之特性,所有的輸入及輸出值 均須先作線性轉換,使其值介於0到1之間的實數,如此方可套入 BPN中來加以訓練,換言之’真正作為BPN輸出入向量值是經過 線性轉換後的AC components。根據AC components的值域特性, 我們分別定義了線性轉換函數;„()及其對應的反轉換函數 如下: 少= (λ: + 1000) / 2000, ⑹ (請先閱讀背面之注意事項再填寫本頁) -裝. *1Τ X =Λτ/(ν) = 2000 &gt;&lt;少-1000。 ⑺ 線 經濟部中央標準局員工消費合作社印製 (8) ^ acl2 &quot; ACYl\-δ ifw. =0 AC\2.=&lt; f ACM, +S if w,. =1 ⑼ 經由BPN訓練之後,將所有的權重值記錄起來’並且可得 到由/(¾到所對應的JC72/,然後根據叭及XC72广來修改 得到乂 G7A&quot;,以JC72/取代JC72it後作反DCT運算後即完成 藏入浮水印,其作法如下: ACY1. =net^ 13 460851 A7 B7 五、發明説明(12) 其中)為-常數值,當3值愈大,所藏入的浮水印將來 雜’ __嫩料水印的影像 人後’必須將秘密金匙_ΡΝ的權 將來二二Ϊ素的:三者以數位簽章技術簽署-個時戮簽章, 來證明該浮水印㈣是在*—姆切的時間 所藏入的。 取回浮水印的程序與藏入時相同,但此時已不須要作咖的 訓練,可以直接由權重值w代入BPNModel中求得乂⑽,並以 下列判別式取出浮水印: 請 先 閲 讀 背 之 注 項 再 填 寫 本 頁 裝 ^ = «〇 if AC12k &lt; AC12k 'l \iAC12k&gt;AC12^ (10) 訂 接下來我們將使用根據我們發明的方法來測試其效能。在數 位訊號處理技射,我們常以PSNRCpeaksignaltonoLMg 別處理前後的差異程度,其計算方式為: _= 1() x 1〇g1。Σ [=)¾¾ 其中CV及(^分別為影像的寬度和高度,勿為原影像在座 標ft W的值,Ο丫X,勿則為修改後的值,255為每個像素使用一個位 元組(byte)時的最大值,PSNR值愈高,表示影像處理前後的差異 程度愈小’ 一般而言,PSNR值大於等於3〇時,已經很難由人的眼 睛辨別出差異來’也就是處理後的影像品質良好。 本紙張尺度適用中國國家標準(CNS ) A4規格(21〇X297公釐 線 經濟部中央檩準局員工消費合作社印製 (12) 14 460851 A7 B7 五、發明説明(13 經濟部中央標準局員工消費合作社印掣 在實驗中,我們取&lt;5值為20,圖六是以BPN作training時的 SSE(summation of square error)的變化曲線,學習參數?/以至 以較佳’大約經過75個epoches即可達到收傲,Training的時間算 是相當快速,圖七⑻是512x512的原始Lena影像,蜀七(c)為朝陽 科技大學的浮水印(64x64)。圖七(b)是將圖七(c)的浮水印藏入圖 七⑻之後的影像,其PSNR值為37.7,而圖七(d)則是直接從圖七 (b)取出的浮水印,其正確率為96.68%。圖八⑻是將藏入浮水印 的影像(圖七(b))經過模糊處理,即每個pixei修改為鄰近5X5個 pixel的平均值,修改後其PSNR值為29.46,圖八(b)則是作影像清 晰處理,PSNR值為34.14。圖八⑹是從圖八⑻取出的浮水印, 正確率為86.99%,而圖八(φ則是從圖八(的取出的浮水印,正確 率為 96.73%。 圖九⑻是將藏入浮水印的影像(圖七⑼)經過JPEG失真壓縮後 的影像,其PSNR值為33.35,圖九(b)則是將影像縮小成 256x256,圖九(c)是從圖九⑷取出的浮水印,正確率為86 64%。 而圖九(d)則是將圖九(b)以鄰近點近似法(nearest加丨轨⑹)還原成 512x512 (PSNR==28.16)後再從中所取出的浮水印,正確率為 84.50% 〇 最後我們以不同的影像(’’Barbara”及’’Airplane”),分別測試了 上述各種影像處理的破壞,於各種處理後所得之PSNR值與取回浮 水印之正確率,綜合整理列表於圖十。從以上的實驗結果看來, 我們所發_齡浮水印技躺確可峨抗各觀_理的破壞 ,達到具有商度保護智慧財產權的__項實用的全新發明。^ n4608b A7 B7 V. Description of the invention (11 Then convert M to DCT. After the conversion, take several components from the first to the ninth AC components 3 (¾ ..., as shown in Figure 4) as the input of the BPN. Vector, but there should be at least five; the output vector of BpN is taken from the tenth to the fourteenth, in the later experimental results, JCUCP * as the input vector, and jcy 厶 as the output Vector, and the hidden layer contains four units. The architecture of BPN is shown in Figure 5. Due to the characteristics of the Aptivation function in BPN, all input and output values must be linearly converted first, so that their values are between Real numbers between 0 and 1 can be put into BPN for training, in other words, 'the true input and input vector values of BPN are AC components after linear conversion. According to the range characteristics of AC components, we define linearity separately. Conversion function; „() and its corresponding inverse conversion function are as follows: Less = (λ: + 1000) / 2000, ⑹ (Please read the precautions on the back before filling this page) -install. * 1Τ X = Λτ / ( ν) = 2000 &gt; &lt; less -1000.印 Printed by the Consumer Cooperatives of the Central Standards Bureau of the Ministry of Online Economics (8) ^ acl2 &quot; ACYl \ -δ ifw. = 0 AC \ 2. = &Lt; f ACM, + S if w ,. = 1 之后 After BPN training , Record all the weight values' and get the corresponding JC72 / from / (¾ to XC72 /, then modify it to get 乂 G7A &quot;, replace the JC72it with JC72 /, and complete the hidden DCT operation. The method of inserting a watermark is as follows: ACY1. = Net ^ 13 460851 A7 B7 V. Description of the invention (12) Where) is a constant value. When the value of 3 is larger, the hidden watermark will be mixed in the future. __ tender material The image of the watermarker must be changed to the right of the secret key _PN. The three are signed with a digital signature technology-a time stamp, to prove that the watermark is in *-Mche The time is hidden. The procedure for retrieving the floating watermark is the same as when hiding it, but no training is required at this time. You can directly substitute the weight value w into the BPNModel to get 乂 ⑽, and use the following discriminant formula to remove the floating watermark. Watermark: Please read the notes on the back before filling in this page. ^ = «〇if AC12k &lt; AC12k 'l \ iAC12 k &gt; AC12 ^ (10) Order Next we will use the method according to our invention to test its performance. In digital signal processing technology, we often use PSNRCpeaksignaltonoLMg to determine the difference before and after processing. The calculation method is: _ = 1 ( ) x 1〇g1. Σ [=) ¾¾ where CV and (^ are the width and height of the image, respectively, not the value of the original image at the coordinate ft W, 〇 X, not the modified value, 255 uses one bit for each pixel The maximum value in bytes. The higher the PSNR value, the smaller the difference between before and after image processing. Generally speaking, when the PSNR value is greater than or equal to 30, it is already difficult to discern the difference by human eyes. The processed image is of good quality. This paper size is in accordance with Chinese National Standard (CNS) A4 specifications (21 × 297 mm line printed by the Consumers' Cooperatives of the Central Bureau of Standards of the Ministry of Economic Affairs (12) 14 460851 A7 B7 V. Description of the invention (13 In the experiment, the Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs took the value of <5 as 20. Figure 6 shows the change curve of SSE (summation of square error) when training with BPN. Learning parameters? Jia 'can be proud after about 75 epoches, and the training time is quite fast. Figure VII is a 512x512 original Lena image, and Shu Qi (c) is the watermark (64x64) of Chaoyang University of Science and Technology. ) Is the watermark of Figure 7 (c). The image after Figure 7⑻ has a PSNR value of 37.7, while Figure 7 (d) is a watermark directly taken from Figure 7 (b), and the accuracy rate is 96.68%. Figure 8⑻ is hidden in the watermark The image (Figure 7 (b)) is blurred, that is, each pixei is modified to the average value of neighboring 5X5 pixels, and the modified PSNR value is 29.46. . Figure 8⑹ is the watermark removed from Figure 8⑻, the correct rate is 86.99%, and Figure 8 (φ is the watermark removed from Figure 8 (, the correct rate is 96.73%. Figure 9⑻ is the hidden The watermarked image (Figure 7) is a JPEG distortion-compressed image with a PSNR value of 33.35. Figure 9 (b) reduces the image to 256x256. Figure 9 (c) is the watermark removed from Figure 9⑷ The correct rate is 86 64%. And Figure 9 (d) is the floating point extracted from Figure 9 (b) after it is restored to 512x512 (PSNR == 28.16) by the nearest point approximation method (nearest plus orbital). Watermark, the correct rate is 84.50%. Finally, we tested the damage of the above image processing with different images ("Barbara" and "Airplane"). The PSNR values obtained after various treatments and the correct rate of retrieved watermarks are summarized in Figure 10. From the above experimental results, it seems that the _age floating watermark technique we issued can indeed resist the damage of various perspectives. , To achieve __ practical new inventions that have been discussed to protect intellectual property rights.

(請先閱讀背面之注意事項再填寫本頁) 裝· 訂--_— 線 15 4 60851 A7 B7 五、發明説明(14) 經濟部中央標準局員Η消費合作社印製 &lt;安全性之分析&gt; 數位淨水印技術麵錄方面,可峨兩财向加以探討, -個是使用訊號處理的技術來加以破壞,而這_方面的考量,如 前所述,細所發明的方法可以有_減,另―方面的破細 是根據夺水印本身演算法的雖,觸加以破壞所藏人的浮水印 ,接下來細將針對本發明以各種不_破壞絲分析探討其安 全性。 由於每一張影像經訓練後的權重值(秘密金匙)並不會相同,而 且藏入浮水印的位置竊盜者並無法得知,因此若藉由多份已藏入 浮水印的媒體中’試圖以統計分析#方式來破壞或分析出合法者 的秘岔金廷疋無法達成的’此一分析方法亦稱之為共謀攻擊 (collusion attack)。另一種攻擊法稱之為暴力式攻擊(bmte attack),也就是把整個原始資料全部都加以改變,但這種方式會 把原始媒體所呈現的意義也給破壞了,因此並不適用於數位浮水 印系統,但如改用機率式的攻擊,則竊盜者正確的找出浮水印所 藏的某一點之機率為(〇HX〇w)-i ’假設每一點可被有效破壞的機率 為一分之一,且需要破壞掉浮水印一半以上才為有效的破壞, 其有效破壞浮水印的機率為: 讀 先 閲 讀 背 之 注 意 事 項 再丨 t 裝 訂 線 則 \ 2x〇hx〇w 由此可見其有效破壞的機率是非常低的 j這一類的攻擊而言,同樣是相當安全的。 本紙張尺度適用中國國家標準(CNS ) A4規格(21〇χ297公釐) 因此我們的方法詞· 16 經濟部中央標準局—工消費合作社印製 460851 五、發明説明(15) 在我們的方法中’秘密金匙即亂數產生器種子s與經BpN訓絲 後的權重值,在完成浮水印藏入之後隨即將之送至可信賴的第三 者(認證中心或法院)簽署時戳(time_stamp)以證明該秘密金匙的峰 是在確切的時間所產生的,然而竊盜也可以用同樣的方法產生 屬於他自己的秘密金匙,再試圖偽造一個假的時戳簽章,使其羞 生秘密金起_間比合法者的還早,如此便能有效的錢他人的 智慧財產’妓齡簽章狀顧賴錢觸純⑽此 cryptosystem) ’如RSA等來實賴,目此舰者要倾—個假的時 ^簽章等於是要破解公開金起密碼系統,其困難度是相當相當的 南,絕非目前一般電腦系統所能夠辦得到的,所以我們的方法在 此一方面的安全性也是絕對足夠的。 分析,可以確認我們所發明的數位浮水印技 靠的並膽合數位浮水印技術的各項要求: 1·加入浮辑後之影像品f甚高。 、卜他人無法偵測出該影像有數位浮水印的存在。 並未卩㈣算法完何以糊’我觸纽安全性 築在破壞者不知道系献如何運作的假設前提下。 不用為不必藉由原媒體之辅助即可完成,也就是 取出汙水印而須同時儲存兩份媒體 A7 B7 ---ΙΓ--r-----^ n I - * US. (請先閲讀背面之注意事項再填寫本頁j ---訂--' ^1---------- 5.經 出來 ^影像處理之破壞後(圖八〜圖十),浮水印仍然可以顯示 Μ氏張尺度適用中國 A4規格(2〗0乂297公釐.) 17 中 央 標 準 局 負 費 合 作 社 印 製 4 60851 五、發明説明(16) A7 B7 〈圖式說明〉 數位浮水印基本架構圖。 倒傳遞類神經網路架構圖。 單元運算示意圖。 DCT轉換運算後AC係數編號示意圖。 本發明使用之BPN架構示意圖。 本發明於經BPN訓練之SSE變化曲線示意圖。 縣雌人浮水印之&quot;Lena 〃雜及朝陽科 孜大學之原始與取回的浮水印示意圖。 圖八:if 莫糊與清晰處理後的影像以及從其中取出浮水印 * 圖丸:ίίϊ5ίί子壓織縮小處理後的影像以及從其中取出浮 圖十:本發明於不同影像取出數位浮水印之正確率統計圖表。 、’圖— ,圖二 〆.圓三 -圖四 、圖五 圖六 ,圖七 --r--r.-----1¾衣-- (請先閲讀背面之注意事項再填寫本頁) 訂 諫 本紙張尺度適用中國國家標準(CNS ) Α4规格(210 X 297公釐 18(Please read the precautions on the back before filling in this page) Binding and binding --_— Line 15 4 60851 A7 B7 V. Description of the invention (14) Printed by the Central Standards Bureau of the Ministry of Economic Affairs, Consumer Cooperatives &lt; Analysis of Safety &gt; In terms of digital watermarking technology, we can discuss the two financial directions, one is to use signal processing technology to destroy, and this _______________________________ ______________ ___________ ___________ ___________ ________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ___________ ______________ ___________ ______________ ___________ ___________ __________ ________ ________ ________ ________ ________ ________ ___________ with regard to this aspect, as mentioned earlier, the method invented by XI may have The reduction in the other aspect is based on the algorithm of capturing the watermark itself. Although it touches the watermark that destroys the hidden people, the security of the invention will be discussed with various non-destructive silk analysis. Since the weight value (secret golden key) of each image after training will not be the same, and the location of the watermark is not known to the thief, if there are multiple copies of the media that have been hidden in the watermark, 'Attempting to use statistical analysis # to destroy or analyze the secrets of the legal person, Jin Tingjun could not be reached.' This analysis method is also called a collusion attack. Another type of attack is called a violent attack (bmte attack), that is, the entire original data is changed, but this method will destroy the meaning presented by the original media, so it is not suitable for digital floating Watermarking system, but if a probabilistic attack is used instead, the probability that a thief correctly finds a point hidden in the watermark is (〇HX〇w) -i 'Assuming that each point can be effectively destroyed, the probability is One-half, and it is necessary to destroy more than half of the watermark in order to effectively destroy it. The probability of effectively destroying the watermark is: Read the precautions of reading the back first, and then the gutter is \ 2x〇hx〇w. The probability of effective destruction is very low. Attacks of this type are also quite safe. This paper size applies the Chinese National Standard (CNS) A4 specification (21 × 297 mm). Therefore, our method words. 16 Printed by the Central Standards Bureau of the Ministry of Economic Affairs—Industrial and Consumer Cooperatives 460851 5. Invention Description (15) In our method 'The secret golden key is the random number generator seed s and the weight value after BpN training. After the watermark is hidden, it will be sent to a trusted third party (certification center or court) to sign the time stamp (time_stamp ) To prove that the peak of the secret key was generated at the exact time, but the burglar can also use the same method to generate his own secret key, and then try to forge a fake time stamp signature to make him ashamed It ’s earlier than the legal ones to make secret money, so that they can effectively make money on the intellectual property of others. Want to pour a fake time ^ signature is equivalent to cracking the open gold password system, the difficulty is quite low, it is by no means at present ordinary computer systems can do, so our method is in this aspect Security also Absolutely enough. Analysis can confirm that the digital watermarking technology we invented is reliable and meets the requirements of the digital watermarking technology: 1. The image quality f after adding the floating series is very high. 2. Others cannot detect the presence of digital watermarks in the image. I do n’t know why the algorithm is complete. I ’m safe on the premise that the saboteur does n’t know how the system works. There is no need to do it without the assistance of the original media, that is, take out the sewage seal and store two copies of media A7 B7 --- ΙΓ--r ----- ^ n I-* US. (Please read first Note on the back then fill out this page j --- Order-'^ 1 ---------- 5. After the image processing is destroyed (Figure 8 ~ Figure 10), the watermark can still be used. Shows the M's scale is applicable to Chinese A4 specifications (2〗 0 乂 297 mm.) 17 Printed by the Central Standards Bureau Negative Fee Cooperative 4 60851 V. Description of the invention (16) A7 B7 Schematic diagram of the digital watermark Schematic diagram of reverse transfer neural network. Schematic diagram of unit operation. Schematic diagram of AC coefficient number after DCT conversion operation. Schematic diagram of BPN architecture used by the present invention. Schematic diagram of SSE change curve of the present invention trained by BPN. The original and retrieved watermarks of Lena Miscellaneous and Chaoyang Kezi University. Figure 8: if the image is not clear and processed and the watermark is removed from it * Figure pill: ίϊ5 ί 压 Weaving reduced image And remove the floating image from it: the invention is in different images A statistical chart of the correct rate of digital watermarks is produced. 'Figure —, Figure 2〆. Circle 3-Figure 4, Figure 5 Figure 6, Figure 7 --r--r .----- 1¾ clothing-(Please (Please read the notes on the back before filling this page) The size of this paper applies to the Chinese National Standard (CNS) Α4 size (210 X 297 mm 18

Claims (1)

460851 1 補充 Α8 Β8 C8 D8 申請專利範圍 1 種植基於類神經網路之數位浮水印技術,該技術包含 於媒體中藏入及取出浮水印等兩大部份,其特徵在於: 於媒aa中藏入浮水之技術主要包含下列步驟, 步驟一.選擇並載入欲藏入浮水印之原始影像; 步驟二.使用者依亂數產生器種子決定DCTbl〇cks位置; 步私二.遥擇合適之AC係數作為類神經網路的輸出入向量並 執行類神經演算法加以訓練以取得權重值; 步驟四.根據訓練結果及浮水印的像素值決定修改係數值 (輪出向量部份)’並作反DCT運算後即完成浮水印的 藏入動作; 步驟四·將秘密金匙交由可信賴的第三者以數位簽章技術簽署 時戳; 步驟五.將秘密金匙及時戳簽章存入資料庫; 經濟部中喪標率局負工消費合作社印製 i nl·— ml nn m^i .... - I ,Γ\· 09· (請先閱—背面之注意事項再填寫本頁) 於媒體中取出浮水印之技術主要包含下列步驟, 步驟一.載入欲取出浮水印的影像資料; 步驟二.從資料庫中取出該媒體之秘密金匙及其時戳簽章; 步馬聚三,以秘密金匙決定DCTblocks位置,並將權重值套入類 神經網路中比對係數值而取得預藏之浮水印; 本紙張尺度相f _家縣(7¾ a« (^0X297^ 19 460851 8 8 8 8 ABCD 六、申請專利範圍步驟四.取出正確之浮水印後,以該可信賴第三者之公開金匙 驗證日镇«之正抓H步確定該浮 藏 入時間。 格規 4 A \)/ 5 N C 準 標 家 國 國 中 .用 適 ;1尺 張紙 ___^__本. 經濟部中央標準局員工消費合作社印製 X ο 2460851 1 Supplementary A8 B8 C8 D8 Patent application scope 1 Planting digital watermarking technology based on neural-like network. This technology includes two major parts: hiding and removing watermarks in the media. It is characterized by: The technique for entering floating water mainly includes the following steps: Step 1. Select and load the original image to be hidden in the watermark; Step 2. The user determines the position of DCTblocs according to the random number generator seed; Step 2. Select the appropriate one remotely The AC coefficients are used as input and output vectors of the neural network and trained by neural-like algorithms to obtain weight values. Step 4. Determine the modified coefficient values (round out the vector part) according to the training results and the pixel values of the watermark 'and make After the inverse DCT operation, the watermark hiding operation is completed; Step 4: Hand the secret key to a trusted third party to sign the time stamp with digital signature technology; Step 5. Deposit the secret key in time Database; printed by the Consumers ’Cooperative of the Lost Bid Rate Bureau of the Ministry of Economic Affairs i nl · — ml nn m ^ i ....-I, Γ \ · 09 · (Please read—Notes on the back before filling out this page ) In the media The technique of taking out watermarks mainly includes the following steps: Step 1. Load the image data of the watermarks to be taken out; Step 2. Take out the secret key of the media and its time stamp signature from the database; The secret key determines the position of the DCTblocks, and sets the weight value into the comparison coefficient value in the neural network to obtain a pre-hidden watermark. The paper scale phase f_ 家 县 (7¾ a «(^ 0X297 ^ 19 460851 8 8 8 8 ABCD VI. Patent Application Step 4. After taking out the correct watermark, verify that the town ’s «Zhengzheng« step H is determined by the trusted third party ’s public gold key to determine the floating time. Standard 4 A \ ) / 5 NC quasi-standard home country and middle school. Appropriate; 1 foot of paper ___ ^ __ this. Printed by the Consumer Cooperatives of the Central Standards Bureau of the Ministry of Economy X ο 2 (請先閱讀背而之注意事項异填寫本X ) :__------, ( -- T(Please read the precautions and fill in this X first): __------, (-T
TW88115524A 1999-09-06 1999-09-06 A digital watermarking technique using neural networks TW460851B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW88115524A TW460851B (en) 1999-09-06 1999-09-06 A digital watermarking technique using neural networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW88115524A TW460851B (en) 1999-09-06 1999-09-06 A digital watermarking technique using neural networks

Publications (1)

Publication Number Publication Date
TW460851B true TW460851B (en) 2001-10-21

Family

ID=21642244

Family Applications (1)

Application Number Title Priority Date Filing Date
TW88115524A TW460851B (en) 1999-09-06 1999-09-06 A digital watermarking technique using neural networks

Country Status (1)

Country Link
TW (1) TW460851B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI398829B (en) * 2010-03-17 2013-06-11 Floating watermark embedding device and verification device, digital floating watermark verification system
TWI742312B (en) * 2017-10-02 2021-10-11 宏達國際電子股份有限公司 Machine learning system, machine learning method and non-transitory computer readable medium for operating the same

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI398829B (en) * 2010-03-17 2013-06-11 Floating watermark embedding device and verification device, digital floating watermark verification system
TWI742312B (en) * 2017-10-02 2021-10-11 宏達國際電子股份有限公司 Machine learning system, machine learning method and non-transitory computer readable medium for operating the same

Similar Documents

Publication Publication Date Title
Zear et al. A proposed secure multiple watermarking technique based on DWT, DCT and SVD for application in medicine
Tsai et al. Robust lossless image watermarking based on α-trimmed mean algorithm and support vector machine
Chang et al. A secure fragile watermarking scheme based on chaos-and-hamming code
Memon et al. Hybrid watermarking of medical images for ROI authentication and recovery
Chen et al. A novel digital watermarking based on general non-negative matrix factorization
Anand et al. Health record security through multiple watermarking on fused medical images
Gul et al. A novel triple recovery information embedding approach for self-embedded digital image watermarking
Jana et al. Local feature based self-embedding fragile watermarking scheme for tampered detection and recovery utilizing AMBTC with fuzzy logic
Shen et al. A self-embedding fragile image authentication based on singular value decomposition
Zeki et al. An intermediate significant bit (ISB) watermarking technique using neural networks
Chen et al. On the security of a copyright protection scheme based on visual cryptography
Surekha et al. A multiple watermarking technique for images based on visual cryptography
Bedi et al. An adaptive data hiding technique for digital image authentication
TW460851B (en) A digital watermarking technique using neural networks
Gaur et al. An Extensive Analysis of Digital Image Watermarking Techniques
Fofanah et al. Watermarking of frequency and steganography for protection of medical images based on bacterial foraging optimization and genetic algorithm
Chang et al. A robust DWT-based copyright verification scheme with Fuzzy ART
Dong et al. The medical image watermarking algorithm with encryption by DCT and logistic
Alam et al. A Novel Hybrid Watermarking scheme with Image authentication based on frequency domain, 2-Level SVD using chaotic map
Tiwari et al. Semifragile watermarking schemes for image authentication-A survey
Thakur et al. Encryption Based DWT-SVD Medical Image Watermarking Technique Using Hamming Code
TW532039B (en) Robust gray-level watermark embedding and retrieving technique
Lukman et al. Discrete Cosine Transform Method for Watermarking in Digital Image Processing
TW448670B (en) A feature oriented digital watermarking technique for multimedia
Sharma et al. DWT and quantization based digital watermarking scheme using kernel OS-ELM

Legal Events

Date Code Title Description
GD4A Issue of patent certificate for granted invention patent
MM4A Annulment or lapse of patent due to non-payment of fees