1. Field of the Invention
This invention relates to a technique for reading a part of symbols uniformly arranged on a two-dimensional plane and identifying a location thereof.
2. Description of the Related Art
In recent years, the techniques have been proposed for arranging the symbols uniformly, reading the symbol, and identifying the location thereof on the two-dimensional plane. For example, the symbols are uniformly arranged on a sheet of paper on which an examination is printed. By scanning the location of the answer selected by the examinee, the selected answer is transmitted to a telecommunications carrier or the like. The system that employs the aforementioned technique has been proposed (for example, as shown in
An M-sequences code is often used for coding the two-dimensional plane. The M-sequences code has the characteristics of “any two partial sequences are not identical, if the partial sequences having a length of m is extracted from the M-sequences code having a length of 2m−1.” Several techniques employing the aforementioned characteristics have been proposed for encoding the plane.
The M-sequences code denotes the code having a longest cycle (2p−1) from among the sequences created with the following expression of a p-th degree recurrence equation (also known as pseudo-random sequences).
at=c1at-1+c2at-2+ . . . +cpat-p(mod 2) (Expression 1)
For example, if P=5, C1=1, C2=1, C3=1, C4=0, and C5=1, the M-sequences (the length 25−1=31) shown in
For example, if 1 bit is represented by a symbol of 0.3 mm, the 10th degree M-sequences will be able to express the long side of a size A4 sheet having a length of 297 mm as follows.
(210−1)×0.3 mm=1023×0.3 mm=306.9 mm
It is to be noted that the aforementioned expression can encode only one sheet of size A4. Encoding a huge area demands a higher M-sequences. This causes problems in that the area to be read has to be larger at the time of identifying the location on the plane, and in addition, the decoding becomes complicated.
According to Japanese Patent Application Publication No. 2003-511762 (Document 1), referring to
The technique described in Document 1, however, has to be devised for identifying an edge of the sheet of paper so as to be applied to a practically useful size such as the size A4. In other words, referring to
The present invention has been made in view of the above circumstances and provides a printed material having a location identification function, two-dimensional coordinate identification apparatus, and image-forming apparatus and method thereof, with which a huge area can be encoded and an accuracy of location detection can be improved.
According to one aspect of the present invention, there may be provided a printed material having a location identification function comprising multiple encode units provided on an area to be encoded. Each of the multiple encode units records first code information of coordinate values identifying a location on the printed material and second code information of an identification number identifying the printed material; and the first code information and the second code information are invisibly recorded on the printed material. The coordinate values identifying the location on the printed material and the identification number identifying the identification number are separately encoded and recorded, enabling encoding a huge area. The coordinate values and the identification number are recorded in every encode unit. This makes it possible to identify the location on the printed material and the identification number of the printed material. Moreover, the aforementioned first code information is capable of improving accuracy in the location detection.
According to another aspect of the present invention, there may be provided a two-dimensional coordinate identification apparatus including an image reading potion that reads an image provided in a given area on a printed material on which first code information of coordinate values identifying a location on the printed material and second code information of an identification number identifying the printed material are recorded in each of multiple encode units provided on an area to be encoded, a detecting portion that detects the first code information and the second code information, with the image provided in the given area that has been read, and a decoding portion that decodes the first and second code information and invisibly outputs the identification number and the coordinate values. The image is read from the printed material having the first code information and the second code information printed thereon, so that the first and second code information is detected and decoded. This makes it possible to identify the identification number of the printed material and the location on the printed material with high accuracy.
According to a further aspect of the present invention, there may be provided an image-forming apparatus including an identification number encoding portion encoding an identification number that identifies a printed material; a coordinate encoding portion encoding coordinate values that identifies a location on the printed material; a symbol creating portion creating symbols of the identification number and the coordinate values according to codes of the identification number and the coordinate values; a combining portion combining an image to be printed and the symbols of the identification number and the coordinate values; and an image creating portion invisibly recording the symbols of the identification number and the coordinate values in each of multiple encode units provided on an area to be encoded and creating the printed material having the image to be printed on the symbols of the identification number and the coordinate values. Reading an encode unit or an area corresponding to the encode unit enables to obtain the location on the printed material and the identification number of the printed material.
According to a further aspect of the present invention, there may be provided a two-dimensional coordinate identification method including reading an image provided in a given area on a printed material on which first code information of coordinate values identifying a location on the printed material and second code information of an identification number identifying the printed material are recorded in each of multiple encode units provided on an area to be encoded; detecting the first code information and the second code information with the image provided in the given area that has been read; and decoding the first and second code information and invisibly outputting the identification number and the coordinate values.
Embodiments of the present invention will be described in detail based on the following figures, wherein:
A description will now be given, with reference to the accompanying drawings, of embodiments of the present invention.
First, a description will be given of a printed material having a location identification function.
The whole area to be encoded is divided into planes of practically useful size such as A3 or A4, and each of the planes is the area to be encoded invisibly, in accordance with the present embodiment. Hereinafter, the area to be encoded is simply referred to as page. Each page includes an identification number and coordinates (X, Y). The identification number identifies the page, and the coordinates (X, Y) indicate the location on the page. The identification number and the coordinates (X, Y) are separately encoded. Referring to
Each encode unit stores symbols for identifying the identification information as shown in
The identification numbers are represented by 20 symbols as shown in
The X-coordinates and the Y-coordinates are represented by the M-sequences codes. Each encode unit is represented by 10 bits (five symbols) on the X-coordinates and 10 bits (five symbols) on the Y-coordinates, and the length of the M-sequences code is 1,023 bits (210−1=1023). Here, the description is given with five symbols, yet the number of symbols may be varied depending on the area to be encoded.
If one symbol is represented by 2 bits, the aforementioned 1,023 bits represents 511.5 symbols. This results in only a half of the long side of the size A4, as shown in
The synchronous codes, which serve as a boundary or edge of the encode units, use 1 bit in the 2 bits included in one symbol. The multiple encode units shown in
If the synchronous code is predetermined, it is effective for determining the directions of the identification number or the symbols representing the X-coordinates or Y-coordinates. For example, assuming that “1” is set to the synchronous code and “2” is acquired when the page is scanned. This indicates that the page is rotated at 90 degrees as shown in
At least a predetermined size (the size of the encode unit) on a sheet of paper is to be read. If the size to be read is not equal to the predetermined size accurately and includes multiple encode units, the identification number and the values of the X-coordinates and Y-coordinates can be supplemented by the information obtained from other encode units.
First code information denotes the symbol or encoded information of the coordinate values identifying a location on the printed material and second code information denotes the symbol or encoded information of the identification number identifying the printed material.
(Configuration of an Image-Forming Apparatus)
The page coordinate information inputting portion 2 inputs a paper size, a print direction, and the identification number. The identification number encoding portion 3 encodes the identification number that has been input, and outputs location information to the identification number encode patterning portion 6. The location information includes an arrangement of the identification number that has been encoded. An encode method is not limited particularly, yet 40 bits can be used for indicating the identification number in accordance with the present embodiment.
The X-coordinate encoding portion 4 determines the location into which the X-coordinate data is written, according to the paper size and the print direction that have been input. Then, the X-coordinate data is encoded by the M-sequences code and the encoded data and the location information are output to the coordinate encode patterning portion 7. In the same manner, the Y-coordinate encoding portion 5 determines the location into which the Y-coordinate data is written, according to the paper size and the print direction that have been input. Then, the Y-coordinate data is encoded by the M-sequences code and the encoded data and the location information are output to the coordinate encode patterning portion 7.
The identification number encode patterning portion 6 converts the encoded identification number into a pattern of the encoded symbols, and arranges the symbols representing the identification number on the location for arranging the identification number according to the location information. The coordinate encode patterning portion 7 converts the X- and Y-coordinates data that have been encoded by the M-sequences code, into the pattern of the encoded symbols, and arranges the symbols representing the X- and Y-coordinates on the locations for arranging the X- and Y-coordinates according to the location information.
The synchronous encode patterning portion 8 determines the location on which the synchronous code is arranged, according to the paper size that has been input. Then, the synchronous code is converted into the pattern of the encoded symbol so that the symbol of the synchronous code may be arranged on the location for arranging the synchronous code according to the location information.
The pattern combining portion 9 combines the symbol of the identification number, the symbol of the coordinates, and the symbol of the synchronous code to form the encode unit.
The document image creating portion 11 creates a document or image to be printed on a sheet of paper. The document image creating portion 11 may be connected to a personal computer (hereinafter referred to as PC) so as to read the document or the image created on the PC. Moreover, the document or the image may be read by a scanner to take into the document image creating portion 11.
The image combining portion 10 overlaps an invisible or hidden pattern of symbols that have been combined in the pattern combining portion 9 and a visible document or image acquired from the document image creating portion 11, so that a print image is formed. The print image formed in the image combining portion 10 is printed out from the image creating portion 12.
Next, a description will be given of a two-dimensional coordinate identification apparatus 20, which reads the printed material having the location identification function shown in
The image reading portion 21 reads the image in the area that identifies the page and the coordinates. The pattern detecting portion 22 detects the symbol from the image that has been read. The bit information converting portion 23 converts the symbol that has been detected by the pattern detecting portion 22 into a bit matrix. The synchronous code detecting portion 24 scans the bit matrix to detect a bit string of the synchronous codes. The image rotation determining portion 25 determines a rotation angle of the image with the bit string of the synchronous codes. The bit information rotation converting portion 26 rotates the image in the reverse direction at the rotation angle that has been determined by the image rotation determining portion 25 to change the direction of the image into a correct one.
The identification number code detecting portion 27 detects the symbol of the identification number from an area that has been read, which includes four areas segmented by the synchronous codes as shown in
The identification number code restoring portion 28 sorts the symbols extracted from the four encode units at most or deletes the identical symbol, in order to convert into the symbols of the identification number included in one encode unit as shown in
The identification number code decoding portion 29 decodes the identification number that has been encoded. The identification number code error detecting portion 30 checks whether there is an error in the bit string identifying the identification number caused resulting from a noise or the like. The identification number code error correcting portion 31 corrects the error detected by the identification number code error detecting portion 30.
The error in the bit string identifying the identification number is detected with the use of a parity check code. Referring to
The X-coordinate code detecting portion 32 detects the symbol representing the X-coordinate value and converts the symbol into a bit string representing the encoded X-coordinate. The X-coordinate decoding portion 33 decodes the bit string of the encoded X-coordinate to obtain the X-coordinate value. The operation the X-coordinate decoding portion 33 will be described later.
The X-coordinate code error detecting portion 34 checks whether there is an error in the bit string indicating the encoded X-coordinate. The X-coordinate code error correcting portion 35 detects the error, and corrects the error if the error can be corrected. The operation of the X-coordinate code error detecting portion 34 and the X-coordinate code error correcting portion 35 will be described later.
The Y-coordinate code detecting portion 36 detects the symbol representing the Y-coordinate value and converts the symbol into a bit string of the encoded Y-coordinate. The Y-coordinate decoding portion 37 decodes the bit string of the encoded Y-coordinate to obtain the Y-coordinate value. The operation the Y-coordinate decoding portion 37 will be described later.
The Y-coordinate code error detecting portion 38 checks whether there is an error in the bit string indicating the encoded Y-coordinate. The Y-coordinate code error correcting portion 39 detects the error, and corrects the error if the error can be corrected. The operation of the Y-coordinate code error detecting portion 38 and the Y-coordinate code error correcting portion 39 will be described later.
The page coordinate information outputting portion 40 outputs the decoded identification number, the X-coordinate value, and the Y-coordinate value.
A description will now be given of the method of detecting an error in the encoded coordinate values. Conventionally, referring to
The error detection of the present embodiment utilizes the characteristics of the M-sequences code. As described, the X- and Y-coordinate values identifying the location on the page are encoded with the M-sequences code. The M-sequences code is calculated with the recurrence equation shown in Expression 1. It is therefore possible to check whether the partial sequences of (p+1) has a discrepancy with the recurrence equation that has generated the M-sequences code. Referring to
Now, referring to
Referring to
In addition to the method for detecting the error in the encoded coordinate value as described above, another method may be employed. For example, the M-sequences code is employed in such a manner that at least 1 is a smallest hamming distance between continuous p-bit partial sequences, and another smallest hamming distance between (p+n)-bit partial sequences is at least 2 in which n more bit(s) is (are) added. Referring to
Here, assuming that p=10 and n=4 in the M-sequences code, for example. The following Expression 2 shows the coefficients in the recurrence equation that generates the M-sequences code in which at least 2 is the smallest hamming distance between (p+n)-bit partial sequences.
{c1,c2,c3c4,c5,c6,c7,c8,c9,c10}={1,1,0,1,0,1,1,0,0,1} (Expression 2)
3 is the hamming distance of the (10+4)-bit partial sequences in the M-sequences code. This makes it possible to detect at least 2 bits of error and correct 1 bit of error.
Next, assuming that p=11 and n=5 in the M-sequences code, for example. The following Expression 3 shows the coefficients in the recurrence equation that generates the M-sequences code in which the smallest hamming distance between (p+n)-bit partial sequences is at least 3.
{c1,c2,c3c4,c5,c6,c7,c8,c9,c10,c11}={1,1,0,1,1,1,1,1,0,0,1} (Expression 3)
3 is the hamming distance of the (11+5)-bit partial sequences in the M-sequences code. This makes it possible to detect at least 2 bits of error and correct 1 bit of error.
Now, a description will be given of the operation procedure of the two-dimensional coordinate identification apparatus 20 with reference to flowcharts in
Next, the two-dimensional coordinate identification apparatus 20 detects the bit matrix included in the four areas segmented by the bit string of encoded synchronous codes in the X direction and in the Y direction, both of which intersect with each other (step S6). Then, the bit string of the X-coordinate is detected (step S7). After the detection of the aforementioned bit string, the X-coordinate is decoded with the bit string that has been detected (step S8).
The bit string of the encoded Y-coordinate is detected (step S9). The Y-coordinate is decoded with the bit string that has been detected (step S10).
The bit string of the encoded identification number is detected (step S11). The identification number is decoded with the bit string that has been detected (step S12).
The page coordinate information outputting portion 40 outputs the identification number, the X-coordinate value, and the Y-coordinate value that have been obtained with the above-mentioned procedure.
A description will now be given of the procedure in which the x-coordinate value is decoded with reference to the flowchart shown in
If predicted value QX is equal to (TX+PX) that is obtained from the recurrence equation of the M-sequences code (YES/step S23), go to step S24 to determine whether TX corresponds to NX. Here, NX denotes the number of additional bits that indicates the range of TX used in the determinations in the steps S22 and S23. This NX corresponds to the range with which a bit error is to be found, after shifting the bit string forward or backward as shown in
If the bit string that has been detected corresponds to the error bit string pattern (YES/step S27), the whole bit string that has been detected is compared with the correctable bit string pattern (step S29). If the bit string that has been detected corresponds to the correctable bit string pattern (YES/step S30) as described above, the bit string is corrected with the correctable bit string pattern (step S31). If the bit string that has been detected does not correspond to the correctable bit string pattern (NO/step S30), N/A (not applicable) is entered. If the bit string that has been detected does not correspond to the error bit string pattern (NO/step S31), or if the bit string is corrected in the step S31, the X-coordinate is decoded with the bit string ranging from the first bit of TX to the bit of PX (step S28).
Next, a description will be given of the decode procedure of the identification number with reference to the flowchart shown in
First, the bit matrix included in the four encode units, each of which is segmented by the encoded bit string of the X-coordinate and the encoded bit string of the Y-coordinate, is sorted to restore the bit matrix identifying the identification number (step S61). Then, the bit matrix that has been restored is scanned and converted into the bit string identifying the identification number (step S62). The bit string that has been converted is checked whether there is an error (step S63). If there is an error (YES/step S64), the error is determined whether the error is correctable (step S65). If the error is correctable (YES/step S66), the error is corrected (step S65) and the page is restored (step S69). If the error is not correctable (NO/step S66), N/A is entered into the identification number (step S68), and the procedure is completed. If there is no error in the bit string that has been restored (NO/step S64), the identification number is restored (step S69).
According to the present embodiment, an image in a given area is read from the printed material on which the code information of the coordinate values identifying the location on the page and the code information of the identification number on the page are invisibly recorded, so that the code information may be detected and decoded. This makes it possible to identify the identification number of the printed material and the coordinates thereon with high accuracy. In addition, the coordinate values and the identification number are invisibly recorded in each encode unit. Reading the encode unit enables to identify the location of the page and the identification number of the page.
The printed material described above is applicable to calendar, keyboard printed on a sheet of paper, application form, application blank, and the like, in addition to a test paper shown in
On the printed material having the location identification function, the first code information is encoded by an M-sequences code. It is therefore possible to identify the coordinates even if any location on the printed material is read.
On the printed material having the location identification function, the multiple encode units are segmented by synchronous codes. It is easy to identify the location on the printed material at the time of reading.
On the printed material having the location identification function, each of the first and second code information is represented by symbols each capable of expressing multiple bits. Each of the first code information and the second code information is composed of a symbol, one bit of which can express multiple bits, resulting in a decrease in the number of the symbols invisibly recorded on the printed material.
On the printed material having the location identification function, the first and second code information and the synchronous codes are represented by symbols; and directions of the first and second code information can be indicated by the symbols representing the synchronous codes. The directions of the first code information and the second code information are identified so that the information can be extracted accurately.
On the printed material having the location identification function, the second code information is recorded repeatedly in each of the multiple encode units. The identification number is repeatedly recorded in every encode unit on the printed material, enabling decoding the identification number at what point or area is read on the printed material.
On the printed material having the location identification function, a size of the second code information is varied depending on a number of pages to be encoded. Even if the number of pages increase, it is possible to encode the pages.
On the printed material having the location identification function, a code length of the first code information is varied depending on a size of the area to be encoded. Even if the size of the printed material changes, it is possible to encode the pages.
On the two-dimensional coordinate identification apparatus, the detecting portion reads the first and second code information from the multiple encode units and detects the second code information. Even if the area to be read does not correspond to the encode unit, the first code information and the second code information can be detected with those in the multiple encode units. The location to be read does not have to be decided or worried about. The first and second code information provided at any point on the printed material is capable of identifying the identification number of the printed material and the location on the printed material.
On the two-dimensional coordinate identification apparatus, the first code information and the second code information are represented by symbols; symbols capable of identifying directions of the first and second code information are arranged among the multiple encode units; and the detecting portion identifies the directions of the symbols and the first and second code information. It is therefore possible to identify the directions of the symbols and extract the information accurately.
On the two-dimensional coordinate identification apparatus, further including an error detecting portion that detects an error in the first code information by adding a given number of bits to the first code information or by shifting the given number of bits forward or backward by 1 bit. It is possible to determine whether there is an error in the coordinate values that have been detected.
On the two-dimensional coordinate identification apparatus, the first code information of the coordinate values is composed of an M-sequences code; and the two-dimensional coordinate identification apparatus further comprises an error-detecting portion that determines whether a partial sequences of the M-sequences code corresponds to another partial sequences and detects an error in the first code information. It is possible to detect the error in the coordinate values.
On the two-dimensional coordinate identification apparatus, further including an error correcting portion that corrects the error that has been detected when a correct bit string can be estimated with the error that has been detected. If the error is correctable, the error can be corrected into a correct one.
On the image-forming apparatus, the coordinate values are encoded by an M-sequences code. The code information of the coordinate values is encoded by the M-sequences code, enabling identifying the coordinate values even if any location on the printed material is read.
On the image-forming apparatus, the identification number encoding portion changes a size of the second code information according to a number of pages to be encoded. It is therefore possible to encode the first and second code information if the number of the pages of the printed material increases.
On the image-forming apparatus, the coordinate encoding portion changes a size of the first code information according to an area to be encoded. It is therefore possible to encode the first and second code information if the size of the printed material changes.
On the two-dimensional coordinate identification method, further including detecting an error in the first code information by adding a given number of bits to the first code information or by shifting the given number of bits forward or backward by 1 bit. It is possible to determine whether the detected coordinate values have an error.
On the two-dimensional coordinate identification method, the first code information is composed of an M-sequences code; and the two-dimensional coordinate identification method further comprises an error-detecting portion that determines whether a partial sequences of the M-sequences code corresponds to another partial sequences and detects an error in the first code information. It is possible to correct the error properly.
Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.
The entire disclosure of Japanese Patent Application No. 2005-054713 filed on Feb. 28, 2005 including specification, claims, drawings, and abstract is incorporated herein by reference in its entirety.
Number | Date | Country | Kind |
---|---|---|---|
2005-054713 | Feb 2005 | JP | national |
Number | Name | Date | Kind |
---|---|---|---|
5051736 | Bennett et al. | Sep 1991 | A |
5221833 | Hecht | Jun 1993 | A |
5449895 | Hecht et al. | Sep 1995 | A |
5477012 | Sekendur | Dec 1995 | A |
5502568 | Ogawa et al. | Mar 1996 | A |
5652412 | Lazzouni et al. | Jul 1997 | A |
5661506 | Lazzouni et al. | Aug 1997 | A |
5852434 | Sekendur | Dec 1998 | A |
5984193 | Uhling | Nov 1999 | A |
6115508 | Lopresti et al. | Sep 2000 | A |
6182901 | Hecht et al. | Feb 2001 | B1 |
6199765 | Uhling | Mar 2001 | B1 |
6279830 | Ishibashi | Aug 2001 | B1 |
6325505 | Walker | Dec 2001 | B1 |
6330976 | Dymetman et al. | Dec 2001 | B1 |
6427920 | Bloomberg et al. | Aug 2002 | B1 |
6439682 | Kakutani | Aug 2002 | B1 |
6594406 | Hecht | Jul 2003 | B1 |
6641053 | Breidenbach et al. | Nov 2003 | B1 |
6651894 | Nimura et al. | Nov 2003 | B2 |
6704431 | Ogawa et al. | Mar 2004 | B1 |
6752317 | Dymetman et al. | Jun 2004 | B2 |
6994254 | Huston et al. | Feb 2006 | B2 |
7128270 | Silverbrook et al. | Oct 2006 | B2 |
7387261 | Onishi | Jun 2008 | B2 |
7604180 | Sonoda et al. | Oct 2009 | B2 |
7604182 | Lapstun et al. | Oct 2009 | B2 |
7611067 | Sonoda | Nov 2009 | B2 |
20020020750 | Dymetman et al. | Feb 2002 | A1 |
20020070281 | Nimura et al. | Jun 2002 | A1 |
20020076080 | Hecht et al. | Jun 2002 | A1 |
20020101597 | Hoover | Aug 2002 | A1 |
20020193975 | Zimmerman | Dec 2002 | A1 |
20030056169 | Lapstun et al. | Mar 2003 | A1 |
20030095685 | Tewfik et al. | May 2003 | A1 |
20030133629 | Sayers | Jul 2003 | A1 |
20030190145 | Copperman et al. | Oct 2003 | A1 |
20040026636 | Shigeta | Feb 2004 | A1 |
20040031852 | Boitsov et al. | Feb 2004 | A1 |
20040041030 | Nimura et al. | Mar 2004 | A1 |
20040071312 | Ogawa et al. | Apr 2004 | A1 |
20040190092 | Silverbrook et al. | Sep 2004 | A1 |
20050025334 | Tewfik et al. | Feb 2005 | A1 |
20050052661 | Lapstun et al. | Mar 2005 | A1 |
20050073544 | Scofield et al. | Apr 2005 | A1 |
20050104861 | Pettersson et al. | May 2005 | A9 |
20050273597 | Lapstun et al. | Dec 2005 | A1 |
20060028674 | Lapstun et al. | Feb 2006 | A1 |
20060075241 | Deguillaume et al. | Apr 2006 | A1 |
20060193522 | Sonoda et al. | Aug 2006 | A1 |
20060203314 | Onishi | Sep 2006 | A1 |
20060268288 | Tanaka | Nov 2006 | A1 |
20060279751 | Onishi | Dec 2006 | A1 |
20060279785 | Onishi et al. | Dec 2006 | A1 |
20060291701 | Tanaka | Dec 2006 | A1 |
20070019245 | Katsurabayashi | Jan 2007 | A1 |
20070023523 | Onishi | Feb 2007 | A1 |
20070035758 | Hasuike | Feb 2007 | A1 |
20070035774 | Kubo | Feb 2007 | A1 |
20070045427 | Onishi | Mar 2007 | A1 |
20070084932 | Shinozaki | Apr 2007 | A1 |
20070090177 | Mitamura | Apr 2007 | A1 |
20070145141 | Ayatsuka | Jun 2007 | A1 |
20070158420 | Sonoda et al. | Jul 2007 | A1 |
20070171480 | Matsunoshita | Jul 2007 | A1 |
20070199990 | Sonoda | Aug 2007 | A1 |
20070242305 | Onishi | Oct 2007 | A1 |
20080066973 | Furuki | Mar 2008 | A1 |
20080095440 | Onishi et al. | Apr 2008 | A1 |
20080101699 | Onishi et al. | May 2008 | A1 |
20080101700 | Onishi et al. | May 2008 | A1 |
20080101702 | Sonoda et al. | May 2008 | A1 |
20080130053 | Okamoto | Jun 2008 | A1 |
20080181447 | Adams et al. | Jul 2008 | A1 |
20080192278 | Ouchi | Aug 2008 | A1 |
20080236903 | Lapstun et al. | Oct 2008 | A1 |
20080285070 | Takeuchi et al. | Nov 2008 | A1 |
20090001167 | Usuba | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
03-037707 | Feb 1991 | JP |
06-506080 | Jul 1994 | JP |
06-309084 | Nov 1994 | JP |
07-098751 | Apr 1995 | JP |
07-141104 | Jun 1995 | JP |
08-036452 | Feb 1996 | JP |
200-227833 | Aug 2000 | JP |
2002-304251 | Oct 2002 | JP |
2003-500720 | Jan 2003 | JP |
2003-511761 | Mar 2003 | JP |
2003-511762 | Mar 2003 | JP |
2003-513368 | Apr 2003 | JP |
2004-140825 | May 2004 | JP |
2005-507535 | Mar 2005 | JP |
9217859 | Oct 1992 | WO |
00-72110 | Nov 2000 | WO |
0126032 | Apr 2001 | WO |
0131519 | May 2001 | WO |
03038741 | May 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20060193522 A1 | Aug 2006 | US |