This application is based upon and claims priority under 35 USC 119 from Japanese Patent Application No. 2009-114205, filed May 11, 2009.
The present invention relates to an image processing apparatus and an image processing program.
According to an aspect of the invention, an image processing apparatus includes an information converting unit and an output unit. The information converting unit converts information into an information expression image formed by a dot arrangement pattern in which information is expressed by arranging a given number or less of dots in a unit display area which is an information unit. The output unit arranges the converted information expression image. The output unit superimposes the converted information expression image on image information. The output unit outputs the superimposed information expression image. In the dot arrangement pattern, the arrangement of the dots is determined so that the number of the dots denoting 1 or 0 of a bit sequence of a given error correction code word is a subset equal to or smaller than the given number, and the dot arrangement pattern is readable by a machine.
Exemplary embodiments of the invention will be described in detail based on the following figures, wherein:
Hereinafter, a mode for carrying out the invention (hereinafter, referred to as an exemplary embodiment) will be described.
In
In the example of
As described above, the number of the dots D is equal to or smaller than the given number. In the example of
Next, only code words of which the number of is equal to or smaller than a given number are extracted from all of the error correction code words (hereinafter, referred to as a code word). When the given number is 4, seventeen code words are extracted from thirty two code words. As the given number is smaller, the image quality can be inhibited from deteriorating. However, since an amount of information which can give expression may be reduced, it is satisfactory that the given number is about 4.
By selecting the code words of the power-of-two as large as possible among the extracted cord words, the subsets of the code words are generated. As an example of a selection method, a method of selecting the code words from the code words with a smaller number when the code words are expressed by binary numbers can be used. In the above example, since the power-of-two which is the largest among the numbers equal to or smaller than 17 is 16, sixteen code words are selected and the subsets of the code words are generated. Since 4-bit information can be expressed using sixteen code words belonging to the subsets, as shown in
The information expression image shown in
In this way, the subsets are generated using sixteen code words from the BCH (9, 5, 3), which is one of the error correction codes, and the 4-bit information is expressed. Therefore, even when one dot is missed or one dot-like image is formed, the original information can be restored owing to the error correction function.
In the example shown in
In general, when the Reed-Solomon code is used as the RS (N, K) of 2k elements, the number of bits forming one block is k bits (where k is a small letter). The code length is N blocks, information has K blocks (where k is a capital letter), and a parity is N−K blocks. An error can be corrected up to (N−K)/2 blocks. Accordingly, the RS (4, 2) code of 23 elements is formed by four 3-bit blocks. Among the blocks, two blocks are information blocks and the remaining two blocks are the parity. Therefore, an error of one or less block can be decoded using the parity. Accordingly, the decoding is possible even when an error of one bit occurs in a 12-bit code word. Even when an error of three bits occurs, the code word is an error correction code which can be decoded as long as the error occurs within one block.
In the Reed-Solomon code, since the number of information bits is six bits, information of 2 to the power of 6=64 can be expressed. When the number of 1s equal to or smaller than a given number is extracted, for example, five code or less words are extracted from all code words belonging to the Reed-Solomon code, the number corresponds to twenty four. Since the maximum value of the power-of-two which does not exceed twenty four is sixteen, sixteen code words are selected from the extracted twenty four code words to generate the subset. Since 4-bit information can be expressed by the sixteen code words belonging to the subset, as shown in
In the information expression image shown in
In the above-described exemplary embodiment, the BCH code and the Reed-Solomon code have been used, but other error correction codes may be used. The 4-bit information is expressed as an example of the expressed information, but information with the large number of bits can also be expressed by a method of adjusting the number of dots of the dot arrangement pattern.
Hereinafter, an exemplary embodiment will be described in which information is embedded in a document image or the like by using the information expression image and the embedded information is decoded.
The CPU 10 controls the operation of each unit, which is described below, on the basis of a control program stored in the RAM 12 or the ROM 14. The RAM 12 mainly functions as a work area of the CPU 10. The ROM 14 stores control programs such as a BIOS and data used by the CPU 10.
The communication device 16 is constituted by a USB (Universal Serial Bus) port, a network port, or other appropriate interfaces and is used for the CPU 10 to exchange data with an external apparatus through communication unit such as a network.
The input device 18, which is constituted by a keyboard, a pointing device, a touch panel, or the like, is used for a user to input an operation instruction or the like.
The display device 20, which is constituted by a liquid crystal display, a touch panel, or the like, displays a result or the like processed by the CPU 10.
The printing device 22 forms a document image or the like, in which information is embedded using an information expression image, on a medium such as a paper sheet. The printing device 22 includes a printer engine. A laser printer engine forming an image by an electrophotographic process, for example is used as the printer engine. Alternatively, an ink jet printer engine may also be used as the printer engine.
The image reading device 24, which is organized by a scanner, for example, reads the document image or the like in which information is embedded using an information expression image.
The hard disk drive 26, which is a storage device, stores a variety of data necessary for a process, which is described below, such as the table expressing the relationship between the dot arrangement pattern and the expressed information. Instead of the hard disk device 22, a non-volatile storage device such as an EEPROM may be used.
The information converting unit 32 converts additive information such as an identification information (ID) of a document or information on an access authority to a document into the information expression image shown in
The image superimposing unit 34 arranges the dot arrangement patterns generated by converting each additive information by the information converting unit 32 and superimposes the dot arrangement patterns with image information, which is an output target such as a document image. In this case, the dot arrangement patterns are arranged in areas where document images or the like are continuously formed. Examples of the dot arrangement pattern includes a so-called raster scan order of arranging a dot arrangement pattern from the upper left to the upper right, descending one pattern, and then again arranging the dot arrangement pattern from the upper left to the upper right and a so-called block raster order of arranging a dot arrangement pattern in an area (an area larger than the dot arrangement pattern) with a predetermined size and then arranging the remaining dot arrangement pattern in an area adjacent to the area.
The image output unit 36 outputs the image information with which the image superimposing unit 34 superimposes the dot arrangement patterns to the printing device 22 or the like. In this way, the document image or the like formed such that the information expression image constituted by the dot arrangement pattern is readable by a machine is generated. The image output unit 36 may have a configuration in which the dot arrangement pattern is printed on a medium on which the image information such as the document image or the like is printed in advance. In this case, the image superimposing unit 34 may be omitted. The image output unit 36 permits the printing device 22 to print the dot arrangement pattern on the medium on which the image information is printed in the raster scan order or the block raster order. In the printing of the dot arrangement pattern, toner or ink which is invisible to the eyes may be used. In this case, the dot arrangement pattern may be disposed on the position at which contents such as the document image are printed. The printing device 22 prints the document image or the like. Alternatively, the document image or the like may be displayed by the display device 20, instead of the printing.
The image acquiring unit 38 permits the image reading device 24 to acquire the image information such as the document image. Alternatively, the image acquiring unit 38 may permit the communication device 16 to acquire the image information through the communication unit such as a network.
The information extracting unit 40 detects the dots forming the information expression image from the image information acquired by the image acquiring unit 38. In this case, the dots forming the information expression image are detected by binarizing the acquired image information, subjecting the binarized image information to a labeling process or the like, calculating the size of the detected area, and excluding an area larger than an appropriately determined certain threshold value and an area smaller than another threshold value. The dots forming the information expression image can be restored by removing the dots other than the dots of the embedded information expression image by the use of a dot interval of a certain value.
Next, the information extracting unit 40 detects the dots on the upper left from the detected dots. A skew angle of the image information acquired by the image acquiring unit 38 is calculated by obtaining the coordinates of the dots of the same row from the detected dots and performing the Hough transform or the like. On the basis of the skew angle, the image information is subjected to skew correction with reference to the upper left dot position. The dot arrangement pattern is read from the upper left dot From the image information subjected to the skew correction and the additive information is restored sequentially by k bits (for example, four bits) with reference to the table shown in
In
Next, the information converting unit 32 selects k bits (for example, four bits) from the additive information (S102), obtains the corresponding code word with reference to the table shown in
The information converting unit 32 determines whether all of the additive information acquired in step S101 in accordance with the above process are converted (S104). When it is determined that all of the additive information is not converted, the processes from step S102 are performed repeatedly.
Alternatively, when it is determined in step S104 that all of the additive information are converted, the image superimposing unit 34 arranges the dot arrangement patterns in the order of the code words and superimposes the additive information with image information which is the output target such as a document image (S105). The image information in which the dot arrangement patterns are superimposed is subjected to an output process such as printing by the image output unit 36 (S106). Alternatively, as described above, the dot arrangement patterns may be printed on the medium on which the image information such as a document image is printed in advance.
In accordance with the process, the image information in which the additive information is embedded as the information expression image by the dot arrangement patterns is printed.
In
Next, the information extracting unit 40 performs the skew correction or the like on the image information and reads the dot arrangement patterns from the dots detected in step S202 (S203). The information extracting unit 40 restores the additive information from the read dot arrangement patterns with reference to the table shown in
The above-described program executing the steps in
“The computer readable record medium recording the program” refers to a record medium which can be read by a computer and stores the program and which is used to install and execute the program and to distribute the program.
The foregoing description of the exemplary embodiment of the present invention has been provided for the purpose of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and various will be apparent to practitioners skilled in the art. The exemplary embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling other skilled in the art to understand the invention for various exemplary embodiments and with the various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
Number | Date | Country | Kind |
---|---|---|---|
2009-114205 | May 2009 | JP | national |
Number | Name | Date | Kind |
---|---|---|---|
5226116 | Sasaki | Jul 1993 | A |
5862270 | Lopresti et al. | Jan 1999 | A |
6116510 | Nishino | Sep 2000 | A |
6219460 | Tatsuta | Apr 2001 | B1 |
6222950 | Sugiura et al. | Apr 2001 | B1 |
6364209 | Tatsuta et al. | Apr 2002 | B1 |
6548768 | Pettersson et al. | Apr 2003 | B1 |
6614914 | Rhoads et al. | Sep 2003 | B1 |
6663008 | Pettersson et al. | Dec 2003 | B1 |
6674427 | Pettersson et al. | Jan 2004 | B1 |
RE39985 | Tatsuta | Jan 2008 | E |
7967216 | Kato et al. | Jun 2011 | B2 |
8189923 | Yoshida | May 2012 | B2 |
20040095337 | Pettersson et al. | May 2004 | A1 |
20040113893 | Pettersson et al. | Jun 2004 | A1 |
20040113898 | Pettersson et al. | Jun 2004 | A1 |
20060076416 | Petterson | Apr 2006 | A1 |
20060109308 | Miyamoto | May 2006 | A1 |
20060154559 | Yoshida | Jul 2006 | A1 |
20070158420 | Sonoda et al. | Jul 2007 | A1 |
20080192300 | Kenji | Aug 2008 | A1 |
20090060341 | Yoshida | Mar 2009 | A1 |
20090091530 | Yoshida | Apr 2009 | A1 |
20090122351 | Tsuchitoi | May 2009 | A1 |
Number | Date | Country |
---|---|---|
9-179924 | Jul 1997 | JP |
2833975 | Oct 1998 | JP |
10-320497 | Dec 1998 | JP |
2003-511762 | Mar 2003 | JP |
2005-070980 | Mar 2005 | JP |
2007-179111 | Jul 2007 | JP |
2008-109578 | May 2008 | JP |
Entry |
---|
Communication from the Japanese Patent Office dated Jan. 22, 2013, in a counterpart application No. 2009-114205. |
Number | Date | Country | |
---|---|---|---|
20110007092 A1 | Jan 2011 | US |