JP2010117870A - Included type code symbol and its reading method, closed area inclusion type code symbol and its reading method, article added with included type code symbol, and article added with closed area inclusion type code symbol - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a code symbol (detection symbol) to be used for detection of articles, etc., capable of being easily produced, and especially, capable of easily marking even by a general user, for example, by handwriting, etc. <P>SOLUTION: An included type code symbol is provided with a symbol area displaying layer at its outermost periphery. A plurality of symbol area displaying layers may exist, and two layers may exist except for the outermost periphery. In inside of the symbol area displaying layer, data-cell groups are disposed. That is, the symbol area displaying layer includes a data-cell. Data of the included type code symbols is represented from an included relationship of the data-cell and a color of the data-cell. These included type code symbol can be easily produced using existing marks etc. by the user, and an automatic recognition code symbol can be easily added to various articles. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  An automatic recognition code that returns data in the order of colors is known. The present invention relates to the relationship between the color order and data of each symbol of the automatic recognition code.

  The inventor of the present application has conducted various research and development on a code system (so-called “color arrangement code”) that expresses data by arrangement, combination, arrangement, and order of colors without depending on dimensions and shapes. For example, the inventor of the present application has applied for a 1D color bit code (Japanese Patent Application No. 2006-196705, etc.) which is one of such codes. In addition, Japanese Patent Application No. 2006-196548 has been filed.

  The present invention relates to an optical automatic recognition code using such a color arrangement, technical improvement of the color “array” of the automatic recognition code, new application of the automatic recognition code using the improved color arrangement, and the like. About.

  The inventor of the present application has developed various automatic recognition codes based on the color arrangement described above. They are those who call the product names “1D color bit code”, “1.5D color bit code”, etc., and several applications have already been filed for these.

  Both of these features are not based on shape recognition, and therefore greatly improve the freedom of the symbol mark and expand the freedom of the marking means, the marking object, and the reading means. Is.

  Therefore, the application of this technique covers the entire application range of the automatic recognition technique for the purpose of so-called traceability including the conventional bar code.

  The inventors of the present application have eagerly pursued the characteristics of an automatic recognition code using a color arrangement represented by these “color bit codes”. As a result, we have found that the automatic recognition code based on this color array can be further applied to individual detection, particularly detection / tracking of a moving individual whose shape changes every moment.

  This patent proposes a new configuration of an optical automatic recognition code and its application (used for tracking) in view of the feature of the automatic recognition code based on such a color arrangement.

