WO2010029933A1

WO2010029933A1 - Method for marking color sequence to article

Info

Publication number: WO2010029933A1
Application number: PCT/JP2009/065712
Authority: WO
Inventors: 昭輝木村
Original assignee: ビーコア株式会社
Priority date: 2008-09-09
Filing date: 2009-09-09
Publication date: 2010-03-18
Also published as: JP2010066927A

Abstract

Realized is a code system wherein a color sequence usable as an optical automatic recognition code representing data by means of the order of colors is continuously marked on an article such as a cord and the same correct data can be read even if any cell of the color sequence is started to be read. The color sequence (code symbol) is determined so that cyclic codes of the color sequence also represent the same data. The cyclic codes are color sequences determined by shifting (rotating) the code symbol in such a way that the cells are cyclic. When a color sequence is composed of six cells, five cyclic codes are determined from the color sequence. Since six color sequences in total represent the same data, the data can be correctly read even if any cell is started to be read when the color sequences are continuously marked.

Description

[Name of invention determined by ISA based on Rule 37.2] Method of attaching color arrangements to articles

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 present inventor has been conducting 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 the size and shape. 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.

Thus, the present invention relates to an optical automatic recognition code, and more particularly to a technical improvement in the case of using a color arrangement as an automatic recognition code.

The conventional automatic recognition code based on a color arrangement (such as a 1D color bit code) is based on the idea of recognizing only a certain color order and expressing data with this. That is, this order is converted into data. In general, in such an automatic recognition code, it is necessary to determine a reading start position in the reading rule.

