WO2006112021A1 - ドットパターンを用いた情報入出力方法 - Google Patents
ドットパターンを用いた情報入出力方法 Download PDFInfo
- Publication number
- WO2006112021A1 WO2006112021A1 PCT/JP2005/007312 JP2005007312W WO2006112021A1 WO 2006112021 A1 WO2006112021 A1 WO 2006112021A1 JP 2005007312 W JP2005007312 W JP 2005007312W WO 2006112021 A1 WO2006112021 A1 WO 2006112021A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- block
- information
- dot
- dot pattern
- blocks
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06037—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1408—Methods for optical code recognition the method being specifically adapted for the type of code
- G06K7/1417—2D bar codes
Definitions
- the present invention relates to an information input / output method using a dot pattern for inputting / outputting various information and programs by optically reading dot pattern information formed on a printed matter and the like, in particular, a dot pattern block reading method. It is about.
- an information output method for reading a barcode printed on a printed matter or the like and outputting information such as sound For example, a method has been proposed in which information matching the key information given to the brute force storage means is stored, the key reader read by the bar code reader is searched, and the information is output. In order to output a large amount of information and programs, a dot pattern in which fine dots are arranged according to a predetermined rule is generated, and the dot pattern printed on printed matter is captured as image data by a camera and digitalized. A technique for outputting audio information has also been proposed.
- a dot pattern defined for each block in a predetermined area is read using an optical reading means and converted into a predetermined code or coordinates, and characters, sounds, images, Video information etc. are output.
- the number of blocks in which the dot pattern is arranged needs to be determined in advance by a predetermined number (fixed length). If the amount of data to be processed is limited or the data is small, all the fixed-length blocks are not used, so the print area may be occupied by meaningless blocks. was there.
- the present invention has been devised to solve the problem.
- the purpose of the present invention is to provide dot patterns to be displayed on printed materials, in particular, blocks that contain dot patterns based on new rules, thereby providing flexibility in the length of registered data and security. Highly provides dot pattern technology.
- FIG. 1 is an explanatory diagram showing GRID 1, which is an example of the dot pattern of the present invention.
- Figure 2 is an enlarged view showing an example of the dot pattern information dot and the bit display of the data defined in it.
- 3 (a) and 3 (b) are explanatory diagrams showing information dots arranged around key dots.
- the information input / output method using the dot pattern of the present invention includes generation of a dot pattern 1, recognition of the dot pattern 1, and means for outputting information and a program from the dot pattern 1. That is, the dot pattern 1 is captured by the camera as image data, first the grid dots are extracted, then the key dot 2 is extracted based on the fact that no dots are originally placed at the grid dots, and then the information dots By extracting 3, the information area is extracted and the information area is extracted to obtain the numerical value of the information, and the information and program are output from this dot pattern 1 based on the numerical information. For example, this dot pattern 1 is used to output information such as voice and programs to an information output device, personal computer, PDA or mobile phone.
- the dot pattern 1 is generated by using a dot code generation algorithm to make fine dots, that is, key dots 2, information dots 3, and lattice dots 4, in accordance with a predetermined rule in order to recognize information such as speech. Arrange in line. As shown in Fig. 1, the block of dot pattern 1 representing information has 5 x 5 grid dots 4 centered on key dot 2 and surrounded by 4 grid dots 4. Place information dot 3 around the center virtual point. Arbitrary numerical information is defined in this block. In the illustrated example of FIG. 1, four blocks of dot pattern 1 (inside the thick line frame) are arranged in parallel. Of course, dot pattern 1 is not limited to 4 blocks.
- One corresponding information and program can be output to one block, or one corresponding information and program can be output to a plurality of blocks.
- grid dots 4 are arranged in dot pattern 1, image data obtained by capturing this dot pattern 1 with a camera corrects distortion caused by the camera, so a lens with a high distortion rate was attached. It can be accurately recognized when capturing image data of dot pattern 1 with a popular camera. Even if the camera is tilted and read with respect to the surface of the dot pattern 1, the dot pattern 1 can be accurately recognized.
- the key dot 2 is a dot in which one grid dot 4 located at a substantially central position of the grid dots 4 arranged in a rectangular shape is shifted in a certain direction.
- This key dot 2 is a representative point of the dot pattern 1 for one block representing the information dot 3.
- the grid dot 4 at the center of the dot pattern 1 block is shifted 0.2 mm upward.
- the coordinate point is the position where key dot 2 is shifted by 0.2 mm downward.
- this value is not limited to this, and can be changed according to the size of the block of dot pattern 1.
- the information dot 3 is a dot for recognizing various information.
- This information dot 3 is placed around the key dot 2 as a representative point, and the center surrounded by the four grid dots 4 is the virtual point. It is arranged.
- the power of expressing 3 bits by arranging in 8 directions is not limited to this, and it is also possible to express 4 bits by arranging in 16 directions. Of course.
- the dot diameter of key dot 2, information dot 3 or grid dot 4 should be about 0.1 mm in consideration of appearance, printing accuracy with respect to paper quality, camera resolution, and optimal digital color. Yes.
- the interval between the grid dots 4 is about vertical and horizontal lmm.
- the displacement of key dot 2 is preferably around 20% of the grid spacing.
- the distance between the information dot 3 and the virtual point surrounded by the four grid dots 4 is preferably about 15 to 30% of the distance between the adjacent virtual points. This is because if the distance between the information dot 3 and the virtual point is longer than this distance, the dots will be visually recognized as a large lump and will soon become unsightly as the dot pattern 1. On the contrary, the distance between the information dot 3 and the virtual point is nearer than this distance V, and it is difficult to determine whether the information dot 3 has the vector direction around the adjacent virtual point of deviation. It is to become.
- FIG. 4 is an example of information dots and bit display of data defined therein, and shows another embodiment.
- the virtual point force surrounded by the grid dot 4 is also used in two types of long and short, and when the vector direction is 8 directions, 4 bits can be expressed. At this time, it is desirable that the longer one is about 25-30% of the distance between adjacent virtual points, and the shorter one is about 15-20%. However, it is desirable that the center distance between the long and short information dots 3 is longer than the diameter of these dots.
- the information dot 3 surrounded by the four grid dots 4 is preferably one dot in consideration of appearance. However, if you want to ignore the appearance and increase the amount of information, you can have a large amount of information by allocating 1 bit for each vector and expressing information dot 3 with multiple dots. For example, in a vector with 8 concentric circles, 2 8 information can be expressed by 3 information dots 3 surrounded by 4 grid dots 4 and 2128 by 16 information dots in one block.
- Figure 5 is an example of information dot and the bit display of the data defined there.
- (A) shows 2 dots
- (b) shows 4 dots
- (c) shows 5 dots. It shows what was done.
- FIG. 6 shows a variation of the dot pattern, where (a) is a six information dot placement type, (b) is a nine information dot placement type, (c) is a 12 information dot placement type, (D) is a schematic diagram of a 36 information dot arrangement type.
- the dot pattern 1 shown in FIGS. 1 and 3 shows an example in which 16 (4 ⁇ 4) information dots 3 are arranged in one block.
- the number of information dots 3 is not limited to 16 arranged in one block, and various changes can be made.
- 6 information dots 3 (2 X 3) are arranged in one block (a)
- 9 information dots 3 in 3 blocks (3 X 3) Arranged (b)
- 36 information dots 3 arranged per block (6 X 6) ( d) is
- GRID2 is a dot placement algorithm using the difference method.
- lattice lines (yl to y7, xl to x5) are provided at predetermined intervals in the xy direction. To do. The intersection of the grid lines is called a grid point.
- the information block unit of 16 blocks is merely an example, and it is needless to say that an information block can be configured with an arbitrary number of blocks.
- corner dots (xlyl, xly5, x5yl, x5y5) (dots surrounded by a circle in the figure). These four corner dots are matched with the lattice points.
- the information block can be recognized by finding four corner dots that coincide with the grid points. However, if only this corner dot is used, the information block can be recognized, but the direction is not known. For example, if the direction of the information block cannot be recognized, even if the same information block is rotated by ⁇ 90 degrees or 180 degrees, it becomes completely different information.
- vector dots are arranged at lattice points in the rectangular area of the information block or in the adjacent rectangular area.
- a dot (x0y3) surrounded by a triangle is a key dot (vector dot) placed at the first grid point vertically above the midpoint of the grid line that forms the upper side of the information block.
- the key dot of the lower information block is arranged at the first grid point (x4y3) vertically above the midpoint of the grid line constituting the lower side in the information block.
- every other information dot is arranged at a position shifted from the lattice point in the x and y directions.
- the diameter of the information dot is preferably more than 0.03-0.05 mm, and the amount of deviation from the lattice point is preferably about 15 to 25% of the distance between the lattice points. This deviation is also Since this is an example, this range does not necessarily have to be within this range, but in general when the amount of deviation is larger than 25%, the dot pattern tends to appear as a pattern when visually observed.
- every other information dot is necessarily arranged on a grid line in the y direction (see Fig. 8). This means that when reading a dot pattern, it is only necessary to find grid lines arranged on a straight line in the y-direction or X-direction every other! ⁇ There is an IJ point.
- the grid lines may not be accurate straight lines. Because it is easy, it can be said that it is an algorithm that is strong against deformation of the paper surface and displacement and distortion of the reading optical system.
- FIG. 9 illustrates the meaning of the information dots.
- + indicates a grid point and ⁇ indicates a dot (information dot). 0 when the information dot is arranged in the y direction with respect to the grid point, 1 when the information dot is arranged in the + y direction, and 0 when the information dot is arranged in the X direction with respect to the grid point.
- the information dot 1 with a circled number (hereinafter referred to as information dot (1)) is displaced in the + x direction from the grid point (x2yl), meaning " ⁇ "
- the information dot (2) (the numerical value with a circle in the figure) is shifted in the + y direction from the grid point (x3yl), so it means “1”
- the information dot (3) ( The circled number in the figure is shifted in the X direction from the grid point (x4y 1). Therefore, "0”, information dot (4) (circled number in the figure) is "0”, information dot (5) is It means "0".
- information dots (1) to (: 17) have the following values.
- the above information bits are further calculated using an information acquisition algorithm based on the difference method described below, but this information dot is output as an information bit as it is. May be.
- the true value may be calculated by computing the value of the security table described later on this information bit.
- numbers surrounded by 0 are numbers surrounded by circles (circled numbers) in the figure, and numbers surrounded by [] are numbers surrounded by squares in the figure. Is meant.
- each 14-bit value in the information block is represented by a difference between adjacent information dots.
- the information dot (5) means "0” and the information dot (1) means "1"
- the first bit [1] means 0—1, that is, “ ⁇ .
- the third bit [3] (7 ) — Represented by (3)
- the 1st to 3rd bits are as follows.
- the value is an absolute value.
- the fourth bit [4] is obtained from the difference between the information dot (8) and the information dot (5) located immediately below the vector dot. Therefore, 4th bit [4] to 6th bit [6] take the difference from the value of the information dot at the position of 1 grid in + x direction and 1 grid in + y direction.
- the 13th bit [13] and the 14th bit [14] take the difference between the information dot (8) and the information dot at the position of 1 grid in the X direction, respectively. Asking.
- the security table storing such key parameters can be registered in the ROM in the optical reader.
- the true values T1 to T14 can be obtained as follows.
- the information bit is obtained from the information dot and the true value is obtained by referring to the security table.
- the first bit [1] to the third bit [3] are represented by the following differential equation.
- dots (4) and (11) are obtained by subtracting the information bit [13] and adding the information bit [14] based on the dot (8) calculated above.
- the dot arrangement on the grid line yn is determined based on the dot arrangement on the grid line y (n ⁇ 1), and the entire information is obtained by sequentially repeating the dot arrangement. Dot placement is determined.
- FIG. 12 is an explanatory diagram showing an example of a dot pattern according to the present invention.
- FIG. 13 is an enlarged view showing an example of the dot pattern information dot and the bit display of data defined in it.
- FIGS. 14A, 14B, and 14C are explanatory diagrams showing arrangement states of key dots and information dots.
- the information input / output method using the dot pattern according to the present invention includes recognition of the dot pattern 1 and means for outputting information and a program from the dot pattern 1.
- the dot pattern 1 is captured as image data by the camera, the reference grid point dot is first extracted, and then the key dot 2 (the four corners of the block is detected by the fact that no dot is originally placed at the position where the reference grid point dot is located. And then extract information dot 3 to extract the information area and extract the numerical value of the information. From the numerical information, the information and information from dot pattern 1 are extracted. Output the program.
- information such as voice or a program is output from the dot pattern 1 to an information output device, a personal computer, a PDA, a mobile phone, or the like.
- the dot pattern 1 of the present invention is generated by a dot code generation algorithm such as voice.
- fine dots that is, key dots 2, information dots 3, and grid dots 4 are arranged according to a predetermined rule.
- the block of dot pattern 1 representing information has 5 x 5 grid dots 4 centered on key dot 2 and around a virtual point at the center surrounded by 4 grid dots 4 Place information dot 3 at.
- Arbitrary numerical information is defined in this block.
- the illustrated example in FIG. 12 shows a state in which four blocks of dot pattern 1 (inside the bold line frame) are arranged in parallel. Of course, dot pattern 1 is not limited to four blocks.
- One corresponding information and program can be output to one block, or one corresponding information and program can be output to a plurality of blocks.
- the image data obtained by capturing the dot pattern 1 with the camera corrects the distortion caused by the camera, so a lens with a high distortion rate was attached. It can be accurately recognized when capturing image data of dot pattern 1 with a popular camera. Even if the camera is tilted and read with respect to the surface of the dot pattern 1, the dot pattern 1 can be accurately recognized.
- the key dot 2 is a dot in which one grid dot 4 at the approximate center position of the grid dots 4 arranged in a rectangular shape is shifted in a certain direction.
- This key dot 2 is a representative point of the dot pattern 1 for one block representing the information dot 3.
- the lattice dot 4 at the center of the dot pattern 1 block is shifted 0.2 mm upward.
- the coordinate point is the position where key dot 2 is shifted 0.2 mm downward.
- this value is not limited to this, and can be changed according to the size of the dot pattern 1 block.
- Information dot 3 is a dot for recognizing various information.
- This information dot 3 is arranged around the key dot 2 as a representative point, and the center surrounded by the four grid dots 4 is assumed temporarily. It is arranged at the end point represented by a vector with this point as the starting point.
- the power of expressing 3 bits by arranging in 8 directions is not limited to this, and it is also possible to express 4 bits by arranging in 16 directions. Of course.
- the diameter of the key dot 2, information dot 3 or grid dot 4 should be about 0.1 mm in consideration of appearance, printing accuracy with respect to paper quality, camera resolution, and optimal digital color. Yes.
- the interval between the grid dots 4 is preferably about vertical and horizontal lmm.
- the displacement of key dot 2 is preferably around 20% of the grid spacing.
- the distance between the information dot 3 and the virtual point surrounded by the four lattice dots 4 is preferably about 15 to 30% of the distance between the adjacent virtual points. This is because if the distance between the information dot 3 and the virtual point is longer than this distance, the dots will be visually recognized as a large lump and will soon become unsightly as the dot pattern 1. On the contrary, the distance between the information dot 3 and the virtual point is nearer than this distance V, and it is difficult to determine whether the information dot 3 has the vector direction around the adjacent virtual point of deviation. It is to become.
- the information dot 3 is clockwise around the key dot 2.
- Fig. 14 (b) illustrates this, and sub-blocks [I I I I], [I I I I], [I I I I], [I I I I]
- the vector direction (rotation direction) of information dot 3 is uniformly determined every 30 to 90 degrees.
- FIG. 15 is an example of information dots and bit display of data defined therein, and shows another embodiment.
- the virtual point force surrounded by the lattice dot 4 is also used in two types of long and short, and the vector direction is 8 directions, 4 bits can be expressed. At this time, it is desirable that the longer one is about 25-30% of the distance between adjacent virtual points, and the shorter one is about 15-20%. However, it is desirable that the center distance between the long and short information dots 3 is longer than the diameter of these dots.
- the information dot 3 surrounded by the four grid dots 4 is preferably one dot in consideration of appearance. However, if you want to ignore the appearance and increase the amount of information, you can have a large amount of information by allocating 1 bit for each vector and expressing information dot 3 with multiple dots. For example, the vector of concentric eight directions, an information dot 3 surrounded by four points lattice dots 4 can represent information of 2 8, and 16 pieces of information dots of one block 2 128.
- Fig. 16 is an example of information dot and bit display of data defined there.
- (A) is 2 dots
- (b) is 4 dots
- (c) to (e) are 5 dots
- (f) shows 7 dots.
- Dot pattern 1 shown in FIGS. 12 and 14 shows an example in which 16 (4 ⁇ 4) information dots 3 are arranged in one block.
- the information dots 3 are not limited to 16 pieces arranged in one block, and can be variously changed.
- six information dots 3 (2 X 3) are arranged in one block (a), and nine information dots 3 in one block.
- 36 information dots 3 arranged in 1 block (6 X 6) There is a thing (d).
- FIG. 17 specifically shows a dot pattern according to an embodiment of the present invention.
- (A) is a 4 ⁇ 4 lattice
- (b) is a 5 ⁇ 4 lattice
- (c) is a 6 ⁇ 4 lattice portion.
- the dot pattern is shown.
- FIG. 9A first, vertical and horizontal reference grid lines 5a to 5d constituting a quadrangle are provided, and virtual grid points 6 are arranged at predetermined intervals within the quadrangle.
- the reference grid point dots 7 are arranged on the virtual grid points 6 on the upper and lower horizontal reference grid lines 5a and 5b.
- an information dot 3 having a distance and a direction with respect to the virtual grid point 6 is set for each virtual grid point 6.
- One information dot 3 is arranged.
- FIG. 17 (a) described above is a case where information dots are arranged in units of 4 in the vertical direction and 4 in the horizontal direction (4 ⁇ 4 grids).
- (B) shows a 5 X 4 lattice, and
- (c) shows a 6 X 4 lattice.
- FIG. 18 shows the definition of information dots, in which values are defined in the direction of information dots around the virtual grid point 6.
- information dots are arranged in 8 directions by 45 degrees clockwise, with grid line 8 passing through virtual grid point 6 as a reference, so that there are a total of 8 types of information (binary 000 ⁇ : L 11, 3 bits). Can now be defined! /
- FIG. 19 shows that a total of 16 kinds of information (in binary), that is, 0000 to 1111 (4 bits) can be defined by further dividing the distance in the above-mentioned direction in two stages! /, The
- FIG. 20 shows a case where a plurality of information dots 3 are arranged on a concentric circle with the virtual lattice point 6 as the center.
- FIG. 21 shows two concentric circles, and 16 bits can be defined. In this way, it is possible to define an enormous amount of information for one virtual grid point 6.
- FIG. 22 is a diagram for explaining the reading order of information dots in the optical reading unit.
- the circled numbers in the figure are for convenience, and the dot patterns shown in FIGS. 17 (a) to (c) are actually obtained.
- FIGS. 23 to 39 illustrate the connection mode of blocks in which dot patterns are formed.
- connection information are schematically shown for convenience of explanation, but the connection information is actually formed as a dot pattern.
- the link information is composed of first link information (the number on the upper left of the block) and second link information (the number on the lower left of the block).
- the first link information indicates the order of reading of the blocks
- the second link information indicates the total number of all blocks to be read. Therefore, (a) in the figure means the case where the total number of blocks is one and the dot pattern to be read is completed by only one block.
- Figure (b) shows that the total number of blocks is 2 (2) (numbered 2 in the figure) and (1) (numbered 1 in the figure). I mean.
- (C) in the figure shows (1) ⁇ (2) ⁇ (3) and the dummy block is the first block read by the force optical reading means that shows one piece of information (block group) with dummy blocks. Starting from this dummy block, each block is read in a spiral form (3) ⁇ (2) ⁇ (1).
- a dummy block is a ⁇ block that stores meaningful information as a dot pattern
- a block group is formed by arranging one or more dummy blocks in the block group.
- the value of the first link information and the value of the second link information are interchanged. That is, the first connection information means the total number of blocks, and the second connection information means the order of the dummy blocks by the difference value from the first connection information. Therefore, if the 1st consolidated information is smaller than or equal to the 2nd consolidated information, it is a meaningful block in which normal information is stored, and the 1st consolidated information is more than the 2nd consolidated information. If the value is large, it is a dummy block.
- a block group storing a series of pieces of information can be made rectangular, and the reading efficiency of the optical reading means can be improved.
- the stored dot pattern information has a fixed length, but it is possible to handle variable-length information by associating multiple blocks using concatenated information. Become.
- the central processing unit of the means determines, based on the program, that the block is a dummy block.Next, since the value obtained by adding 1 to the value of the first connection information is the total number of blocks, this block group Therefore, a block order table for reading three blocks is generated in the memory of the optical reading means.
- FIG. 40 shows the change in the block order table provided in the optical reading means for the reading procedure described above.
- the reading start block by the optical reading means is the second block (2).
- the optical reading means reads the block (2) and generates a block order table in which four reading flags from block order powers ⁇ to 3 can be set since the second linked information power is '3'. And at the generation stage of this ranking table, set all reading flags to "0". Keep it as
- the optical reading means reads the block (3) at the position moved by +1 block in the X direction. Since this block (3) has the first linked information power 3 ", the reading flag of the block order" 3 "in the order table is set (updated to" 1 ").
- the optical reading means reads the block (0) at the position moved by one block in the y direction. Since the first link information of this block (0) is “0”, the reading flag of the block order “0” in the order table is set (updated to “1”).
- the optical reading means reads the block (1) at the position moved by one block in the X direction. Since this block (1) has the first linked information power “1”, the reading flag of the block ranking “ ⁇ ” in the ranking table is set (updated to “1”).
- Fig. 24 (a) is an example in which two dummy blocks are arranged, (b) is one, (d) is two, and (e) is one.
- Fig. 12 (b) shows a block configuration in which two of the 16 blocks are dummy blocks and the remaining 14 blocks are significant.
- FIG. 26 (a) shows a block configuration in which one of 16 blocks is a dummy block and the remaining 15 blocks are significant.
- Fig. 22 (b) shows a block configuration in which information is stored in all 16 blocks to make them significant.
- one block has a fixed length, but the data stored as the dot pattern can be made variable length by connecting the blocks based on the connection information in this way.
- a group of blocks can be formed into a rectangular shape or can be made into a free shape.
- FIGS. 27 to 28 are diagrams illustrating the block concatenated data scan method.
- the blocks are connected in the longitudinal direction in the form of strips in the horizontal direction, and such a block group is arranged in three stages. .
- Fig. 27 (b) shows a case where two blocks are connected in the width direction and connected in the longitudinal direction in a band shape, and the final block of the connection is a dummy block.
- Fig. 27 (c) shows three blocks connected in the width direction and connected in the longitudinal direction in the form of a strip, and the last two blocks in the connection are dummy blocks.
- the number of blocks in the width direction is obtained by the optical reading means as a difference force between the reading order of the left and right data blocks. That is, a block group having an arbitrary width can be read.
- Fig. 28 is a diagram for explaining a reading range when the band-like block connection group is read by the optical reading means.
- FIG. 28 (a) shows an example of reading a block group connected in a strip shape starting from block (4) while reading the connection information.
- the optical reader scans and sequentially reads the blocks connected in a band, reads the second connection information of the first block (4), and reads the block order table (here 6 blocks). After that, the reading flag is set based on the first connection information by sequentially reading the blocks in the band direction ( Then, the reading of the block group is completed with all the reading flags in the block order table set.
- the central processing unit (not shown) of the optical reading means follows the program.
- the status of the reading flag in the block order table may be monitored, and a scanning end signal by sound or LED display light may be output when all reading flags are set ("1").
- Fig. 28 (b) shows an example in which the belt-like block group is scanned in the belt-like direction two stages at a time
- Fig. 28 (c) shows an example in the case of scanning in the belt-like direction in three stages.
- FIGS. 29 to 39 show examples of block reading based on the so-called block concatenated data search method.
- connection information there are three pieces of connection information, which are first connection information, second connection information, and third connection information, respectively.
- first link information in the upper row defines how the blocks are connected in the vertical direction
- second link information in the middle row defines how the blocks are connected in the horizontal direction.
- the third connection information indicates a block connection number.
- the first connection information means that “0” is not connected, “ ⁇ is connected up,“ 2 ”is connected down, and“ 3 ”is connected up and down. .
- the information is completed in a single block, and the first to third linked information is all “0”.
- FIG. 30 to FIG. 39 are specific examples of reading a block having such three pieces of connection information.
- the optical reading means reads the block (2). Then, each link information of this block (2) is read. At this time, since the first connection information is “0”, the second connection information is “2”, and the third connection information is “1”, the block (2) is not connected in the vertical direction. It is connected in the direction and is the second rank in the block group (the third link information is " ⁇ but" 0 "is the initial value, so it becomes" 2 ").
- the reading means first reads the dot pattern of this block (2), and then reads the dot pattern of the left adjacent block (1) based on the second connection information.
- the first connection information Is "0”
- the second link information is "1”
- the third link information is "0” so that the block (1) is not linked up and down, but is linked in the right direction.
- No. 1 in the block group It can be seen that the eye rank (the third link information is “1” because the initial value is “0”). Therefore, the optical reading means has read all the blocks connected from the block (2) as the starting point, and thus completes the reading of the block group.
- the block (1) in the upward direction starting from the block (2) and the block (3) in the right direction are read.
- the optical reading means belongs to the block group.
- the dot pattern expanded in the memory as a result of reading all the blocks is rearranged based on the 3rd link information of each block, and numerical values or codes are displayed, and the corresponding image, video, sound, character, program Etc. are output.
- Figure 31 (a) shows an example of reading a total of 4 blocks with block (1) as the starting block, and Fig. 31 (b) shows a total of 5 blocks with block (3) as the starting block.
- Fig. 32 (a) shows an example of reading a total of 6 blocks with block (3) as the starting block, and Fig. 32 (b) shows a total of 7 blocks with block (4) as the starting block.
- Fig. 33 (a) shows an example of reading a total of 8 blocks with block (5) as the start block, and Fig. 33 (b) shows a total with block (5) as the start block. This is an example of reading 9 blocks.
- FIG. 34 (a) has 10 pieces
- FIG. 34 (b) has 11 pieces
- FIG. 35 has 12 pieces
- FIG. 36 has 13 pieces
- FIG. 37 has 14 pieces
- FIG. 38 has 15 pieces
- blocks can be arranged in any way as long as upper and lower or left and right connections are secured.
- Block groups can be placed even when there are restrictions on the shape of the area to be raised, increasing the degree of freedom of block group placement.
- Figures 41 to 43 are based on GRID1 (dot information definition algorithm described in Figures 1 to 6). This explains the dot pattern when the blocks are connected by the direct scan method using the dot pattern.
- This direct scan method is a method in which each block is sequentially read when the right force in the figure is continuous in the left direction.
- the explanatory diagram shown in FIG. 41 is specifically the dot pattern shown in FIG. In the actual dot pattern, grid lines in the vertical and horizontal directions in Fig. 43 are provided, and V, N, or U.
- the information dot of 3 1 I) means the block connection number, and (4 1 I 1) and (I) mean the block connection number. And (I) ⁇ (Information stored
- the block composed of 1 1 I) is the 0th block.
- FIG. 44 to FIG. 46 illustrate dot patterns when blocks are connected by the differential scan method using a dot pattern based on GRID1.
- the information is defined by the difference from the corresponding dot.
- the number of block connections in the block is (
- the block connection number “2” is defined by the difference.
- (I 10 ), (I and I 10 ), and the block connection number “0” is defined by the difference from (1 I 1 u).
- the blocks (I n ) to (I n) are 0 of the data composed of two blocks.
- the first block that is, the first block.
- Figs. 47 to 49 illustrate dot patterns when blocks are connected in a direct spiral manner using a dot pattern based on GRID1.
- FIG. 47 illustrates the arrangement of each dot
- FIG. 48 illustrates the meaning of the corresponding dot
- FIG. 49 illustrates a specific dot pattern.
- the third block), and the lower left block (and (I) is the third (ie, the fourth) block.
- Fig. 50 to Fig. 52 explain the dot pattern when the blocks are connected by the differential spiral method using the GRID1 dot pattern! /
- FIG. 50 illustrates the arrangement of each dot
- FIG. 51 illustrates the meaning of the corresponding dot
- FIG. 52 illustrates a specific dot pattern.
- each block is the same as the arrangement example shown in Fig. 47, such as upper left ⁇ upper right ⁇ lower right ⁇ lower left.
- FIG. 45 the true value of the dot is read by the difference (FIG. 5 FIG. 53 to FIG. 55 show that the blocks are connected by the direct search method with the dot pattern by GRID1. Explain the dot pattern when you are tied! /
- Fig. 53 illustrates the arrangement of each dot
- Fig. 54 illustrates the meaning of the corresponding dot
- Fig. 55 illustrates a specific dot pattern.
- connection block numbers are the same as the block connection numbers described in FIG.
- connection information is information indicating whether a block is connected vertically or horizontally.
- dot value of (I n) means left and right concatenation
- the value means up and down concatenation.
- (I u) is “00”, so it is not connected to the block in the left-right direction.
- the upper left (I u) to (I u) blocks are the lower blocks (the lower left blocks in the figure).
- 1 3 I block is the left block (lower left block in the figure)
- the upper left block is the 0th (first) block
- the lower left block is the first (second)
- the lower right block is the second (third) block It can be seen that it is.
- FIG. 56 to FIG. 58 explain the dot pattern when block concatenation is defined by the difference search method using the dot pattern based on GRID1.
- FIG. 56 illustrates the arrangement of each dot
- FIG. 57 illustrates the meaning of the corresponding dot
- FIG. 58 illustrates a specific dot pattern.
- the concatenated block number and concatenated information are defined by the difference method.
- the linked block numbers and the linked information values based on the difference values are as shown in FIG.
- FIGS. 59 to 61 illustrate dot patterns when block concatenation is defined by the difference search method in the dot pattern based on GRID2 (dot algorithm described in FIGS. 7 to 11).
- Fig. 59 illustrates the arrangement of each dot
- Fig. 60 illustrates the meaning of the corresponding dot
- Fig. 61 illustrates a specific dot pattern.
- FIGS. 59 (a) and Fig. 59 (b) are connected figures, but are divided for convenience of explanation. Since the direct scan method has been described with reference to FIGS.
- FIGS. 62 to 64 illustrate dot patterns in the case where block concatenation is defined by the differential scanning method in the dot pattern based on GRID2 (dot algorithm described in FIGS. 7 to 11).
- Fig. 62 (a) and (b) illustrate the arrangement of each dot
- Fig. 63 illustrates the meaning of the corresponding dot
- Fig. 64 illustrates a specific dot pattern. It is a thing.
- FIGS. 65 to 67 illustrate dot patterns when block concatenation is defined by the direct spiral method in the dot pattern based on GRID2 (dot algorithm described in FIGS. 7 to 11).
- FIG. 65 illustrates the arrangement of each dot
- FIG. 66 illustrates the meaning of the corresponding dot
- FIG. 67 illustrates a specific dot pattern.
- FIGS. 68 to 70 illustrate dot patterns when block concatenation is defined by the differential spiral method in the dot pattern based on GRID2 (dot algorithm described in FIGS. 7 to 11).
- FIG. 68 illustrates the arrangement of each dot
- FIG. 69 illustrates the meaning of the corresponding dot
- FIG. 70 illustrates a specific dot pattern.
- FIG. 71 to FIG. 73 illustrate dot patterns when block concatenation is defined by the direct search method using the dot pattern based on GRID2 (dot algorithm described in FIG. 7 to FIG. 11).
- FIG. 71 illustrates the arrangement of each dot
- FIG. 72 illustrates the meaning of the corresponding dot
- FIG. 73 illustrates a specific dot pattern.
- 74 to 76 illustrate dot patterns when block concatenation is defined by the difference search method in the dot pattern based on GRID2 (dot algorithm described in FIGS. 7 to 11).
- FIG. 74 illustrates the arrangement of each dot
- FIG. 75 illustrates the meaning of the corresponding dot
- FIG. 76 illustrates a specific dot pattern.
- FIGS. 77 to 79 illustrate dot patterns when block concatenation is defined by the direct scan method using the dot pattern based on GRID3 (dot algorithm described in FIGS. 12 to 16).
- Fig. 77 (a) and (b) explain the arrangement of each dot
- Fig. 78 shows the meaning of the corresponding dot
- Fig. 79 shows a specific dot pattern. It is a thing.
- Figs. 80 to 82 illustrate dot patterns when block concatenation is defined by the differential scan method in the dot pattern based on GRID3 (dot algorithm described in Figs. 12 to 16).
- FIG. 80 shows the arrangement of each dot
- Fig. 81 corresponds to this.
- FIG. 82 shows a specific dot pattern showing the meaning of each dot.
- FIGS. 83 to 85 illustrate dot patterns when block concatenation is defined by the direct spiral method in the dot pattern based on GRID3 (dot algorithm described in FIGS. 12 to 16).
- FIG. 83 illustrates the arrangement of each dot
- FIG. 84 illustrates the meaning of the corresponding dot
- FIG. 85 illustrates a specific dot pattern.
- Figs. 86 to 88 illustrate dot patterns when block concatenation is defined by the differential spiral method in the dot pattern based on GRID3 (dot algorithm described in Figs. 12 to 16).
- FIG. 86 illustrates the arrangement of each dot
- FIG. 87 illustrates the meaning of the corresponding dot
- FIG. 88 illustrates a specific dot pattern.
- Figs. 89 to 93 illustrate dot patterns when block concatenation is defined by the direct search method with the dot pattern based on GRID3 (dot algorithm described in Figs. 12 to 16).
- FIG. 89 illustrates the arrangement of each dot
- FIG. 92 illustrates the meaning of the corresponding dot
- FIG. 93 illustrates a specific dot pattern.
- FIG. 90 shows the meanings of dot positions and block connection directions.
- Fig. 91 illustrates the arrangement of blocks.
- FIGS. 94 to 98 illustrate dot patterns when block concatenation is defined by the difference search method in the dot pattern based on GRID3 (the dot algorithm described in FIGS. 12 to 16).
- Fig. 94 illustrates the arrangement of each dot
- Fig. 97 illustrates the meaning of the corresponding dot
- Fig. 98 illustrates a specific dot pattern.
- Fig. 95 shows the meanings of dot positions and block connecting directions.
- Fig. 96 illustrates the arrangement of the blocks.
- FIG. 99 to FIG. 101 illustrate dot patterns when block concatenation is defined by the direct scan method using the dot pattern based on GRID4 (dot algorithm described in FIG. 17 to FIG. 22).
- FIG. 99 illustrates the arrangement of each dot
- FIG. 100 illustrates the meaning of the corresponding dot
- FIG. 101 illustrates a specific dot pattern.
- Fig. 102 to Fig. 104 illustrate dot patterns when block concatenation is defined by a differential scan method with a dot pattern based on GRID4 (dot algorithm described in Fig. 17 to Fig. 22). .
- FIG. 102 illustrates the arrangement of each dot
- FIG. 103 illustrates the meaning of the corresponding dot
- FIG. 104 illustrates a specific dot pattern.
- Figs. 105 to 107 illustrate dot patterns when block concatenation is defined by the direct-snoral method with a dot pattern based on GRID4 (dot algorithm described in Figs. 17 to 22). ing.
- FIG. 105 illustrates the arrangement of each dot
- FIG. 106 illustrates the meaning of the corresponding dot
- FIG. 107 illustrates a specific dot pattern.
- FIGS. 108 to 110 illustrate dot patterns when block concatenation is defined by a differential spiral method with a dot pattern based on GRID4 (dot algorithm described in FIGS. 17 to 22). .
- FIG. 108 illustrates the arrangement of each dot
- FIG. 109 illustrates the meaning of the corresponding dot
- FIG. 110 illustrates a specific dot pattern.
- FIGS. 111 to 113 illustrate dot patterns when block concatenation is defined by a direct search method using a dot pattern based on GRID4 (the dot algorithm described in FIGS. 17 to 22).
- FIG. 111 illustrates the arrangement of each dot
- FIG. 112 illustrates the meaning of the corresponding dot
- FIG. 113 illustrates a specific dot pattern.
- FIGS. 114 to 116 illustrate dot patterns when block concatenation is defined by a difference search method using a dot pattern based on GRID4 (the dot algorithm described in FIGS. 17 to 22). .
- FIG. 114 illustrates the arrangement of each dot
- FIG. 115 illustrates the meaning of the corresponding dot
- FIG. 116 illustrates a specific dot pattern.
- FIG. 1 is a diagram showing a dot pattern of GRID1, which is an embodiment of the present invention.
- FIG. 2 is a diagram (1) showing a definition of GRID1 information.
- FIG. 3 is a diagram (1) showing a reading order of blocks of GRID1.
- FIG. 4 is a diagram (2) showing a definition of GRID1 information.
- FIG. 5 is a diagram (3) showing a definition of GRID1 information.
- FIG. 6 is a diagram (2) showing the reading order of blocks of GRID1.
- FIG. 7 is a diagram showing a dot pattern of GRID2.
- FIG. 8 is a diagram (1) for defining GRID2 dot pattern information.
- FIG. 9 is a diagram (2) for defining GRID2 dot pattern information.
- FIG. 10 is a diagram (3) for defining GRID2 dot pattern information.
- FIG. 11 is a diagram showing the contents of a security table for GRID2.
- FIG. 12 is a diagram (1) for explaining GRID3.
- FIG. 13 is a diagram (2) for explaining GRID3.
- FIG. 14 is a diagram (3) for explaining GRID3.
- FIG. 15 is a diagram (4) for explaining GRID3.
- FIG. 16 is a diagram (5) for explaining GRID3.
- FIG. 17 is a diagram (1) for explaining GRID4.
- FIG. 18 is a diagram (2) for explaining GRID4.
- FIG. 19 is a diagram (3) for explaining GRID4.
- FIG. 20 is a diagram (4) for explaining GRID4.
- FIG. 21 is a diagram (5) for explaining GRID4.
- FIG. 22 is a diagram (6) for explaining GRID4.
- FIG. 23 is a diagram (1) for explaining how blocks are connected
- FIG. 24 is a diagram (2) for explaining a block connection mode
- FIG. 25 is a diagram (3) for explaining how blocks are connected
- FIG. 26 is a diagram (4) for explaining how blocks are connected
- FIG. 27 is a diagram (5) for explaining how blocks are connected
- FIG. 28 is a diagram (6) for explaining how blocks are connected; ⁇ Circle around (29) ⁇
- FIG. 29 is a diagram (7) for explaining how blocks are connected.
- FIG. 30 is a diagram (8) for explaining how blocks are connected
- FIG. 32 is a diagram (10) for explaining how blocks are connected
- FIG. 34 is a diagram (12) for explaining how blocks are connected
- FIG. 35 is a diagram (13) for explaining how blocks are connected
- FIG. 36 is a diagram (14) for illustrating how blocks are connected
- FIG. 37 is a diagram (15) for explaining how blocks are connected
- FIG. 38 is a diagram (16) for illustrating how blocks are connected
- FIG. 39 is a diagram (17) for illustrating how blocks are connected
- FIG. 40 shows the contents of a block order table.
- FIG. 41 is a diagram (1) for explaining block concatenation by the direct scan method of GRID1.
- FIG. 42 is a diagram (2) for explaining block concatenation by the direct scan method of GRID1.
- FIG. 43 is a diagram (3) for explaining block concatenation by the direct scan method of GRID1.
- FIG. 44 is a diagram (1) for explaining block concatenation by the differential scan method of GRID1
- FIG. 45 is a diagram (2) for explaining block concatenation by the differential scan method of GRID1
- FIG. 46 is a diagram (3) for explaining block concatenation by the differential scan method of GRID1
- FIG. 47 is a diagram (1) for explaining block connection by the direct spiral method of GRID1.
- FIG. 48 is a diagram (2) for explaining block connection by the direct spiral method of GRID1.
- FIG. 49 is a diagram (3) for explaining block connection by the direct spiral method of GRID1.
- FIG. 50 is a diagram (1) for explaining block connection by the differential spiral method of GRID1.
- FIG. 51 is a diagram (2) for explaining block connection by the differential spiral method of GRID1.
- FIG. 52 is a diagram (3) for explaining block connection by the differential spiral method of GRID1.
- FIG. 53 is a diagram (1) for explaining block concatenation by the GRID1 direct search method.
- FIG. 54 is a diagram (2) for explaining block concatenation by the direct search method of GRID1.
- FIG. 55 is a diagram (3) for explaining block concatenation by the direct search method of GRID1.
- FIG. 56 is a diagram (1) for explaining block concatenation by the difference search method of GRID1.
- FIG. 57 is a diagram (2) for explaining block concatenation by the difference search method of GRID1.
- FIG. 58 is a diagram (3) for explaining block concatenation by the GRID1 differential search method.
- FIG. 59 is a diagram (1) for explaining block concatenation by the GRID2 direct scan method.
- FIG. 60 is a diagram (2) for explaining block connection by the GRID2 direct scan method.
- FIG. 61 is a diagram (3) for explaining block concatenation by the direct scan method of GRID2.
- FIG. 62 is a diagram (1) for explaining block concatenation by the GRID2 differential scan method.
- FIG. 63 is a diagram (3) for explaining block concatenation by the GRID2 differential scan method. It is a figure (4) for demonstrating the block connection by the differential scanning system of GRID2
- FIG. 65 is a diagram (1) for explaining block connection by the direct spiral method of GRID2.
- FIG. 66 is a diagram (2) for explaining block connection by the direct spiral method of GRID2.
- FIG. 67 is a diagram (3) for explaining block connection by the direct spiral method of GRID2.
- FIG. 68 is a diagram (1) for explaining block connection by the differential spiral method of GRID2.
- FIG. 69 is a diagram (2) for explaining block connection by the differential spiral method of GRID2.
- FIG. 70 is a diagram (3) for explaining block connection by the differential spiral method of GRID2.
- FIG. 71 is a diagram (1) for explaining block concatenation by the GRID2 direct search method.
- FIG. 72 is a diagram (2) for explaining block concatenation by the GRID2 direct search method.
- FIG. 73 is a diagram (3) for explaining block concatenation by the GRID2 direct search method.
- FIG. 74 is a diagram (1) for explaining block concatenation by the GRID2 differential search method.
- FIG. 75 is a diagram (2) for explaining block concatenation by the difference search method of GRID2.
- FIG. 76 is a diagram (3) for explaining block concatenation by the GRID2 differential search method.
- FIG. 77 is a diagram (1) for explaining block concatenation by the direct scan method of GRID3.
- FIG. 78 is a diagram (2) for explaining block concatenation by the direct scan method of GRID3.
- FIG. 79 is a diagram (3) for explaining block concatenation by the direct scan method of GRID3.
- FIG. 80 is a diagram (1) for explaining block concatenation by a differential scan method of GRID3
- FIG. 81 is a diagram (2) for explaining block concatenation by the differential scan method of GRID3
- FIG. 82 is a diagram (3) for explaining block concatenation by the differential scan method of GRID 3
- FIG. 83 is a diagram (1) for explaining block connection by the direct spiral method of GRID3.
- FIG. 84 is a diagram (2) for explaining block connection by the direct spiral method of GRID3.
- FIG. 85 is a diagram (3) for explaining block connection by the direct spiral method of GRID3.
- FIG. 86 is a diagram (1) for explaining block connection by the differential spiral method of GRID3.
- FIG. 87 is a diagram (2) for explaining block connection by the differential spiral method of GRID3.
- FIG. 88 is a diagram (3) for explaining block connection by the differential spiral method of GRID3.
- FIG. 89 is a diagram (1) for explaining block concatenation by the GRID3 direct search method.
- FIG. 90 is a diagram (2) for explaining block concatenation by the GRID3 direct search method.
- FIG. 91 is a diagram (3) for explaining block concatenation by the GRID3 direct search method.
- FIG. 92 is a diagram (4) for explaining block concatenation by the GRID3 direct search method.
- FIG. 93 is a diagram (5) for explaining block concatenation by the GRID3 direct search method.
- FIG. 94 is a diagram (1) for explaining block concatenation by the difference search method of GRID3.
- FIG. 95 is a diagram (2) for explaining block concatenation by the GRID3 differential search method.
- FIG. 96 is a diagram (3) for explaining block concatenation by the GRID3 differential search method.
- FIG. 97 is a diagram (4) for explaining block concatenation by the GRID3 differential search method.
- FIG. 98 is a diagram (5) for explaining block concatenation by the difference search method of GRID3.
- FIG. 99 is a diagram (1) for explaining block concatenation by the GRID4 direct scan method.
- FIG. 100 is a diagram (2) for explaining block concatenation by the direct scan method of GRID4.
- FIG. 101 is a diagram (3) for explaining block concatenation by the direct scan method of GRID4.
- FIG. 102 is a diagram (1) for explaining block concatenation by the differential scan method of GRID4.
- FIG. 103 is a diagram (2) for explaining block concatenation by the differential scan method of GRID4.
- FIG. 104 is a diagram (3) for explaining block concatenation by the differential scan method of GRID4.
- FIG. 105 is a diagram (1) for explaining block connection by the direct spiral method of GRID4.
- FIG. 106 is a diagram (2) for explaining block connection by the direct spiral method of GRID4.
- FIG. 107 is a diagram (3) for explaining block connection by the direct spiral method of GRID4.
- FIG. 108 is a diagram (1) for explaining block connection by the differential spiral method of GRID4.
- FIG. 109 is a diagram (2) for explaining block connection by the differential spiral method of GRID4.
- FIG. 110 is a diagram (3) for explaining block connection by the differential spiral method of GRID4. is there.
- FIG. 111 is a diagram (1) for explaining block concatenation by the GRID4 direct search method.
- FIG. 112 is a diagram (2) for explaining block concatenation by the GRID4 direct search method.
- FIG.113 This is figure (3) for explaining block concatenation using the direct search method of GRID4.
- FIG. 114 is a diagram (1) for explaining block concatenation by the GRID4 differential search method.
- FIG. 115 is a diagram (2) for explaining block concatenation by the GRID4 differential search method. It is figure (3) for explaining the block connection by the difference search method of GRID4 Industrial applicability
- the present invention can be used for a dot pattern capable of recording variable length information.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Editing Of Facsimile Originals (AREA)
- Image Processing (AREA)
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/911,587 US8189923B2 (en) | 2005-04-15 | 2005-04-15 | Information input output method using a dot pattern |
JP2006521327A JPWO2006112021A1 (ja) | 2005-04-15 | 2005-04-15 | ドットパターンを用いた情報入出力方法 |
CNA2005800494744A CN101167090A (zh) | 2005-04-15 | 2005-04-15 | 使用了点图形的信息输入输出方法 |
PCT/JP2005/007312 WO2006112021A1 (ja) | 2005-04-15 | 2005-04-15 | ドットパターンを用いた情報入出力方法 |
EP05730620A EP1876555A1 (en) | 2005-04-15 | 2005-04-15 | Information i/o method using dot pattern |
US13/481,459 US8699798B2 (en) | 2005-04-15 | 2012-05-25 | Information input output method using a dot pattern |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2005/007312 WO2006112021A1 (ja) | 2005-04-15 | 2005-04-15 | ドットパターンを用いた情報入出力方法 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/911,587 A-371-Of-International US8189923B2 (en) | 2005-04-15 | 2005-04-15 | Information input output method using a dot pattern |
US13/481,459 Continuation US8699798B2 (en) | 2005-04-15 | 2012-05-25 | Information input output method using a dot pattern |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006112021A1 true WO2006112021A1 (ja) | 2006-10-26 |
Family
ID=37114774
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/007312 WO2006112021A1 (ja) | 2005-04-15 | 2005-04-15 | ドットパターンを用いた情報入出力方法 |
Country Status (5)
Country | Link |
---|---|
US (2) | US8189923B2 (ja) |
EP (1) | EP1876555A1 (ja) |
JP (1) | JPWO2006112021A1 (ja) |
CN (1) | CN101167090A (ja) |
WO (1) | WO2006112021A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110011940A1 (en) * | 2007-10-30 | 2011-01-20 | Kenji Yoshida | Code pattern |
KR101070051B1 (ko) | 2009-10-26 | 2011-10-04 | 이종춘 | 도트 패턴에서 불변 영역을 인식하는 방법 |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ATE434803T1 (de) | 2002-09-26 | 2009-07-15 | Kenji Yoshida | Informationswiedergabe-i/o-verfahren mit punktmuster und informationswiedergabeeinrichtung |
AU2004326049B2 (en) * | 2004-12-28 | 2011-08-18 | Kenji Yoshida | Information input/output method using dot pattern |
AU2005331401B2 (en) | 2005-04-28 | 2012-07-12 | Kenji Yoshida | Information input/output method using dot pattern |
JP3771252B1 (ja) | 2005-07-01 | 2006-04-26 | 健治 吉田 | ドットパターン |
DE102008017168A1 (de) * | 2008-04-02 | 2009-10-08 | Crossmedia Solution Gmbh & Co. Kg | Verfahren zum Speichern und Auslesen von Daten |
CN101600006A (zh) * | 2008-06-02 | 2009-12-09 | 郑阿奇 | 一种用手机点读印刷品的方法 |
JP5287485B2 (ja) * | 2009-05-11 | 2013-09-11 | 富士ゼロックス株式会社 | 情報表現画像、印刷物、画像処理装置及び画像処理プログラム |
JP5489118B2 (ja) * | 2010-01-28 | 2014-05-14 | 健治 吉田 | 入出力装置、情報入出力システム |
WO2014028245A2 (en) * | 2012-08-17 | 2014-02-20 | Evernote Corporation | Using surfaces with printed patterns for image and data processing |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08106517A (ja) * | 1994-10-05 | 1996-04-23 | Olympus Optical Co Ltd | 情報記録媒体及び情報再生装置 |
JPH11219405A (ja) * | 1998-02-02 | 1999-08-10 | Olympus Optical Co Ltd | 情報再生システム |
JP2000076372A (ja) * | 1998-08-31 | 2000-03-14 | Brother Ind Ltd | 二次元コードデータ変換用記録媒体,二次元コードデータ変換装置およびプリンタ |
JP2000099161A (ja) * | 1998-09-24 | 2000-04-07 | Taiyo Ltd | レギュレータの調圧機構 |
JP2002197410A (ja) * | 2001-12-11 | 2002-07-12 | Olympus Optical Co Ltd | 情報再生システム |
JP2005031932A (ja) * | 2003-07-11 | 2005-02-03 | Dainippon Printing Co Ltd | 関連帳票判定システム、電子ペン及びプログラム |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5142614A (en) * | 1990-08-06 | 1992-08-25 | Elite High Technology, Inc. | Expander cartridge for printer font cartridge |
JP2000099616A (ja) | 1998-09-28 | 2000-04-07 | Olympus Optical Co Ltd | コードイメージデータ生成装置 |
SE517445C2 (sv) * | 1999-10-01 | 2002-06-04 | Anoto Ab | Positionsbestämning på en yta försedd med ett positionskodningsmönster |
JP2005319932A (ja) | 2004-05-11 | 2005-11-17 | Mitsubishi Electric Corp | 車両用パワーステアリングシステム |
-
2005
- 2005-04-15 WO PCT/JP2005/007312 patent/WO2006112021A1/ja not_active Application Discontinuation
- 2005-04-15 JP JP2006521327A patent/JPWO2006112021A1/ja not_active Withdrawn
- 2005-04-15 US US11/911,587 patent/US8189923B2/en not_active Expired - Fee Related
- 2005-04-15 CN CNA2005800494744A patent/CN101167090A/zh active Pending
- 2005-04-15 EP EP05730620A patent/EP1876555A1/en not_active Withdrawn
-
2012
- 2012-05-25 US US13/481,459 patent/US8699798B2/en not_active Expired - Fee Related
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08106517A (ja) * | 1994-10-05 | 1996-04-23 | Olympus Optical Co Ltd | 情報記録媒体及び情報再生装置 |
JPH11219405A (ja) * | 1998-02-02 | 1999-08-10 | Olympus Optical Co Ltd | 情報再生システム |
JP2000076372A (ja) * | 1998-08-31 | 2000-03-14 | Brother Ind Ltd | 二次元コードデータ変換用記録媒体,二次元コードデータ変換装置およびプリンタ |
JP2000099161A (ja) * | 1998-09-24 | 2000-04-07 | Taiyo Ltd | レギュレータの調圧機構 |
JP2002197410A (ja) * | 2001-12-11 | 2002-07-12 | Olympus Optical Co Ltd | 情報再生システム |
JP2005031932A (ja) * | 2003-07-11 | 2005-02-03 | Dainippon Printing Co Ltd | 関連帳票判定システム、電子ペン及びプログラム |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110011940A1 (en) * | 2007-10-30 | 2011-01-20 | Kenji Yoshida | Code pattern |
KR101070051B1 (ko) | 2009-10-26 | 2011-10-04 | 이종춘 | 도트 패턴에서 불변 영역을 인식하는 방법 |
Also Published As
Publication number | Publication date |
---|---|
US20120325910A1 (en) | 2012-12-27 |
US8699798B2 (en) | 2014-04-15 |
JPWO2006112021A1 (ja) | 2008-11-27 |
CN101167090A (zh) | 2008-04-23 |
EP1876555A1 (en) | 2008-01-09 |
US8189923B2 (en) | 2012-05-29 |
US20090060341A1 (en) | 2009-03-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2006112021A1 (ja) | ドットパターンを用いた情報入出力方法 | |
JP3706385B2 (ja) | ドットパターンを用いた情報入出力方法 | |
JP3771252B1 (ja) | ドットパターン | |
CA2606135C (en) | Information input/output method using dot pattern | |
JP5581541B2 (ja) | ドットパターン | |
WO2005064523A1 (ja) | ドットパターンを用いた情報入出力方法 | |
US20080043258A1 (en) | Information Input Output Method Using Dot Pattern | |
JP4308311B2 (ja) | コードパターン | |
JP4336837B2 (ja) | ドットパターン | |
TWI439943B (zh) | 點圖像編碼結構、其解碼方法與電子裝置 | |
JP4397866B2 (ja) | 2次元パターン読み取り装置、2次元パターン読み取り方法 | |
JP3858051B6 (ja) | ドットパターンを用いた情報入出力方法 | |
KR20070112474A (ko) | 도트 패턴을 이용한 정보 입출력 방법 | |
AU2012241078A1 (en) | Printed Material Printed with a Dot Pattern | |
JP3858052B6 (ja) | ドットパターンを用いた情報入出力方法 | |
AU2016200846A1 (en) | Printed Material Printed with a Dot Pattern |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 2006521327 Country of ref document: JP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1020077023330 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580049474.4 Country of ref document: CN Ref document number: 11911587 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005730620 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: RU |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: RU |
|
WWP | Wipo information: published in national office |
Ref document number: 2005730620 Country of ref document: EP |