(* "1D color bit code" and "color bit code" are product names and unique names of the applicant's automatic recognition code.)
Hereinafter, each code symbol of the optical automatic recognition code suitable for tracking the object proposed in this case is referred to as a “detection symbol”. In this case, when it is simply called a code, it represents the “system” of the code including the reading rule. A group of individual specific color arrangements used in each code is called a “code symbol” or simply “symbol”.

Comparison of Conventional Tracking Code Symbols (Traceability Symbols) and Detection Symbols Proposed in the Present Invention Here, the required specifications of conventional traceability symbols and detection symbols are compared. Here, for example, a symbol specific to a child's clothes (that is, a symbol for detection) is attached to a detection symbol at an athletic meet and the mark (detection symbol) is found while being photographed with a video camera or the like. Further, an example of an application for tracking the mark (detection symbol) is considered. In the following description, the conventional traceability symbol is simply referred to as “traceability”, and the detection symbol of the present invention is referred to as “detection”.

(1) Positional relationship with the object ・ Traceability: The positional relationship between the symbol and the object is given. And a visual field is matched with this and the position of a target object is tracked from the positional relationship mentioned above within the visual field.

  -Detection: The positional relationship between the symbol and the object is not particularly determined, and may be in the vicinity of an appropriate distance. A symbol may be attached to the hat, or it may be attached to the clothes.

(2) Symbol data (data represented by a symbol) Traceability: Since a symbol needs to represent different data depending on an object, it needs to be able to express a huge symbol pattern. Also, the tracking side needs to be able to recognize all of these enormous symbol patterns. • Detection: It is only necessary to recognize the target symbol, and it is not necessary to represent enormous symbol data. Similarly, it is not necessary to identify a large amount of symbol data.

(3) Symbol shape-Traceability: The minimum conditions for reading, such as the presence of a quiet zone and deformation of the shape, must be cleared in advance in terms of use conditions.

  Here, the quiet zone refers to a region to which a color that does not constitute a code symbol is added in an automatic recognition code using a color arrangement.

  ・ Detection: A code system that does not assume the existence of a quiet zone due to movement or other effects is used. In addition, the code system is premised on distortion and partial visibility.

(4) Marking ・ Traceability: Marked with a dedicated tag or marking device.

  -Detection: A general user can easily mark.

(5) Misreading ・ Traceability: Misreading is not allowed. It is impossible to keep track of misreads.

  ・ Detection: Tracking can continue even if there is some misreading. Rather, it is more important to “find” the code symbol.

  There are differences in operation, configuration, and effect as described above.

  The “color bit code” previously developed by the inventor of the present application naturally satisfies the above-described requirement for “traceability”.

  However, compared with the above “detected symbol” proposed in this patent, it is not easy to use and particularly suitable for use as an automatic recognition code for tracking. There was a face.

  In addition, let's consider other classic black-and-white barcodes. As is well known, this black and white barcode has no flexibility in shape, and it must be said that it cannot be used as a “detected symbol”. That is, it is difficult to use as an automatic recognition code for tracking.

  In addition, as a tracking / tracking technique, a technique such as so-called face recognition has been widely developed in recent years, and a simple algorithm may be installed in a digital camera or the like. However, with this face recognition technology, there are many cases where the feature detection specification is too elaborate and the face cannot be recognized and cannot be tracked, such as in a distant place. Further, when tracking a predetermined object, it is considered that it is necessary to attach an automatic recognition code individually, that is, marking, if the shape is very similar.

  In addition, a technique for tracking and tracking simply by color is also known. However, it is well known that mere color detection is not practical in cases where there are many similar colors.

Automatic recognition code by terms of description color disposition is a type of so-called optical recognition code. Some terms related to the optical recognition code will be explained.

Code symbol:
A specific optical recognition code, which represents predetermined data, and a group of figures / graphic figures are particularly called “code symbols”. Or, it may be simply called “symbol”. Further, since it is one unit of the automatic recognition code, it may be called a “unit code mark”.

Furthermore, for convenience, the “code symbol” itself is sometimes called a “tag”. However, a tag basically refers to a medium attached to an article (an article to be marked). For example, price tags, product tags, and the like.
In the present invention, a color array is used as an automatic recognition code, and each of these color arrays corresponds to a “code symbol” as an automatic recognition code.

Optical recognition code (optical automatic recognition code):
In general, the term “optical recognition code” is often used as a word meaning such a code “system”, not an individual specific code symbol. For example, it is expressed as “an optical recognition code named QR code (registered trademark)”, and is generally a word indicating “code system”.
In addition, since the optical recognition code is generally automatically recognized by a machine, it is often called an optical automatic recognition code.

Object to be stamped:
An article / object to which a code symbol of an optical recognition code is given is called a “marked object”. In this embodiment to be described later, “articles” are mainly used.

marking:
The operation of assigning each code symbol of the optical recognition code to the object to be marked is called “marking”. In addition to the process of “printing” the code symbol directly on the object to be marked, the operation of applying an “adhesive seal” with the code symbol and the operation of “hanging” the tag with the code symbol are “marking”. It corresponds to a preferable example of “. In particular, when the article to be marked is a product / product to be sold, a tag with a code symbol corresponds to a “price tag”, a “product brand tag”, or the like. A code symbol is attached to such a “price tag” and attached to a “product”. In recent years, plastic wires are often used for this attachment. Such “attachment” is also a suitable example of the above “marking”.

  Also, the act of attaching a code symbol to the container of the object to be marked is often called marking in consideration of a substantial aspect.

Marking color:
One or more colors used for the code symbol are called “marking colors”. The marking color is also called “signal color”. As the marking color, about three colors are typically appropriate considering the identification accuracy and the like. For example, three colors of RGB and three colors of CMY are suitable.

  At the time of reading, reading is performed by regarding a certain color space as a marking color. The color that becomes the center of the color space is called a reference color. The reference color is substantially the same as the marking color.

  In the present invention, the color used for the cells constituting the color array is the marking color referred to here, but in the embodiments described later, R (red) G (green) B (blue) will be mainly described as an example. is doing.

Medium:
The means / material used when marking the object is called “medium”. Specifically, it corresponds to ink used for marking, a price tag to be applied to the object to be marked, a product tag, and the like. For example, “ink” for direct printing is an example of the medium. “Product tag” and “price tag” in the case of “hanging” a product tag with a code symbol are also examples of the medium. The above-mentioned adhesive seal corresponds to a suitable example of this “medium”.

Quiat Zone:
A region other than the marking color and a region other than the code symbol boundary and the code symbol is called a “quiat zone”.

  Note that colors other than the marking color are particularly referred to as “ambient colors”.

Conventional Prior Patent Technologies Here, several conventional prior patent technologies will be described.

For example, Patent Document 1 below discloses a CRC code error detection device in which parity bits are assigned in reverse order.
Further, Patent Document 2 below discloses an invention that suppresses processing delay when error detection is performed using an inverse CRC circuit in which temporal transition is reversed.
Patent Document 3 below discloses a barcode demodulator that can complete demodulation in a short time without causing an error due to reverse reading of the right block.
Patent Document 4 below discloses a technique for canceling the correlation of data by using a scramble signal generated from a cyclic code and realizing stable tracking control of a magnetic disk recording apparatus.
Patent Document 5 below discloses a technique for providing a barcode on the inner periphery of an optical disc that uses trellis coding based on the Hamming distance and recording the production date, serial number, and the like.
JP 2002-171171 A JP 2000-269826 A Japanese Patent Laid-Open No. 11-053464 JP 2003-036598 A JP 2006-318467 A

  The present invention has been made in view of the above circumstances, and an object thereof is to realize the “detection symbol” as described above. It is another object of the present invention to provide a code symbol (detection symbol) that is optimal for “detection” as described above and can be easily marked by a general user, for example, by handwriting.

  (1) In order to solve the above problems, the present invention provides a color arrangement code symbol in which a plurality of cells with a predetermined color are arranged. The plurality of cells include all other cells. One whole cell is included, and the cells other than the whole cell are always included in any one other cell, and the cells other than the whole cell are zero or one or more other cells. It is an inclusion type code symbol characterized by including the following cells.

  (2) Further, in order to solve the above-described problem, the present invention provides that the color of the predetermined cell in the inclusive code symbol described in (1) is different from the colors of other cells including the cell. It is a featured inclusive code symbol.

  (3) Further, according to the present invention, in the inclusive code symbol described in (1) above, the colors used for the cells include white and black.

  (4) In the inclusion type code symbol according to any one of (1) to (3), the data represented by the inclusion type code symbol is a cell constituting the inclusion type code symbol. This is an inclusion type code symbol expressed by either or both of the number of cells and the combination of inclusion relationships between cells.

(5) The present invention also provides:
The inclusive code symbol according to any one of claims 1 to 3,
The data represented by the inclusion type code symbol is represented by one or both of a combination of colors of cells constituting the inclusion type code symbol and a combination of inclusion relations between cells. Code symbol.

  (6) Further, according to the present invention, in the inclusion type code symbol according to any one of the above (1) to (3), the data represented by the inclusion type code symbol is a cell constituting the inclusion type code symbol. The data is represented by both a combination of colors and a combination of inclusion relationships between cells, and the data is represented by a combination of the portion represented by the combination of colors and the inclusion relationship between cells. And an inclusive code symbol characterized by being composed of two types of mutually independent data portions.

  (7) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the combination of colors and the part represented by the combination of inclusion relations between the cells An inclusion type code symbol, wherein one represents data and the other represents check data of the data.

  (8) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the color combination and the part represented by the combination of inclusion relations between the cells An inclusion type code symbol, wherein one represents data and the other represents a reading specification of the data.

  (9) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the color combination and the part represented by the combination of inclusion relations between the cells The inclusion type code symbol is characterized in that one represents a product type, and the other represents production management data of the product, and represents the content of the product.

  (10) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the combination of colors and the part represented by the combination of inclusion relations between the cells The inclusion type code symbol is characterized in that one represents a student's school, and the other represents the student's student ID number and represents the attribute of the student.

  (11) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the combination of colors and the part represented by the combination of inclusion relations between the cells An inclusion type code symbol in which one represents data and the other represents interpolation data of the data.

  (12) Further, according to the present invention, in the inclusion type code symbol described in the above (6), any one of the part represented by the combination of colors and the part represented by the combination of inclusion relations between the cells One of the data is an inclusion type code symbol in which one represents data and the other represents correction data of the data reading specification.

  (13) Further, according to the present invention, in the inclusion type code symbol described in (1) above, the inclusion relationship between the whole cell and a predetermined part of other cells is fixed. Type code symbol.

  (14) Further, according to the present invention, in the inclusion type code symbol described in the above (13), the whole cell to which the inclusion relation is fixed and the predetermined part of the other cells are assigned colors. Is also an inclusive code symbol characterized by being fixed.

  (15) In the method of reading an inclusion type code symbol according to any one of (1) to (14), a maximum value is defined for the number of layers representing the depth of the inclusion relationship. And if there is a cell in a deep layer exceeding the maximum value, the data represented by the inclusive code symbol is obtained based on the cell excluding the cell in the deep layer. It is a reading method.

  (16) In the method for reading the inclusive code symbol according to any one of (1) to (14), the present invention may further include a step of obtaining image data by imaging the inclusive code symbol; A step of determining a color range used for a cell constituting the inclusive code symbol based on a distribution of colors in the image data; and a color area to be a cell based on the determined color range And a step of determining a color area to be the cell from an inner color area.

  (17) Further, in order to solve the above-described problem, the present invention provides a color array code symbol in which a plurality of closed regions formed by lines with predetermined colors are arranged. Includes one entire closed region including all other closed regions, and the closed regions other than the entire closed region are always included in any one of the other closed regions. The closed region other than the region is a closed region inclusion type code symbol including zero or one or more other closed regions.

  (18) Further, according to the present invention, in the closed region inclusion type code symbol described in the above (17), either of the number of closed regions constituting the closed region inclusion type code symbol and the inclusion relationship of the closed regions It is a closed region inclusion type code symbol characterized by representing data by one or both.

  (19) Further, according to the present invention, in the closed region inclusion type code symbol described in the above (17), a combination of a color assigned to the closed region forming an inclusion relationship and a color of a line forming the closed region Is a closed region inclusion type code symbol characterized by representing data.

  (20) Further, in the closed region inclusion type code symbol according to (17), the present invention is a combination of a color assigned to the closed region forming an inclusion relationship and a color of a line forming the closed region. And a closed region inclusion type code symbol characterized in that data is represented by one or both of the number of closed regions constituting the closed region inclusion type code symbol and the inclusion relationship of the closed regions. is there.

  (21) Further, according to the present invention, in the closed region inclusion type code symbol according to any one of (17) to (20), the data represented by the closed region inclusion type code symbol is the closed region inclusion type. It is represented by both a combination of colors of the closed region constituting the code symbol and a combination of inclusion relations between the closed regions, and the data is between the portion represented by the combination of colors and the closed region A closed region inclusion type code symbol characterized in that it is composed of two types of mutually independent data portions and a portion represented by a combination of inclusion relationships.

  (22) Further, according to the present invention, in the closed region inclusion type code symbol described in the above (21), a portion represented by the combination of colors and a portion represented by a combination of inclusion relationships between the closed regions , One of the data represents data, and the other represents the check data of the data.

  (23) Further, according to the present invention, in the closed region inclusion type code symbol described in (21), a portion represented by the combination of colors and a portion represented by a combination of inclusion relationships between the closed regions , One of which represents data, and the other represents a read specification of the data, which is a closed region inclusion type code symbol.

  (24) Further, according to the present invention, in the closed region inclusion type code symbol described in the above (21), a portion represented by the combination of colors and a portion represented by a combination of inclusion relationships between the closed regions , One of these represents a product type, the other represents production management data of the product, and represents the content of the product.

  (25) Further, according to the present invention, in the closed region inclusion type code symbol described in (21) above, a portion represented by the combination of colors and a portion represented by a combination of inclusion relationships between the closed regions , One of which represents the student's school, and the other represents the student's student ID number, and represents the student's attributes.

  (26) Further, according to the present invention, in the closed region inclusion type code symbol described in the above (21), a portion represented by the combination of colors and a portion represented by a combination of inclusion relationships between the closed regions , One of which represents data and the other represents interpolated data of the data, which is a closed region inclusion type code symbol.

  (27) Further, according to the present invention, in the inclusion type code symbol described in the above (21), any one of the part represented by the color combination and the part represented by the combination of inclusion relations between the cells One of the data is an inclusion type code symbol in which one represents data and the other represents correction data of the data reading specification.

  (28) Further, according to the present invention, in the closed region inclusion type code symbol described in (17) above, the inclusion relationship between the entire closed region and a predetermined part of other closed regions is fixed. It is a featured closed area inclusion type code symbol.

  (29) Further, according to the present invention, in the inclusion type code symbol according to the above (28), the entire closed region where the inclusion relation is fixed and the other predetermined closed region are attached. It is a closed region inclusion type code symbol characterized in that the color is also fixed.

  (30) Further, in order to solve the above-described problem, the present invention provides a method for reading a closed region inclusion type code symbol according to any one of (17) to (29), wherein the depth of the inclusion relationship is as follows. A maximum value is defined for the number of layers representing, and when there is a closed region of a deep layer exceeding the maximum value, the closed region is included based on the closed region excluding the closed region of the deep layer. A closed region inclusion type code symbol reading method characterized by obtaining data represented by a type code symbol.

  (31) The present invention is an article to which the inclusion type code symbol according to any one of the above (1) to (15) is attached in order to solve the above problems.

  (32) The present invention is an article to which the inclusion type code symbol according to any one of the above (17) to (29) is attached in order to solve the above problems.

  (33) In order to solve the above-described problem, the present invention provides a method for registering the inclusion type code symbol according to any one of (1) to (14) in a reading device, wherein the inclusion code symbol is a registration target. Based on the instructed color, the step of obtaining the image data by capturing the inclusive code symbol, the step of obtaining the color of the part designated by the user as the color of the inclusive code symbol in the image data, The inclusion type code symbol to be registered is cut out and registered, the color used by the registered inclusion type code symbol, and the color space to be judged as the color are registered in association with the inclusion type code symbol. An inclusive code symbol registration method comprising: a step.

  As described above, according to the present invention, since data can be expressed based on the inclusion relation, a code symbol can be realized. In addition, an existing mark can be used as a code symbol based on the inclusion relationship.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

A. Embodiment 1
First Introduction The “color bit code” previously invented by the inventors of the present application is an excellent code that realizes an automatic recognition code that uses a small number of colors and does not depend on the shape. This color bit code has an excellent property that it is more resistant to color fluctuations (fading, discoloration, etc.) without depending on the shape, as compared with a conventional black and white barcode.

  However, as described above, in the method of arranging colors in a certain order, the number of color cells to be used tends to increase, and the marking operation becomes complicated. For example, when attaching to children's clothing, etc., it is only possible to use an adhesive seal or the like after all.

  In addition, if different data is to be expressed in detail for each object, it is necessary to use a large number of color areas, and the mark tends to be complicated. When such a mark is used, it is expected that if the object is located far away, the image becomes small and reading becomes difficult. In addition, when there is a large blur due to the lens of the imaging means, there is a strong possibility that reading will be difficult as well.

  Therefore, the present embodiment proposes the following code symbol marking specifications.

2nd proposed code symbol marking specifications
2-1 Specification 1 Structure in which a color area has an inclusive relationship A conceptual diagram of this specification 1 is shown in FIG. As shown in FIG.
-It is composed of three layers of color areas that are inclusive, and is called the first layer, the second layer, the third layer, ... from the outer edge.

The first layer and the second layer are always composed of one color area.
The third layer, the fourth layer, ... are composed of one or more color areas.
According to such a rule, a plurality of color areas are positioned so as to be in an inclusive relationship.

  Conventionally, most automatic recognition codes in which color areas are arranged do not allow other color areas to be arranged in the color area in principle. In other words, it is based on the premise that the color area is arranged one-dimensionally or two-dimensionally, based on the idea that data is represented by the arrangement of colors. Further, it is considered that the data density is not improved even if a structure having an inclusion relationship as proposed in the present embodiment is adopted.

  In the present embodiment, as a result of providing such an inclusion relationship in the color area, if a certain color area is found, all the color areas can be quickly found by tracing the inside. In other words, the present embodiment is intended to improve the ease of finding code symbols, and is an automatic recognition code suitable for uses such as tracking and finding.

  On the other hand, automatic recognition codes using conventional colors are designed to arrange a large number of color areas in order to express more complex data, and code symbol reading is not always efficient. It was hard to say. For example, if the colors are connected one-dimensionally or two-dimensionally, it is necessary to sequentially read each color area in the one-dimensional direction and the two-dimensional direction. In this case, it is assumed that the object does not move much. In some cases, it is difficult to follow when the object moves rapidly.

  Therefore, in this embodiment, in order to realize an automatic recognition code suitable for tracking and discovery, conventionally, color areas that do not have an inclusion relationship are arranged, but an inclusion relationship is introduced between the color areas. Thus, the code symbol can be found more quickly.

  The code symbol described in the present embodiment is called a “color inclusion symbol”.

  This color inclusion type symbol has a structure in which n layers of color areas are arranged in an inclusive relationship with each other, and each layer below the third layer may have two or more color areas. The configuration is adopted.

  The first layer and the second layer are configured so as to be always composed of one color area, so that the effect of facilitating the discovery of the color inclusion type symbol is provided. By detecting the inclusion of the colors of the first layer and the second layer, it is possible to quickly grasp the position and size of the color-including symbol.

  Hereinafter, various configuration examples will be described.

Example 1
FIG. 1 shows an example of this three-layer structure.
-The first layer is R.
The second layer is G.
In the third layer, the number of color areas is 1, and the color is B.
Here, R represents red, B represents blue, and G represents green. Of course, other colors are acceptable. For example, CMY or the like may be used, or white or black may be combined.

In such a structure, data is represented by the color (combination) of each layer. For the third layer,
(A) Data is represented in the color arrangement order of the color area included in the third layer.

  (B) Data is given only by the number of color types in the color area included in the third layer.

Use one of the methods to represent the data.

  In any case, data is represented by {color of the first layer, color of the second layer, arrangement / number of colors of the third layer}.

Example 2
FIG. 2 shows another example of a code symbol having a three-layer structure. The example of FIG. 2 is an example in which three color areas are included in the third layer.

-The first layer is R.
The second layer is G.
In the third layer, the number of color areas is 3, and the colors are 2 for B and 1 for R.
Data is expressed from the color of each layer and the arrangement / combination of the colors in each color area. Except for the point that two color areas are included in the third layer, this is the same as Example 1 described above.

Example 3
FIG. 3 shows another example of a code symbol having a three-layer structure. The example of FIG. 3 is an example in which four color areas are included in the third layer.

-The first layer is R.
-The second layer is K.
In the third layer, the number of color areas is 4, and R is 4 colors.
Data is expressed from the color of each layer and the arrangement / combination of the colors in each color area. In Example 3, four color areas are included in the third layer.

Example 4
FIG. 4 shows another example of a code symbol having a four-layer structure. In the example of FIG. 4, one color area is included in the third layer, and two color areas are included in the fourth layer.

-The first layer is R.
-The second layer is K.
In the third layer, the number of color areas is 1, and the color is R.
In the fourth layer, the number of color areas is 2, and the color is K.
Data is expressed from the color of each layer and the arrangement / combination of the colors in each color area.
2-2 Example of Application to Baseball Cap Hereinafter, an example of application of the code symbol described so far to an actual clothing item, for example, a hat will be described.

Example 5
FIG. 5 shows an example in which the code symbol having the three-layer structure shown in FIG. 3 is applied to an athletic meet red cap. As is well known, athletic meet etc., red hat and white hat are widely used to distinguish red and white hats, and red hat is widely used at athletic meet. It is a hat.

  As shown in FIG. 5, rice fields are drawn on the red cap 10 with black markers. In this way, the ground color (R) of the red cap 10 corresponds to the first layer, and the portion (K) drawn by the black marker of the drawn rice field corresponds to the second layer (see FIG. 5). .

  Furthermore, the part (four R) part in the shape of a rice field comprises the 3rd layer.

As a result, as shown in FIG.
-The first layer is R.
-The second layer is K.
In the third layer, the number of color areas is 4, and R is 4 colors.
It is possible to mark the red cap 10 with a code symbol such as As described above, since only a single black marker is provided, it is possible to easily mark a plurality of layers of detection symbols on the clothing item. Therefore, the inclusive symbol is an extremely easy to use and effective symbol.

Example 6
FIG. 6 shows an example of a detection symbol that can be marked with a black marker, as in FIG. In FIG. 6, the star shape is drawn with the black marker on the red cap of the athletic meet. It is possible to mark the detection symbol of the present embodiment even with such a simple operation.

  In this case, the background color (R) of the red cap 10 corresponds to the first layer, and the star-shaped portion (K) of the drawn black marker corresponds to the second layer (see FIG. 6).

  Furthermore, the portion (six R) in the star shape constitutes the third layer. The detection symbol having such a configuration can be marked on the red cap 10.

Example 7
FIG. 7 shows a state in which a predetermined patch is attached to the red cap 10 for marking the detection symbol of the present embodiment. The emblem 12 has a ground color of green (G) and has a number “123” inside. Among these, “1” and “3” are drawn in blue (B), and “2” is drawn in red (R).

  In this case, the ground color (R) of the red cap 10 corresponds to the first layer, and the ground color (G) of the patch 12 corresponds to the second layer (see FIG. 7).

  Further, the color of each character (two B and one R) inside the emblem 12 corresponds to the third layer.

Example 8
FIG. 8 shows another example drawn using a black marker for marking the red cap 10 with the detection symbol of the present embodiment. As shown in FIG. 8, a large circle is drawn with a black marker on the side of the red cap 12, a small circle is drawn concentrically inside the circle, and a cross is drawn inside the small circle.

  As a result, the background color (R) of the red cap 10 corresponds to the first layer, and the black marker portion (K) of the outer large circle drawn corresponds to the second layer. A region (R) between the large circle and the small circle corresponds to the third layer. The inner small circle portion (K) corresponds to the fourth layer. Each area (four R) delimited by the inner cross corresponds to the fifth layer.

  In this way, it is possible to easily mark a somewhat complicated detection symbol up to the fifth layer with only a black marker.

Example 9
FIG. 9 shows another example drawn using a black marker for marking the red cap 10 with the detection symbol of the present embodiment. As shown in FIG. 9, a circle with a black marker on the side of the red cap 12 and a letter “123” on the inside of the circle.

  As a result, the background color (R) of the red cap 10 corresponds to the first layer, and the black marker portion (K) of the outer large circle drawn corresponds to the second layer. A region (R) inside the outer large circle corresponds to the third layer. The character (K) × 3 (3 characters) drawn inside the circle corresponds to the fourth layer.

  In this way, it is possible to easily mark a somewhat complicated detection symbol up to the fourth layer with only a black marker.

  As described above, as described in Examples 1 to 9, the detection symbol can be marked relatively easily at the site where the tracking operation is to be performed.

  This detection symbol is referred to as an “inclusive code symbol”. Further, they are also called “color inclusion symbols”, “inclusion symbols”, and the like. In addition, the code system is also called a color inclusion type code and an inclusion type code.

2-3. Points to Consider When Reading As described so far, the detection symbol proposed in this embodiment is easy to mark. In particular, when used for tracking, it is sufficient that it can be identified and distinguished from others, and the specific numerical value it represents does not matter much. Therefore, it is possible to easily mark a detection symbol for tracking by drawing a circle, a square, a cross, or the like with a simple idea at the site where the user wants to use it, which is extremely convenient.

  On the other hand, the following points should be noted when reading this detection symbol.

(1) Cutout It is preferable to cut out the “color inclusion symbol” by detecting the color region of the second layer when reading the “color inclusion symbol”.

  For example, considering the example of the red cap 10 in FIG. 5, there may be a case where red exists by chance in the background. In the extreme case, it will be clear that if the background is all red, cutting out the first layer does not make sense. Even in such a case, it is useful to cut out the second layer. That is, regardless of the background color, the second layer can be cut out in the same manner (as long as imaging is performed well).

  Now, such a cut-out of the second layer is nothing but “determination of a black region surrounded by red”. If other specifications are included, it will be generalized as “determination of Y color region surrounded by X color”.

  Subsequent to this cutout, it is possible to cut out the target mark by examining whether or not four red regions (third layer) are included in the black region (second layer).

(2) Color Area As is clear from the examples described so far, the detection symbol proposed in the present embodiment is a decimal number, similar to the “color bit code” developed by the present inventor previously filed. The code symbol can be composed of the following colors. For example, it is possible to configure only red and black.

  Therefore, similar to the “color bit code” described above, the color used for the color area determination can occupy a wide area in the color space. That is, the color space recognized as “red” can be widened, and the code symbol can be read even if there is some color variation. Here, it is considered that the color variation is caused by illumination, fading, dirt, color accuracy at the time of marking, and the like.

  For example, in FIG. 5, only R and K are used, but it is also preferable to use three or more colors. Obviously, since there are more variations in the case of multiple colors, there is a high possibility that a more unique marking will be obtained when marking is performed using an appropriate color arbitrarily by handwriting or the like. That is, the possibility of accidental coincidence with other marks (marks drawn by others) is low.

  On the other hand, if the configuration is too common in topology, there is a high possibility that a shape corresponding to the non-mark will appear. For example, if you draw a river character in ○, a mark consisting of the first layer of ○, the second layer of the region between ○ and the river, and the three regions of the third layer that make up the river character However, in such an example, there is a high possibility that others will adopt the same configuration, and therefore, there is a high possibility that it will coincide with other marks including accidental colors.

  Eventually, depending on the application, you should avoid specifying symbols that are too topologically simple.

Third encoding part 1
In the second embodiment, it has been described that an inclusion symbol can be used as a detection symbol.

When used for the purpose of tracking, it is only necessary to identify each detection symbol. For example,
-The first layer is R.
-The second layer is K.
In the third layer, the number of color areas is 1, and the color is R.
In the fourth layer, the number of color areas is 2, and the color is K.
An algorithm may be used in which a detection symbol having a configuration is found. However, if the above-described method is used for each detection symbol, the operation may be complicated.

  However, from the viewpoint of data processing, in order to represent each detection symbol (inclusion type code symbol), it is desirable to replace the detection symbol with a certain number. In particular, when handling a plurality of detection symbols, it is preferable in terms of data processing that each detection symbol can be identified numerically. In this section, coding is examined from this point of view.

  First, an inclusive code symbol as shown in FIG. 10 will be described.

If the inclusion relationship of the inclusion type code symbols as shown in FIG. 10 is represented by a tree, it is as shown in FIG. In order to express the inclusion relationship with a simpler notation, a notation such as R (G + G + B) is used.

This means that the color region in () is included in the color region adjacent to the left of (). R, G, B and the like represent respective color regions.

That means
R (G + G + B) → “G, G, B” is included in R.

  Means.

  Further, when only one color area is included, () can be omitted.

That means
RG → G is included in R.

  Decide the notation to mean.

If this notation is used to express the inclusion relationship of FIG.
RG (B (R + R (G + G)) + RBGR + B (G + G + R + R + R)) = P (11)
... (Formula a)
It becomes. Here, P (11) means to represent the pattern of FIG.

Next, for the lower layer,
The color change in the direction of R → G → B → R → is represented by “p”,
When the color change in the direction of R → B → G → R → is represented by “q”,
The above (formula a) is
P (11) = Rp (p (p + p ( p + p )) + qqqq + p ( q + q + p + p + p ))
Is marked.

Here, p + p is represented as (2p, 0q), q + q + p + p + p is represented as (2p, 2q), and is represented as K1 and K2, respectively. These are calculated according to the table of FIG.
K1 = 3
K2 = 17
It becomes. Therefore, the above-mentioned formula a (P (11) formula) becomes
P (11) = Rp (p (p + p (3)) + qqqq + p (17))
It becomes. Here, if the number (quantum) and the symbol are identified with (+), the above equation becomes
P (11) = Rp (p (p + p (+3)) + qqqq + p (+17))
It becomes.

Here, in order to reduce the types of symbols, if “(+” and “+” are replaced with () for convenience, the above equation becomes
P (11) = Rp (p (p () p () 3)) () qqqq () p () 17))
It becomes.