(* "1D color bit code" and "color bit code" are product names and unique names of the applicant's automatic recognition code)
That is, in the case of an automatic recognition code based on a normal color array, the end points of the color array are clear, and after the color is recognized as an image, the color array is read from the end points and converted into data. .

Further, in the example of the automatic recognition code filed earlier by the inventor, even if the end points are not always clear, if the number of constituting cells (the number of color ranges) is specified, the end points are estimated and the data It is also possible to convert to. However, in this case, a certain redundant portion determined by the rule is required in the color array.
* Here, a cell refers to a color area to which a predetermined color is added.

On the other hand, products such as electric wires may mark the color arrangement endlessly in the longitudinal direction. In such a case or a case where the end points are closed to form a closed loop such as a strap, it is conceivable that the portion that can be actually read is a small part of the marked code.

In such a case, it is rare that the read portion coincides with the start point and end point of the code. In addition, when redundant cells (such as CRC code) are arranged near the start point or end point, this redundancy usually increases according to the amount of data. When the readable part is limited, the redundant cell is blocked. It is expected that there are cases where all the important data cells cannot be read.

The inventor of the present application has invented an automatic recognition code that temporally connects color changes and expresses data by the changes, and has filed a separate application (Japanese Patent Application No. 2008-212973, etc.). However, with this automatic recognition code, it is possible to know the data only after recognizing the color change of the color emission. In the case of this color change, by recognizing data with a small number of cells, it is possible to shorten the time from the start of reading until the data is returned (referred to here as turnaround time), but error detection / correction, etc. In the case where there are a large number of redundant cells for this purpose, this time (turnaround time) may be disadvantageous.

When data cannot be read due to data cell damage, etc., it is generally necessary to read another data portion that is not damaged, but this complicates the operator's work and greatly impairs practicality. Can be easily imagined.

Explanation of Terms The automatic recognition code based on the color arrangement is a kind 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 stamped is often called marking in consideration of substantial aspects.

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.

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”.

In addition, colors other than the marking color are particularly called “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 technical RAID apparatus that records a production date, a serial number, and the like by providing a barcode on the inner periphery of an optical disc that uses trellis coding based on the Hamming distance.
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 of the present invention is to obtain a color array (code) that can return predetermined data without particularly setting the starting point of continuous cells (colors). .

(1) In order to solve the above-described problem, the present invention is a color array that expresses predetermined data by arranging m cells each having a predetermined color, and is configured so that cells of the same color are not adjacent to each other. In the color arrangement, when the m color arrangements are repeatedly and continuously arranged, the color arrangement composed of m consecutive cells at arbitrary positions is always the same data among the repeated color arrangements. It is a color arrangement characterized by expressing. Here, the m is an integer of 2 or more.

(2) Further, in order to solve the above-described problem, the present invention is a color array light emitting method for expressing predetermined data by emitting predetermined colors m times in order, and the same colors are not continuously emitted. In the color array light emitting method configured as described above, when the m times of light emission are repeatedly and continuously emitted, the continuous color light emission sequence is started at an arbitrary timing. The color array light emitting method is characterized in that a sequence of colors emitted m times always represents the same data. Here, m is an integer of 2 or more.

(3) Further, the present invention provides the color array described in (1), wherein the first color array representing the first data and the second data representing the second data different from the first data. The color arrangement is a color arrangement characterized in that the Hamming distance between them is n or more. Here, n is a positive integer.

(4) Further, in the color arrangement according to (3), the present invention obtains a hamming distance between colors of each digit in the color arrangement for each digit, and calculates a sum of the obtained hamming distances between the color arrangements. The color arrangement is characterized by a Hamming distance.

(5) Further, in the color arrangement described in (4), the present invention is configured such that an order is set for the color group used in the color arrangement, and the distance between the colors according to the order is the Hamming distance between the colors. It is a color arrangement characterized by the following.

(6) Further, the present invention is the color arrangement described in (3), wherein the n is 3.

(7) In order to solve the above-described problem, the present invention is a color array that expresses predetermined data by arranging m cells each having a predetermined color, and is configured so that cells of the same color are not adjacent to each other. In the color array, the color array obtained by cyclically replacing the color array representing the predetermined data for the cell also represents the predetermined data, and the color array group representing the predetermined data is grouped as a replacement group for the cell. It is a color arrangement characterized by that. Here, m is an integer of 2 or more.

(8) Further, according to the present invention, in the color array described in (7), a color group to be used is set in order, and the color array representing predetermined data is circulated and replaced based on the order of colors. The array represents another data different from the predetermined data, and belongs to a group as a replacement group for the color representing the other data.

(9) The present invention is the color array according to (1), wherein the color array represents the same data as when read in the reverse order and when read in the reverse order. .

(10) According to the present invention, in the color array described in (1), when the color array represents other data different from the case of reading in the normal order when the reverse order is read, the color in the reverse order is displayed. The color arrangement is characterized in that the arrangement is excluded from the available color arrangement group.

(11) Further, the present invention provides the method for attaching the color arrangement according to any one of (1), (3) to (10) to an article, wherein the predetermined color arrangement is continuously arranged in a line. An arrangement step of attaching to the article a color array characterized by comprising:

(12) Further, the present invention is a method for attaching a color array to an article, wherein the color array according to (11) is attached to the article, wherein the row is a straight line or a curve.

(13) Further, in the method of attaching the color arrangement described in (11) or (12) to an article, the present invention applies the arrangement step to each of the plurality of color arrangements, and A method of applying a color arrangement to an article, wherein the arrangement includes arranging the arrangement in a row, and the columns for each color arrangement are arranged on the article in parallel with each other.

(14) Further, the present invention provides the color array light emitting method according to (2), wherein the first color array emitted to represent the first data is different from the first data. The second color array emitted to represent data is a color array light emitting method characterized in that a Hamming distance between them is n or more. Here, n is a positive integer.

(15) Further, the present invention provides the color array light emitting method according to (14), wherein a Hamming distance between colors of each cell in the color array is obtained for each digit, and a total sum of the obtained Hamming distances is obtained in the color array. A color array light emitting method characterized by a hamming distance between them.

(16) Further, in the color array light emitting method according to (15), the present invention is configured such that an order is set for the color group used in the color array, and a distance between the colors according to the order is set between the colors. A color array light emitting method characterized by a Hamming distance.

(17) Further, the present invention is the color array light emitting method according to (14), wherein n is 3.

(18) Further, the present invention is an article provided with the color arrangement described in any one of (1), (3) to (10).

As described above, according to the present invention, an automatic recognition code that can express and read data without adopting a starting point is adopted, so that an optical automatic recognition is performed on a string-like article such as an electric wire. A code can be continuously attached (marked), and a highly convenient optical automatic recognition code can be realized.

It is explanatory drawing explaining the concept of a cyclic code. In the case of a 6-cell color arrangement, it is an explanatory diagram showing an example in which color arrangements that have the same value when a cyclic arrangement is created are grouped, resulting in 14 groups. It is a conceptual diagram of a Hamming distance. It is explanatory drawing which shows the Hamming distance between groups in the case of a 6-cell color arrangement | sequence. It is explanatory drawing which shows the mode in the case of the group B + group C1 which is one of the methods of taking the group in the case of obtaining the combination whose Hamming distance is 3 or more. (A) is explanatory drawing which shows a mode when the string-like object is continuously marked, (b) is explanatory drawing of the case which light-emits a color sequentially in time, (c) These are explanatory drawings which show a mode in the case of reading the automatic recognition code | cord | chord which was marked in multiple rows | lines on the article | item through the window which has a fixed width (marked). It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. It is the table | surface which formed the group by the color arrangement | sequence which becomes the same value also in the case of 12 color arrangement | sequences, and showed the structure of those groups. 7 is a table in which, among the groups in the 12-color arrangement shown in FIGS. 7 to 8, groups having an intra-group hamming distance of less than 3 are indicated by crosses. FIG. 9 is a table showing inter-group Hamming distances for groups in which the intra-group Hamming distance is less than 3 among the groups in the 12-color arrangement shown in FIGS. It is a table | surface which shows all 45 color arrangement | sequences which comprise each group which shows the upper left part of FIG. It is the table | surface which also showed the arrangement | sequence when each color arrangement | sequence (code symbol) shown in the table | surface of FIG. 15 is called in reverse order.

10 Shutter 12 Window

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

In this case, the “array” of colors is an arrangement of colors in a predetermined row, and may be linear or curved. This color array represents data by the arrangement of the colors, and is used as a so-called automatic recognition code. In this case, n, m, k, etc. are positive integers unless otherwise specified.

In the present invention, the above problem is solved by coding a cyclic arrangement of color arrangements. The cyclic arrangement refers to all color arrangement groups obtained by rotating the color arrangement code in a cyclic manner, the details of which will be described later with reference to FIG.

In the present invention, data Da returned by the color array A1: Ak from a cell at an arbitrary position in the color array group (referred to as A1) to a cell Ak after a predetermined number k of cells is returned from an arbitrary cell B1. This means that the color array B1: up to the cell Bk after passing through a predetermined number k of cells is an array having the characteristic that it is equal to the data Db returned by Bk.
The above problem is solved by using a color arrangement group having such properties.

In this embodiment, a color arrangement group is formed by continuously arranging color arrangements composed of k cells. Since the cyclic arrangement of the color arrangement is also configured to represent the same data as the original color arrangement, it is possible to restore correct data no matter where the color arrangement group starts to be read.

This means that, for example, in data represented by normal binary numbers (0, 1), the number of rounds as shown in FIG. 1 is regarded as the same value.
FIG. 1 shows a conceptual diagram of coding using a cyclic array. In FIG. 1, the concept is described using “0” and “1” instead of an example using colors.

For example, in FIG. 1, “10000000”, “01000000”, “00100000”, “00010000”,... Rotated one bit at a time for the code “00000001” is a cyclic array. As described above, by regarding all of these as the same value, it is possible to obtain a code system that can read data correctly from any position.
In FIG. 1, the concept of the cyclic arrangement is described using numerical values (0, 1), but the same applies to colors.
In FIG. 1, for example, a code string of 00000101 is
00000101000001010000010100000101 ...
It is assumed that “00000101” is “repeatedly arranged”.

* Color array-> numerical conversion method By the way, there are various ways to replace the color array with numerical values, each with its own characteristics.

These are described below. As a typical method, first, there may be an idea of adopting a numerical value represented only by color transition. Secondly, there seems to be an idea of using the starting color. These ideas are originally devised by the present inventors.
For convenience of explanation, an example using the start color will be described.

1. Use of starting color (fixed + prefix numerical system)
As described above, when data is expressed only by color transition (transition digitization method), there are many cases where three different color arrays return the same value because of the start color.

Therefore, for example, as a method of replacing RGB with numerical values,
There is a replacement method in which R = 0, G = 1, and B are equivalent to the prefix numbers. When colors are assigned to numerical values in this way, continuity of the same colors can be prevented, and adjacent cells can always have different colors, making reading easier.

For example, when 0s are continuous, it is only necessary to arrange the colors RBRB... And the same color will not be continued. When 1 is continuous, it is only necessary to arrange colors GBGB... In this case, the same color is not continued.
Applying such an allocation method, the above color arrangement is
Fixed + prefix numerical system RGBRBG RGBRBG RGBRBG
... → 100110 100110 100110
GBRGRB GBRGRB GBRGRB
... → 001011 001011 001011
BRGBGR BRGBGR BRGBGR
... → 110001 110001 110001
It becomes.

2. Concept of adopting numerical values expressed by color transition (transition numerical system)
As described above, it is possible to replace the color transitions with numerical values of 0 and 1 as they are. By repeatedly arranging these numerical values, a continuous code corresponding to a cyclic code can be represented.
At this time, the data can be known by taking in the numerical values for the known number of digits from an arbitrary starting point of the continuous code. In this case, since the actual signal is a color array, the numerical values that can be expressed as described above are limited.

Transition numerical system Different color arrangements can be used depending on the starting color. For example,
“0” is represented by changes of R → G, G → B, and B → R.

“1” is represented by changes of R → B, B → G, and G → R. Then, the numerical value can be restored from the color array as follows. That is,
RGBRBG RGBRBG RGBRBG ... → 000111000111000111
GBRGRB GBRGRB GBRGRB ... → 000111000111000111
BRGBGR BRGBGR BRGBGR ... → 000111000111000111
Thus, it can be seen that different values are returned while maintaining the characteristics of the number of rounds.

Color array and numerical array In this way, the color array can be associated with binary “0, 1” data (= numerical data). However, when this is repeatedly arranged, the color array and the numerical array The following relationship arises between

◆ Relationship between color array and numerical data (1)
For example, consider the numerical data 00001. If you repeat this,
00001 00001 00001...

Here, when 00001 is represented by a color arrangement in the above-described transition numerical system, when the head is set to R,
RGBRBG (∵RG = 0, GB = 0, BR = 0, RB = 1, BG = 1)
It becomes. So, if you repeat this color arrangement,
RGBRBG RGBRBG RGBRBG RGBRBG
It becomes.

By the way, when this repeated color array is replaced (converted) with a numerical value, it is assumed that 00001 “1” 00001 “1” 00001 “1”.
Then, another number “1” appears. Here, the above “” is inserted to mean another number that appears separately.

As can be understood from this example, the numerical repeating arrangement of 0101 cannot be represented by a color arrangement, but 000111 can be represented. This means that the numerical array that can be represented by the repeated arrangement of the color array has certain restrictions.

As described above, when 00001 is repeatedly arranged in the color arrangement and converted again into a numerical value, 00001 “1” is repeated, and this color arrangement becomes RGBRBGR.
As can be easily understood, when the numerical values are expressed in a color arrangement, if the first color (in this case “R”) and the last color (in this case “R”) are equal, as described above, It means that another number does not appear, and the numerical value can be normally repeated repeatedly.

Considering such conditions as numerical data,
In a sequence consisting of i “0 (numerical values)”, the final colors are G (i = 1), B (i = 2), R (i = 3),
G (i = 4), B (i = 5), R (i = 6),.
It becomes. On the other hand, “1 (numerical value)” is opposite to the case where the progression (transition direction) of RGB is “0”. Therefore, if the number of “1” included in the numerical value is m, it is clear that
G (im = 1), B (im = 2), R (im = 3),
G (im = 4), B (im = 5), R (im = 6),...

It becomes. That is, if the number of digits in the sequence is k and the number m of “1 (numerical values)” is included,
(K-2m) mod 3 ≡ 0
Satisfying the condition is a condition that can be expressed when the numerical sequence is arranged by repeating the color arrangement.

In addition, in the case of the fixed + prefix numerical system described above, for example, 00110 is RBGBR, but if this is repeatedly arranged,
RBGBR RBGBR RBGBR
It turns out that R overlaps. In other words, in the fixed + prefix numerical system, it is found that the color arrangement cannot be repeated when the front end and the end are the same value and the previous one is a different value.

In detail, it is as follows.
First, the tip color is determined to be R if it is 0 and G if it is 1.
Consider the case where the tip value is zero. In this case, the color at the tip is R. Similarly, in order for the end to be R, the numerical value of the end must be 0. If the end is 1, the end color will be G or B.

Even if the terminal is 1, if the value immediately before the terminal is 0, the terminal may be B indicating the same value. Therefore, when the position immediately before the end is not 0, the same color as the tip is always obtained.
Thus, in the case of adopting a color arrangement system that does not allow the same color to continue, generally, it is not possible to replace all the repeated numerical value arrangements with a color arrangement.

◆ Relationship between color array and numerical data (Part 2)
By the way, when 000111 is represented by a color array using the above-described transition numerical system, the representation method is RGBRBGR as described above.
First of all. But besides that,
GBRGRBG and BRGBGRB
There is also a way of expressing that.

Therefore,
000111000111000111 ...
The color arrangement that represents is RGBRBG RGBRBG RGBRBG ...
GBRGRB GBRGRB GBRGRB ...
BRGBGR BRGBGR BRGBGR ...
There are three types.

When this color arrangement is recognized cyclically, recognition is performed as follows. Recognizing cyclically means that the start point is sequentially shifted and read to perform recognition.
When the recognition is started from the first R, when the recognition is started from the next G, the recognition is performed by sequentially shifting the starting point as in (...). An example recognized in this way is shown below.

RGBRBG RGBRBG RGBRBG ... → 000111000111000111
GBRBG RGBRBG RGBRBG ... → 00111000111000111
BRBG RGBRBG RGBRBG ... → 0111000111000111
RBG RGBRBG RGBRBG ... → 111000111000111
BG RGBRBG RGBRBG ... → 11000111000111
G RGBRBG RGBRBG ... → 1000111000111

GBRGRB GBRGRB GBRGRB ... → 000111000111000111
BRGRB GBRGRB GBRGRB ... → 00111000111000111
RGRB GBRGRB GBRGRB… → 0111000111000111
GRB GBRGRB GBRGRB ... → 111000111000111
RB GBRGRB GBRGRB ... → 11000111000111
B GBRGRB GBRGRB ... → 1000111000111

BRGBGR BRGBGR BRGBGR ... → 000111000111000111
RGBGR BRGBGR BRGBGR ... → 00111000111000111
GBGR BRGBGR BRGBGR ... → 0111000111000111
BGR BRGBGR BRGBGR ... → 111000111000111
GR BRGBGR BRGBGR… → 11000111000111
R BRGBGR BRGBGR… → 1000111000111

As described above, the numerical values are a repetitive arrangement of the same numerical values, and the colors do not appear in succession. That is, it will be understood that the arrangement is such that different colors always appear in adjacent cells.
Further, in the fixed + prefix numerical system, a pattern in which the color arrangement of the portion differs depending on the starting situation as shown below. In the following example, “the part” is clarified by adding “”.

000111000111000111
... → "RBR" GBG RBRGBG RBRGBG
00111000111000111
... → "RB" GBG RBRGBG RBRGBG
0111000111000111
... → "R" GBG RBRGBG RBRGBG
111000111000111
... → "GBG" RBRGBG RBRGBG
11000111000111
... → "GB" RBRGBG RBRGBG

As described above, the same repeated numerical value array may be represented by a plurality of different color arrays.

Therefore, the following situations will be considered in the text.

(1) Consider a case of adopting a color arrangement pattern that does not allow continuous equivalence (same color is continuously assigned to a plurality of cells).
(2) When the above pattern is adopted, a system is adopted in which all cyclic arrays are regarded as the same data when the code symbols are repeatedly arranged.

Under the circumstances (1) and (2),
(A) Property of cyclic color array (B) Data conversion of cyclic color array will be discussed and explained in detail below.

* Specific properties of the cyclic color arrangement The color arrangement composed of three kinds of colors (R, G, B) is described below.

“Specific Example 1” Example of 6-cell color arrangement Here, the 6-cell color (array) is a color array configured by arranging 6 cells, and is an example such as RGRGBG, RGRGBG, RGRGBG, and the like. It is a condition and feature that the end (underlined part) is a different color.
In the case of such a 6-cell color arrangement, there are 14 patterns shown in FIG. 2 that do not have the same value even if a cyclic arrangement (step of creating a cyclic code) is performed. That is, 14 types of data can be represented.

By the way, in the present invention, as described above, the cyclic arrays are regarded as equivalent. This ensures that the correct value is always obtained no matter where you start reading.
The specifications that do not change even if cyclic replacement is performed are the number of cells of each color and the cell interval arrangement, and it is considered appropriate to classify the color arrangement based on this. In FIG. 2, the 14 code symbols are classified into groups from such a viewpoint.

In the table of FIG. 2, the meaning of each grouping is as follows: Group A: RGB each of two colors, and each color interval (number of cells between them) is 1, 3
Group B: 2 colors for each of RGB, and the interval between each color (the number of cells between them) is 2, 2
Group C: 3, 2, and 1 RGB. (However, in random order)
However, C-1 and C-2 are cyclic permutation groups for each color.

Group 0: Consists of only two colors of RGB (this group is omitted in the following discussion).
According to this way of thinking, the color order is not taken into account, so each group is replaceable with respect to the color. Actually, each group shown in FIG. 2 is a cycle that can perform color replacement (change) of R → G, G → B, B → R, or R → B, G → R, B → G. It will be understood that this is a replacement group, and the replaced code symbol group and the code symbol before replacement are closed for each group. That is, these code symbols form a so-called substitution group.

In addition, the groups C1 and C2 are mirror images of each other (replacement of only R ← → G, G ← → B, and B ← → R). On the other hand, each of the groups C1 and C2 is closed as a cyclic replacement group.

Also, it will be understood that the group C1 + C2 has no group and is closed with respect to the replacement in which any pair of colors is replaced.

* In the present invention and this embodiment, "cyclic substitution" is used as a word meaning cyclic substitution of sequences, and "cyclic substitution" is defined as R → G, G → B, B → R. It is used as a term for the cyclic substitution of such constituent species.

To put it simply, shifting the position of each cell constituting the array cyclically is called cyclic replacement, and changing the color (in a predetermined order) is called cyclic replacement.

In order to accurately recognize the color arrangement at the Hamming distance, it is desirable that the difference (Hamming distance) between the color arrangements is large.
What is characteristic in the present embodiment is that (hamming) distance is defined between colors. As a result, it is possible to discuss numerically the detection accuracy in the automatic color recognition code.

The Hamming distance between the color arrangements is the sum of the digits of the color arrangements, the distance between the colors obtained for each digit. The distance between colors is preferably determined by providing an order between the colors and determining the distance between the colors according to the order. That is, if the colors are adjacent in that order, the Hamming distance is set to 1. If there is another kind of color between them, the Hamming distance between these colors is 2. Of course, in the case of the same color, the Hamming distance is zero.
That is, it is preferable to set the “distance” to the number of colors +1 between one color and another color + 1.

Therefore, when three colors (for example, RGB) are used, the Hamming distance is 0 for the same color, but the Hamming distance is 1 for different colors. Similarly, when three colors (for example, RGB) are used, the Hamming distance between the color arrangements is the number of digits that are different colors by comparing the digits of the color arrangements.

However, in the present invention, since the cyclic codes are all regarded as the same, the minimum hamming distance between the cyclic arrays of each data (automatic recognition code symbol) is regarded as the hamming distance of the data (representing automatic recognition code symbol).

For example, the Hamming distance of the RGBRBG and GBRGRB color arrays is compared with the RGBRBG and GBRGRB cyclic code groups, and the smallest value is defined as the Hamming distance of the RGBRBG and GBRGRB color arrays.
Examples of RGBRBG and GBRGRB are shown below. The underline is underlined where the digits do not match.

RGBRBG is compared with the following cyclic code group.

↓ ↑

GBRGRB

Hamming distance 6
↓ Cyclic B GBR

GR

Hamming distance 3 The code above is cyclically shifted to the right (ROTATE)
↓ cyclic R BGBR G Hamming distance 4 similar ↓ cyclic GR B G B

R

Hamming distance 4 similar ↓ cyclic RG

RBGB

Hamming distance 4 similar ↓ cyclic BRG RBG Hamming distance 3 similar, and the minimum distance is "3". Therefore, the Hamming distance between RGBRBG and GBRGRB is “3”.

◆ Relationship between error handling and groups In the automatic recognition code proposed in this embodiment, the cyclically replaced code symbols are also treated as representing equivalent data.
That is, the group of the color arrangement described above is not affected by the cyclic replacement, and this group is essential in correspondence with the data. That is, the group directly corresponds to the data.
Therefore, even in error handling, it is efficient to select the color arrangement to be used based on the Hamming distance between groups. If this Hamming distance is large, an error is detected, and in some cases, correction may be possible.

-Hamming distance between groups First, as described above, colors are permutable in each group. Therefore, the Hamming distance between each group (all the constituent elements) becomes clear by examining the relationship between one constituent element of one group and the other group.

For example,
Group A (A1, A2, A3, A4, A5, A6)
← → Group B (B1, B2, B3, B4, B5, B6)
The relationship between A1 ← → B1, A1 ← → B2, A1 ← → B3, A1 ← → B4, A1 ← → B5, A1 ← → B6 may be examined.

Here, A1, A2, A3, A4, A5, A6 are code symbols that are members of group A. On the other hand, B1, B2, B3, B4, B5, and B6 are code symbols that are members of group B.

-Hamming distance within a group Next, the hamming distance within a group is demonstrated.
In the same group, the hamming distance in the group becomes clear by examining the relationship between one member (code symbol) of the group and the other member (code symbol) in the same group.

For example, in the case of group A (A1, A2, A3, A4, A5, A6) A1 ← → A2, A1 ← → A3, A1 ← → A4, A1 ← → A5, A1 ← → A6
Here, “a condition that satisfies a predetermined hamming distance as a whole” (a condition that guarantees a predetermined (minimum) hamming distance as a whole) is that both the hamming distance between groups and the intra-group hamming distance satisfy the condition ( There is always a Hamming distance that is greater than the minimum Hamming distance).

This conceptual diagram is shown in FIG. In FIG. 3, a portion indicated by a white bidirectional arrow means that the hamming distance between groups is equal to or greater than a certain value (minimum hamming distance). A group indicated by a white circle means that the intra-group hamming distance is equal to or greater than a certain value (minimum hamming distance).
In the range indicated by X in FIG. 3, the Hamming distance is guaranteed between all the color arrangements. Therefore, if an automatic recognition code system is constructed and used using a code in the range indicated by X, a code system with a guaranteed minimum Hamming distance can be used, and a code that is resistant to errors is used. be able to.

For example, in the case of a 6-cell color arrangement, the Hamming distance between the groups described above is as shown in the table of FIG. As described above, the Hamming distance may be 2 or less between the groups A and B, between the groups A and C, and between the groups C1 and C2.

Therefore, for example, when it is desired to obtain a combination with a Hamming distance of 3 or more,
・ Group B + Group C1, or
・ Group B + Group C2
Can be read from FIG. In this case, a total of five color arrangements can be obtained, that is, two color arrangements of group B and three color arrangements of group C1 or C2. The situation in the case of group B + group C1 is shown in FIG.

◆ Symmetry By the way, depending on the application range and use of the automatic recognition code, for example, it may be necessary to assume that a string-like object is repeatedly arranged in color.
In this case, it is difficult to distinguish the beginning and the end from a part cut out from the color array (group) marked repeatedly.
Therefore, in the use of the string-like object, the reverse order of the color arrangement obtained as shown in the above table cannot be matched with the normal order of the other color arrangements.
Now, in the data of the table of FIG. 5, the two color arrangements of group B have such a relationship (relation that the reverse order matches the normal order of other codes).

That means
→ BGRBGR = BRGBRG ←: (Arrows indicate reading order)
It is clear that

In such a case, when BGRBGR = BRGBRG is considered, it can be used as a code system having four values as a whole (though it is one less than the example in FIG. 5).

It should be noted that such matters need not be taken into account when, for example, the case where the colors are emitted sequentially in time or when the normal / reverse relationship of the marking is known in advance. An explanatory view of this state is shown in FIG.

FIG. 6 (a) shows an explanatory diagram of a state in which the string-like object is continuously marked. As shown in FIG. 6A, the direction of the cord is different between the case of looking at this side of the string and the case of looking at the other side.

FIG. 6B shows an explanatory diagram of a case in which colors are emitted in order in time. Unlike the case where the colors are arranged in the space, the color is changed (arranged) in time, so that the order is not reversed unlike FIG.

FIG. 6 (c) is an explanatory diagram showing a state of reading an automatic recognition code marked (attached) in multiple rows on an article through a window 12 having a certain width. ing. This window 12 is a U-shaped notch formed in the shutter 10, and a portion visible through this window is a reading range. In this way, it is also conceivable to increase the number of data by repeatedly arranging the color array.

“Specific Example 2” Example of 12-color arrangement The case of the 12-color arrangement is shown in the table in the same manner as the case of the 6-color arrangement. This table is shown in FIGS. In the case of a 12-color arrangement, groups as shown in these tables are configured. These groups have different color numbers and intervals, and each group is closed in a component color replacement operation and forms a replacement group.

Investigating each of these groups, a group with a hamming distance within group of less than 3 is indicated by a cross in the table shown in FIG. Here, the x mark represents an intra-group Hamming distance of less than 3.

Next, as shown above, the Hamming distance between one component (color arrangement) in each group and another group was examined. The results are shown in the table of FIG.

In FIG. 14, the group in which the hamming distance is already less than 3 in the group is excluded, and the hamming distance between the hamming distances of 3 or more is obtained and shown in FIG. In the table of FIG. 14, the hamming distance between groups is less than 3 in gray (gray). White squares represent a Hamming distance of 3 or more.

In the table of FIG. 14, a certain region where a gray square is not present in the upper left corner is observed. In this area, it is indicated that all constituent groups have a Hamming distance of 3 or more (

groups

4131, 4222, 25b, 4121a, 6a, 4111b, 324d, 322d). (* The “name” of the group is given by the inventors of the present application for convenience.)
Therefore, all 45 color arrangements (see the table in FIG. 15) constituting these (

groups

4131, 4222, 25b, 4121a, 6a, 4111b, 324d, 322d) are hamming distances of 3 or more with each other even if cyclic replacement is performed. Keep.

Reverse Incidentally, the table also shows the sequence when called in reverse order each color sequence (code symbol) shown in the table of FIG. 15 is shown in Figure 16.

In the table of FIG. 16, the group 4131 can be used as it is because the color arrangement order does not change even if reverse reading is performed. The

groups

4122 and 4121a return the same value as other color arrays in the same group by reverse reading. Therefore, as shown below, each pair may be treated as representing one data.

The group 4122 includes six color arrays, but if each group is paired to represent one piece of data, a total of three types of data can be represented.

4122 (1) and 4122 (6) form a pair 4122 (2) and 4122 (4) form a pair 4122 (5) and 4122 (3) form a pair Group 4121a is the same is there.

In addition, since the groups of 324d and 322d become elements of different groups (color arrangement) when reversed reading is performed, it cannot be used in applications where reverse order reading must be considered.

Therefore, in the examples shown in Tables 15 and 16, when reverse reading is considered, the number of data that can be expressed is as follows.
4131 group: 3 4122 group: 3 25b group: 3 21b group: 6 4121b group: 3 6a group: 3 4111b group: 6
Thus, a total of 27 types of data can be expressed.

Summary / Modifications Various examples of the color arrangement used as the automatic recognition code have been described above.

(1)
According to the present embodiment, since a cyclic code is used, a color array that can read data correctly from anywhere can be obtained.

Also, it was proposed to set the Hamming distance between the color arrangements to be used above a certain value. By guaranteeing the minimum value of the Hamming distance, it is possible to contribute to error detection and the like.

In addition, a configuration has been described in which even if the color arrangement is called in the reverse order, another data is not read by mistake.

(2)
A value of about 3 is appropriate as the value of the Hamming distance described above. A Hamming distance of 3 is useful for error detection and correction. On the other hand, if this value is too large, the code utilization efficiency may deteriorate, and it may be difficult to efficiently represent data.

(3)
So far, examples of using a color arrangement as an automatic recognition code have been mainly described. This color arrangement is mainly described as being arranged in a straight line, but as long as the series can be traced, it may be bent like a curve, or bend at a right angle, etc. It does not matter if there is a “break”.

In particular, when attached to a string-like article, the color arrangement also bends when the string is bent, but there is no problem because the data can be restored if the color order can be recognized.

(4)
A region to which each color constituting the color array is attached is called a cell symbolically. In other words, the color array is configured by arranging cells with predetermined colors. This cell is a concept on a symbol representing a place where colors constituting a color array are given. Of course, the actual cell is a physical region / part on the surface of the article and coated with ink of a predetermined color. Cells are often referred to as digits.

(5)
It was proposed above that when the color array is read in reverse order, the reverse color array is also grouped to represent the same data.

However, it is also preferable to simply “do not use” the reverse color arrangement.

(6)
The configuration in which two rows of color arrays are provided has been described above. If two columns are provided, the amount of data that can be represented is doubled. Although the example of two rows has been described above, it may be three rows or more. The amount of data can be increased according to the number of columns.

Note that it is preferable that each column is parallel to each other in view of reading effort. However, it is also preferable to intentionally break the parallelism from the viewpoint of design. Alternatively, it may be preferable in terms of design to combine a straight line and a k line.

(7)
In the example described above, an example in which an automatic recognition code is configured by attaching a color array to an article that is mainly tangible has been described.

In such an example, colors are arranged in space.

As described above, it is also preferable to arrange colors on the time axis. Also in this case, the same contrivance as in the case of arranging in space can be made, and the same effect can be obtained.

However, when the colors are sequentially emitted on the time axis, it is unlikely that they will be read in the reverse order. Therefore, it is often unnecessary to deal with the reverse order described above in the case of color emission on the time axis.

In particular, when light is emitted in order on the time axis, it is harder to detect than when the start point is space. Therefore, the utility of the present invention may be higher when light is emitted along the time axis than when colors are arranged in space.

Claims

In a color array in which m cells each having a predetermined color are arranged to express predetermined data, the color array configured so that cells of the same color are not adjacent to each other,
When the m color arrays are repeatedly and continuously arranged, among the repeated color arrays, the color array including m consecutive cells at arbitrary positions always represents the same data. Characteristic color arrangement. Here, the m is an integer of 2 or more.
In a color array light emitting method configured to emit predetermined m colors m times in order to express predetermined data, the color array light emitting method configured so that the same color is not continuously emitted,
When the m times of light emission are repeatedly and continuously emitted, among the repeated color light emission columns, a continuous color sequence of m times of light emission starting from an arbitrary timing is always performed. A color array light emission method characterized by expressing the same data. Here, m is an integer of 2 or more.
The color arrangement according to claim 1,
The first color array representing the first data and the second color array representing the second data different from the first data have a Hamming distance of n or more between them. Color arrangement characterized by. Here, n is a positive integer.
4. The color arrangement according to claim 3, wherein a Hamming distance between colors of each digit in the color arrangement is obtained for each digit, and a sum of the obtained Hamming distances is set as a Hamming distance between the color arrangements. Color array.
5. The color array according to claim 4, wherein an order is set for the color groups used in the color array, and a distance between colors according to the order is a Hamming distance between the colors. .
4. The color array according to claim 3, wherein n is 3.
In a color array in which m cells each having a predetermined color are arranged to express predetermined data, the color array configured so that cells of the same color are not adjacent to each other,
The color array obtained by cyclically replacing the color array representing predetermined data for a cell also represents the predetermined data, and the color array group representing the predetermined data is grouped as a replacement group for the cell. Color array to be used. Here, m is an integer of 2 or more.
The color arrangement according to claim 7,
The order of colors used is set,
The color array obtained by cyclically replacing the color array representing predetermined data based on the order with respect to colors represents other data different from the predetermined data, and is included in a group as a replacement group for colors representing the other data. A color array characterized by belonging.
The color arrangement according to claim 1,
The color array represents the same data as when read in the reverse order even when read in the reverse order.
The color arrangement according to claim 1,
When the color arrangement is read in the reverse order and represents other data different from the data read in the normal order, the color arrangement in the reverse order is excluded from the available color arrangement groups. Color array.
A method for attaching the color arrangement according to any one of claims 1, 3 to 10 to an article,
An arrangement step of arranging the predetermined color arrangement continuously in a line;
A method of attaching a color arrangement to an article comprising:
12. A method of attaching the color arrangement of claim 11 to an article,
A method of applying an array of colors to an article, wherein the rows are straight or curved.
In the method of attaching the color arrangement according to claim 11 or 12 to an article,
Applying the arrangement step to each of a plurality of the color arrangements, and arranging the arrangement in the row for each color arrangement;
A method of applying a color array to an article, wherein the columns for each color array are arranged on the article in parallel with each other.
The color array light emitting method according to claim 2,
The first color array emitted to represent first data and the second color array emitted to represent second data different from the first data are between them. The color array light emitting method characterized by that the Hamming distance of is n or more. Here, n is a positive integer.
15. The color array light emitting method according to claim 14, wherein a Hamming distance between colors of each cell in the color array is obtained for each digit, and a sum of the obtained Hamming distances is set as a Hamming distance between the color arrays. Color array light emitting method.
16. The color array light emitting method according to claim 15, wherein an order is set for the color groups used in the color array, and a distance between colors according to the order is set as a Hamming distance between the colors. Color array emission method.
15. The color array light emitting method according to claim 14, wherein n is 3.
An article to which the color arrangement according to any one of claims 1, 3 to 10 is attached.