Source: http://www.google.com/patents/US7471838?dq=6,370,566
Timestamp: 2016-06-30 05:00:22
Document Index: 419898336

Matched Legal Cases: ['Application No. 2003', 'application No. 2003', 'Application No. 04252470', 'application No. 2003', 'application No. 2005', 'application No. 2003']

Patent US7471838 - Image data processing apparatus, image data processing method, and computer ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsTo reduce the processing required to embed a code into image data and decode the code. The present invention includes a block dividing section 101 that divides original image data 10 into a plurality of blocks (M�N); an averaging section 103 that extracts each average density (characteristic amount)...http://www.google.com/patents/US7471838?utm_source=gb-gplus-sharePatent US7471838 - Image data processing apparatus, image data processing method, and computer readable mediumAdvanced Patent SearchPublication numberUS7471838 B2Publication typeGrantApplication numberUS 11/842,928Publication dateDec 30, 2008Filing dateAug 21, 2007Priority dateMay 20, 2003Fee statusPaidAlso published asEP1480163A2, EP1480163A3, US7280701, US20040234139, US20080253674Publication number11842928, 842928, US 7471838 B2, US 7471838B2, US-B2-7471838, US7471838 B2, US7471838B2InventorsJun Moroo, Tsugio NodaOriginal AssigneeFujitsu LimitedExport CitationBiBTeX, EndNote, RefManPatent Citations (20), Non-Patent Citations (11), Classifications (11), Legal Events (1) External Links: USPTO, USPTO Assignment, EspacenetImage data processing apparatus, image data processing method, and computer readable medium
US 7471838 B2Abstract
To reduce the processing required to embed a code into image data and decode the code. The present invention includes a block dividing section 101 that divides original image data 10 into a plurality of blocks (M�N); an averaging section 103 that extracts each average density (characteristic amount) in a plurality of blocks; and an encoding section 106 that embeds a code C (a plurality of bits) into a plurality of blocks by relating one code (one bit out of the code C) to each pair of blocks mutually located in near position in the plurality of blocks based on a magnitude relation of the average density.
1. An image-data processing apparatus for extracting a code repeatedly embedded in image data, the image-data processing apparatus comprising:
a dividing unit that divides the image data into a plurality of blocks;
a characteristic-amount extracting unit that extracts a characteristic amount of each of the blocks; and
a decoding unit that extracts a code from a pair of the blocks based on a magnitude relation between a first characteristic amount extracted by the extracting unit from a first block and a second characteristic amount extracted by the extracting unit from a second block from among the pair of blocks, wherein
a bit-information extracting unit that extracts a plurality of bit information corresponding to each bit of the extracted code, from each pair of the blocks based on the magnitude relation between the first characteristic amount and the second characteristic amount by comparing the first characteristic amount with the second characteristic amount, calculating a difference between the first characteristic amount and the second characteristic amount, and if the difference is smaller than an upper threshold and the first characteristic amount is smaller than the second characteristic amount then the bit-information extracting unit extracts a first candidate code as the bit information, if the difference is smaller than the upper threshold and the second characteristic amount is smaller than the first characteristic amount then the bit-information extracting unit extracts a second candidate code as the bit information, and if the difference is equal to or larger than the upper threshold then the bit-information extracting unit extracts a third candidate code as the bit information; and
a bit-value determining unit that determines a bit value for each extracted code based on a majority decision processing from the extracted first, second and third candidate codes as the plurality of the extracted bit information.
an error correcting unit that corrects an error of the code embedded in the image data by using the code extracted by the decoding unit.
3. The image-data processing apparatus according to claim 1, wherein the characteristic-amount extracting unit extracts the characteristic amount from a portion of each of the blocks.
4. The image-data processing apparatus according to claim 3, wherein the portion is a center of each of the blocks.
5. The image-data processing apparatus according to claim 1, wherein
the characteristic-amount extracting unit extracts the characteristic amount for a specific color component contained in the image data, and
the decoding unit extracts the code embedded in a plurality of the blocks by using the extracted characteristic amount for the specific color component.
6. The image-data processing apparatus according to claim 5, wherein the specific color component is a yellow component.
7. The image-data processing apparatus according to claim 1, wherein the pair of blocks is formed with two adjacent blocks.
8. The image-data processing apparatus according to claim 1, wherein the dividing unit divides the image data based on a cut-out mark pixel added to the image data.
9. The image-data processing apparatus according to claim 1, wherein the characteristic amount includes at least one of average density, granularity, chroma, density barycenter, and variance.
10. An image-data processing method of extracting a code repeatedly embedded in image data, the image-data processing method comprising:
extracting a characteristic amount of each of the blocks; and
decoding by extracting a code from a pair of the blocks based on a magnitude relation between a first characteristic amount extracted by the extracting from a first block and a second characteristic amount extracted by the extracting from a second block from among the pair of blocks, wherein
the decoding further includes
extracting a plurality of bit information corresponding to each bit of the extracted code, from each pair of the blocks based on the magnitude relation between the first characteristic amount and the second characteristic amount by:
comparing the first characteristic amount with the second characteristic amount,
calculating a difference between the first characteristic amount and the second characteristic amount,
if the difference is smaller than an upper threshold and the first characteristic amount is smaller than the second characteristic amount, extracting a first candidate code as the bit information,
if the difference is smaller than the upper threshold and the second characteristic amount is smaller than the first characteristic amount, extracting a second candidate code as the bit information, and
if the difference is equal to or larger than the upper threshold, extracting a third candidate code as the bit information; and
determining a bit value for each extracted code based on a majority decision processing from the extracted first, second and third candidate codes as the plurality of the extracted bit information.
11. The image-data processing method according to claim 10, further comprising correcting an error of the code embedded in the image data by using the code extracted by the decoding.
12. The image-data processing method according to claim 10, wherein the extracting of the characteristic amount includes extracting the characteristic amount from a portion of each of the blocks.
13. The image-data processing method according to claim 12, wherein the portion is a center of each of the blocks.
14. The image-data processing method according to claim 10, wherein
the extracting of the characteristic amount includes extracting the characteristic amount for a specific color component contained in the image data, and
the decoding includes extracting the code embedded in a plurality of the blocks by using the extracted characteristic amount for the specific color component.
15. The image-data processing method according to claim 14, wherein the specific color component is a yellow component.
16. The image-data processing method according to claim 10, wherein the pair of blocks is formed with two adjacent blocks.
17. The image-data processing method according to claim 10, wherein the dividing includes dividing the image data based on a cut-out mark pixel added to the image data.
18. The image-data processing method according to claim 10, wherein the characteristic amount includes at least one of average density, granularity, chroma, density barycenter, and variance.
19. A computer readable medium storing an image-data processing program for extracting a code repeatedly embedded in image data by controlling an apparatus to perform operations comprising:
the decoding unit further includes
20. The computer readable medium according to claim 19, wherein the operations further comprise correcting an error of the code embedded in the image data by using the code extracted by the decoding.
21. The computer readable medium according to claim 19, wherein the extracting of the characteristic amount includes extracting the characteristic amount from a portion of each of the blocks.
22. The computer readable medium according to claim 21, wherein the portion is a center of each of the blocks.
23. The computer readable medium according to claim 19, wherein
24. The computer readable medium according to claim 23, wherein the specific color component is a yellow component.
25. The computer readable medium according to claim 19, wherein the pair of blocks is formed with two adjacent blocks.
26. The computer readable medium according to claim 19, wherein the dividing divides the image data based on a cut-out mark pixel added to the image data.
27. The computer readable medium according to claim 19, wherein the characteristic amount includes at least one of average density, granularity, chroma, density barycenter, and dispersion. Description
This application is a continuation of U.S. application Ser. No. 10/824,528 filed Apr. 15, 2004, now U.S. Pat. No. 7,280,701 and claims the benefit of Japanese Application No. 2003-142582 filed May 20, 2003 in the Japanese Patent Office, the contents of which are incorporated herein by reference.
The present invention relates to an image data processing apparatus, an image data processing method, and an image data processing program that are can be suitably used in, for example, encoders or decoders. Particularly, the present invention relates to an image data processing apparatus, an image data processing method, and an image data processing program that can reduce the processing required to embed a code into image data or decode the code.
U.S. Pat. No. 5,636,292 and Japanese Patent Application Laid-Open No. 2000-299779 disclose embedding of separate data (such as a code) into image data or audio data to prevent falsifications, prevent an illicit use, and provide additional services.
As the technique is applied for a security purpose, conventional methods are designed to be able to bear a deformation of original data or a request for a partial use. For example, a very complex method (such as a digital watermark) is conventionally employed such as a spread disposition of the same data within an image or inputting data in a frequency region using a Fast Fourier Transformation (FFT).
The digital watermark technique is applied to various additional services. For example, U.S. Pat. No. 5,841,978 discloses a method of reading a digital watermark embedded into a printed material, and displaying a specific web page.
In the conventional technique of embedding a digital watermark, it is necessary to calculate the FFT. However, it requires a huge number of calculations to be performed to calculate the FFT.
It is practically difficult to embed or read data into or from the image data in portable information devices (portable telephone, PHS (Personal Handy phone System), PDAs (Personal Digital Assistant) and the like because these devices have limited resources such as less memory capacity or slower processors.
The present invention has been achieved in order to solve the above problems. It is an aspect of the present invention to provide an image data processing apparatus, an image data processing method, and a computer readable medium that can reduce the processing required to embed a code into image data or decode the code.
To achieve the above mentioned aspect, the present invention includes an image data processing apparatus comprising a dividing unit that divides image data into a plurality of blocks, a characteristic amount extracting unit that extracts a characteristic amount from each of the blocks, and an encoding unit that embeds a plurality of codes based on a magnitude relation of the characteristic amount between each pair of blocks in the blocks.
Moreover, the present invention includes an image data processing method comprising dividing image data into a plurality of blocks, extracting a characteristic amount from each of the blocks, and embedding a plurality of codes based on a magnitude relation of the characteristic amount between each pair of blocks in the blocks.
Moreover, the present invention includes a computer-readable medium storing a program which, when executed by a computer, causes the computer to perform operations comprising dividing image data into a plurality of blocks extracting a characteristic amount from each of the blocks, and embedding a plurality of based on a magnitude relation of the characteristic amount between each pair of blocks in the blocks.
According to the present invention, one code is related to each pair of blocks in a plurality of blocks as a result of dividing image data, based on a magnitude relation of characteristic amount, and a plurality of codes are embedded into a plurality of blocks. Therefore, the necessity to calculate the FFT is eliminated by the present invention, and the processing required to embed the code into the image data is reduced by the present invention.
Moreover, the present invention includes an image data processing apparatus comprising a dividing unit that divides image data into a plurality of blocks, an error-correction-coding code generating unit that encodes a code using an error correction coding to generate an error-correction-coding code, a characteristic amount extracting unit that extracts a characteristic amount from each of the blocks, and an encoding unit that embeds a plurality of error-correction-coding codes based on a magnitude relation of the characteristic amount between each pair of blocks in the blocks.
According to the present invention, as a plurality of error-correction-coding codes are embedded into a plurality of blocks, there is an effect that the decoding side can correct an error, and reliability is increased.
FIG. 1 is a block diagram of the encoder 100 according to the first embodiment of the present invention.
FIG. 2 is an example of original image data I0.
FIG. 3 is an example of image data I1.
FIG. 4 is an example of a code C.
FIG. 5 is an example of image coded data I3.
FIG. 6 is a flowchart of an operation example 1.
FIG. 7 explains about a density change processing of the encoder 100.
FIG. 8 is a flowchart of an operation example 2.
FIG. 9 is a block diagram of the decoder 200 according to the first embodiment.
FIG. 10 explains about the majority decision processing by the decoder 200.
FIG. 11 is a flowchart of operations performed by the decoder 200.
FIG. 12 is a block diagram of an encoder 300 according to the second embodiment.
FIG. 13 is a block diagram of a decoder 400 according to the second embodiment.
FIG. 14 is a flowchart of operations performed by the decoder 400.
FIG. 15 explains about the code determination processing by the decoder 400.
FIG. 16 is to explain a third embodiment of the present invention.
FIG. 17 is a block diagram of an encoder 500 according to a fourth embodiment of the present invention.
FIG. 18 is a graph that illustrates a relation between the density change quantity and the MOS value according to the fourth embodiment.
FIG. 19 explains about the image cut-out processing according to the fifth embodiment of the present invention.
FIG. 20 is a flowchart of a four-corner search processing according to the fifth embodiment.
FIG. 21 explains about the four-corner search processing according to the fifth embodiment.
FIG. 22 is a block diagram of a computer as a modification according to the first to the fifth embodiments of the present invention.
An image data processing apparatus, an image data processing method, and an image data processing program according to first to fifth embodiments of the present invention are explained in detail below with reference to drawings.
An image data processing apparatus according to a first embodiment of the present invention relates to an encoder 100 (refer to FIG. 1) that embeds a (binary) code as separate data into original image data, and a decoder 200 (refer to FIG. 9) that reads the code from the image coded data.
FIG. 1 is a block diagram of the encoder 100. The encoder 100 embeds a code C (refer to FIG. 4) eight times, for example, into original image data I0, and generates image coded data I3 (refer to FIG. 5).
FIG. 2 shows an example of original image data I0. As discussed herein below, the code C will be embedded in the original image data I0. In the example shown in FIG. 2, the original image data I0 is a digital image, but the present invention is not limited to this example.
The original image data I0 is generated in a predetermined format and has a size of 1024�1024 pixels. The predetermined format may be JPEG (Joint Photographic Expert Group), GIF (Graphics Interchange Format) and the like. The code C (1010110101001010) having 16 bits illustrated in FIG. 4, for example, is embedded into the original image data I0.
In the encoder 100 shown in FIG. 1, a block dividing section 101 divides the original image data I0 into blocks of N rows�M columns (16�16, in the drawing) as illustrated in FIG. 3, and outputs the resultant data as image data I1 after division.
The image data I1 includes 256 (16�16) blocks having blocks Bl11, Br11, . . . , Bl18, Br18, Bl21, Br21, . . . , Bl168, and Br168. One block is of 64�64 pixels.
A code of one bit is embedded into a pair of blocks.
This pair of blocks includes two blocks in proximity to each other. For example, these two blocks are adjacent horizontally or vertically to each other, or they are diagonal to each other and touch corner to corner.
In this embodiment, the pair of blocks includes two blocks adjacent horizontally to each other.
Concretely, the blocks Bl11 and Br11, the blocks Bl12 and Br12, . . . , and the blocks Bl18 and Br18 (a first row up to this block), the blocks Bl121 and Br121, . . . , and the blocks Bl128 and Br128 (a second row up to this block), . . . , and the blocks Bl161 and Br161, . . . , and the blocks Bl168 and Br168 (a 16-th row up to this block), respectively, are the pairs of blocks.
In a block represented as Blxy, the suffix l means that the block is on the left in the pair of the blocks, suffix x denotes a row (N), and suffix y denotes a column (M). On the other hand, in a block represented as Brxy, the suffix r means that the block is on the right in the pair of the blocks, suffix x denotes a row (N), and suffix y denotes a column (M).
An average density, a characteristic amount, of the left block Blxy (i.e., average gradation of each pixel within the block) is expressed as left-side average density data Dl, and that of the right block Brxy is expressed as right-side average density data Dr.
When the left-side average density data Dl is less than the right-side average density data Dr as illustrated in the following expression, the pair of blocks express “0” as a code of one bit. On the other hand, when the left-side average density data Dl is equal to or larger than the right-side average density data Dr, the pair of blocks express “1” as a code of one bit.
Dl<Dr→[0]
Dl≧Dr→[1]
For example, as shown in FIG. 3, left-side average density data Dl18 of block Bl18 is “115” and right-side average density data Dr18 of Br18 is “125” so that the pair of blocks Bl18, and Br18 express “0” as a code of one bit.
Regarding the pair of blocks Bl28 and Br28, left-side average density data Dl28 is “125”, and right-side average density data Dr28 is “115”. Therefore, the pair of blocks express “1” as a code of one bit.
In the image data I1, there are eight pairs of blocks in each row (i.e., total 16 blocks), and therefore, this data expresses a code of eight blocks. Accordingly, the total rows (16 rows) express codes of 128 bits in total. In the first embodiment, the code C (refer to FIG. 4) to be embedded into the image data I1 has 16 bits. Therefore, the code C can be embedded into the image data I1 by eight (i.e., 128/16) times (refer to FIG. 5).
Referring back to FIG. 1, a characteristic amount extracting section 107 includes a block extracting section 102, an averaging section 103, a register 104 l, and a register 104 r. A block extracting section 102 sequentially extracts the pair of blocks (the block Blx and the block Brx) from the image data I1 (refer to FIG. 3) following a bit shift of the code C. The block extracting section 102 sequentially outputs density distributions of the block Blx and the block Brx as block density data D.
The bit shift of the code C refers to the shifting of a bit pointer (not illustrated) from the leftmost bit (1) to the right bit (0) illustrated in FIG. 4 by one bit each time.
An averaging section 103 calculates left-side average density data D1 corresponding to the block Blx and right-side average density data Dr corresponding to the block Brx from the block density data D, and sequentially stores the left-side average density data D1 into a register 104 l and the right-side average density data Dr into a register 104 r following the bit shift of the code C.
A comparing section 105 compares the n-th bit of the code C (n=1, 2, . . . , 16) with the result of a bit decision made from the magnitude relation between the left-side average density data Dl and the right-side average density data Dr stored in the register 104 l and the register 104 r, respectively (bit decision is made as “0” or “1” from the expressions described above).
An encoding section 106 embeds the code C into the image data I1 (the original image data I0) based on the result of the comparison carried out by the comparing section 105, and outputs the code C embedded data, image coded data I3, to the outside of encoder 100. Specifically, when the result of the comparison carried out by the comparing section 105 indicates coincidence, the encoding section 106 maintains the magnitude relation between the left-side average density data Dl and the right-side average density data Dr. On the other hand, when the result of the comparison indicates non-coincidence, the encoding section 106 changes the left-side average density data Dl and the right-side average density data Dr (i.e., reverses the magnitude relation) so as to obtain the magnitude relation that expresses the bit of the code C, generates the image coded data I3 (refer to FIG. 5), and outputs this data.
The image coded data I3 illustrated in FIG. 5 corresponds to the image data I1 (refer to FIG. 3) and the original image data I0 (refer to FIG. 2), and has areas A1 to A8. The same code C (1010110101001010) is embedded by eight times in total into the areas A1 to A8.
For example, the area A1 corresponds to the blocks Bl11, Br11, . . . , Bl28, and Br28. Other areas A2 to A8 correspond to the blocks Bl31, Br31, . . . , Bl168, and Br168.
While FIG. 5 illustrates a state that the code C (refer to FIG. 3) is embedded, the actual image coded data I3 corresponds to the image data that is substantially the same as the original image data I0 (refer to FIG. 2) (i.e., it is substantially impossible to visually discriminate between these drawings although a part of the blocks may have changed density).
Constituent elements of the encoder 100 are connected to each other via a control section (not shown).
The operation of the encoder 100 is explained with reference to flowcharts in FIG. 6 and FIG. 8. FIG. 6 is a flowchart that explains an operation example 1 of the encoder 100.
At operation SA1, the code C is set to the comparing section 105. At operation SA2, the comparing section 105 initializes n to 1. n denotes a pointer of the bit of the code C. n=1 corresponds to the leftmost bit (“1”) of the code C.
At operation SA3, the original image data I0 is input to the block dividing section 101. At operation SA4, the block dividing section 101 divides the original image data I0 into 16�16 blocks Bl11 to Br1168, and outputs the result as the image data I1 to the block extracting section 102.
At operation SA5, the block extracting section 102 extracts a pair of blocks corresponding to n=1 (i.e., the block Bl11 and the block Br11) from the image data I1. Then, the block extracting section 102 outputs the density distributions of the block Bl11 and the block Br11 as the block density data D to the averaging section 103.
At operation SA6, the averaging section 103 obtains the left-side average density data Dl11 of the block Bl11 and the right-side average density data Dr11 of the block Br11 from the block density data D by the average processing.
At operation SA7, the averaging section 103 provides a control to store the left-side average density data Dl11 into the register 104, and store the right-side average density data Dr11 into the register 104 r.
At operation SA8, the comparing section 105 obtains “1” that is the leftmost bit (corresponding to n=1) of the code C, and a difference between the left-side average density data Dl11, and the right-side average density data Dr11 and executes the bit decision based on the difference in the densities (i.e., magnitude relation).
Concretely, if the left-side average density data Dl11, is equal to or larger than the right-side average density data Dr11, the comparing section 105 sets “1” as a result of the decision made for the pair of blocks based on the above magnitude relation.
At operation SA9, the comparing section 105 decides whether the n-th bit (in this case, the first bit “1”) of the code C is the bit for which the decision made about the bit (in this case, “1”) at operation SA8. In this case, the comparing section 105 sets “Yes” as a result of the decision.
At operation SA10, the comparing section 105 increment n by 1. As a result, n becomes 2. At operation SA11, the comparing section 105 decides whether n is larger than nend, where nend is a total number of bits of the code C (refer to FIG. 4), and in the current example it is equal to 16. Because n is 2, the comparing section 105 sets “No” as a result of the decision made at operation SA11.
At operation SA5, the block extracting section 102 extracts a pair of blocks corresponding to n=2 (i.e., the block Bl12 and the block Br12) from the image data I1. Then, the block extracting section 102 outputs the density distributions of the block Bl12 and the block Br12 as the block density data D to the averaging section 103.
At operation SA6, the averaging section 103 obtains the left-side average density data Dl12 of the block Bl12 and the right-side average density data Dr12 of the block Br12 from the block density data D by the average processing.
At operation SA7, the averaging section 103 provides a control to store the left-side average density data Dl12 into the register 104, and store the right-side average density data Dr12 into the register 104 r.
At operation SA8, the comparing section 105 obtains “0” that is the next bit (corresponding to n=2) of the code C, and a difference between the left-side average density data Dl12 and the right-side average density data Dr12 stored in the register 104 l and the register 104 r respectively, and executes the bit decision based on the difference of densities (i.e., magnitude relation).
If the left-side average density data Dl12 is less than the right-side average density data Dr11, the comparing section 105 sets “0” as a result of the decision made for the pair of blocks based on the above magnitude relation.
At operation SA9, the comparing section 105 decides whether the n-th bit (in this case, the second bit “0”) of the code C is the bit for which the decision is made about the bit (in this case, “0”) at operation SA8. In this case, the comparing section 105 sets “Yes” as a result of the decision.
At operation SA10, the comparing section 105 increments n by 1. As a result, n becomes 3. At operation SA11, the comparing section 105 decides whether n (i.e., 3) is larger than nend (i.e., 16). In this case, the comparing section 105 sets “No” as a result of the decision made. Thereafter, the operation at operation SA5 and after is repeated until when the result of the decision made at operation SA11 becomes “Yes”.
When n is 16 at operation SA10 and also when the result of the decision made at operation SA11 is “No”, at operation SA5, the block extracting section 102 extracts a pair of blocks corresponding to n=16 (in this case, the block Bl28 and the block Br28) from the image data I1. Then, the block extracting section 102 outputs the density distributions of the block Bl28 and the block Br28 as the block density data D to the averaging section 103.
At operation SA6, the averaging section 103 obtains the left-side average density data Dl28 (“125”, see FIG. 3) corresponding to the block Bl28 and the right-side average density data Dr28 (“115”, see FIG. 3) corresponding to the block Br28 from the block density data D by the average processing.
At operation SA7, the averaging section 103 provides a control to store the left-side average density data Dl28 (“125”) into the register 104 l and store the right-side average density data Dr28 (“115”) into the register 104 r.
At operation SA8, the comparing section 105 obtains “0” that is the right bit (corresponding to n=16) of the code C illustrated in FIG. 4, and a difference of densities (10) between the left-side average density data Dl28 (“125”) and the right-side average density data Dr28 (“115”) stored in the register 104 l and the register 104 r respectively, and executes the bit decision based on the difference of densities (i.e., magnitude relation).
In the current example, as the left-side average density data Dl28 (“125”) is larger than the right-side average density data Dr28 (“115”), the comparing section 105 sets “1” as a result of the decision made for the pair of blocks based on the above magnitude relation.
At operation SA9, the comparing section 105 decides whether the n-th bit (in this case, the 16-th bit “0”) of the code C is the bit for which the decision is made about the bit (in this case, “1”) at operation SA8. In this case, the comparing section 105 sets “No” as a result of the decision.
At operation SA14, the comparing section 105 decides whether the difference of densities (10) obtained at operation SA8 is equal to or less than an upper threshold (for example, 100) set in advance, and in this case, sets “Yes” as a result of the decision made.
At operation SA15, the encoding section 106 executes the density change processing to change the left-side average density data Dl28 and the right-side average density data Dr28 such that the result of the bit decision based on the magnitude relation between the left-side average density data Dl28 (“125”) and the right-side average density data Dr28 (“115”) becomes the same as the n-th bit (in this case, the 16-th bit “0”) of the code C.
In other words, the encoding section 106 reverses the magnitude relation between the left-side average density data Dl28 (“125”) and the right-side average density data Dr28 (“115”) such that the left-side average density data Dl28 becomes less than the right-side average density data Dr28, and changes the densities such that the result of the bit decision changes from “1” to “0”.
Specifically, the encoding section 106 obtains left-side average density data D′l after the change (corresponding to left-side average density data D′l28 after the change) from an expression (1) of (A) when Dl<Dr illustrated in FIG. 7. After this, the encoding section 106 obtains right-side average density data D′r after the change (corresponding to right-side average density data D′r28 after the change) from an expression (2) shown in FIG. 7.
As a result, after the change of the densities, the left-side average density data D′l28 becomes less than the right-side average density data D′r28, and the result of the bit decision changes from “1” to “0”.
On the other hand, in order to obtain (B) Dl≧Dr illustrated in FIG. 7, left-side average density data D′l after the change (corresponding to left-side average density data D′lxy after the change) is obtained from an expression (3) shown in FIG. 7. After this, right-side average density data D′r after the change (corresponding to right-side average density data D′rxy after the change) is obtained from an expression (4) shown in FIG. 7.
As a result, after the change of the densities, the left-side average density data D′lxy becomes equal to or larger than the right-side average density data D′rxy, and the result of the bit decision changes from “0” to “1”.
When the result of the decision made at operation SA14 is “No”, that is, when the difference of densities obtained at operation SA8 is larger than the upper threshold, the processing at operation SA10 is executed without executing the density change processing.
The reason is explained below in detail. When the difference of densities in the pair of blocks is large, the execution of the density change processing apparently reveals the change. Therefore, in order to prevent the image quality from being degraded (unnatural image), the density change is not executed intentionally.
At operation SA10, the comparing section 105 increments n by 1. As a result, n becomes 17. At operation SA1, the comparing section 105 decides whether n (=17) is larger than nend (=16). In this case, the comparing section 105 sets “Yes” as a result of the decision made.
At operation SA12, the comparing section 105 decides whether the processing concerning the last pair of blocks (the blocks Bl168 and Br168) in the image data 11 ends, and, in this case, sets “No” as a result of the decision made.
At operation SA16, the comparing section 105 resets n to 1. At operation SA5, the block extracting section 102 extracts the next pair of blocks corresponding to n=1 (in this case, the block Bl31 and the block Br31) from the image data I1. Then, the block extracting section 102 outputs the density distributions of the block Bl31 and the block Br31 as the block density data D to the averaging section 103.
Thereafter the above operation is repeated until when the result of the decision made at operation SA12 becomes “Yes”.
When the result of the decision made at operation SA12 is “Yes”, at operation SA13, the encoding section 106 generates and outputs the image coded data I3, based on the result of the decision made at operation SA9, the result of the decision made at operation SA14, and the density change processing at operation SA15.
Specifically, when the result of the decision made at operation SA9 for the pair of blocks is “Yes” (when the result of the decision made at operation SA14 is “No”), the encoding section 106 maintains the magnitude relation between the left-side average density data Dl and the right-side average density data Dr (i.e., no change in the densities). On the other hand, based on the density change processing at operation SA15, the encoding section 106 generates the image coded data I3 corresponding to the left-side average density data D′l and the right-side average density data D′r after the change, based on the density change processing at operation SA15. The decoder 200 described later decodes this image coded data I3.
The same code C (1010110101001010) is embedded by eight times in total into the areas A1 to A8 in the image coded data I3 illustrated in FIG. 5.
An operation example 2 of the encoder 100 is explained in detail below with reference to a flowchart in FIG. 8. In FIG. 8, operation SB10 and operation SB11 are added to the flowchart.
Because operations SB1 to SB9 and SB12 to SB18 in FIG. 8 are same as the operations SA1 to SA16 in FIG. 6, their detailed explanation is omitted.
At operation SB9 illustrated in FIG. 8, the comparing section 105 decides whether the n-th bit of the code C is the same as a result of the bit decision made at operation SB8, and, in this case, sets “Yes” as a result of the decision made.
At operation SB10, the comparing section 105 decides whether the difference in the densities obtained at operation SB8 is less than a lower threshold (for example 10) set in advance. In this case, it is assumed that the result of the decision made is “Yes”.
When the difference of densities is less than the lower threshold, the magnitude relation is reversed and the precision becomes low.
In order to avoid this problem, at operation SB11, the encoding section 106 adjusts the left-side average density data Dl and the right-side average density data Dr such that the difference of densities becomes equal to or higher than the lower threshold, and executes a density difference expand processing to expand the difference of densities.
When the result of the decision made at operation SB10 is “No”, that is, when the difference in the densities is equal to or higher than the lower threshold, the processing at operation SB12 is executed. When the result of the decision made at operation SB16 is “No”, the processing at operation SB12 is also executed.
FIG. 9 is a block diagram of the decoder 200 according to the first embodiment. The decoder 200 decodes a code that is embedded in the image coded data I3 that is encoded by the encoder 100.
The decoder 200 includes an image cut-out section 201 that cuts out the effective image coded data I3 from the total when the surrounding of the image coded data I3 includes image data (for example, blank space). However, when only the image coded data I3 is input to the image cut-out section 201, the image cut-out section 201 does not cut out data.
The decoder 200 includes a block dividing section 202 that divides the image coded data I3 output from the image cut-out section 201 into blocks of N rows�M columns (16�16, in the drawing) in the same manner as the block dividing section 101 of the encoder 100 divides the original image data I0, and outputs the result as image data divided into blocks.
The decoder 200 includes a characteristic amount extracting section 208, and wherein characteristic amount section 208 includes a block extracting section 203, an averaging section 204, a register 205 l, and a register 205 r. a block extracting section 203 that sequentially extracts pairs of blocks (two blocks) from the image data divided into blocks in the same manner as the block extracting section 102 of the encoder 100 extracts the pairs of blocks. The block extracting section 203 sequentially outputs density distributions of the pair of blocks (two blocks) as block density data.
The decoder 200 includes an averaging section 204 that obtains left-side average density data corresponding to one of the pair of blocks and right-side average density data corresponding to the other block from the block density data, and sequentially stores these data into a register 205, and a register 205, following the bit shift of the code, in a similar manner to that of the averaging section 103 (refer to FIG. 1).
A comparing section 206 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205, and the register 205 r respectively, thereby making a bit decision. The comparing section 206 outputs a code group CG (candidate codes C1 to C8: refer to FIG. 10) corresponding to the result of the bit decision (bit decided as “0” or “1” from the expression described above), to a decoding section 207.
Each of the candidate codes C1 to C8 has 16 bits, and is the result that each code (16 bits) embedded into the areas A1 to A8 of the image coded data I3 (refer to FIG. 5) is decoded. Each code is a candidate of a code C′ (refer to FIG. 9) as a result of the decoding by the decoder 200.
In the candidate codes C1 to C8, “2” denotes a bit for which a bit decision about “1” or “0” is uncertain.
The decoding section 207 makes each bit (16 bits) firm based on a majority decision in a bit unit (a bit string in a vertical direction in the drawing) from the candidate codes C1 to C8 corresponding to the result of the comparison by the comparing section 206, as illustrated in FIG. 10. The decoding section 207 outputs this result as the code C′ of the result of decoding by the decoder 200.
Constituent elements of the decoder 200 are connected to each other via a control section (not shown).
The operation of the decoder 200 is explained with reference to a flowchart illustrated in FIG. 11.
At operation SC1, the image coded data I3 (refer to FIG. 1) is input to the image cut-out section 201. At operation SC2, n is initialized to 1. n denotes a pointer of the bit of a code to be decoded. In this case, n=1 corresponds to the leftmost bit of the code.
At operation SC3, when the surrounding of the input image coded data I3 includes image data (for example, blank space), the image cut-out section 201 cuts out the effective image coded data I3 from the total.
At operation SC4, the block dividing section 202 divides the image coded data I3 cut out by the image cut-out section 201 into 16�16 blocks based on the block divide processing, and outputs the result as the image data divided into blocks to the block extracting section 203, in a similar manner to that of the block dividing section 101 (refer to FIG. 1).
At operation SC5, the block extracting section 203 extracts a pair of blocks (two blocks) corresponding to n=1 from the image data divided into blocks, and outputs the density distributions of these blocks as the block density data to the averaging section 204, in a similar manner to that of the block extracting section 102 (refer to FIG. 1).
At operation SC6, the averaging section 204 obtains left-side average density data corresponding to one of the pair of blocks and right-side average density data corresponding to the other block from the block density data by the average processing, in a similar manner to that of the averaging section 103 (refer to FIG. 1).
At operation SC7, the averaging section 204 provides a control to store the left-side average density data into a register 205 and store the right-side average density data into a register 205 r.
At operation SC8, the comparing section 206 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205 l and the register 205 rrespectively, thereby making a bit decision. The comparing section 206 outputs the result of the bit decision (bit decided as “0” or “1” from the expression described above), to the decoding section 207.
The comparing section 206 obtains a difference between the left-side average density data and the right-side average density data. When the difference of densities is larger than a certain upper threshold, the comparing section 206 sets the result of the bit decision to “2” (uncertain: refer to FIG. 10) by regarding that the bit decision result corresponding to the pair of blocks is not reliable.
At operation SC9, the comparing section 206 increments n by 1. As a result, n becomes 2. At operation SC10, the comparing section 206 decides whether n is larger than nend (=16), and in this case, sets “No” as a result of the decision made.
Thereafter, the operation at operation SC5 and after is repeated until when the result of the decision made at operation SC10 becomes “Yes”.
When n becomes 17 at operation SC9, the result of the decision made at operation SC10 is set to “Yes”. At this point of time, the comparing section 206 sets the candidate code Cl illustrated in FIG. 10 as a result of the bit decision.
At operation SC11, the comparing section 206 decides whether the processing concerning the last pair of blocks (two blocks) in the image data divided into blocks ends, and, in this case, sets “No” as a result of the decision made.
At operation SC14, the comparing section 206 sets n to 1 in order to reset n (=17). At operation SC5, the block extracting section 203 extracts the next pair of blocks (two blocks) corresponding to n=1 from the image data divided into blocks. Then, the block extracting section 203 outputs the density distributions of the blocks as the block density data to the averaging section 204.
Thereafter, the above operation is repeated until when the result of the decision made at operation SC11 becomes “Yes”.
When the result of the decision made at operation SC11 becomes “Yes”, at operation SC12, the decoding section 207 executes a majority decision processing. In other words, at this point of time, the candidate codes C1 to C8 illustrated in FIG. 10 are bit decision result.
The decoding section 207 makes each bit (16 bits) firm based on a majority decision in a bit unit (a bit string in a vertical direction in the drawing) from the candidate codes C1 to C8. For example, in the case of the leftmost bit of the candidate codes C1 to C8, “0” is 2, “1” is 5, and “2” is 1. Therefore, the leftmost bit of the code C′ is decided as “1” based on the majority decision.
At operation SC13, upon reception of the result of the majority decision processing, the decoding section 207 outputs the code C′ (refer to FIG. 10) as a result of the decoding by the decoder 200. The code C′ is the same as the code C (refer to FIG. 4).
As explained above, according to the first embodiment, one bit (code) is related to each pair of blocks in a plurality of blocks (image data I1: refer to FIG. 3) that are obtained by dividing the original image data I0 (refer to FIG. 2), based on a magnitude relation of the average density (characteristic amount), and the code C (plurality of codes) is embedded into a plurality of blocks. Thus, because it is not required to calculate the FFT the processing required to embed the code into the image data can be reduced.
According to the first embodiment, as explained in the operation example 1 (refer to FIG. 6), when the magnitude relation of the average density in the pair of blocks does not coincide with the bit (code) to be embedded, the average density of the pair of blocks is changed so as to reverse the magnitude relation. Therefore, an optional code can be embedded as desired.
According to the first embodiment, as explained in the operation example 1 (refer to FIG. 6), when the difference of densities between the pair of blocks (i.e., difference between characteristic amounts) exceeds an upper threshold, the average density is not changed. Therefore, it is possible to prevent the image quality from being degraded following an excessive change of the average density.
According to the first embodiment, as explained in the operation example 2 (refer to FIG. 8), when the magnitude relation of the average density (characteristic amount) coincides with the bit (code) to be embedded and also when the difference of densities between the pair of blocks (i.e., difference between characteristic amount) is less than a lower threshold, the average density is changed such that the difference becomes equal to or higher than the lower threshold. Therefore, when the decoder 200 decodes the code, a reduction in the precision such as a reversal of the magnitude relation can be prevented.
According to the first embodiment, because the characteristic amount of the average density is employed, the characteristic amount can be calculated with lesser calculations and quickly.
According to the first embodiment, the code C is embedded repeatedly (eight times) as illustrated in FIG. 5. Therefore, an uncertain code can be specified by the majority decision at the decoding time, and reliability can be increased.
Thus, according to the first embodiment, it is possible to provide decoder can reduce the processing required to decode the code in the image data.
It is explained in the first embodiment that the encoder 100 performs embedding the code C (refer to FIG. 4) and the decoder 200 decodes the embedded code C. However, instead of using the code C, an error-correction-coding code is embedded using error correction coding (for example, BCH (Bose Chaudhuri Hocquenghem) code, or Reed Solomon code), and a decoder decodes the embedded error-correction-coding code. This configuration example is explained as the second embodiment.
An encoder 300 shown in FIG. 12 and a decoder 400 shown in FIG. 13 are examples of an image data processing apparatus according to the second embodiment. The encoder 300 embeds a code (binary) as separate data into an original image data, and generates image coded data, and the decoder 400 reads the code from the image coded data.
FIG. 12 is a block diagram of the encoder 300. In this drawing, portions corresponding to those in FIG. 1 are designated with like reference numerals, and their explanation is omitted.
In FIG. 12, an error correction code encoding section 301 is newly provided, and a comparing section 302 and an encoding section 303 are provided in place of the comparing section 105 and the encoding section 106 shown in FIG. 1.
The error correction code encoding section 301 encodes a code Ca including x bits using error-correction-coding (for example, a BCH signal), and generates error-correction-coding CE.
The code for error-correction-coding CE includes the code Ca (x bits), and a redundant bit (y bits) that is calculated from the code Ca and a predetermined calculation expression, and has (x+y) bits (for example, 15 bits). According to this error-correction-coding code CE, even when an error of three bits occurs, the original code Ca can be restored based on the error correction.
The encoder 300 embeds the error-correction-coding code CE eight times, for example, into the original image data I0 (refer to FIG. 2), and generates image coded data I4. The encoder 300 is different from the encoder 100 in that the encoder 300 uses error-correction-coding code CE, while the encoder 100 uses the code C.
The comparing section 302 compares the nth bit of the error-correction-coding code CE with the result of a bit decision made from the magnitude relation between the left-side average density data Dl and the right-side average density data Dr stored in the register 104 l and the register 104 r respectively (a bit decision is made as “0” or “1” from the relational expression described in the first embodiment: refer to FIG. 3).
The encoding section 303 executes a processing to embed the error-correction-coding code CE into the image data I1 (the original image data I0) based on the result of the comparison carried out by the comparing section 302. Specifically, when the result of the comparison carried out by the comparing section 302 indicates coincidence, the encoding section 303 maintains the magnitude relation between the left-side average density data Dl and the right-side average density data Dr. On the other hand, when the result of the comparison indicates non-coincidence, the encoding section 303 changes the left-side average density data Dl and the right-side average density data Dr (i.e., reverses the magnitude relation) so as to obtain the magnitude relation that expresses the bit of the error-correction-coding CE, generates the image coded data I4, and outputs this data.
This image coded data I4 has the same configuration as the image coded data I3. Therefore, the same error-correction-coding code CE (15(x+y) bits) is embedded by eight times in total into the image coded data I4.
Constituent elements of the encoder 300 are connected to each other via a control section not illustrated.
The operation of the encoder 300 is similar to that of the encoder 100 except that the error-correction-coding code CE is used, and therefore, the explanation is omitted.
FIG. 13 is a block diagram of the decoder 400. The decoder 400 decodes the embedded error-correction-coding code CE (code Ca) from the image coded data I4 that is encoded by the encoder 300.
In FIG. 13, portions corresponding to those in FIG. 9 are designated with like reference numerals, and their explanation is omitted. In FIG. 13, a comparing section 401 and a decoding section 402 are provided in place of the comparing section 206 and the decoding section 207 shown in FIG. 9.
The comparing section 401 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205 l and the register 205 r respectively, thereby making a bit decision, in a similar manner to that of the comparing section 206 (refer to FIG. 9). The comparing section 401 outputs a candidate error-correction-coding code group CEG (candidate error-correction-coding codes CE1 to CE8: refer to FIG. 15) corresponding to the result of the bit decision (bit decided as “0” or “1” from the expression explained in the first embodiment), to a decoding section 402.
Each of the candidate error-correction-coding codes CE1 to CE8 has 15 (x+y) bits, and is the result that eight error-correction-coding codes (15 bits) embedded into the image coded data I4 are decoded. Each code is a candidate of an error-correction-coding code for CE′ (refer to FIG. 15).
In the candidate error-correction-coding codes CE1 to CE8, “2” denotes a bit for which a bit decision about “1” or “0” is uncertain.
The decoding section 402 makes each bit (15 bits in total) firm based on a majority decision in a bit unit (a bit string in a vertical direction in the drawing) from the candidate error-correction-coding codes CE1 to CE8 corresponding to the result of the comparison by the comparing section 401, as illustrated in FIG. 15. The decoding section 402 outputs this result as the error-correction-coding code CE′.
Strictly speaking, the error-correction-coding code CE′ has a risk of including an error bit. Therefore, in the second embodiment, the decoding section 402 executes a supplement processing to replace the bit of “2” (uncertain) in the candidate error-correction-coding codes CE1 to CE8 (i.e., the candidate error-correction-coding code group CEG) with a corresponding bit in the error-correction-coding code CE′, and obtains candidate error-correction-coding codes CE′1 to CE′8 (a candidate error-correction-coding code group CEG′).
The decoding section 402 executes an error correction decode processing (for example, a decode processing based on the BCH code) for each of the candidate error-correction-coding codes CE′1 to CE′8, and obtains a code (corresponding to the code Ca illustrated in FIG. 12, for example) and number of errors. The number of errors is number of error bits in each of the error-correction-coding codes CE′1 to CE′8.
The decoding section 402 outputs a code corresponding to a minimum number of errors among codes obtained by the error correction decode processing, as a code Ca′. This code Ca′ is the result of decoding by the decoder 400.
Constituent elements of the decoder 400 are connected to each other via a control section not illustrated.
Next, the operation of the decoder 400 illustrated in FIG. 13 is explained with reference to a flowchart illustrated in FIG. 14.
In the drawing, at operation SD1, the image coded data I4 (refer to FIG. 12 and FIG. 13) is input to the image cut-out section 201. At operation SD2, n is initialized to 1. This n denotes a pointer of the bit of a code to be decoded. In this case, n=1 corresponds to the leftmost bit of the code.
At operation SD3, when the surrounding of the input image coded data I4 includes image data (for example, blank space), the image cut-out section 201 cuts out the effective image coded data I4 from the total.
At operation SD4, the block dividing section 202 divides the image coded data I4 cut out by the image cut-out section 201 into M�N blocks based on the block divide processing, and outputs the result as the image data divided into blocks to the block extracting section 203.
At operation SD5, the block extracting section 203 extracts a pair of blocks (two blocks) corresponding to n=1 from the image data divided into blocks, and outputs the density distributions of these blocks as the block density data to the averaging section 204.
At operation SD6, the averaging section 204 obtains left-side average density data corresponding to one of the blocks and right-side average density data corresponding to the other block from the block density data by the average processing.
At operation SD7, the averaging section 204 stores the left-side average density data into a register 205 l and stores the right-side average density data into a register 205 r respectively.
At operation SD8, the comparing section 401 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205 l and the register 205 r respectively, thereby making a bit decision. The comparing section 401 outputs the result of the bit decision (bit decided as “0” or “1” from the expression described above), to the decoding section 402.
The comparing section 401 obtains a difference between the left-side average density data and the right-side average density data. When the difference of densities is larger than the upper threshold explained at operation SA14 (refer to FIG. 6), the comparing section 401 sets the result of the bit decision to “2” (uncertain: refer to FIG. 15) by regarding that the bit decision result corresponding to the pair of blocks is not reliable.
At operation SD9, the comparing section 401 increments n by 1. As a result, n becomes 2. At operation SD10, the comparing section 401 decides whether n is larger than nend (=15), and in this case, sets “No” as a result of the decision made, in a similar manner to that at operation SC10 (refer to FIG. 11).
Thereafter, the operation at operation SD5 and after is repeated until when the result of the decision made at operation SD10 becomes “Yes”.
When n becomes 17 at operation SD9, the result of the decision made at operation SD10 is set to “Yes”. At this point of time, the comparing section 401 sets the candidate code for error-correction-coding CE1 illustrated in FIG. 15 as a result of the bit decision.
At operation SD11 the comparing section 401 decides whether the processing concerning the last pair of blocks (two blocks) in the image data divided into blocks ends, and, in this case, sets “No” as a result of the decision made.
At operation SD16, the comparing section 401 sets n to 1 in order to reset n (=16). At operation SD5, the block extracting section 203 extracts the next pair of blocks (two blocks) corresponding to n=1 from the image data divided into blocks. Then, the block extracting section 203 outputs the density distributions of the blocks as the block density data to the averaging section 204.
Thereafter, the above operation is repeated until when the result of the decision made at operation SD11 becomes “Yes”.
When the result of the decision made at operation SD11 becomes “Yes”, at operation SD12, the decoding section 402 executes a majority decision processing, in a similar manner to that at operation SC12 (refer to FIG. 11). In other words, at this point of time, the candidate error-correction-coding codes CE1 to CE8 illustrated in FIG. 15 are the result of the bit decision.
The decoding section 402 makes each bit (15 bits in total) firm based on a majority decision in a bit unit (a bit string in a vertical direction in the drawing) from the candidate error-correction-coding codes CE1 to CE8. As a result, the error-correction-coding code CE′ is generated.
For example, in the case of the leftmost bit of the candidate error-correction-coding code CE1 to CE8, “0” is 2, “1” is 5, and “2” is 1. Therefore, the leftmost bit of the error-correction-coding code CE′ is decided as “1” based on the majority decision.
At operation SD13, the decoding section 402 executes a supplement processing to replace the bit of “2” (uncertain) in the candidate error-correction-coding codes CE1 to CE8 (i.e., the candidate error-correction-coding code group CEG) with a corresponding bit in the error-correction-coding code CE′, and obtains the candidate error-correction-coding code group CEG′ (i.e., the candidate error-correction-coding codes CE′1 to CE′8).
At operation SD14, the decoding section 402 executes the error correction decode processing (for example, a decode processing based on the BCH code) for each of the candidate error-correction-coding codes CE′1 to CE′8, and obtains a code (corresponding to the code Ca illustrated in FIG. 12) and number of errors.
At operation SD15, the decoding section 402 outputs a code corresponding to a minimum number of errors among codes obtained by the error correction decode processing, as the code Ca′.
As explained above, according to the second embodiment, the error-correction-coding code CE is embedded into a plurality of blocks as explained with reference to FIG. 12. Therefore, the decoder 400 and the like can correct errors, and can increase reliability.
In the first and the second embodiments, the configuration example of encoding and decoding using the average density of the total block (for example, the block Bl18) as illustrated in FIG. 3 is explained. It is also possible to have a configuration that uses the average density of only some portion (for example, the center portion) of the blocks. This configuration example is explained below as a third embodiment of the present invention.
FIG. 16 is to explain the third embodiment. In this drawing, a block B corresponds to the block (for example, the block Bl18 illustrated in FIG. 3) in the first and the second embodiments, and has a size of t�t pixels. In the third embodiment, encoding and decoding are carried out using the average density of a center portion Ba ((t/2)�(t/2) pixel size) as one portion of the block B.
As explained above, according to the third embodiment, the processing quantity concerning the density change processing can be reduced from that when the average density of the total block is used.
When the first to the third embodiments described above are applied to a color image, the following two methods may be employed. One method is to embed a code into a gray scale image (a monochromatic image) that is obtained by transforming a color image into brightness. The other method is to embed a code into any one component (for example, a yellow color component) out of color components (a cyan component, a magenta component, and a yellow component) of three primary colors (cyan, magenta, and yellow) in a color image.
The latter method has an advantage over the former method in that a change in the density is not easily discriminated by human eyes (refer to FIG. 18). FIG. 18 is a graph that expresses a relation between a density change quantity and MOS (Mean Opinion Score) according to the fourth embodiment.
This graph is the result of evaluation according to a subjective evaluation method that is prescribed in the International Commission on Illumination (ITU-T) known as an image evaluation method. According to the subjective evaluation method, when it is not possible to visually discriminate between an original image and an image obtained by changing the image by only a density change, five points are scored for the MOS value. When a difference between the two images becomes larger, a lower score is evaluated for the MOS value.
In the graph, “yellow” is the result of evaluation concerning an image of the yellow component. The “brightness” is the result of evaluation concerning an image of gray scale. As is clear from this graph, the yellow component (“yellow”) has a higher MOS value than that of the gray scale (“brightness”) even when the density change quantity increases. Therefore, according to the latter method of changing the density in the yellow component, a change cannot be easily discriminated by human eyes.
A configuration example of embedding a code into a color component (in this case, the yellow component) is explained as a fourth embodiment according to the present invention.
FIG. 17 is a block diagram of an encoder 500 according to the fourth embodiment. In this drawing, portions corresponding to those in FIG. 12 are designated with like reference numerals, and their explanation is omitted.
In FIG. 17, a yellow component cut-out section 501 and a yellow component integration section 502 are newly provided. The yellow component cut-out section 501 cuts out the yellow component from block density data D, and outputs this component as yellow block density data DE to the averaging section 103.
The yellow component cut-out section 501 obtains left-side average density data DE, corresponding to one block and right-side average density data DEr corresponding to the other block from the yellow block density data DE, and stores these data into the register 104 l and the register 104 r respectively.
The yellow component cut-out section 501 also cuts out the cyan component and the magenta component from the block density data D, and outputs these components as cyan/magenta block density data DCM to the yellow component integration section 502.
In the fourth embodiment, a processing is executed to the yellow block density data DE, and the density of the yellow component is changed. The encoding section 303 outputs yellow image coded data IE4 corresponding to the yellow component. The yellow component integration section 502 integrates the yellow image coded data IE4 and the cyan/magenta block density data DCM, and outputs the result as image coded data I5.
As explained above, according to the fourth embodiment, the yellow component cut-out section 501 cuts out the yellow component, and embeds into a plurality of blocks of the yellow component. Therefore, by utilizing the characteristic amount that yellow is not distinctive, the data decision capacity can be maintained without degrading the image quality.
A fifth embodiment of the present invention relates to how the image cut-out section 201 illustrated in FIG. 9 cuts-out the image. As illustrated in FIG. 19, the encoder 100 (refer to FIG. 1) may add yellow marks ME1 to ME4 at four corners of the image coded data I3 to distinguish between the cut-out portion and a blank portion P. This configuration example is explained below as the fifth embodiment.
In FIG. 19, the yellow marks ME1 to ME4 are yellow fine dots, and are not distinctive as explained with reference to FIG. 18.
Next, how the image cut-out section 201 illustrated in FIG. 9 cuts the image is explained. When the blank portion P and the image coded data I3 (the yellow marks ME1 to ME4) illustrated in FIG. 19 are input to the image cut-out section 201, a four-corner search processing illustrated in FIG. 21 is executed.
In this four-corner search processing, the four corners of the image coded data I3 (the yellow marks ME1 to ME4) illustrated in FIG. 19 are searched. In the following explanation, number of pixels of the blank portion P (white) is assumed as 255, and number of pixels of black (yellow) is assumed as 0.
Specifically, at operation SE1 illustrated in FIG. 20, the image cut-out section 201 searches a minimum pixel value (for example, 250) in the blank portion P (white) that is the surrounding portion of the image coded data I3. At operation SE2, the image cut-out section 201 multiplies a safety ratio (0.9) to the minimum pixel value (250), thereby setting a threshold (225).
At operation SE3, the image cut-out section 201 searches a position of pixels equal to or smaller than the threshold (255) by moving a search line L of an inclination angle 45 degrees from a corner of the blank portion P (the left upper corner in FIG. 21) to an X direction, as illustrated in FIG. 21.
When the search line L reaches the yellow mark ME1, the image cut-out section 201 firms the position of the yellow mark ME1 as one of the four corners of the image coded data 13, as the pixel value (=0) of the yellow mark ME1 is smaller than the threshold.
At operation SE4, the image cut-out section 201 decides whether the four corners of the image coded data 13 are searched, and, in this case, sets “No” as a result of the decision made. Thereafter, the processing at operation SE3 is executed for the other three corners. When the four corners (the yellow marks ME1 to ME4) illustrated in FIG. 19 are searched, the image cut-out section 201 sets “Yes” as a result of the decision made at operation SE4.
Next, the image cut-out section 201 cuts out the image coded data I3 from the total image (i.e., the blank portion P and the image coded data I3) illustrated in FIG. 19 according to a known affine transformation or the like using the position coordinates of the yellow marks ME1 to ME4.
As explained above, according to the fifth embodiment, the yellow marks ME1 to ME4 for cut-out are given to the image coded data I3 as the embedded result as illustrated in FIG. 19. Therefore, the image cut-out at the decoding time can be executed easily.
While the configurations according to the first to the fifth embodiments of the present invention are explained in detail with reference to the drawings, detailed configuration examples are not limited to the first to the fifth embodiments. In the present invention, any design alteration within a scope not departing from the gist of the invention is included.
For example, in the first to the fifth embodiments, a computer program that achieves the functions of the encoder 100, the decoder 200, the encoder 300, the decoder 400, or the encoder 500 may be recorded onto a computer-readable recording medium 700 illustrated in FIG. 22. A computer 600 illustrated in FIG. 22 reads the computer program recorded on the recording medium 700, and executes the computer program, thereby achieving the functions.
The computer illustrated in this drawing includes a CPU (Central Processing Unit) 610 that achieves the computer program, an input unit 620 including a keyboard and a mouse, a ROM (Read Only Memory) 630 that stores various data, a RAM (Random Access Memory) 640 that stores operation parameters, a reading unit 650 that reads the computer program from the recording medium 700, and an output unit 660 including a display and a printer.
The CPU 610 reads the computer program that is recorded on the recording medium 700 via the reading unit 650, and executes the computer program, thereby achieving the functions. The recording medium 700 includes an optical disk, a flexible disk, a hard disk, etc.
The characteristic amount of the image is not limited to the average density. It is also possible to use other characteristic amount that are obtained from granularity, chroma, density barycenter, and variance. In this case, as the characteristic amount is granularity, chroma, density barycenter, or variance, the characteristic amount is not distinctive, which can reduce the influence to the image quality.
In the first to the fifth embodiments, the characteristic amount may be changed to other characteristic amount based on a predetermined conversion rule.
As explained above, according to the present invention, one code is related to each pair of blocks in a plurality of blocks as a result of dividing image data, based on a magnitude relation of characteristic amount, and a plurality of codes are embedded into a plurality of blocks. Therefore, there is an effect that the conventional FFT is not necessary, and that the processing required to embed the code into the image data can be reduced.
According to the present invention, when the magnitude relation of characteristic amount between the pair of blocks does not coincide with the code to be embedded, the characteristic amount of the pair of blocks are changed to reverse the magnitude relation. Therefore, there is an effect that a desired code can be freely embedded.
According to the present invention, when a difference of characteristic amount between a pair of blocks exceeds an upper threshold, the characteristic amount are not changed. Therefore, there is an effect that it is possible to prevent the image quality from being degraded following an excessive change of the average density.
According to the present invention, when the magnitude relation of characteristic amount coincides with the code to be embedded and also when the difference of densities between the pair of blocks is less than a lower threshold, the characteristic amount are changed such that the difference becomes equal to or higher than the lower threshold. Therefore, there is an effect that when the code is decoded, a reduction in the precision such as a reversal of the magnitude relation can be prevented.
According to the present invention, as a plurality of codes for error-correction-coding are embedded into a plurality of blocks, there is an effect that the decoding side can correct an error, and reliability can be increased.
According to the present invention, as each characteristic amount is extracted from a portion of each block, there is an effect that the processing quantity can be reduced as compared with when the characteristic amount of a total block is used.
According to the present invention, a yellow component is cut out from a plurality of blocks, and embedding is executed into a plurality of blocks of the yellow component. Therefore, there is an effect that by utilizing the characteristic amount that yellow is not distinctive, the data decision capacity can be maintained without degrading the image quality.
According to the present invention, there is an effect that the processing required to decode a code of the image data can be reduced.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5636292May 8, 1995Jun 3, 1997Digimarc CorporationSteganography methods employing embedded calibration dataUS5841978Jul 27, 1995Nov 24, 1998Digimarc CorporationNetwork linking method using steganographically embedded data objectsUS6522766Mar 15, 1999Feb 18, 2003Seiko Epson CorporationWatermarking with random zero-mean patches for copyright protectionUS6600828May 26, 1999Jul 29, 2003Canon Kabushiki KaishaImage processing method and apparatus, and storage medium thereforUS6898297Jun 20, 2001May 24, 2005Matsushita Electric Industrial Co., Ltd.Digital watermark embedding method, digital watermark extracting method, recording medium, image recording device, and image replaying deviceUS20030021442Jul 17, 2002Jan 30, 2003Masahiko SuzakiWatermark Information embedment device and watermark information detection deviceUS20030063319Sep 27, 2002Apr 3, 2003Canon Kabushiki KaishaImage processing apparatus and method, computer program, and recording mediumUS20040120546Dec 12, 2003Jun 24, 2004Hiroshi YoshiuraMethod of judging digital watermark informationJP3784825B2 Title not availableJP2000050057A Title not availableJP2000059743A Title not availableJP2000216983A Title not availableJP2000228720A Title not availableJP2000299779A Title not availableJP2001103284A Title not availableJP2002010058A Title not availableJP2002135736A Title not availableJP2003101762A Title not availableJP2003110846A Title not availableJPH11205577A Title not availableNon-Patent CitationsReference1Ching-Tang Hsieh et al., "A Study of Enhancing the Robustness of Watermark", Dept of Electrical Engineering Tamkang University Taipei, Hsien, Taiwan, pp. 325-327 (Dec. 11, 2000).2Decision to Grant a Patent for Japanese patent application No. 2003-142582 (Japan patent No. 3784781) from which the present above-identified US patent application claims priority, dated Mar. 14, 2006, 1 page, including English language translation thereof (1 page).3European Search Report issued Feb. 24, 2006 in European Application No. 04252470.2-2218 related to the present above-identified US patent application.4Kineo Matsui, "Basics of Digital Watermark", Morikita Shuppan, K. K., Aug. 1998 pp. 94-97, English translation pp. 1-5.5Notification of Reason(s) for Refusal issued by the Japanese Patent Office on Dec. 13, 2005 in Japanese patent application No. 2003-142582 (Japan patent No. 3784781) from which the present above-identified US patent application claims priority, 3 pages, including English translation thereof (4 pages).6Notification of Reason(s) for Refusal issued by the Japanese Patent Office on Dec. 13, 2005 in Japanese patent application No. 2005-276561 (Japan patent No. 378425, which is a Japanese divisional application of priority Japanese application No. 2003-142582 from which the present above-identified US patent application claims priority, 3 pages, Including English translation thereof (4 pages).7Seiji Kobayashi, et al., "Data Hiding using Nature of Neighboring Pixels-Statistical Nature of Neighboring Pixels," Information Processing Society of Japan 56th Annual Conference (First Half of 1998), vol. 3-37 to 3-38 (2 pages), including English translation thereof 6 pages).8Shuichi Shimizu et al., "Still Picture Data Hiding By Pixel Block", IMB Japan Ltd., Tokyo Research Laboratory, Information Society of Japan, 1966, pp. 2-257 and 2-258, English translation pp. 1-6.9U.S. Appl. No. 10/824,528, filed Apr. 15, 2004, Jun Moroo, et al., Fujitsu Limited Kawasaki, Japan.10W. Wesley Peterson et al., "Bose-Chaudhuri-Hocquenghem Codes", pp. 269-309 (1988).11Wolfgang Funk, "Image Watermarking in the Fourier Domain based on global features of concentric ring areas", Proceedings of the SPIE vol. 4675, pp. 596-599, (2002).Classifications U.S. Classification382/239International ClassificationG06T1/00, H04N1/387, H04N7/08, G06K9/36, H04N7/081Cooperative ClassificationG06T2201/0083, G06T2201/0061, G06T2201/0051, G06T1/0021European ClassificationG06T1/00WLegal EventsDateCodeEventDescriptionMay 30, 2012FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services