Furthermore, each symbol is replaced with a number as follows.

R: 1 (first character only)
G: 2 (first character only)
B: 3 (first character only)
): 0
(: 1
p: 2
q: 3
Also, to transform quantum numbers into quaternary numbers,
(3 = 3 17 = 101 (17 (decimal) quaternion)
After all,
P (11)
= 121212102103001033331021010100 (quaternary number)
= 184544593344802960000 (decimal number)
It can be expressed as a number.

4th coding 2 (when color areas are continuous)
Next, as shown in FIG. 13, when a part of the color area is in contact (referred to as being continuous), if the continuous color area is expressed as R = B = R, The tree diagram is as shown in FIG.

It is considered that this is expressed by an expression as in the third case. If the inclusion relationship is expressed by () as in the third case,
G (R (G (R) = B (R = B = B = BG) = G (B = RB) B (G = RR)))
It is expressed. In order to avoid misunderstanding, if “=” is written as “*”, this formula becomes
G (R (G (R) * B (R * B * B * BG) * G (B * RB) B (G * RR)))
... (Type b)
It becomes. Or
GR (GR * B (R * B * B * B + G) * G (B * RB) + B (G * R + R)
Moreover,
GR (GR * B (R * 3B + G) * G (B * RB) + B (G * R + R)
Can also be described.

  Here, paying attention to the above-described a-formula and b-formula, the character types used in these are as follows.

  There are five types of “a”, “R”, “G”, “B”, “(”, “)”.

  There are six types of formulas “R”, “G”, “B”, “(”, “)”, and “*”.

So, in both formulas, “)” = 0
"(" = 1
“R” = 2
“G” = 3
“B” = 4
“*” = 5
The above formula a is
213141221330021413120004133222000
Can be converted to a quinary number.

Similarly, the formula b above is
312131205412554545430531425240413522000
Can be replaced with a hexadecimal number.

  Of course, it is also suitable to express these numbers in decimal (decimal numbers).

For example, when the colors that can be used are three colors (R, G, B), the situation of the mark is
First layer: R, G, B
Second layer: R, G, B
Third layer: R (n1), G (n2), B (n3), RkxGkx (n4), GkxBkx (n5), BkxRkx (n6)
Fourth layer: R (n), G (n), B (n), RxGy (n), GxBy (n), BxRy (n)
...
It is possible to connect like this.

In particular, assuming the first layer is R, the above combination is
First layer: R
Second layer: G, B
Third layer: R (n), G (n), RxGy (n) (assuming that the second layer is B)
Fourth layer: R (n), G (n), B (n), RxGy (n), GxBy (n), BxRy (n)
...
It is possible to write as follows.

B. Embodiment 2
In addition to the improvement in the first embodiment described above, the second embodiment proposes the following marking specifications for inclusive code symbols.

First proposed marking specification of inclusion type code symbol The present invention provides a technique that can be realized by detecting and reading an inclusion relationship between two or more colors (including black and white).

  The main features of the present invention are as follows.

1. A maximum coverage "symbol area" that covers the entire symbol is defined.
2. The “symbol area” includes individual regions “data cells” representing data, and the maximum number of layers and the range of the number of regions are predetermined.
3. Symbol identification (data conversion) is determined by the relationship between the inclusion relationship pattern of “data cells” and the colors of cells in each inclusion relationship.
In other words, having such a feature can be said to be independent of its shape and size.

In case of 1-2 colors
A specific example of using two colors when there is no inclusion relationship in the data cell will be described.

  A conceptual diagram of this example is shown in FIG. As shown in FIG. 15, first, a symbol area is represented by an outer peripheral frame. In FIG. 15, the “symbol area display layer 22” including a black background in a white background and the “symbol area display layer 20” included as a white background (in a black background) include “symbols”. Area 100 "is clearly indicated.

  The “symbol area 100” includes data cells 30a, 30b, 30c, 30d, and 30e. FIG. 1 (a) shows an example in which the number of data cells is five, and FIG. 1 (b) shows an example in which the number of data cells is six.

  For example, when the number of data cells is first defined between 1 and 10, it is preferable that the number of data cells indicates the data in FIG.

  This “symbol area” includes data cells.

Terminology Terms in the second embodiment will be described. In the second embodiment, a technique for restoring a data by finding a code symbol from the captured image data and reading (decoding) the code symbol and an inclusive code symbol used therefor will be described.

・ "Image data" and "Color area (color area)"
There are various color areas in the captured image data. This color area refers to an area to which a certain predetermined color is added. In the present embodiment, a region (area) refers to a two-dimensional region (area).

  On the other hand, a code symbol is composed of cells with a predetermined color. In the present embodiment, this cell is any color area in the image data. That is, the color area may be a cell, and there is also a color area that constitutes the background.

In the present embodiment, as described above, the inclusive code symbol of the present embodiment is
• Symbol area display layer • Data cell 2 types of cells. For convenience, the symbol area display layer is also referred to herein as a “cell”.

"Symbol area"
An area where the code symbol exists, which is a predetermined area on the plane, is called a symbol area.

"cell"
A code symbol component that represents data. Cells are assembled to form a code symbol. As described above, in the second embodiment, the cell is
・ Symbol area display layer,
Data cells,
In principle, the data cell represents data. The symbol area display layer mainly serves to facilitate the discovery of the code symbol. Both the symbol area display layer and the data cell are color areas (color areas) in the image data.

When there is an inclusion relationship among data cells Next, consider a case where there is an inclusion relationship between data cells.

  FIG. 16 shows a case where the number of data cells is 5 and there is an inclusion relationship of up to two layers. These are cases where there are five data cells. FIG. 16A shows a case where the inclusion relationship is 2: 1: 1: 1, and FIG. 16B shows a case where the inclusion relationship is 3: 1. : 1. FIG. 16C shows a case where the inclusion relationship is 2: 2: 2, and FIG. 16D shows a case where the inclusion relationship is 3: 2. FIG. 16E shows a case where the inclusion relationship is 5.

  As shown in FIG. 16, the data cell is defined as “a region closed with a predetermined defined color”.

  Therefore, although all of the examples shown in FIG. 16 have “the number of data cells 5”, there are six patterns in total including the case of FIG.

  In the present invention, the number of data cells and the pattern of the inclusion relation shown here are recognized as data represented by the code symbol (detected symbol), and each code symbol is identified based on this data.

Role of the second color (especially when using chromatic colors)
In each of the above-described examples, the case of two colors, particularly black and white, has been described in mind. However, as a matter of course, the use of other colors such as chromatic colors such as red and blue has the following advantages.

2-1 Merit as specifying means The present invention aims at a simple pattern as much as possible regardless of the shape. Therefore, in the case of the above example, there is a possibility that a similar pattern exists by chance. Therefore, it is considered that this possibility can be reduced by using a specified color (other chromatic colors such as red and blue) even if there are two colors.

  In addition, when a color already exists on the ground (for example, orange), it is easier to perform marking with orange or the like in the orange, or simply use a task for searching for a predetermined color (for example, black). This makes it easy to cut out (find).

  Further, if two or more colors are used, the use of a specific color for the symbol area display layer makes it easy to cut out symbols. Thus, for example, a code symbol that can be easily cut out can be created simply by surrounding a black pattern on a white background with red or the like.

  Specific examples of these are shown below.

  FIG. 17A is a black line with a cross pattern drawn in a circle, but one symbol area display layer 24 is arranged on the outermost periphery. Further, it can be recognized as a pattern in which four data cells 36a, 36b, 36c, and 36d exist inside.

  FIG. 17B shows a face mark. As in FIG. 17A, one symbol area display layer 26 and six data cells 38a, 38b, 38c, 38d, 38e, and 38f are arranged on the outermost periphery. Has been placed. These inclusion relations can be recognized as a 2: 2: 1: 1 pattern.

  FIG. 18A shows an example in which marks and characters are drawn in black on a red background with a signboard or the like. It consists of two symbol area display layers 28a and 28b and six data cells 40a, 40b, 40c, 40d, 40e and 40f. These inclusion relationships can be recognized as a 3: 2: 1 pattern.

  In the case of FIG. 18A, the combination of red and black is easy to recognize and the possibility that the same pattern exists is low.

  FIG. 18B is an example in which the characters Tanaka drawn in black on a white background are surrounded by red lines. It is composed of two symbol area display layers 29a and 29b of red and white and eight black and white data cells 42a, 42b, 42c, 42d, 42e, 42f, 42g and 42h. It can be recognized that these inclusion relations are 5: 3 patterns.

  As described above, FIG. 18 illustrates an example in which the outer periphery of a pattern such as an existing character is changed to a recognizable symbol by surrounding it with a “symbol area display layer”. Since the code symbol for tracking can be easily generated by such a method, the tracking operation can be easily executed.

2-2 Various Means for Increasing Variation (Data Amount) In the code symbols described so far, predetermined data is represented by the number of data cells and the inclusion relation. Each code symbol (detected symbol) has been distinguished by the data.

Here, for example, in FIG. 15A, the background is white, and a code symbol is formed by marking with black and red on the background (that is, when it is configured with three colors of white, black, and red). 5 data cells Black: 5 / Red: 0 Black: 4 / Red: 1 Black: 3 / Red: 2 Black: 2 / Red: 3 Black: 1 / Red : 4 Black: 0 / Red: 5 There are 6 ways of expression. That is, the number of types of data that can be expressed can be increased six times.

In addition, in the example shown in FIG. 16A described above, similarly, when considering a variation on the condition of marking on a white background using red and black,
Black / Red / Black: 3 / Red: 0 Black / Red / Black: 2 / Red: 1 Black / Red / Black: 1 / Red: 2 Black / Red / Black: 0 / Red: 3 red / black / black: 3 / red: 0 red / black / black: 2 / red: 1 red / black / black: 1 / red: 2 red / black / black: 0 / Red: There are three ways of expression. That is, the number of types of data that can be expressed can be increased eight times. The symbol ⊃ is a symbol indicating an inclusion relationship. For example, “black ⊃ red” indicates an inclusion relationship between a pair of data cells in which a black data cell includes a red data cell.

Third Recognition Method The code symbol (detection symbol) proposed in the present embodiment is based on the color area, recognizes the inclusion relationship of each color area, and recognizes each code symbol.

  Therefore, in an actual application scene, one premise is to use a captured digital color image.

  Moreover, it is preferable that the color to be used is generally defined in advance. Therefore, it is preferable that a predetermined color range including the reference color is set on the basis of the color to be used, and the colors in the color range are regarded as the reference color (converged). . If there are several colors to use, the color of the captured image will be converged to the several reference colors.

  Note that the color to be used may be dynamically changed without being defined in advance, and the present invention can be used even in such a case. However, the dynamic variation of the colors used is also considered to be a separate technical idea and will not be described in detail in this patent. In the present embodiment, the description will be focused on the case where the colors to be used are defined in advance.

  FIG. 19 is an explanatory diagram showing an example in which the color space is divided into several spaces including a predetermined reference color. The color space represented by the color solid shown in FIG. 19 has brightness (B) in the vertical direction, and the azimuth angle on the horizontal plane represents the hue (H). The distance from the central portion of the color solid represents the saturation (S).

  In particular, the color space shown in FIG. 19 shows an example in which the space is divided into white (W), black (K), and red (R). Each partial space includes white, black, and red, which are reference colors.

・ "Space" and "Area" / "Area"
In this patent, the term “space” represents a color space, and the portion is referred to as a partial space. On the other hand, “area” and “area” represent areas with a certain color in the image. In other words, the word “space” is used on the color, and the words “area” and “area” are used on the image.

  Now, if noise and the like are removed after convergence on the reference color, the image data becomes image data including only the reference color. This image data is called a converged color image 50. This converged color image 50 is shown in FIG.

  Only each “border line between color areas (color areas)” is extracted from the converged color image 50 of FIG. Here, each color region (region located between the data cell and the symbol area display layer) belonging to the symbol is configured with a predetermined color.

  Therefore, the “border line between colors” is a border line of a predetermined color and a closed curve. The symbol area display layer is also a boundary between colors and is a closed curve.

  An image obtained by extracting only such a boundary line is called a color boundary line drawing 52 and is shown in FIG. A code symbol is detected based on the color boundary line drawing 52. This code symbol (detected symbol) is recognized under the following conditions.

(Recognition conditions)
-There must be one or more boundary circles that form a symbol area display layer that matches the predetermined color relationship and the number of layers.
The boundary circle formed by the data cells conforming to the predetermined color relationship exists in the boundary circle formed by the symbol area display layer.
-The number of boundary circles in the symbol area display layer is a predetermined number (or range of numbers).
-In addition, the inclusion relation of the circles constituting the data cell is, so to speak, "a circle is included in the circle", but this inclusion relation is a predetermined number of layers or less.
Under the above recognition conditions, it is possible to find a desired object or a plurality of related symbols.

● Consideration of imaging environment So far, we explained that the color within a certain range is detected from the captured image data around the reference color, and the symbol area display layer, data cell, etc. are detected.

  By the way, depending on the illumination of the imaging environment, the color tone of the imaging may change. Therefore, the overall color tone of the obtained image data is first determined, and then the reference color range is determined by appropriately shifting the color tone. Is preferred. Such a technique can conventionally be performed automatically, for example, by adjusting white balance or the like, and therefore can be implemented by using such a technique. Furthermore, it is also preferable to attach the influence of such an environment to the code symbol as correction data. The correction data will be described in detail later.

  Specifically, an example of the reading operation in that case is as follows.

Imaging the inclusive code symbol to obtain image data;
Determining a color range to be used for cells constituting the inclusive code symbol based on a color distribution in the image data;
Determining a color area to be a cell from a color area in the image data based on the determined color range;
Will be included. Conventionally, methods for setting the white balance from the color distribution are known, and it is easy for those skilled in the art to implement such a method.

● On the precautions regarding the number of layers , one of the recognition conditions is “the inclusion relationship is equal to or less than the predetermined number of layers”, but this restriction may be relaxed. For example, if the predetermined number of layers is set to the maximum value, and there is a data cell with a depth exceeding the maximum value, the data cell in the portion exceeding the maximum value may be ignored to obtain data. preferable.

  Next, in Sections 3-1 and 3-2 below, when a boundary line circle such as a symbol area display layer exists on the outer periphery of the symbol, or a data cell-like boundary circle is formed in the data cell Consider the case where it exists.

  This is considered to be the case where a boundary circle representing a symbol is formed in layers due to background, dirt, noise, or the like.

3-1 Problems when a pseudo boundary circle is added to the outer circumference When a pseudo boundary circle is added to the outer circumference of the original normal symbol, the number of data cells becomes pseudo if this is added. Will increase. That is, it cannot be distinguished from the pattern shown in FIG.

  For example, if a double boundary circle is provided on the outside in a pseudo manner, the new boundary circle is “seen” in the symbol area display layer, so that the original symbol area display layer is added to two overlapping data cells. It will be “visible”.

However,
-Determine the number of data cells (or the range of the number of data cells).
・ Determine the number of layers (or the range of the number of layers).
-It is determined as a rule that a data cell having an inclusion relationship of one or more pairs must be included.
・ Different colors between data cell and symbol area display layer.
By defining such methods and rules, it is possible to avoid erroneous recognition due to dirt and noise as described above, and to recognize the correct symbol by eliminating the influence of the pseudo boundary circle.

  Note that it is difficult to completely prevent such a case from occurring depending on the situation such as the background, but it is also preferable to use it specially for an application under a situation where there is no confusing background.

  Further, since the background situation is often known in advance by the application, it is preferable to set the parameters as described above so as not to be confused with such a background situation. For example, it is preferable to devise such as using a color that is clearly different from the background, or making the inclusion relationship difficult to appear in the background.

3-2 Problems when a pseudo-boundary circle is added to the data cell part In this case, since it is inside the regular boundary circle (boundary circle of the data cell), some noise in the symbol or the symbol originally has It is a pattern problem.

  The following can be considered as basic measures.

  ・ First, the number of layers does not increase too much. When the number of layers is large, it can be considered that a pseudo boundary circle due to noise has occurred.

  -Or it is preferable to ignore the boundary circle more than a predetermined number of layers. As a result, it is possible to avoid (ignoring) seeing a borderline that is finer than necessary (close to noise).

3-2-1 Further Problems However, even if the above countermeasure is taken when a pseudo-boundary circle is added to the data cell portion, the following problem may occur.

  That is, it is a case where a part of the data cell is regarded as a symbol area display layer and meets the symbol condition. This is the state where the symbols appear to be nested.

To avoid this,
・ Change the color specifications of the data cell and symbol area display layer.

  -If a nesting is recognized, a rule is set so that the outside (or inside, or both) is regarded as a correct symbol or all are regarded as incorrect.

  Such measures can be read even when symbols are nested, and the flowability can be greatly improved.

3-3 Extraction Various methods for extracting the code symbol pattern proposed in the present embodiment are conceivable. However, basically, the process starts with a process of finding a symbol area display layer constituting the outer edge. The term “cutout” refers to extracting a region that is determined to be the code symbol from image data obtained by imaging or the like. In the code symbol described in the present embodiment, a symbol area display layer is provided so as to include the data cell in addition to the data cell in order to facilitate the extraction.

  Therefore, as described above, it is preferable to start by finding the symbol area display layer first.

  (1) Since this “symbol area display layer” is composed of another predetermined color in a predetermined color (background), it can be found based on the relationship between the colors. In addition, since all other areas (data cells) are necessarily included in the symbol area display layer, the symbol area display layer can be further specified based on the relationship.

Position Specification No. 1 Cutout Target Furthermore, in order to make it easy to specify the position of a symbol, it is possible to first increase the number of layers as shown in FIG. In FIG. 22A, three layers (three) are used as symbol area display layers. In FIG. 22B, three data cells are arranged inside the symbol area display layer. One of them further includes another data cell inside.

  In FIG. 22C, an example in which there are four internal data cells is shown. One of the data cells further includes another data cell.

As a result, two colors are required between the symbol area display layers (see FIG. 22A). If the color is increased in this manner, the probability that the specific color is accidentally used in the background is reduced, so that the position of the symbol can be specified more accurately.

  Note that the symbol position means the area occupied by the symbol.

Location 2
In order to facilitate the specification of the symbol position, the second possibility is to use a plurality of areas in a predetermined layer as shown in FIG. In FIG. 23A, three symbol area display layers are used as in FIG. 22, but two innermost symbol area display layers are provided.

  Two symbol area display layers cannot be provided because the outermost one defines the outer edge of the symbol and defines the position (area occupied) of the symbol. However, in the case of the inner symbol area display layer, it is also preferable to divide into two or more areas, that is, to provide two or more symbol area display layers. With such a hierarchical structure and inclusion relation, the symbol can be characterized more complicatedly.

  If the characterization is more complicated, it is possible to reduce the possibility that such a feature matches the background image, so that it is possible to detect and cut out symbols more accurately.

  However, if it is too complicated, there is a possibility that the following points will become a problem.

  (A) Reading the inclusion structure is a complicated operation and takes time to detect.

  (B) The symbol area display layer tends to consume a large area, and there is a possibility that the area that can be occupied by the data cells for representing data becomes extremely small.

  As shown in FIG. 23, when two symbol area display layers of the innermost layer are provided, a data cell can be provided inside each. This is shown in FIG. Further, an example in which data cells are further added is shown in FIG.

  Note that it is also preferable to characterize each symbol by the inclusion relationship with the data cells further inside the symbol area display layer. According to such a configuration, each symbol can be detected and cut out more accurately.

Specifying the location 3
In order to specify the position of the symbol, the third thing that can be considered is to use a specific color, as shown in FIG.

  FIG. 24A shows an example in which one R color (red) is provided as a data cell. Due to the presence of this red data cell, this symbol can be easily identified and cut out easily. The data cell of this specific color may exist anywhere. In FIG. 24B, there are three data cells at the level immediately below the symbol area display layer, and one of them is a red cell (indicated by hatching in the figure). In FIG. 24 (c), there are three data cells at a level immediately below the symbol area display layer, one of which is a red cell (indicated by hatching in the figure), and The red cell further contains one data cell.

  In FIG. 24D, there are five data cells at a level immediately below the symbol area display layer, and one of them is a red cell (indicated by hatching in the figure).

  In either case, the display layer and the data cell may not be located in the outermost layer, either by increasing the symbol area display layer or by using a cell using a specific color.

3-4 Data conversion 3-4-1 In case of 2 colors (Containment pattern data conversion)
As a result of recognition by the above algorithm, it can be quantified in the same manner as in the first embodiment based on the number of data cells in the symbol area display layer and the configuration of the number of layers (with a predetermined number of layers as a limit).

  Here, first, a case of two colors, that is, a case where data is represented by an inclusion pattern of the symbol, and a color type does not affect the data will be described.

  For example, if the upper limit is two layers, the data cell configuration is given as follows.

That is, the following sequence 1, 2, 1, 1, 3, 2
It is expressed as

Here, in the above sequence,
The “1” represents a data cell that does not form a layer.

  The above “2” and “3” are layered data cells. In particular, “2” represents a one-to-one inclusion relationship. 3 represents a case where two cells are included in one cell as in the example shown in FIG.

Now, when the above sequences are arranged in descending order,
3,2,2,1,1,1
Thus, in this example, the number of data cells is 10 of these sums.

  There is no problem even if the above sequence is used as the data to be obtained. However, if this is systematically arranged and given a permutation number, and this permutation number is used as “data”, the redundancy is greatly reduced, and the number of digits of the numerical value can be made compact and efficient. Data processing is possible.

  An example of the sequence that can be obtained in the case of p (10) is shown in FIG.

  In the table shown in FIG. 25, the number sequences that p (10) can take are listed. Referring to FIG. 25, S / N (serial number: permutation number) can be associated with each number sequence. Then, this serial number (: permutation number) is used as data to be finally converted.

  Incidentally, when there are two symbol area display layers, the calculation is performed as follows. For example, when considering two layers and two colors (for example, black and white and white background), when the number of cells is 5, m, which is the total number of possible combinations of inclusion relationships, is obtained as follows.

  In the following description, numerical values (number of cells in each mountain) are indicated by →.

・ 5 black on a white background (1 layer x 5)
→ 1,1,1,1,1
-1 black and 3 black (2 layers x 1 + 1 layer x 4) on a white background
→ 2,1,1,1
-1 black and 2 black (2 layers x 2 + 1 layer x 3) on a white background
→ 3,1,1
-1 black and 1 black (2 layers x 1 + 1 layer x 4)
→ 4,1
-1 black and 0 black (2 layers x 1 + 1 layer x 4) on a white background
→ 5
-2 black and 1 black (2 layers x 1 + 1 layer x 4) on a white background
→ 2,2,1
-1 black and 2 black in it and 1 black and 1 white in it → 3, 2
Looking at the numerical values here, it turns out that it is the so-called “number of divisions”. The number of divisions refers to the number of representations when integers are represented by the sum of natural numbers (integer division is performed). The same integers may be present, but only those that are changed in order are considered to be the same partition.

For example, the natural number 5 is
5 = 5
5 = 4 + 1
5 = 3 + 2
5 = 3 + 1 + 1
5 = 2 + 2 + 1
5 = 2 + 1 + 1 + 1
5 = 1 + 1 + 1 + 1 + 1
The number of divisions of natural number 5 is 7. A function representing the number of divisions is called a division function and represented as p (5). That is, p (5) = 7.

  Thus, the number of data amounts (types of data that can be expressed) that can be expressed in the inclusion type code symbol is given by a so-called division function with respect to the number of data cells. Therefore, if n is the number of data cells, p (n) is the number of data that can be represented.

It is known that a “recursion formula of a division function” can be applied to this division function. According to Euler's pentagon number theorem, the recursive relational expression is Σp (n−j (3j ± 1) / 2) (− 1) ^ j = 0
It is known to be given in

The result of calculating this is shown in FIG.

  The calculations so far are based on two layers. Although it should be possible to solve mathematically in the case of multiple layers, a simple mathematical formula has not yet been found. The general formula is expected to be very complex.

  Since the number of layers actually used is considered to be limited in many cases, it may be preferable to individually calculate the number of cells determined to some extent by a program or the like.

  Similarly, when the number of colors increases, it is also difficult to generalize, so it may be preferable to individually determine the number of colors determined to some extent by a program.

  As already mentioned, this inclusive code symbol is more suitable for private use than it is widely used in the world. It is not considered necessary.

Modifications Note that the two colors mentioned here are not limited to “black and white”, and any color can be used as long as the color is determined. For example, “Red Blue” is also acceptable.

  Therefore, since the selected color directly becomes the symbol characteristic, even if the same inclusion pattern, it is possible to recognize that it is a different symbol if the color is different.

  For example, even if the S / N (permutation number) is the same “11”, it is also preferable to distinguish colors such as “11 black and white” and “11 red blue” by identifying colors.

  It is also preferable that the symbol area display layer is not necessarily one layer or two layers. In this case, depending on the number of layers, even if the data cell has the same inclusion pattern, it can be recognized as different symbols.

  For example, even when the S / N (permutation number) is the same “11”, the number of symbol area display layers is identified, and the symbols are discriminated as “2 layers 11” and “3 layers 11”. Is also preferable.

-About the inclusion pattern (combination of inclusion relations) Now, the "inclusion pattern" has been described, which means "combination of inclusion relations". The inclusion relationship means a relationship such that the A cell is included in the B cell, and the description of all the cells is a “combination” of the inclusion relationship. This combination of inclusion relationships is called “inclusion pattern” as described above.

3-4-2 In case of multiple colors (inclusion pattern + color pattern)
If three or more colors are used, the number of data increases depending on the combination of colors as compared with the case of two colors. In this case, how to represent the data is further complicated, and various methods can be taken.

  FIG. 27 shows a combination of colors using the pattern No. 16 in the table of FIG. 25 as an example.

In FIG. 27, a pattern composed of RGB as shown in FIG. 28 is assumed. Since the background color in the symbol area is R (see FIG. 28), the first layer of each data cell is only G or B. (See FIG. 28).
In FIG. 27, the possible contents of this data cell are expressed using three blocks.

  First, the block composed of the number of cells “4” indicates that four data cells (indicated by X in FIG. 28) can take eight color patterns as shown in FIG. .

  Also, the block consisting of the number of cells “2” indicates that two data cells (indicated by Y in FIG. 28) can take four color patterns as shown in the center of FIG. ing.

  Similarly, in the block “1111”, as shown in the right part of FIG. 27, four data cells (indicated by Z in FIG. 28) have the number of types of the number ratio of G and B, that is, five ways. This means that it is possible to take a color pattern.

  Therefore, the combinations are as shown in the table of FIG. 27, and the possible combinations are 8 × 4 × 5 = 160.

  Here, considering the characteristics of the symbols, it can be considered that the data portion by the pattern and the data portion by the combination of the colors are shown so as to be easily understood in terms of quality and usability.

That is,
DATA = CCCPPPP
DATA = PPPCCCCC
DATA = PPCCCCPP (where P is pattern data and C is color data)
An example like this can be considered. That is, the data portion represented by the pattern and the data portion represented by the color are combined to form the entire “DATA”.

  Of the above data, data represented by a pattern (one component of one digit) is referred to as pattern data, and data represented by a color (one component of one digit) is referred to as color data.

  In this case, for example, the following handling is suitable.

  (1) The pattern data represents original data, and the color data represents check data. The check data represents various conventional check data. For example, parity data and so-called CRC data are suitable examples of this check data.

  (2) The pattern data represents color reading specifications, and the color data represents original data. The reading specification represents the relationship between color (color) and data. A specification in which “1” and “0” are assigned to colors is also preferable. Also, color transitions, for example, “1” is assigned to “R → B”, “B → G”, “G → R”, and “0” is assigned to “B → R”, “G → B”, and “R → G”. It is also suitable. In addition, the relationship between various colors and data can be considered. These are reading specifications.

  (3) The pattern data represents the product type, and the color data represents the production management data. In this case, a symbol used for attaching the symbol to the product and representing the content of the product can be realized.

  (4) The pattern data represents a school, and the color data represents a student ID number. This means a symbol attached to a student and used to represent the student's attributes.

  As described above, it is expected that the application range will be expanded by using color data and pattern data.

further,
(5) The pattern data represents predetermined data, and the color data represents data that complements the data. This is a useful specification when it is necessary to supplement predetermined data.

  (6) The pattern data represents predetermined data, and the color data represents data to be corrected for its reading specification. This is a symbol that can be corrected smoothly when the color tone that can be read changes depending on the light source of the environment.

  The sharing of the pattern data and the color data as described above may be reversed. For example, instead of (1), it is also preferable that the color data represents original data and the pattern data represents check data. When (2) is reversed, the reading specification is the reading specification based on the relationship between the inclusion relationship and the data. The same applies to (3), (4), (5), and (6).

  Even in the case of two colors, the same idea can be taken because several types of code symbols can be created by selecting colors as described above.

3-4-3 Symbol Registration This symbol proposed in the present embodiment can be easily created by handwriting or the like as described above, and an existing mark can be used as a symbol.

  Therefore, the symbol can be created by means of printing a mark in accordance with the standard as in the case of a conventional barcode, but it is also possible to take a method of taking an existing mark and registering it as a symbol.

At this time, it is necessary to satisfy a predetermined condition in order to make the pattern to be converted into a symbol in accordance with the symbol definition. Those conditions are, for example,
-Surrounded by a symbol area display layer,
・ The number of data cells is within the specified range.
Etc.

  Of course, it is expected that there will be certain restrictions on noise, fine patterns, ambiguous color changes, etc. due to optical limitations of cameras and other devices, software limitations, and convenience. However, there is still an unprecedented technical effect that a considerably free pattern can be obtained as compared with a barcode or the like having a fixed shape, and an existing mark can be used as an automatic recognition symbol. be able to.

  When using an existing mark as an automatic recognition symbol, it is necessary to register the mark in advance in a code reader or the like as an inclusive code symbol. By registering, the code reader can recognize the mark as a code symbol and perform automatic recognition.

  The flow of processing when registering a pattern that satisfies the rules as a symbol is shown below. A conceptual diagram of this processing flow is shown in FIG.

  First, data is captured as shown in FIG. This is to image a mark centered on a mark that can be used as a code symbol to be registered by an imaging means (video camera or the like), and image data as shown in FIG. 29A is obtained. As this imaging means, it is preferable to use the imaging means of the code reader as it is.

  The code reader generally includes an imaging means such as a video camera for reading the code symbol of the optical automatic recognition code, and cuts out an area estimated to be a code symbol from the image data captured by the means. Decoding is performed by regarding the area as a code symbol, and data represented by the code symbol is calculated. The calculated data is displayed to the user using predetermined display means (liquid crystal display or the like).

  Therefore, the code reader is typically an example of a configuration that is preferably configured by a computer including a camera. Original data can be obtained by extracting and decoding an area that is considered to be a code symbol from image data captured by a camera. The obtained data is presented to the user via a computer liquid crystal display or the like.

  The display is convenient because the user can know the state of decoding by displaying captured image data and the like.

  Now, as described above, the image data is composed of various color areas (color areas). The computer selects a color portion that can be a code symbol and recognizes a symbol area that is a code symbol. Now, a color within a certain color range centering on the reference color is estimated to be a cell constituting a code symbol, and an area that seems to be a code symbol is found. This operation is basically the same as the code symbol decoding operation. It is considered that the symbol may be read and registered basically in the same manner as the reading operation.

  However, in practice, it may be appropriate to consider that the mark to be registered actually has a variety of colors. Therefore, it is extremely preferable that the user directly designates an area (color) to be used as a code symbol from the captured image data with a pointing device such as a mouse. In FIG. 29 (b), the user points out that the portion of (1) (represented by circle 1 in the figure) is a data cell, and (2) (represented by circle 2 in the figure). It is pointed out that this part is a symbol display layer. Then, the computer registers the indicated color area as the color used for the code symbol, and reads the color based on the registered color at the time of reading.

  A mark to be registered is referred to as a “target symbol”.

  In this way, the reading color range is set based on the target symbol.

  Registration is preferably performed by writing to a hard disk or the like inside the computer. Of course, it is also preferable to collectively register in an external database via a network.

  In FIG. 29B, (3) not shown (represented as a circle 3 in the figure) is recognized as a so-called “background” and “external color”.

  In FIG. 29C, the color area is cut out according to the color pointed out and selected by the user and displayed on the display. The user looks at the displayed mark and proceeds with registration if there is no problem. In the case where the color is faintly subtracted, the process returns to FIG. 29B and starts again from the color selection instruction.

  In FIG. 29C, if the cut-out area represents the target mark, the computer is instructed to register the pattern. The computer recognizes the indicated mark as an inclusive code symbol, and displays the number of data cells, the number of symbol area display layers, the number of colors used, and the like on the display (see FIG. 29C). . If there is no problem, the user clicks the OK button in FIG. 29C to instruct the computer to register. The computer stores the mark as an inclusive code symbol, and reads the mark while referring to the registered data.

  What is characteristic in the present embodiment is that when an inclusive code symbol is registered, the color used by the inclusive code symbol and the color range are registered in association with each other. As a result, since reading is performed based on the registered color range at the time of reading, a preferable color range can be set for each user and each code symbol to be used, and efficient reading is performed. It is possible.

  The registration process proceeds as described above.

  Note that the color factor is important as a premise of this processing flow. It is necessary to set the color range to be recognized as a pattern color (color used as a pattern) to an appropriate value range based on variations in the color of captured data, differences in color values between patterns, camera characteristics, and predicted usage environment. There is.

  Here, the pattern color is a color used as a symbol, such as red, blue, and green. That is, the range of colors that can be recognized as these colors is determined. Basically, a certain range around the reference color as a reference is regarded as a pattern color. The pattern color is sometimes called a marking color. In addition, the reference color that is the center of the color range may be referred to as a marking color.

  For example, when a general user uses it, it is preferable to give priority to searching for a symbol even if there is some misrecognition because the pattern color range is slightly widened. As described above, it is preferable to change the specification of the color range of the pattern color according to the specification mode of the symbol, the purpose of use, and the concept of the symbol.

  The color value is preferably represented by RGB or the like. For example, it is possible to express R in 256 steps (0 to 255), B in 256 steps (0 to 255), and G in 256 steps (0 to 255). Then, like the color of (R: 64 B: 128 G: 255), the color is expressed by RGB component values. Thus, the color value is generally a vector.

  In addition to the absolute value of the color, it is also preferable to pay attention to a color difference between patterns (an angle between vectors, etc.) and adopt a means for creating data based on this angle difference.

3-4-3-1 Effects and uses obtained by registering symbols (for private use)
As described above, the inclusive code symbol proposed in the present embodiment can be easily created and registered by correcting an existing mark or simply using handwritten characters or figures. .

  In conventional automatic recognition codes such as barcodes, it is difficult for individuals to easily create barcodes, and it has been necessary to appropriately create them with a printer using a computer. Furthermore, it is necessary to attach the created automatic recognition code so that it can be seen as an object. It is sufficient if the object is easy to attach an adhesive seal or the like, but if it is a cloth or the like, it is not easy to attach a barcode or the like so that it can be seen. Complicated work such as creating a tag with a bow code and sewing it is necessary.

  On the other hand, according to the present embodiment, an inclusive code symbol can be created and registered in a simple operation such as drawing an existing mark with a pen and enclosing it with a pen. Therefore, there is an effect that it is suitable for “private use”.

  There are other reasons why the inclusive code symbol according to the present embodiment is suitable for private use.

As described above, in the case of a normal bar code (including a color bit code using a chromatic color), a person who wants to mark certain data (for example, the number “100”) must be sure to mark “100” according to a certain rule. Can be decoded and must be possible. Otherwise, other users will be in trouble. This is because old bar codes and the like are widely spread socially and everyone needs to be able to read them.

  On the other hand, in private use, it is only necessary to recognize a specific mark for one's own use, so there is no need to generalize like a normal barcode. As described above, the inclusion type code symbol is very well suited in such a usage scene premised on the purpose and application.

  That is, in this embodiment, first, each inclusive code symbol is created, and the created inclusive code symbol is registered in the reading device. A code symbol to be registered may be called a target symbol.

  Therefore, since the color range of reading can be set based on the color of the inclusive code symbol that has been created, the feature is that it can be effectively used as an “automatic recognition system that only you use”. is there.

  For example, if you put a recognition patch for your child on a hat or something before an athletic meet, you only need to read this patch. Therefore, it is clear that decoding specialized for the color specific to the Wabben (more precisely, the color signal of the image obtained from the emblem including the camera characteristics) is more desirable.

  The registration operation meets such a purpose, and it is possible to efficiently obtain and use an inclusive code symbol for private use.

  In this case, since the color changes depending on the environment, a certain range of color is required in anticipation of this, but this point has already been described with reference to FIGS. 19 and 29.

  In this way, it is particularly effective for private use to adjust the specific reading settings based on the target symbol (the mark to be registered) in advance. An automatic recognition code can be easily obtained and used. For example, if a picture or character is drawn on a child's hat and circled on the morning of the athletic meet day, an inclusive code symbol can be formed and registered easily. And it can be used immediately at the actual athletic meet, and an extremely convenient automatic recognition system can be used for personal purposes.

  Unlike conventional systems, there is another reason why this can be easily achieved. That is, the inclusive code symbol of the present embodiment does not have any particular limitation on the shape. If you use a code that has some restrictions on the shape, it is necessary to accurately reproduce the shape, so it is difficult to draw easily with "handwriting" etc. It is virtually impossible to use the mark.

  As described above, according to the present embodiment, since there is no limitation on the shape, the "inclusion type code symbol" that is an automatic recognition code that expresses data with the inclusion relation of the color area is used. It has the following features.

  ・ The rate of recognition is improved. Since there is no restriction on the shape, the code symbol can be read even if it is deformed for some reason. Therefore, it can be directly attached to clothes or the like.

  ・ Even if there is another similar pattern and it is recognized, it does not affect the operation of searching for the user's target. Coincidentally, other children may use similar markings as inclusive code symbols. That doesn't mean your child won't be able to recognize it, but you can track it.

  Since this inclusion type code symbol recognizes the inclusion type code symbol in the image data and reads the data, there is no problem even if the number of code symbols read at one time is two or more.

  The present inventors have proposed a “color bit code” (Japanese Patent Application No. 2007-130504, etc.), which is a code that represents data by color arrangement and the like and does not depend on the shape. All code symbols that meet the conditions are read from the data. (In other words, there is no reason to limit to one). Therefore, basically all the inclusive code symbols in the image data are read out even in the inclusive code symbol of this case, so even if other child inclusive code symbols are similar, In principle, it has no effect on tracking.

The inclusive code symbol in this case is
-Unlike the color bit code invented by the inventor of the present application, the mark can be enlarged and easily recognized from a distance.

  -Unlike color bit codes, two colors are also possible. Since the inclusion type code symbol represents data not only by the color but also by the inclusion relation of the cells (color regions), it can be constructed if there are at least two colors that can express the inclusion relation.

  -Unlike color bit codes, it can be used for handwritten marks, and a system that matches handwritten characters and figures well can be constructed. Also, it is difficult for the mark to feel uncomfortable. This is because human-friendly characters and figures can be applied. Tasteless barcodes, two-dimensional barcodes, etc. make a clear difference.

  Because of this feature, it is suitable for personal and home use, as well as for private use within a company and temporary automatic recognition codes used only at certain events. Is possible.

3-4-4 ◆ Symbolization by line drawing pattern So far, patterning by color area has been described. That is, any existing mark is used as a predetermined detection symbol of the automatic recognition code as a set of color areas. In order to achieve this, an existing mark is regarded as a set of color areas having an inclusive relationship, and various patterning by the color area has been studied.

  On the other hand, it is also preferable to recognize that various existing marks are line drawings.

  Here, the line is, after all, a “narrow color area”, and can be said to be essentially the same as patterning by a color area. However, recognizing a drawn line as a “line” as it is is often convenient and easy to understand because it matches human intuition. This is because, in general, humans often recognize character marks or the like as a set of color areas, but not as a set of color areas. Therefore, in data conversion, it is considered that a result that matches a human intuition is often obtained by capturing the data as a line drawing.

In order to achieve this,
・ It is appropriate to add the condition that the color area of a certain thickness is extended. By adding such a condition, it becomes easier to calculate an error assumption in pattern recognition.

  By capturing it as a line drawing, it becomes easy to detect line breaks, double lines such as handwritten marks, etc., and to easily correct these.

  Furthermore, it is expected that it will be less susceptible to changes in the ground color situation by capturing it as a line drawing.

  These effects can be expected.

  In this case, the recognition may be performed by recognizing the color boundary line shown in FIG. 21 as a long and narrow area (circular area) having a predetermined color and a predetermined width and thickness.

  Further, instead of the value “color inside and outside the color boundary line”, it may be recognized that the color line is inside and outside the color boundary line, and the same processing as described above may be performed.

  As described above, the other way of thinking and processing is the same as described above only by recognizing the line as an elongated area having a certain width of the “color of the line itself”.

3-4-5 Items to be noted in line drawing (difference between line drawing pattern and inclusion pattern)
However, the example shown in FIG. 30 requires a little care.

First, according to the idea of viewing a mark as a line drawing pattern, any color area is viewed as an area surrounded by those lines (curves). Therefore,
A line that does not enclose a closed region can be regarded as meaningless. In the left diagram of FIG. 30, a short “line” that connects an inner circle and an outer circle can be ignored (treated as not present). As a result, it can be seen that the inner small circle is contained in the outer region surrounding the outside.

  On the other hand, if the line is treated as having a thickness, the curve itself is an area (for example, black), and therefore the area inside the small circle and the area inside the large circle are both in the black curve area. It can be seen that there are two regions included. This explanatory diagram is shown in FIG.

  As described above, recognizing as a line drawing pattern means performing processing that does not see the thickness in terms of processing, such as taking an intermediate point even if there is a certain thickness.

  Therefore, the process for that is needed. For example, a thin line having a certain thickness or less is treated as a line having a thickness of 0.

  However, when the area (region) is viewed as a rule instead of a line, two inner and outer color boundary lines must be processed, whereas one line process is used when treating it as a line drawing. Therefore, there is an advantage that the processing can be simplified. In addition, even if there is a break or the like as described above, there is an advantage that correction processing is easy.

  In the case of a boundary line, the color data is data inside and outside the color data, but in the case of a line drawing, the color data has three colors of inside, line, and outside. In other words, the concept of line is treated as one of colors.

  In any case, an appropriate method should be appropriately selected depending on the marking method and the use environment. It is also preferable to distinguish between colors and layers. When red is used, it is a line drawing, and when blue is used, it is handled as an area. In addition, although an area above a certain level is handled as an area, if it is below a certain level, a fine image is obtained. Therefore, it is also an example of a suitable process to perform a process such as handling all as a line drawing. In this way, it is also suitable depending on the purpose to use both the treatment as a line drawing pattern and the treatment as an inclusion pattern.

  In the claims, a code symbol when the mark is viewed as a line drawing pattern is referred to as a closed region inclusion type code symbol. On the other hand, a code symbol when the mark is regarded as an inclusion pattern of cells (color cells) is called an inclusion type code symbol.

As described above for the fourth article , the inclusive code symbol can be easily registered and used as an optical automatic recognition code. If this is attached to an article, the article can be easily given an automatic recognition code. It becomes possible. Conventionally, it has been necessary to create a code symbol from the model number of the article, and it has been necessary to calculate it using a computer, but according to the present embodiment, an article with an automatic recognition code can be easily obtained. can get.

  Similar actions and effects can be obtained in the same manner for an article with a closed region inclusion type code symbol when used as line drawing data.

6 is a conceptual diagram of code symbol specification 1 in the first embodiment. FIG. It is explanatory drawing which shows the example of the code symbol of a 3 layer structure. It is explanatory drawing which shows the other example of the code symbol of a 3 layer structure. It is explanatory drawing which shows the example of the code symbol of 4 layer structure. It is explanatory drawing which shows a mode that the code symbol of 3 layer structure was applied to the hat. It is explanatory drawing which shows a mode that the code symbol which can be marked with a black marker was represented on the hat. It is explanatory drawing which shows a mode that the code symbol was marked on the hat using the emblem. It is another explanatory drawing which shows a mode that the code symbol which can be marked with a black marker was represented on the hat. It is another explanatory drawing which shows a mode that the code symbol which can be marked with a black marker was represented on the hat. It is explanatory drawing of an example of the inclusion type | mold symbol in the case of describing encoding. It is a tree figure which shows the inclusion relation of an inclusion type code symbol. It is a figure which shows the table | surface of p and q. It is explanatory drawing which shows a mode that a part of color area is continuing. FIG. 14 is a tree diagram of the code symbol of FIG. It is explanatory drawing which shows the mode of the inclusion type | mold code symbol in the case of using 2 colors. It is explanatory drawing of the inclusion type | mold code symbol in case the number of data cells is 5 and it accept | permits to two phases. It is explanatory drawing which shows the example of the inclusion type | mold code symbol in the case of using 3 or more colors. It is explanatory drawing which shows the example of the inclusion type | mold code symbol in the case of using 3 or more colors. It is explanatory drawing which shows a mode that the color space is divided | segmented into the some space containing a predetermined reference color. It is a figure which shows a convergent color image. It is a figure which shows a color boundary line drawing. It is a figure which shows the example which increased the number of layers of the symbol area display layer, and specified the symbol easily. It is a figure which shows the example which increased the number of the symbol area display layers in the same level, and specified the symbol easily. It is a figure which shows the example which made specification of a symbol easy using a specific color. It is an example of a numerical sequence that can be obtained in the case of p (10). It is explanatory drawing of the calculation result of the data amount which a code symbol can represent. It is explanatory drawing which shows the combination of the color of the pattern of No16 of FIG. It is a figure which shows the example of the inclusion type | mold code symbol comprised by RGB. It is explanatory drawing which shows the flow which registers a pattern. It is explanatory drawing for demonstrating the notice point in a line drawing pattern and an inclusion pattern.

Explanation of symbols

10 Red cap 12 Patch 20 Symbol area display layer 22 Symbol area display layer 24 Symbol area display layer 26 Symbol area display layer 28a, 29b Symbol area display layer 29a, 29b Symbol area display layer 30a, 30b, 30c, 30d, 30e, Data cell 32a, 32b, 32c, 32d, 32e, 32f Data cells 34a, 34b, 34c, 34d, 34e, Data cells 36a, 36b, 36c, 36d Data cells 38a, 38b, 38c, 38d, 38e, 38f Data cells 40a, 40b , 40c, 40d, 40e, 40f Data cell 42a, 42b, 42c, 42d, 42e, 42f Data cell 50 Convergent color image 52 Color boundary line image 100 Symbol area

Claims (33)

In a color arrangement code symbol formed by arranging a plurality of cells with a predetermined color,
The plurality of cells includes one whole cell including all other cells,
The cells other than the whole cell are always included in any one other cell,
The inclusive code symbol, wherein the cells other than the whole cell include zero or one or more other cells. The inclusive code symbol of claim 1,
The inclusion type code symbol, wherein the color of the predetermined cell is different from the colors of other cells including the cell. The inclusive code symbol of claim 1,
An inclusive code symbol, wherein colors used for the cells include white and black. The inclusive code symbol according to any one of claims 1 to 3,
The data represented by the inclusion type code symbol is represented by one or both of the number of cells constituting the inclusion type code symbol and the combination of inclusion relations between the cells. The inclusive code symbol according to any one of claims 1 to 3,
The data represented by the inclusion type code symbol is represented by one or both of a combination of colors of cells constituting the inclusion type code symbol and a combination of inclusion relations between cells. Code symbol. The inclusive code symbol according to any one of claims 1 to 3,
The data represented by the inclusive code symbol is represented by both the combination of the colors of the cells constituting the inclusive code symbol and the combination of the inclusive relations between the cells.
Further, the data is composed of two kinds of mutually independent data parts, a part represented by the combination of colors and a part represented by a combination of inclusion relations between the cells. Inclusive code symbol. The inclusive code symbol of claim 6,
One of the portion represented by the combination of colors and the portion represented by the combination of inclusion relationships between the cells represents data, and the other represents check data of the data, Inclusive code symbol to be. The inclusive code symbol of claim 6,
One of the part represented by the combination of colors and the part represented by the combination of inclusion relationships between the cells represents data, and the other represents the reading specification of the data, Inclusive code symbol to be. The inclusive code symbol of claim 6,
One of the part represented by the combination of colors and the part represented by the combination of inclusion relationships between the cells represents a product type, and the other represents production management data of the product, An inclusive code symbol that represents the contents of a product. The inclusive code symbol of claim 6,
One of the part represented by the color combination and the part represented by the combination of inclusion relationships between the cells represents a student's school, and the other represents the student's student ID number, An inclusive code symbol characterized by representing student attributes. The inclusive code symbol of claim 6,
One of the portion represented by the combination of colors and the portion represented by the combination of inclusion relationships between the cells represents data, and the other represents interpolation data of the data, Inclusive code symbol to be. The inclusive code symbol of claim 6,
One of the part represented by the color combination and the part represented by the combination of inclusion relations between the cells represents data, and the other represents correction data of the data reading specification. An inclusive code symbol characterized by The inclusive code symbol of claim 1,
An inclusion type code symbol, wherein an inclusion relationship between the whole cell and a predetermined part of another cell is fixed. The inclusive code symbol of claim 13,
The inclusion type code symbol, wherein the colors attached to the whole cell and the predetermined part of other cells to which the inclusion relation is fixed are also fixed. A method for reading an inclusive code symbol according to any one of claims 1 to 14,
A maximum value is defined for the number of layers representing the depth of the inclusion relation, and when there is a cell in a deep layer exceeding the maximum value, based on the cell excluding the cell in the deep layer, A method for reading an inclusive code symbol, comprising: obtaining data represented by an inclusive code symbol. A method for reading an inclusive code symbol according to any one of claims 1 to 14,
Imaging the inclusive code symbol to obtain image data;
Determining a color range to be used for cells constituting the inclusive code symbol based on a color distribution in the image data;
Determining a color area to be a cell from a color area in the image data based on the determined color range.
An inclusive code symbol reading method comprising: In a color arrangement code symbol formed by arranging a plurality of closed regions formed by lines with a predetermined color,
The plurality of closed regions include one whole closed region including all other closed regions,
The closed region other than the entire closed region is always included in any one other closed region,
The closed region inclusion type code symbol, wherein the closed region other than the entire closed region includes zero or one or more other closed regions. The closed region inclusion type code symbol according to claim 17,
A closed region inclusion type code symbol characterized in that data is represented by one or both of the number of closed regions constituting the closed region inclusion type code symbol and the inclusion relationship of the closed regions. The closed region inclusion type code symbol according to claim 17,
A closed area inclusion type code symbol, wherein data is represented by a combination of a color assigned to the closed area forming an inclusion relation and a color of a line forming the closed area. The closed region inclusion type code symbol according to claim 17,
A combination of a color attached to the closed region forming an inclusive relationship and a color of a line forming the closed region;
Either or both of the number of closed regions constituting the closed region inclusion type code symbol and the inclusion relationship of the closed regions;
A closed region inclusion type code symbol characterized by representing data by. The closed region inclusion type code symbol according to any one of claims 17 to 20,
The data represented by the closed region inclusion type code symbol is represented by both a combination of colors of the closed region constituting the closed region inclusion type code symbol and a combination of inclusion relations between the closed regions,
Further, the data is composed of two independent data parts, a part represented by the combination of colors and a part represented by a combination of inclusion relations between the closed regions. Closed region inclusion type code symbol. The closed region inclusion type code symbol according to claim 21,
One of the portion represented by the combination of colors and the portion represented by the combination of inclusion relations between the closed regions represents data, and the other represents check data of the data. Closed area inclusion type code symbol. The closed region inclusion type code symbol according to claim 21,
One of the part represented by the combination of colors and the part represented by the combination of inclusion relations between the closed regions represents data, and the other represents the reading specification of the data. Closed area inclusion type code symbol. The closed region inclusion type code symbol according to claim 21,
One of the part represented by the combination of colors and the part represented by the combination of inclusion relationships between the closed regions represents a product type, and the other represents production management data of the product, A closed region inclusion type code symbol representing contents of the product. The closed region inclusion type code symbol according to claim 21,
The part represented by the combination of colors and the part represented by the combination of inclusion relations between the closed areas represent one of the student's schools, and the other represents the student's student ID number, A closed region inclusion type code symbol representing an attribute of the student. The closed region inclusion type code symbol according to claim 21,
One of the part represented by the combination of colors and the part represented by the combination of inclusion relationships between the closed regions represents data, and the other represents interpolation data of the data. Closed area inclusion type code symbol. The inclusive code symbol of claim 21,
One of the part represented by the color combination and the part represented by the combination of inclusion relations between the cells represents data, and the other represents correction data of the data reading specification. An inclusive code symbol characterized by The closed region inclusion type code symbol according to claim 17,
A closed region inclusion type code symbol, wherein the inclusion relationship between the entire closed region and another predetermined closed region is fixed. The inclusive code symbol of claim 28,
The closed region inclusion type code symbol, wherein the attached color is fixed to the entire closed region in which the inclusion relation is fixed and the other part of the predetermined closed region. A method for reading a closed region inclusion type code symbol according to any one of claims 17 to 29,
A maximum value is defined for the number of layers representing the depth of the inclusion relationship, and when there is a closed region of a deep layer exceeding the maximum value, the closed region excluding the closed region of the deep layer is included. A closed region inclusion type code symbol reading method, comprising: obtaining data represented by the closed region inclusion type code symbol.   An article to which the inclusion type code symbol according to any one of claims 1 to 15 is attached.   An article to which the inclusion type code symbol according to any one of claims 17 to 29 is attached. A method for registering an inclusive code symbol according to any one of claims 1 to 14 in a reader.
Capturing the inclusive code symbol to be registered to obtain image data;
Obtaining the color of the part indicated by the user as the color of the inclusive code symbol in the image data;
Cutting out and registering the inclusive code symbol to be registered based on the instructed color; and
Registering the color used by the registered inclusion type code symbol and the color space to be determined as the color in association with the inclusion type code symbol;
An inclusive code symbol registration method comprising:

Images