Processing method and system for secret mark of digital image
Abstract
Problem to be solved.To provide a method and a system for encoding a code into a digital image and auditing the image to determine whether it is derived from the encoded image. [Structure] A method and system for embedding a signature in a visible image in both a digital display and a print or film are provided. The signature is inseparably embedded in the visible image and survives image transformations such as resizing, conversion to print or film, and reconversion to digital form. Select a symbol point from the pixels of the original image, adjust the pixel value of the symbol point and the pixels around it by the amount that can be detected by the digital scanner, and this adjusted symbol point forms the digital symbol. The image derived from the image is stored for later identification. Signs are embedded in the image by searching for relatively extreme values in a continuous space of pixel values and selecting a sign point from them. [Selection diagram] Fig. 1
Term
Term ended
Projected expiry passed 9 May 2025, 1.4 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
33 claims: 32 independent, 1 dependent
- 1ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、ソース信号は、各々2進値を有するデジタルデータ値より成り、上記方法は、符牒の各ビットに対し、 上記ビットをソース信号の少なくとも1つのデータ値へとマップし、 上記ソース信号データ値の値を符牒のビットに基づいて変化させ、そして 少なくとも2つの隣接するソース信号データ値の値も符牒の上記ビットに基づいて変化させ、 ソース信号に対する変化はデータ値のグループにおいて行って、符牒が埋め込まれたソース信号の劣化に良く耐える、符牒のソース信号への頑丈な埋め込みを生じさせることを特徴とする方法。
- 2ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、ソース信号は、各々2進値を有するデータ値より成り、上記方法は、符牒の各ビットに対し、ソース信号データ値の値をそれに基づいて変化させる段階を含む方法において、ランダム関数を使用して、符牒の上記ビットがソース信号の上記値を変化させるところのソース信号内の位置をランダム化することを特徴とする方法。
- 3ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、ソース信号は像データを表し、上記方法は、 ソース信号内の複数の位置のデータ隠匿特性を評価し、そして データ隠匿特性の悪い位置を回避して、ソース信号内に符牒を埋め込み、 符牒は、それがあまり目立たないところで埋め込まれることを特徴とする方法。
- 4ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、ソース信号は像データを表し、上記方法は、 所定のデータ隠匿属性を有するソース信号の部分を識別し、そして 上記部分の少なくともあるところでソース信号を変化させて、そこに符牒の埋め込みを行い、 符牒は、それがあまり目立たないところで埋め込まれることを特徴とする方法。
- 5ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも2であり、ソース信号は像を表しそして複数のピクセルを含み、上記方法は、 像内の複数の符牒ポイントピクセルを擬似ランダムに識別し、 上記符牒ポイントピクセルの選択された第1グループに対して、上記ピクセル及びそれに関連した領域内のピクセルの値を増加し、そして 上記符牒ポイントピクセルの、上記第1グループとは異なる第2グループに対して、上記ピクセル及びそれに関連した領域内のピクセルの値を減少し、 上記符牒ポイント及びそれに関連した領域におけるピクセル値の上記選択された増加及び減少は、その後の識別のために像をマークするように働くことを特徴とする方法。
- 6符牒を埋め込むために像をマークする方法であって、その複数のポイントで像を変化させる段階を含む方法において、像に対するある変更を拘束すべきところの境界領域を画成し、この境界領域は、像全体より小さく、そして上記領域内でのみ上記ある変化を生じさせることを特徴とする方法。
- 7符牒を埋め込むために像をマークする方法であって、その複数のポイントで像を変化させる段階を含む方法において、像はピクセルより成り、そして変化を生じさせるところでピクセルをランダムに選択する段階を含むことを特徴とする方法。
- 8符牒を埋め込むために像をマークする方法であって、その複数のポイントで像を変化させる段階を含む方法において、像はピクセルより成り、上記変化は、各々の上記ポイントで符牒ピクセルの値を増加又は減少させ、更に、上記符牒ピクセルに隣接する各ピクセルの値を増加又は減少させて、それに隣接する符牒ピクセルの変化に対応させることを特徴とする方法。
- 9符牒を埋め込むために像をマークする方法であって、符牒は、上記像を後で識別し易くするものであり、上記方法は、 上記像の複数の符牒ポイントをランダムに選択し、 上記ランダムに選択された符牒ポイントの第1サブセット、及びそのランダムに選択された符牒ポイントを取り巻くポイントにおいて像の値を増加させ、 上記ランダムに選択された符牒ポイントの第2サブセット、及びそのランダムに選択された符牒ポイントを取り巻くポイントにおいて像の値を減少させるという段階を含むことを特徴とする方法。
- 10ポイントとして表された像を処理する方法であって、各ポイントはパラメータ値を有し、上記方法は、 像内の複数のポイントを識別し、 第1グループの上記識別されたポイント各々のパラメータ値を増加すると共に、各ポイントを取り巻く第1区分のポイントのパラメータ値も増加させ、そして 第2グループの上記識別されたポイント各々のパラメータ値を減少すると共に、各ポイントを取り巻く第2区分のポイントのパラメータ値も減少させるという段階を含むことを特徴とする方法。
- 11像にデータを埋め込む装置において、 ピクセルの順序付けされたセットとして像を記憶するためのコンピュータメモリを備え、各ピクセルは、ピクセルパラメータ値を有し、 更に、像内の複数のポイントを識別する手段と、 第1グループの上記識別されたポイント各々のパラメータ値を増加すると共に、その各ポイントを取り巻く第1区分のポイントのパラメータ値も増加するための像変更手段とを備え、 上記像変更手段は、更に、第2グループの上記識別されたポイント各々のパラメータ値を減少すると共に、その各ポイントを取り巻く第2区分のポイントのパラメータ値も減少することを特徴とする装置。
- 12オリジナルソース信号を処理して、Nビットの符牒を隠して埋め込んだソース信号を形成する方法であって、Nは少なくとも1であり、オリジナルソース信号は、各々パラメータ値を有する複数のエレメントを含む表示を有し、上記方法は、上記エレメントのパラメータ値を変化させて、符牒をそこに埋め込み、そして上記変化の大きさを上記パラメータ値に基づいてスケーリングする段階を含み、大きなパラメータ値を有するソース信号表示のエレメントは、小さなパラメータ値を有するソース信号表示のエレメントより相対的に大きく変化されることを特徴とする方法。
- 13第2データの複数のエレメントにより表わされた著作物内のNビットの第1データを埋め込む方法であって、Nは、少なくとも1であり、各エレメントは、ある値を有し、上記方法は、第1データの各ビットに対して、 ランダム関数を含むプロセスにより上記ビットを第2データの少なくとも1つのエレメントへとマップし、そして 第2データの上記少なくとも1つのエレメントの値を変化させ、 著作物に対する上記変化は、本質的に人間に分からないものであることを特徴とする方法。
- 14ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、上記方法は、 ソース信号内の複数の位置のデータ隠匿特性を評価し、そして データ隠匿特性の悪い位置を回避して、ソース信号内に符牒を埋め込み、 符牒は、それがあまり目立たないところで埋め込まれ、そして上記埋め込みは、本質的に人間に分からないような僅かなソース信号の変化を生じさせることを特徴とする方法。
- 15データのセットで表された像内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、上記方法は、 上記データセットの異なる部分のデータ隠匿特性を評価し、そして データ隠匿特性の悪い部分を回避して、データセットに符牒を埋め込み、 符牒は、それがあまり目立たないところで埋め込まれ、そして上記埋め込みは、本質的に人間に分からないような僅かな像の変化を生じさせることを特徴とする方法。
- 16データのセットで表された像内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、上記方法は、 所定のデータ隠匿属性を有するデータセットの部分を識別し、そして 上記部分の少なくとも幾つかにおけるデータのセットを変化させて、そこに符牒の埋め込みを行い、 符牒は、それがあまり目立たないところで埋め込まれ、そして上記埋め込みは、本質的に人間に分からないような僅かな像の変化を生じさせることを特徴とする方法。
- 17ソース信号内にNビットの符牒を埋め込む方法であって、Nは少なくとも1であり、上記方法は、 所定のデータ隠匿属性を有するソース信号の部分を識別し、そして 上記部分の少なくとも幾つかにおけるソース信号を変化させて、そこに符牒の埋め込みを行い、 符牒は、それがあまり目立たないところで埋め込まれ、そして上記埋め込みは、本質的に人間に分からないような僅かなソース信号の変化を生じさせることを特徴とする方法。
- 18ピクセル値をもつピクセルを有するオリジナル像に符牒を埋め込む方法であって、上記方法は、 オリジナル像のピクセルの中から複数の候補ポイントを探索し、 上記候補ポイントの中から第1の複数の符牒ポイントを選択し、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、そして 上記符牒を将来の識別のためにデータベースにデジタルで記憶する、という段階を含むことを特徴とする方法。
- 19ピクセル値をもつピクセルを有するオリジナル像について像符牒を処理する方法において、 オリジナル像のピクセルの中から第1の複数の符牒ポイントを選択し、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、そして 上記符牒を将来の識別のためにデータベースにデジタルで記憶する、という段階を含むことを特徴とする方法。
- 20ピクセル値をもつピクセルを有するオリジナル像に符牒を埋め込む方法において、 オリジナル像内の相対的に極端なピクセル値を探索し、 オリジナル像のピクセルの中から第1の複数の符牒ポイントを選択し、該選択は、パターンに基づいてその極端なピクセル値を有するピクセルの中から符牒ポイントを選択することを含み、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、そして 上記符牒を将来の識別のために記憶する、という段階を含むことを特徴とする方法。
- 21ピクセル値をもつピクセルを有するオリジナル像について像符牒を処理する方法において、 オリジナル像のピクセルの中から第1の複数の符牒ポイントを選択し、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、そして 上記符牒を将来の識別のために記憶する、という段階を含み、上記オリジナル像には境界エリアがあり、値が調整されるピクセルが、この境界エリア内に存在しないように、該ピクセルを選択することを特徴とする方法。
- 22ピクセル値をもつピクセルを有するオリジナル像について像符牒を処理する方法において、 オリジナル像のピクセルの中から第1の複数の符牒ポイントを選択し、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、 上記符牒を将来の識別のために記憶し、そして 符牒ポイントを取り巻く複数のピクセル値を調整して、符牒ポイントにおける調整されたピクセル値への滑らかな移行を与える、という段階を含むことを特徴とする方法。
- 23ピクセル値をもつピクセルを有するオリジナル像について像符牒を処理する方法において、 オリジナル像のピクセルの中から第1の複数の符牒ポイントを選択し、 オリジナル像内の符牒ポイントのピクセル値を調整することにより符牒を形成し、これにより、符牒と、符牒を形成するように調整されなかったオリジナル像のピクセル値とを含む符牒付けされた像を形成し、 上記符牒を将来の識別のために記憶し、そして デジタルの当該像が、符牒を形成するように調整されたピクセル値を有する符牒付けされた像を構成するか又はそこから派生されたかを分析するという段階を含み、この分析段階は、当該像の正規化を含むことを特徴とする方法。
- 24埋め込まれたデータが実質的に分からないようにデジタル像内にNビットの符牒を埋め込む方法であって、Nは少なくとも2であり、符牒の各ビットは、第1又は第2の値を有し、 デジタル像は、ピクセルの行及び列として与えられ、各ピクセルは、少なくとも輝度値及びそれに関連したカラー値を有し、 上記埋め込み動作は、データ隠匿属性に対してピクセルの複数のM行xM列領域を分析し、そして分析結果に基づいて埋め込むことを含み、 上記埋め込み動作は、上記ピクセルの少なくともあるピクセルに対し輝度値の増加を生じ、そして 上記埋め込み動作は、上記ピクセルの少なくとも他のピクセルに対し輝度値の減少を生じさせることを特徴とする方法。
- 255≦M≦10である請求項24に記載の方法。
- 26埋め込まれたデータが実質的に分からないようにデジタル像内にNビットの符牒を埋め込む方法であって、Nは少なくとも2であり、符牒の各ビットは、第1又は第2の値を有し、デジタル像はピクセルの行及び列として表示するように与えられる方法において、埋め込み動作は領域に基づいて行なわれ、各領域は、M個の隣接するピクセル行及びM個の隣接するピクセル列にわたり、Mは少なくとも5であることを特徴とする方法。
- 27デジタル像に符牒を埋め込む方法において、 複数のピクセルで構成された上記デジタル像を用意し、上記ピクセル各々は、少なくとも1つのカラーの輝度を表す輝度データを含み、そして 上記ピクセルの少なくとも1つに関連した上記輝度データを所定のパーセンテージ変化で調整することを特徴とする方法。
- 28オリジナル輝度を有する複数のオリジナルデータ値を含むデジタル像に符牒を埋め込んだ、埋め込み符牒を有する像を発生する方法において、 複数の符牒値を含むデジタル符牒を用意し、各符牒値は、パーセンテージ調整を有すると共に、上記オリジナルデータ値との対応関係を有し、そして 各々の上記オリジナルデータ値の上記オリジナル輝度に、符牒が見えないところの上記符牒値の対応する1つの上記パーセンテージ調整を乗算することにより、埋め込み符牒を有する像を形成する、という段階を含むことを特徴とする方法。
- 29符牒をデジタル像に埋め込む方法において、 デジタルのオリジナル像を用意し、 デジタルの符牒を用意し、そして デジタル符牒を埋め込んだ際にオリジナル像のピクセルの色度を変化させることなく、オリジナル像に符牒を重畳することにより、符牒を埋め込んだ像を形成する、という段階を含むことを特徴とする方法。
- 30オリジナル像にデジタル符牒を埋め込む方法において、オリジナル像のピクセル値の輝度のパーセンテージを調整してオリジナル像に符牒を入れる段階を含むことを特徴とする方法。
- 31符牒をデジタル像に埋め込むシステムにおいて、 デジタルのオリジナル像と、デジタルの符牒が記憶された記憶装置と、 符牒を埋め込んだ際にオリジナル像の色度を変化させることなく、オリジナル像に符牒を重畳することにより符牒を埋め込んだ像を形成する手段と、を備えたことを特徴とするシステム。
- 32複数のビットコードを埋め込むために著作物にマーキングする方法において、上記著作物は、複数のデータエレメントのセットとして与えられ、上記方法は、個々のデータエレメントの値だけでなく、その隣接データエレメントの属性にも基づいて、上記マーキングを行うために変更されるべきデータエレメントを選択し、上記隣接データエレメントは、実質的に非均一な値を有するデータエレメントより成ることを特徴とする方法。
- 33データ変更の明らかな痕跡を残さずに著作物にマーキングする方法において、上記著作物は、複数のデータエレメントのセットにより与えられ、上記方法は、第1の複数のビットデータを与え、この第1の複数のビットデータから、それに対応する付加的なエラー修正データを計算し、そして上記データエレメントの少なくともあるエレメントの値を、上記第1データ及びエラー修正データより成る複合データに基づいて変更する段階を含むことを特徴とする方法。
Independent claims33
38 paragraphs, as filed
The present invention relates to a method and system for encoding a signature into a digital image and auditing the digital image to determine if it is derived from the encoded image.
Various images are generally distributed to a large number of users in traditional printed matter and photographic media. For example, printed matter, photographs and film clips relating to the general public may be distributed in media. Owners may want to audit the use of those images in printed matter and electronic media, and therefore analyze printed matter, film and digital images and either obtain them directly from the owner or derive from those images. We need a way to determine if this is the case. For example, the owner of the statue may want to restrict access or use of the statue. In order to monitor and enforce such restrictions, it is useful to have a method of verifying that the image is a copy or derivative of the owner's image. This method of proof must be accurate and unobstructive. In addition, the method must be capable of detecting unauthorized copies that have been resized, rotated, cut, or otherwise slightly modified.
<p> In the field of computers, digital signatures are applied to digital data other than images to identify the source of the data. These known digital signatures have not been applied to digital image data for various reasons. One reason for this is that if the data to which these known digital symbols are applied is changed, these digital symbols will be lost. Digital images are often modified due to the formation of unintended "noise" by the mechanical playback equipment used each time they are printed, scanned, copied, or photographed. In addition, it is often desired to intentionally resize, rotate, cut, or otherwise resize the image. Therefore, existing digital signatures are unacceptable for use in digital images.</p>
<p> The present invention is a method and system for embedding an image symbol in a visible image, and in the preferred embodiments described herein, a method and system that can be applied to both digital display and other media such as printed matter and film. provide. The sign identifies the source or ownership of the statue, and also distinguishes separate copies of the single statue. In a preferred embodiment, these signatures survive image conversions such as resizing and print-to-film conversions, and thus the subsequent use of digital images, including prints and other forms of derivative images. It provides a way to track.</p><p> In the preferred embodiment described below, a plurality of sign points arranged in the original image having pixels with pixel values are selected. The pixel value of the sign point is adjusted by the amount that can be detected by the digital scanner. The adjusted sign points form a digital sign that is stored to identify the image derived from that image in the future.</p><p> In a preferred embodiment of the invention described below, the signature is embedded in the original image by positioning candidate points such that the pixel values are relatively extreme. The symbol points are selected from the candidate points, and the data bits are encoded by adjusting the pixel values at and around each point at each symbol point. It is preferable that the signature is redundantly embedded in the image, and the signature can be identified by using any of the redundant displays. The signature is stored for later use in identifying the image.</p><p> According to a preferred embodiment, identifying the image involves ensuring that the image is normalized, i.e., of the same size, rotation and brightness level as the original image. If not pre-normalized, the image is normalized by aligning and adjusting the luminance values of the subset of pixels in the image to match the corresponding subset in the original image. The normalized image is then subtracted from the original image and the result is compared to the stored digital signature. In another embodiment, the normalized image is directly compared to the marked image.</p>
The present invention relates to a method and system for embedding a signature in an original image to form the signatured image. A preferred embodiment comprises selecting a large number of candidate points in the original image and selecting a large number of sign points from among these candidate points. These sign points are slightly modified to form the sign. The sign points are stored for later use to audit the image and determine if the image is derived from the marked image.
The sign is encoded in the visible domain of the image and therefore becomes part of the image and cannot be detected or removed by known knowledge of the sign. The important point is that the changes represented by the signature are too small to be seen by the human eye, but are easily and consistently recognizable by a normal digital image scanner, and then the signature is extracted by a software algorithm. It is possible to decipher and collate.
Unlike known signing methods used for non-image data, this signing survives significant image transformations that retain the visible image but can completely alter the digital data. Certain transformations allowed include resizing the image to a larger or smaller size, rotating the image, adjusting the color, brightness and / or contrast uniformly, and making limited cuts. .. What is important is that the signature survives the process of printing the image on paper or film and rescanning it into digital form.
The computer system 10 shown in FIG. 1 is used to carry out the present invention. The computer system 10 includes a computer 12 having ordinary complementary memory and logic circuits, a display monitor 14, a keyboard 16, a mouse 18, or other indicating device. The computer system also includes a digital scanner 20 used to form a digital image that represents an original image such as a photograph or picture. Typically, pictorial delicate images are converted to prints or films before being scanned into digital form. In one embodiment, the printer 22 is connected to the computer 12 to print a digital image output from the processor. Further, the digital image can also be output in a data format to a storage medium 23 such as a floppy disk for later display at a remote location. Any digital display device such as a regular computer printer, XY plotter or display screen may be used.
An example of the output of the scanner 20 to the computer 12 is the digital image 24 shown in FIG. More specifically, the scanner outputs data representing the digital image, and the computer displays the digital image 24 on the display monitor 14. The term "digital image" as used herein refers to digital data representing a digital image, a digital image displayed on a monitor or other display screen, and a digital image printed by a printer 22 or a remote printer.
The digital image 24 is drawn with a large number of pixels 24 having different pixel values. In the grayscale image 24, the pixel value is a luminance value representing a luminance level that changes from black to white. In a color image, a pixel has a color value and a luminance value, both of which are pixel values. The color value can include the value of any component in the display of color by vector. FIG. 3 shows a digital image 24A in the form of an array of pixels 26. Each pixel is combined with one or more pixel values, which are the luminance values from 0 to 15 in the example shown in FIG.
The digital image 24 shown in FIG. 2 contains thousands of pixels. The digital image 24A shown in Figure 3 contains 225 pixels. The present invention is preferably used for images with millions of pixels. Therefore, of course, the usefulness of the present invention will be briefly described here.
According to a preferred embodiment of the present invention, a large number of candidate points are positioned within the original image. A sign point is selected from these candidate points and changed to form a sign. A sign is a pattern of any number of sign points. In a preferred embodiment, the signature is a binary number 16-bit to 32-bit in length. The sign points can be anywhere in the image, but are preferably chosen to be as inconspicuous as possible. The number of sign points is preferably much larger than the number of bites of the sign. This makes it possible to redundantly encode the signature in the image. When using 6-32 bit signatures, 50-200 signature points are preferred in order to obtain a large number of signatures for the image.
In a preferred embodiment of the invention, candidate points are positioned by finding relative maximums and minimums (referred to as overall extremes) in the image. These extremes locally represent extreme brightness or color. Figure 4 shows what the relatively extremes mean. FIG. 4 is a graph showing the pixel values of the small part of the digital image. The vertical axis of this graph represents the pixel values, while the horizontal axis represents the pixel positions along a single line of the digital image. The small variation in pixel value shown in 32 represents a digital image portion where the brightness or color changes slightly between pixels. The relative maximum value of 34 represents the pixel with the highest pixel value for a given area of the image. Similarly, the relative minimum value of 36 represents the pixel with the lowest pixel value for a given area of the image.
Relatively extreme values are the preferred sign points for two main reasons. First of all, they are easily searched by a simple and well-known process. And second, they allow the sign points to be encoded less noticeably.
One of the easiest ways to determine relatively extreme values is to use the "mean difference" technique. This technique uses a predetermined neighborhood around each pixel 26, with small neighbors 28 and large neighbors 30 shown in Figures 2 and 3. In the examples shown here, these neighborhoods are square for simplicity, but in preferred embodiments circular neighborhoods are used. This technique determines the difference between the average pixel value of a small neighborhood and the average pixel value of a large neighborhood. When this difference is large relative to the difference for the surrounding pixels, the first pixel value is the relative maximum or minimum.
Using the image of FIG. 3 as an example, the average difference with respect to pixel 26A is determined as follows. Adding the pixel values in the small neighborhood 28A of 3x3 pixels gives 69, which is divided by 9 pixels to average 7.67. Adding the pixel values within the large neighborhood 30A of 5x5 pixels gives 219, which is divided by 25 pixels to give an average of 8.76, so the difference between the means is -1.09. Similarly, the average of the small neighbor 28G is 10.0 and the average of the large neighbor 30G is 9.8, so the difference between the averages of the pixels 26G is 0.2. The same calculation for pixels 26B to 26F results in the following table.<u style="single">26A 26B 26C 26D 26E26F 26G</u>Small Neighbor 7.67 10.56 12.89 14.11 13.11 11.56 10.0 Large Neighbor 8.76 10.56 12.0 12.52 12.52 11.36 9.8 Mean Difference -1.09 0.0 0.89 1.59 0.59 0.2 0.2 Pixel 26A-26G has a relative maximum for pixel 26D and the mean difference 1.59 is greater than the average difference over the other pixels examined in that row. To determine if pixel 26D is not just a small variation, but a relative maximum, its average difference must be compared to the average difference with respect to the pixels surrounding it in a large area.
Extreme values within 10% of the image size on either side should not be used as sign points. This prevents the signing points from being lost due to the provision that cuts the border area of the image. Also, it is preferable to use relatively extreme values that do not appear in a regular pattern but are randomly and widely spaced.
Using the average difference technique or other known techniques, a large number of extreme values can be obtained, the number of which is based on the pixel density and contrast of the image. Of the total number of extreme values found in this way, in the preferred embodiment 50-200 sign points are selected. This is done manually by the user selecting each sign point from the extreme values displayed on the display monitor 14 with a keyboard 16, mouse 18, or other indicator. These extreme values may be displayed as a digital image and each point may be selected using a mouse or other pointing device pointing to a pixel, or these values may be displayed as a list of coordinates. , A keyboard, mouse or other indicator may be used for selection. Alternatively, the computer 12 can be programmed to randomly select the sign points or to select based on a pre-programmed pattern.
At each sign point in the image, 1-bit binary data is encoded by adjusting the pixel value at that point and the pixel values around it. The image is modified to represent binary 0 or 1 by adjusting the pixel value at that sign point to be slightly positive or negative by 2% to 10%. Pixels surrounding each of its symbol points in a grid of about 5x5 to 10x10 are preferably adjusted proportionally to ensure a continuous transition to new values at that symbol point. A large number of bits are encoded at the sign point to form a pattern that is a sign for the image.
In a preferred embodiment, the signature is the pattern of all signature points. When auditing the image, if a statistically significant number of potential sign points in the image match the corresponding sign points in the marked image, the image is marked. It is thought that it was derived from the statue. A statistically significant number is slightly less than 100%, but it is sufficient if the image is reasonably convinced that it is derived from the marked image .
In another embodiment, the signatures are encoded using a redundant pattern, which distributes the signatures within the signature points in a way that can be reliably retrieved using only a subset of the signature points. In one embodiment, only a predetermined number of exact copies of the signature are encoded. Alternatively, other redundant display methods such as error correction codes may be used.
The symbols are stored in a database where they are associated with the original image in order to audit future images and determine if they match the signed image. The symbol can be stored by associating the bit value of each symbol point with the xy coordinate of that symbol point. The sign may be stored separately from or as part of the marked image. At this time, the signed image is distributed in digital form.
As mentioned above, the signed image can be transformed and manipulated to form a derived image. Derived images are derived from images that have been marked by various transformations such as resizing, rotating, adjusting color, brightness and / or contrast, cutting, converting to print or film. Derivation may be done in multiple stages or processes, or the signed image may simply be copied directly.
It is assumed that the derivation of the image that the owner intends to track includes only the intended use that substantially preserves the resolution and general quality of the image. A 90% reduction in size, significant discoloration, or a clear reduction in pixel value destroys the signature, but also reduces the significance and value of the image so that it is unwilling to audit.
To audit the image based on a preferred embodiment, the user identifies the original image that the image appears to be a duplicate. In the case of a print or film image, the image is scanned to form a digital image file. Scanning is not required for digital images. This digital image is normalized to the same size and total brightness, contrast and color profile as the unmodified original image using the techniques described below. The image is analyzed by the method described below to extract the signature, if any, and compare it with the signature stored for the image.
This normalization process involves a series of steps to undo the transformations already made on the image and bring it back as close as possible to the resolution and appearance of the original image. It is assumed that the image has been manipulated and transformed as described above. In order to align the image with the original image, in a preferred embodiment, three or more points corresponding to the points in the original image are selected from the image. These three or more points of the image are aligned with the corresponding points of the original image. The points of the image that are not selected are rotated and resized as needed to accept the alignment of the selected points.
For example, FIG. 5 shows the digital image 38, which is smaller than the original image 24 of FIG. To resize the image, the user points to three points, such as the mouth 40B, ears 42B, and eyes 44B, of the image using a mouse 18 or other pointing device. Since it is usually difficult to pinpoint a single pixel, the computer chooses the extreme value closest to the pixel pointed to by the user. The user points to the mouth 40A, ears 42A and eyes 44A of the original image. Computer 12 may size the images as needed to ensure that points 40B, 42B, and 44B are positioned with each other in the same way that points 40A, 42A, and 44A are positioned with each other in the original image. Change and rotate. The remaining pixels are repositioned in proportion to the repositioning of these points 40B, 42B and 44B. By aligning these three points, the entire image is aligned with the original image without having to align each pixel individually.
The next step after the image is aligned is to normalize the brightness, contrast and / or color of the image. This normalization involves adjusting the pixel values of the image to match the value distribution profile of the original image. This is done by a technique similar to that used to align the images. The subset of pixels in the image is adjusted to be equal to the corresponding pixels in the original image. Pixels that are not in this subset are adjusted in proportion to the adjustments made to the pixels in the subset. The pixel of the image corresponding to the sign point must not be within a subset of pixels. Otherwise, the signature points of the image will be hidden from detection when adjusted equally to the corresponding pixels of the original image.
In a preferred embodiment, the subset includes the brightest and darkest pixels of the image. These pixels are adjusted to have a brightness value equal to the brightness value of the corresponding pixel in the original image. To ensure that the sign points can be detected, the sign points must not be selected from the brightest and darkest pixels of the original image during the above-mentioned sign embedding process. For example, after selecting a sign point from less than 5% of the brightest and darkest to ensure no overlap, then pixel out of 3% of the brightest and darkest to adjust the subset. Can be used.
The image is preferably compared to the original image after it has been fully normalized. One way to compare these images is to subtract one image from the other. By this deduction, a digital image including the sign points existing in the image is formed. These sign points, if any, are compared to the sign points stored for the marked image. If the sign points do not match, the image is not a derivative of the marked image unless it is substantially modified from the marked image.
In another embodiment, the normalized image is compared directly to the signed image, rather than subtracting it from the original image. This comparison involves subtracting the image from the marked image. If this deduction produces little or no image, then the image is equal to the marked image and is therefore derived from the marked image.
In yet another embodiment, instead of normalizing the entire image, only the portion of the image surrounding each potential sign point has the same general resolution and appearance as the corresponding portion of the original image. Is normalized as. This is done by selecting each potential sign point of the image and selecting the portion around each potential sign point. Normalization of each selected portion is performed according to the same method as described above for normalization of the entire image.
By normalizing each selected part individually, each potential signing point of the image can be directly compared to the corresponding signing point of the marked image. It is preferred that the mean value be calculated for each potential sign point by averaging the pixel values of the potential sign points with the pixel values of a plurality of pixels around the potential sign point. The mean value calculated for each sign is directly compared to the corresponding sign point in the marked image.
As described above, the method of normalizing and extracting the signature from the image was related to the luminance value, but the same method can be used for the color value. Instead of or in addition to normalizing by changing the luminance value, the color value of the image can be adjusted equally to the corresponding color value of the original color image. However, it is not necessary to adjust the color values to encode the signatures or extract the signatures from the color image. The color image uses pixels having pixel values including luminance and color values. Digital signatures can encode any pixel value, regardless of whether the pixel value is a luminance value, a color value, or a pixel value in another format. Luminance values are preferred because they can be easily changed without being visible to the human eye.
Although the specific embodiments of the present invention have been described in detail above for the purpose of explanation, it will be clear that various changes can be made without departing from the spirit and scope of the present invention. Therefore, the present invention shall be limited only by the scope of claims.
<figref num="1">It is a figure which shows the computer system used in the preferable embodiment of this invention.</figref><figref num="2">It is a figure which shows the digital image sample in which a preferable example of this invention is used.</figref><figref num="3">It is a figure which shows the digital image in the form of a pixel array which has a pixel value.</figref><figref num="4">It is a graph of the pixel value which shows the relative minimum and maximum pixel value.</figref><figref num="5">It is a figure which shows the digital image compared with the image of FIG. 2 by a preferable embodiment of this invention.</figref>
Code description
10 Computer System 12 Computer 14 Display Monitor 16 Keyboard 18 Mouse 20 Digital Scanner 22 Printer 23 Storage Medium 24 Digital Image 26 Pixels
52 members in 4 offices
Priority claims5
| Document | Office | Kind | Date |
|---|---|---|---|
| 07923841 | United States of America | – | |
| 92384192 | United States of America | A | |
| 92384192 | United States of America | A | |
| 1992923841 | – | – | – |
| US19920923841 | – | – | – |
Members52
| Document | Office | Kind | |
|---|---|---|---|
| CA2101673A1 | Canada | A1 | |
| CA2504316A1 | Canada | A1 | |
| EP0581317A2 | European Patent Office (EPO) | A2 | |
| JPH06343128A | Japan | A | |
| EP0581317A3 | European Patent Office (EPO) | A3 | |
| US5721788A | United States of America | A | |
| US5809160A | United States of America | A | |
| US5930377A | United States of America | A | |
| US6072888A | United States of America | A | |
| US6137892A | United States of America | A | |
| US2001002213A1 | United States of America | A1 | |
| US6301369B2 | United States of America | B2 | |
| US6307950B1 | United States of America | B1 | |
| US6317505B1 | United States of America | B1 | |
| US2002037090A1 | United States of America | A1 | |
| US2002044673A1 | United States of America | A1 | |
| US6385330B1 | United States of America | B1 | |
| US2002061119A1 | United States of America | A1 | |
| US6459803B1 | United States of America | B1 | |
| US2002181740A1 | United States of America | A1 | |
| US2003026450A1 | United States of America | A1 | |
| US6614915B2 | United States of America | B2 | |
| US6628801B2 | United States of America | B2 | |
| US6678392B2 | United States of America | B2 | |
| US2005117776A1 | United States of America | A1 | |
| US2005147275A1 | United States of America | A1 | |
| US2005147276A1 | United States of America | A1 | |
| CA2101673C | Canada | C | |
| JP2005328528AThis record | Japan | A | |
| US7062070B2 | United States of America | B2 | |
| US7068811B2 | United States of America | B2 | |
| US7068812B2 | United States of America | B2 | |
| JP3837432B2 | Japan | B2 | |
| US7136503B2 | United States of America | B2 | |
| JP2006314125A | Japan | A | |
| JP2007006504A | Japan | A | |
| US2007019837A1 | United States of America | A1 | |
| US2007086619A1 | United States of America | A1 | |
| JP2007251980A | Japan | A | |
| US7280672B2 | United States of America | B2 | |
| JP4004528B2 | Japan | B2 | |
| JP4009655B2 | Japan | B2 | |
| JP2008017504A | Japan | A | |
| US7412074B2 | United States of America | B2 | |
| US2008298703A1 | United States of America | A1 | |
| JP2009027730A | Japan | A | |
| CA2504316C | Canada | C | |
| US7593545B2 | United States of America | B2 | |
| JP4444317B2 | Japan | B2 | |
| JP4485585B2 | Japan | B2 | |
| US2010220934A1 | United States of America | A1 | |
| US7978876B2 | United States of America | B2 |
37 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Cancellation because of completion of termEXPY | EXPY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Written notification of registration of transferJAPANESE INTERMEDIATE CODE: R350R350 | R350 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Written notification of registration of transferJAPANESE INTERMEDIATE CODE: R350R350 | R350 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313111S111 | S111 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313111S111 | S111 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313113S111 | S111 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Transfer withdrawnWithdrawnJAPANESE INTERMEDIATE CODE: R371R371 | R371 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313113S111 | S111 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313111S111 | S111 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313111S111 | S111 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Written notification for declining of transfer of rightsJAPANESE INTERMEDIATE CODE: R360R360 | R360 | |
| Transfer withdrawnWithdrawnJAPANESE INTERMEDIATE CODE: R371R371 | R371 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Written notification for declining of transfer of rightsJAPANESE INTERMEDIATE CODE: R360R360 | R360 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313111S111 | S111 | |
| Request for change of ownership or part of ownershipJAPANESE INTERMEDIATE CODE: R313113S111 | S111 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| First payment of annual fees (during grant procedure)JAPANESE INTERMEDIATE CODE: A61A61 | A61 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Decision of grant or rejection writtenTRDD | TRDD | |
| Written amendmentJAPANESE INTERMEDIATE CODE: A523A521 | A521 | |
| Written permission of extension of timeJAPANESE INTERMEDIATE CODE: A602A602 | A602 | |
| Written request for extension of timeJAPANESE INTERMEDIATE CODE: A601A601 | A601 | |
| Notification of reasons for refusalJAPANESE INTERMEDIATE CODE: A131A131 | A131 |
Numbers
- Publication
- 2005328528
- Publication, DOCDB
- 2005328528
- Publication, EPODOC
- JP2005328528
- Application
- 136454
- Application, DOCDB
- 2005136454
- Application, EPODOC
- JP20050136454
Titles2
- Japanese
- デジタル像符牒の処理方法及びシステム
- English
- Digital image code processing method and system
Classification
- CPC, 22
- G06T1/0064
- G06Q20/341
- G06T1/0028
- G06T2201/0051
- G06T2201/0081
- G07D7/12
- G07D7/2008
- G07D7/2033
- G07F7/08
- G07F7/12
- H04N1/32203
- H04N1/32208
- H04N1/32229
- H04N1/32245
- H04N1/32251
- H04N1/32288
- H04N1/3232
- H04N2201/3233
- H04N2201/3235
- H04N2201/327
- G07D7/0047
- G07D7/0056
- IPC, 13
- G06T1 00
- G06T7 00
- G06T9 00
- G07D7 00
- G07D7 12
- G07D7 20
- G07F7 12
- G09C5 00
- H04N1 32
- H04N1 387
- H04N1 40
- H04N7 08
- H04N7 081