JP2000082108A - Two-dimensional code recognition processing method, device therefor and medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To make it possible to efficiently and precisely recognize code data from picture data of a two-dimensional code. SOLUTION: In this recognition processing method the picture data of a two-dimensional code picked up by a CCD video camera binarization processed at a step S2 and, next, has a black pixel coupling area decided at a step S3. Then, a logo mark cell part responsible for presentation of a reference of recognition processing and readable information at the same time is detected at a step S10. Corner cells within a specified search range with a logo mark cell part as a reference are detected at a step S12 and code data of the two-dimensional code existing in an area of a code part surrounded by the corner cells is detected. At a step S14, the code data of the detected code data are verified.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a two-dimensional code recognition processing method, a two-dimensional code recognition processing device, and a medium for causing a computer to execute a two-dimensional code recognition processing program. The present invention relates to a two-dimensional code recognition processing method, a two-dimensional code recognition processing device, and a medium for causing a computer to execute a two-dimensional code recognition processing program that enables efficient and accurate recognition of code data from data.

[0002]

2. Description of the Related Art Conventionally, alphanumeric characters indicating the type and condition of an article are converted into a bar code, for example, attached to an article, and the attached bar code is read to read the type and condition of the article. A barcode system that acquires information
Widely used in many industrial fields.

FIG. 20 shows an example of a barcode of this type, which is particularly called a one-dimensional barcode. In this figure, a one-dimensional barcode 500
Is a code portion 501 composed of a combination of bars (black bar portions) having different thicknesses and spaces (blank portions).
Indicates the code coded in the code part 501
An ID (identification number) section 502 is provided. And
In the ID section 502, alphanumeric characters coded in the code section 501 are displayed as readable information. Such a one-dimensional barcode 500 is read by an optical recognition device called a barcode scanner.

[0004]

By the way, the above-mentioned 1
One way to read the dimensional barcode 500 is to use CC
There is a method of reading with a D video camera. For example, if the bar arrangement becomes long with the increase in the amount of information to be coded, it becomes difficult to read the one-dimensional barcode 500 with a CCD video camera.

Therefore, even if the information to be coded becomes large, in order to enable reading by a video camera, the bar of the one-dimensional bar code 500 is used instead.
A code section 601 in which a plurality of black square cells are two-dimensionally arranged according to a predetermined arrangement rule as shown in FIG. 21, and an ID section 60 indicating a code coded in the code section 601
2 has been proposed.

[0006] According to this, since the information is coded two-dimensionally, a larger amount of information can be coded, and more information can be coded than the one-dimensional barcode 500. Even if it is, it can be read by a video camera.

However, when recognizing the two-dimensional code 600 from image data captured by a video camera, the two-dimensional code 600 is difficult to distinguish from dust, dirt, and other images other than the two-dimensional code 600. There is a problem that code data cannot be recognized accurately.

In the two-dimensional code 600 described above, similarly to the one-dimensional bar code 500, the ID part 60
2, although the coded code is displayed by human-readable alphanumeric characters and the like, the two-dimensional code 600 is a code indicating what, and further, what kind of code system is used. It was not possible to identify what kind of arrangement rule the square cells are two-dimensionally arranged.

The present invention has been made in view of such a situation, and is intended to enable efficient and accurate recognition of code data from two-dimensional code image data.

[0010]

According to a first aspect of the present invention, there is provided a two-dimensional code recognition processing method for recognizing a two-dimensional code in which a plurality of rectangular cells are two-dimensionally arranged according to a predetermined arrangement rule.
In the dimension code recognition processing method, a binarization processing step of generating binarized data based on a predetermined threshold value from image information fetched from outside, and a binarization data generated in the binarization processing step. A reference cell detection processing step of detecting a reference cell serving as a reference for recognizing the two-dimensional code based on the reference cell detection processing based on the binarized data generated in the binarization processing step. A corner cell detection processing step of detecting a corner cell existing within a predetermined search range with reference to the reference cell detected in the step, and the binarization data generated in the binarization processing step, Code data for detecting code data assigned to the two-dimensional code existing in the area of the code part surrounded by the reference cell and the corner cell Characterized in that it comprises a data detection processing step.

According to a thirteenth aspect of the present invention, there is provided a two-dimensional code recognition processing apparatus for recognizing a two-dimensional code in which a plurality of rectangular cells are two-dimensionally arranged according to a predetermined arrangement rule. From the image information,
A binarizing unit for generating binarized data based on a predetermined threshold, and a reference cell serving as a reference for recognizing the two-dimensional code based on the binarized data generated by the binarizing unit Based on the binarized data generated by the binarizing means, and a corner existing within a predetermined search range based on the reference cell detected by the reference cell detecting means. A corner cell detecting means for detecting a cell, and the two-dimensional code existing in an area of a code part surrounded by the reference cells and the corner cells based on the binarized data generated by the binarizing means. And code data detecting means for detecting the code data assigned to.

A medium for causing a computer to execute the two-dimensional code recognition processing program according to claim 18 is a medium in which a plurality of rectangular cells are two-dimensionally arranged according to a predetermined arrangement rule.
In a two-dimensional code recognition processing program for recognizing a two-dimensional code, a binarization processing step of generating binarized data based on a predetermined threshold value from image information fetched from outside, and a binarization processing step generated in the binarization processing step A reference cell detection processing step of detecting a reference cell serving as a reference for recognizing the two-dimensional code based on the binarized data;
Corner cell detection for detecting a corner cell existing within a predetermined search range based on the binarized data generated in the binarization processing step with reference to the reference cell detected in the reference cell detection processing step Processing steps;
Based on the binarized data generated in the binarization processing step, code data assigned to the two-dimensional code existing in a region of a code part surrounded by the reference cell and the corner cell is detected. And a code data detection processing step.

A two-dimensional code recognition processing method according to claim 1, a two-dimensional code recognition processing device according to claim 13, and a medium that causes a computer to execute the two-dimensional code recognition processing program according to claim 18, , Based on image information taken in from outside, based on a predetermined threshold,
The binarized data is generated, and based on the binarized data,
A reference cell serving as a reference in recognizing the two-dimensional code is detected. Further, a corner cell existing within a predetermined search range is detected with reference to the reference cell, and a code section surrounded by the reference cell and the corner cell is detected. The code data allocated to the two-dimensional code existing in the area of is detected.

[0014]

Embodiments of the present invention will be described below.

FIG. 1 shows an example of use of a personal computer 1 to which the present invention is applied. Object 100
Is, for example, a business card-shaped card on which a two-dimensional code 101 is attached (including printing).

As shown in FIG. 2, in the two-dimensional code 101, a plurality of square cells (black portions) are two-dimensionally arranged in accordance with a predetermined arrangement rule. For example, in this example, the numeral 200 is coded.

The details of the two-dimensional code 101 will be described below. The two-dimensional code 101 is composed of a logo mark portion 201 and a code portion 202. When the logo mark portion 201 and the code portion 202 as a whole represent a rectangular area of one square cell as one block, A side in the X-axis direction with a length of 7 blocks and a Y with a length of 9.5 blocks
It is arranged in a region formed by the sides in the axial direction (hereinafter, such a region is referred to as a 7 × 9.5 block region. The same applies to other cases).

The logo mark section 201 includes a logo mark cell section 301 and a non-cell section 302 as shown in FIG. In a logo mark cell section 301 which is a rectangular cell of a 7 × 1.5 block area, white readable character information related to a two-dimensional code such as a logo mark, a character, or a number is displayed by printing. ing. Here, for example, as the logo mark, “CyberCod” attached to the code system of the two-dimensional code 101 is used.
For example, what the two-dimensional code 101 means, such as "e", is displayed in white characters as a human-readable mark.

In addition to the logo mark, the name of the company of the applicant who developed the code system of the two-dimensional code 101 is displayed, and the URL indicating the storage location of information resources related to the code system of the two-dimensional code 101 is displayed. (Uniform Resource Loc
ator) may be displayed. UR
L is a notation method for uniquely specifying a storage location of an information resource such as a file distributed on the Internet.

As described above, by displaying the two-dimensional code 101 with a logo mark or the like in the rectangular logo mark cell section 301, information on the logo mark or the like is posted. By referring to a homepage on the Internet or the like, information on the two-dimensional code 101 can be acquired and understood. For example, at the time of filing of the present application, the homepage accessible by the following URL provided by the applicant,
The following explanation is posted. http://www.sony.co.jp/sd/ProductsPark/Consumer/PCO
M / PCG-C1CAT / cybercode.html "" Cybercode "is Sony's unique two-dimensional barcode, with approximately 16.77 million (24-bit) patterns. About 1 million (20 bits) of these can be freely registered for starting arbitrary programs. The remaining code is reserved for future service expansion. "Cyber code" starts from the one with it
Acts as an index for extracting information on the corresponding computer, and when the program is started through the finder of CyberCode Finder, the corresponding information jumps out of the computer as if the "cyber code" was pasted To provide a new interface. "

Next, as shown in FIG. 3, in the 7 × 1 block area on the code section 202 side of the logo mark cell section 301, there is a non-cell section 302 having no cell. The long axis (the axis in the X-axis direction in FIG. 2) of the logo mark cell portion 301 is the side A, and the short axis (the axis in the Y-axis direction in FIG. 2) is the side B.
And

In the code section 202, as shown in FIG.
When the logo mark cell section 301 is positioned downward, the upper left corner cell and the logo mark cell section 3 located 7 blocks upward from the left end of the logo mark cell section 301.
There is an upper right corner cell located 7 blocks upward from the right end of 01. Further, there are a lower left corner cell located one block upward from the left end of the logo mark cell part 301 and a lower right corner cell located one block upward from the right end of the logo mark cell part 301. When it is not necessary to particularly distinguish the upper left corner cell, the upper right corner cell, the lower left corner cell, and the lower right corner cell, these are collectively referred to as corner cells.

There are no cells in three adjacent blocks around the corner cell. That is, it exists at the position as described above with respect to the logo mark cell portion 301,
A cell whose cell does not exist in the surrounding three block areas is a corner cell.

The code section 202 can actually code information of 49 bits (7 blocks × 7 blocks = 49 blocks) assuming that one block is 1 bit. One block) and three blocks around the corner cell do not constitute data. That is, a total of 16 blocks do not constitute data. Of the remaining 33 blocks (33 bits), 9 blocks (9 bits) constitute check data for confirming that the code data is correct code data. Therefore, information of 24 bits is coded in the code section 202.

FIG. 5 shows a specific example of the two-dimensional code 101 described above. In the code part 202 of the two-dimensional code 101 in FIG.
2, 203, 1500, 1501, 1502, and 1
A code pattern in which 503 is coded is printed. The ID section 20 below the logo mark cell section 301
3 is printed with a number corresponding to the encoded identification number.

In the specific example shown in FIG. 5B, a logo mark is printed in the logo mark cell portion 301 of the two-dimensional code 101 in white characters. Further, in the specific example shown in FIG. 5C, the number corresponding to the identification number of the ID section 203 of the two-dimensional code 101 is omitted. Further, FIG.
In the specific example shown in (D), a number corresponding to the identification number is printed in white letters on the logo mark cell portion 301,
A logo is printed in black on the ID section 203. The code portions 202 of the two-dimensional code 101 shown in FIGS. 5A to 5D are all created according to the same specifications.

Here, the above-mentioned logo mark cell portion 301
Is formed by a rectangular area having a predetermined aspect ratio, and includes a black pixel connection area formed by connecting a plurality of black pixels as described later. Further, the logo mark cell unit 301 includes white readable information related to the two-dimensional code 101. Then, in the initial stage of starting the recognition processing of the two-dimensional code 1101, by detecting a rectangular logo mark cell portion 301 having a predetermined aspect ratio, the logo mark cell portion 301 is detected.
, The recognition process can proceed to the process of detecting other cells existing within the predetermined search range.
Therefore, the above-described logo mark cell unit 301 is provided not only for the purpose of displaying the meaning of the two-dimensional code 101 in the form of a readable logo mark, but also for performing recognition processing of the two-dimensional code 101. It also has the function of indicating the standard for proceeding.

As described above, in addition to the function of indicating the reference, the logo mark cell section 301 has the functions shown in FIGS.
As shown in (D), a function to display logos and characters is provided, so that the information necessary for the recognition processing standard and the readable information can be presented simultaneously with a minimum occupation area. It is possible.

Returning to FIG. 1, the personal computer 1
Is, for example, an object 100 and a two-dimensional code 101
Can be captured by the CCD video camera 23, and the code data of the two-dimensional code 101 obtained as a result is recognized.

6 to 11 show examples of the configuration of a portable personal computer to which the present invention is applied. The personal computer 1 is a mini-notebook type personal computer, and basically includes a main body 2 and a display unit 3 which can be opened and closed with respect to the main body 2. 6 is an external perspective view showing a state where the display unit 3 is opened with respect to the main body 2, FIG. 7 is a plan view of FIG. 6, and FIG. 8 shows a state where the display unit 3 is closed with respect to the main body 2. Left side view,
9 is a right side view showing the display unit 3 opened 180 degrees with respect to the main body 2, FIG. 10 is a front view of FIG.
FIG. 10 is a bottom view of FIG. 9.

The main body 2 is provided with a keyboard 4 operated for inputting various characters and symbols and a stick type pointing device 5 operated for moving a mouse cursor on its upper surface. Also,
On the upper surface of the main body 2, there are further provided a speaker 8 for outputting sound and a shutter button 10 operated when capturing an image with the CCD video camera 23 provided on the display unit 3.

A claw 13 is provided at an upper end portion of the display unit 3. As shown in FIG. 8, when the display unit 3 is closed with respect to the main body 2, Is provided with a hole 6 into which the claw 13 is fitted. A slide lever 7 is provided on the front face of the main body 2 so as to be movable in parallel with the front face. I can do it. By releasing the lock, the display unit 3 can be rotated with respect to the main body 2. Microphone 2 next to claw 13
4 is attached. As shown in FIG. 11, the microphone 24 can also collect sound from the back.

A programmable power key (PPK) 9 is also provided on the front of the main body 2. As shown in FIG. 9, an exhaust hole 11 is provided on the right side surface of the main body 2, and an intake hole 14 is provided at a lower front portion of the main body 2 as shown in FIG. 10. Further, a PCMCIA (Personal Computer Memory Card Internat) is provided on the right side of the exhaust hole 11.
A slot 12 for inserting an ional association) card (PC card) is provided.

An LCD for displaying an image is provided on the front of the display unit 3.
(Liquid Crystal Display) 21 is provided, and an imaging unit 22 is provided at the upper end thereof so as to be rotatable with respect to the display unit 3. That is, this imaging unit 22
It can rotate to any position within a range of 180 degrees between the same direction as D21 and the opposite direction (backward direction). A CCD video camera 23 is attached to the imaging unit 22.

A power lamp is provided on the lower body side of the display unit 3.
PL, battery lamp BL, message lamp ML, other LEDs
Is provided. Reference numeral 40 shown in FIG. 8 is a power switch provided on the left side surface of the main body 2, and reference numeral 25 shown in FIG.
This is an adjustment ring for adjusting the focus. Further, reference numeral 26 shown in FIG. 11 is a lid for covering an opening for mounting an additional memory in the main body 2, and reference numeral 41 is a small hole for inserting a pin for releasing the lock nail of the lid 26.

FIG. 12 shows an example of the internal configuration of the personal computer 1. The internal bus 51 includes a CPU (Cen
tral Processing Unit) 52, inserted as needed
A PC card 53, a RAM (Random Access Memory) 54, and a graphic chip 81 are connected. The internal bus 51 is connected to an external bus 55. The external bus 55 has a hard disk drive (HDD) 56, an I / O
(Input / output) controller 57, keyboard controller 58, stick type pointing device controller 59, sound chip 60, LCD controller 83,
A modem 50 and the like are connected.

The CPU 52 is a controller that controls each function, and the PC card 53 is appropriately mounted when an optional function is added.

Image data captured by the CCD video camera 23 is input to the graphic chip 81 after being processed by the processing section 82. The graphic chip 81 stores video data input from the CCD video camera 23 via the processing unit 82 into the built-in VRAM 8.
1A, read it out as appropriate, and output it to the LCD controller 83. The LCD controller 83 converts the image data supplied from the graphic chip 81 into the LCD 21
And display it. The backlight 84 is connected to the LCD 21
To be illuminated from behind.

In the RAM 54, when the activation is completed, an e-mail program (application program) 54A, an auto-pilot program (application program) 54B, and an OS (basic program) 54C are transferred from the HDD 56 and stored. .

The e-mail program 54A is a program for exchanging messages via a network from a communication line such as a telephone line. E-mail program 54A
Has an incoming mail acquisition function as a specific function. This incoming mail acquisition function executes processing for checking with the mail server 93 whether mail addressed to the user (user) has arrived in the mailbox 93A, and acquiring mail if there is any mail addressed to the user. I do.

The autopilot program 54B is a program for sequentially starting and processing a plurality of preset processes (or programs) in a preset order.

OS (basic program software) 54C
Controls the basic operations of a computer, such as Windows95 and Windows98 (trademark).

On the other hand, a hard disk drive (HDD) 56 on the external bus 55 side has an electronic mail program 56
A, an autopilot program 56B, an OS (basic program software) 56C, and a two-dimensional code recognition program 56D are stored.

The two-dimensional code recognition program detects the logo mark cell part 301 and the code part 202 of the two-dimensional code logo mark part 201 from the image data stored in the VRAM 81A of the graphic chip 81, It is a program that reads coded predetermined information by recognizing code data.

The I / O controller 57 has a microcontroller 61, and the microcontroller 61
An I / O interface 62 is provided. This microcontroller 61 includes an I / O interface 62, a CPU 6
3, a RAM 64 and a ROM 69 are connected to each other. The RAM 64 stores the key input status register 6
5. It has an LED (light emitting diode) control register 66, a set time register 67, and a register 68. The set time register 67 is used to start the operation of the start-up sequence control unit 76 at a time (start-up condition) set by the user in advance. The register 68 stores a correspondence between a preset operation key combination (start condition) and an application program to be started. When the stored operation key combination is input by the user, the register 68 stores the correspondence. The activated application program (for example, e-mail) is activated.

The key input status register 65 stores an operation key flag when the programmable power key (PPK) 9 for one-touch operation is pressed. The LED control register 66 controls the lighting of a message lamp ML that indicates the start-up state of the application program (e-mail) stored in the register 68. The set time register 67 can arbitrarily set a predetermined time.

A backup battery 74 is connected to the microcontroller 61, and the values of the registers 65, 66, and 67 are retained even when the power of the main body 2 is turned off. It has become.

The ROM 69 in the microcontroller 61 stores a wake-up program 70, a key input monitoring program 71, and an LED control program 72 in advance. The ROM 69 is, for example, an EEPROM (electricall
y erasable and programmable read only memory). This EEPROM is also called a flash memory. Further, an RTC (Real-Time Clock) 75 that constantly counts the current time is connected to the microcontroller 61.

The wake-up program 70 in the ROM 69 checks based on the current time data supplied from the RTC 75 whether or not the time set in the set time register 67 has been reached. , A program for starting a predetermined process (or program) or the like. The key input monitoring program 71
9 is a program for constantly monitoring whether or not 9 has been pressed by the user. The LED control program 72 is a program for controlling lighting of the message lamp ML.

The ROM 69 further includes a BIOS (Basic Input / O
utput System) 73 is written. The BIOS refers to a basic input / output system, and is a software program that controls data transfer (input / output) between an OS or application software and peripheral devices (display, keyboard, hard disk drive, etc.).

The keyboard controller 58 connected to the external bus 55 controls input from the keyboard 4. The stick type pointing device controller 59 is used for the stick type pointing device 5.
Control input.

The sound chip 60 includes the microphone 24
Or an audio signal is supplied to the built-in speaker 8.

The modem 50 can be connected to a communication network 92 such as the Internet, a mail server 93, and the like via a public telephone line 90 and an Internet service provider 91.

The power switch 40 is operated when the power is turned on or off. The half-press switch 85 is turned on when the shutter button 10 is half-pressed, and the full-press switch 86 is turned on when the shutter button 10 is fully pressed. The reversing switch 87 is connected to the imaging unit 2
2 is rotated 180 degrees (CCD video camera 23
It is turned on when it is rotated in the direction of imaging the opposite side of the CD 21).

Next, the processing procedure of the two-dimensional code recognition processing will be described with reference to the flowchart of FIG.

The two-dimensional code 101 is imaged by the CCD video camera 23, and the resulting image data for one frame is processed by the processing unit 82 and stored in the VRAM 81 A of the graphic chip 81. When the two-dimensional code recognition program 56D stored in the program is activated, in step S1,
The CPU 52 initializes 1 to a value of a counter i that counts the setting of a threshold value indicating a predetermined luminance value. In this example, as shown in FIG. 14, the threshold value is set in five levels. The value of the threshold value A indicated by the setting number 1 is set to the largest value, and the value is set so as to gradually decrease toward the threshold value E indicated by the setting number 5.

In step S2, the CPU 52 sets the VRAM based on the threshold of the set number corresponding to the value of the counter i.
A binarization process is performed on the image data stored in 81A. Here, the pixel value of the pixel holding the luminance larger than the threshold value is coded to “0”, and the pixel is set to white on display. In the following, the pixel value is
Pixels coded to 0 "are referred to as white pixels.

On the other hand, the pixel value of a pixel holding a luminance value equal to or less than the threshold value is coded as "1", and the pixel is set to black on display. In the following, the pixel value is
Pixels encoded as 1 "are referred to as black pixels.

Next, in step S3, the CPU 52
Indicates that the region where the black pixels are connected is 1 as shown in FIG.
Numbers are set (labeled) from upper left to lower right as two areas.

In step S4, the CPU 52 obtains the total number M of the black pixel connected regions labeled in step S3, and determines whether or not the calculated total number M of the black pixel connected regions is 257 or more. If it is determined that the number is 257 or more, that is, if it is determined that the image frame currently stored in the VRAM 81A is not suitable for performing the subsequent processing, the process proceeds to step S5.
Here, the image that is not suitable for performing the subsequent processing is
This is an image containing a large amount of sand-like points, which is a so-called dithered image.If the recognition process is forcibly advanced on such a dithered image, the CPU load required for arithmetic processing is large. turn into. Therefore, in the case of such a dithered image, the process proceeds to step S5 without directly proceeding with the recognition process.

In step S5, the CPU 52 determines that the value of the counter i is equal to the set number N (= 5) of thresholds (i = 5).
5) It is determined whether or not i is not equal to 5,
In step S6, after the value of the counter i is increased by 1, the process returns to step S2. In step S2, the CP
The U52 executes the binarization process again on the image data stored in the VRAM 81A based on the threshold of the setting number corresponding to the value of the counter i incremented by one.

As described above, the threshold value A indicated by the setting number 1 is the threshold value having the largest value. That is, if the largest value is set as the threshold value for the binarization processing, many pixels of the image data Has a relatively smaller value than the threshold value A. As a result, many pixels are recognized as black pixels, thereby increasing the total number M of the black pixel connected regions. Therefore, in step S5, the value of the counter i is increased by one,
If the threshold value that is smaller by one level is set as the threshold value for the next binarization process, the number of pixels recognized as black pixels decreases.

Thus, first, at a larger threshold,
By performing a binarization process based on a large luminance value,
A binarization process suitable for an image in which the entire frame is relatively bright can be executed. Further, the threshold value is reduced stepwise, and the binarization process is performed based on a smaller luminance value. A binarization process suitable for a dark image can be executed. Thus, a threshold of 5
By dividing the threshold into stages and changing this threshold in stages, even when the brightness of the entire image frame fluctuates, it is possible to always generate highly accurate binary data. I have.

In step S5, the CPU 52 sets i =
When the pixel data is determined to be 5, that is, when an appropriate total number M of black pixel connected areas is not generated by any of the thresholds A to E, the two-dimensional code 101 is included in the pixel data for one frame. If it is determined that the file does not exist, the process ends.

In step S4, when the CPU 52 determines that the total number M of the black pixel connected regions is smaller than 257, the process proceeds to step S7.

In step S7, the CPU 52 determines whether the two-dimensional code recognized by the two-dimensional code
Position of the dimension code 101 on the display of the LCD 21, for example,
It is determined whether or not the center point of the logo mark cell portion 301 is stored in the RAM 54 or the like. If it is stored, the process proceeds to step S8, and the stored point is determined to start the logo mark cell portion detection processing. Set to a point. Step S7
If it is determined that the position of the two-dimensional code 101 is not stored, the process proceeds to step S9, where the CPU 52
A center point (for example, X
The 160th pixel in the axial direction and the 120th pixel in the Y-axis direction) are set as the starting points. By doing so, the logo mark cell portion 301 can be efficiently detected.

Next, in step S10, a logo mark cell part detecting process is executed. Details of the logo mark cell part detection processing in step S10 will be described with reference to the flowchart in FIG.

First, in step S21, the CPU
52 initializes the value of a counter j for counting the total number M of the black pixel connected areas to 1 and then, in step S22, starts from the start point set in steps S8 and S9 in FIG. A black pixel connection area is searched for along the leftward spiral trajectory above, and the first detected black pixel connection area is selected as a logo mark cell part candidate area.

Next, in step S23, the CPU 52
Determines sides AT and BT corresponding to sides A and B of the logo mark cell section 301 as shown in FIG. 3 in the logo mark cell section candidate area selected in step S22.
As shown in FIG. 17, the side AT has a black pixel connection region of an LCD.
The longer one of the line projected on the X-axis (X-axis projection line) and the line projected on the Y-axis (Y-axis projection line) on the image 21 . The side BT is the other shorter line.

Next, at step S24, the CPU 52
Determines whether the side BT corresponding to the short axis is composed of less than 20 pixels. For example, assuming that a black pixel connection region in which the short axis (side B) is composed of less than 20 pixels is the logo mark cell portion 301,
As shown in FIG. 2, the length of one side of one block is the side B
Since the ratio to the length is 1: 1.5, the pixel is composed of a smaller number of pixels. In this case, the minimum cell (cell in the 1 × 1 block area) becomes smaller, and
Will not be displayed properly. From this, step S
In 24, if it is determined that the side BT is composed of less than 20 pixels, the black pixel connected area selected in step S22 is the logo mark cell unit 301
Is not determined, the process proceeds to step S25, and the CPU 52
It is determined whether or not the value of the counter j is equal to the total number M of the black pixel connected regions (j = M). If it is not determined that j = M, the process proceeds to step S26, and the value of the counter j is increased by one. After that, the process returns to step S22. And the CPU 52
Performs the same processing with the next black pixel connection area as the next logo mark cell part candidate area.

In step S24, step S22
The side BT of the logo mark cell part candidate area selected in step is 20
If it is determined that the pixel is composed of pixels equal to or more than the pixel, the process proceeds to step S27 and the CPU 5
No. 2 determines whether the side AT of the logo mark cell part candidate area is composed of more than 300 pixels. For example, assuming that the black pixel connection area in which the long axis (side A) is composed of more than 300 pixels is the logo mark cell portion 301, the length of the side A becomes 7 as shown in FIG. On the other hand, the length of one side of one block obtained at a ratio of 1 is increased, and as shown in FIG.
The upper left corner cell and the upper right corner cell located 7 blocks apart from 1 are not displayed on the LCD 21. Accordingly, in step S27, the side AT
Is determined to be composed of more than 300 pixels, it is determined that the black pixel connected region selected this time in step S22 is not the logo mark cell unit 301, and the process proceeds to step S25. Done.

In step S27, in step S22
The side AT of the logo mark cell part candidate area selected in step is 30
If it is determined that the pixel is not composed of more than 0 pixels (composed of pixels of 300 pixels or less), the process proceeds to step S28, and the CPU 52 determines that the total number of black pixels in the logo mark cell candidate area is 20 It is determined whether the number of pixels is equal to or more than 1500 pixels and less than 1500 pixels.
If it is determined that the number is less than the pixel, the process proceeds to step S29.

On the other hand, if it is determined in step S28 that the total number of black pixels in the logo mark cell candidate region is less than 20, or greater than 1500, the process proceeds to step S25. If the total number of black pixels is less than 20 pixels, the same problem as in the case where the side BT is composed of less than 20 pixels occurs in step S24,
If the number of pixels is 1500 or more, the same problem as in the case where the side AT is composed of more than 300 pixels in step S27 occurs, and in any case, the possibility of being the logo mark cell portion 301 is reduced. .

Next, in step S29, the CPU 52
Determines the squareness (fitness) of the logo mark cell part candidate area selected in step S22, and if it is determined that the area is a square, the process proceeds to step S30. In the case of this example, the fitness calculated based on the equation (1) is
If it is 0.2 or more, the logo mark cell part candidate area is determined to be rectangular.

[0075]

(Equation 1)

The constant a in the equation (1) is based on the equation (2), the constant c is based on the equation (3), and the constant b / 2
Is a two-dimensional moment of the so-called moment feature obtained based on the equation (4).

[0077]

(Equation 2)

[0078]

(Equation 3)

[0079]

(Equation 4)

F (i, j) in equations (2) to (4) is
This function is 1 when the pixel specified by the X coordinate i and the Y coordinate j of the pixel on the LCD 21 is black, and becomes 0 when the specified pixel is white.

In step S30, the CPU 52 calculates the ratio between the major axis and the minor axis of the logo mark cell part candidate area squared in step S29 based on the equation (5). And it is determined whether it is 25 or less.

[0082]

(Equation 5)

If it is determined that the calculation result is not less than 2.0 and not more than 25, the process proceeds to step S31, and the CPU 52
Sets (assumes) the logo mark cell part candidate area selected in step S22 as the logo mark cell part 301, and causes the RAM 54 to store, for example, the number of the black pixel connected area that is the logo mark cell part candidate area. In this way, the logo mark cell section 301 is detected, and the processing ends.

If it is determined in step S28 that the total number of black pixels is less than 20 pixels or 1500 pixels or more, if it is determined in step S29 that the logo mark cell part candidate area is not rectangular, or In S30, when it is determined that the ratio of the side AT to the side BT is less than 2.0 or greater than 25, the logo mark cell part candidate area selected this time in step S22 is determined not to be the logo mark cell part 301, Proceeding to step S25, the next detected black pixel connected area is set as the next logo mark cell part candidate area, and the subsequent processing is performed.

If it is determined in step S25 that the value of the counter j is equal to the total number M of the black pixel connected areas (j = M), the logo mark cell unit 301 is determined in step S31.
Is not set, and the process ends. That is, the image data (one frame) subjected to the two-dimensional code recognition process this time does not include the logo mark cell unit 301.

As described above, when the logo mark cell portion detection processing is completed, the process proceeds to step S11 in FIG.

In step S11, step S10
It is determined whether or not the logo mark cell portion 301 has been detected, and if it is determined that the logo mark cell portion 301 has been detected, the process proceeds to step S12, and a code portion detection process is executed. The details of the code part detection processing in step S12 will be described with reference to the flowchart in FIG.

First, in step S41, the CPU
52 initializes the value of a counter j for counting the total number M of the black pixel connected areas detected in step S3 of FIG. 13 to 1, and detects a black pixel connected area of a number corresponding to the value in step S42. , And select it as the upper left corner cell candidate area.

Next, in step S43, the CPU 52
Determines whether the ratio of the lengths of the side AT and the side BT determined as shown in FIG. 17 of the upper left corner cell candidate area selected in step S42 is 3 times or less, and If it is determined that it is three times or less, step S44
Proceed to.

In step S44, the CPU 52 determines that the upper left corner cell candidate area selected in step S42 is
Logo mark cell part 3 detected in step S10 in FIG.
It is determined whether or not it is within a search range set in advance for 01, and if it is determined that it is within the search range, the process proceeds to step S45, where it is set (assumed) as an upper left corner cell.

If it is determined in step S43 that the ratio of the length of the side BT to the length of the side AT is greater than three times, or if it is determined in step S44 that it is not within the search range, the process proceeds to step S44. It is determined that the black pixel connected area selected in S42 is not the upper left corner cell, and the process proceeds to step S46, where it is determined whether the value of the counter j is equal to the total number M of the black pixel connected areas (j = M). , J = M, it is determined in step S
Proceeding to 47, the value of the counter j is increased by 1 and the process returns to step S42. Then, the black pixel connected area of the next number is set as the next upper left corner cell candidate area, and the same processing is performed.

When the upper left corner cell is set in step S45, the process proceeds to step S48, where the CPU 52
Initializes 2 to another counter k for counting the number of the black pixel connected area, and then detects a black pixel connected area having a number corresponding to the value of the counter k in step S49, and places it in the upper right corner. Select as a cell candidate area.

Next, in step S50, the CPU 52
Calculates the ratio of the number of pixels (area) of the upper left corner cell set in step S45 to the number of pixels (area) of the upper right corner cell candidate area selected in step S49, and the ratio (area ratio) is 6 times or less. Is determined, and when it is determined that it is six times or less, the process proceeds to step S51.

In step S51, the CPU 52 sets the area (number of pixels) of the upper left corner cell set in step S45 (number of pixels) (S1), the area (number of pixels) of the upper right corner cell candidate area selected in step S49 (number of pixels) (S2), and The distance (D) between the center point of the upper left corner cell and the center point of the upper right corner cell candidate area is calculated, and it is determined whether Expressions (6) and (7) hold.

(S1 / D2) <= 900 (6) (S2 / D2) <= 900 (7) In step S51, it is determined that the equations (6) and (7) hold. In this case, the process proceeds to step S52 and the CPU
52 sets (assumes) the upper right corner cell candidate area selected in step S49 as the upper right corner cell.

When the upper right corner cell is set (assumed) in step S52, in step S55
The CPU 52 converts the area formed by the upper left corner cell set in step S45, the upper right corner cell set in step S52, and the logo mark cell part 301 set in step S10 in FIG. 8. A length of 7 blocks in the direction, and 9.
Affine transformation is performed so that the area becomes 5 blocks. Note that the length of one side of one block is calculated based on the side AT or the side BT of the logo mark cell portion 301 set in step S10.

Next, in step S56, the CPU 52
Deletes the area (7 × 2.5 block area) corresponding to the logo mark cell portion 301 set in step S10 of FIG. 13 and the corresponding non-cell portion 302 from the image converted in step S55, The black pixel connection region is mapped as a cell in the range of the obtained 7 × 7 block region, and a code map is generated.

In step S57, the CPU 52 selects 4 of the cells of the code map generated in step S56.
The corner cell is detected, and it is determined whether or not the three block areas around the corner cell are white pixels. If it is determined that the three pixels are white pixels, the process proceeds to step S58 and proceeds to step S58.
The code map generated in 56 is set (assumed) as the code part 202 of the two-dimensional code 101. When the code section 202 is detected in this way, the processing is terminated.

If it is determined in step S50 that the area ratio is larger than six times, in step S51,
If it is determined that Expressions (6) and (7) do not hold, or if it is determined in Step S57 that the three block areas around the square cell are not white pixels, the process proceeds to Step S53, and the counter proceeds to Step S53. It is determined whether or not the value of k is equal to the total number M of the black pixel connected regions (k = M). If it is determined that k is not M, step S54 is performed.
And the value of the counter k is incremented by 1, and the
Return to 49. Then, the black pixel connected area of the next number is set as the next upper right corner cell candidate area, and the same processing is performed.

If it is determined in step S53 that the value of the counter k is equal to the total number M of the black pixel connected regions, the process returns to step S46. If it is determined in step S46 that j is not equal to M, the process proceeds to step S47.
And the value of the counter j is incremented by 1, and the
Returning to 42, the next numbered black pixel connected area is selected as the next upper left corner cell candidate area, and the subsequent processing is performed.

If it is determined in step S46 that j = M, it is determined that the two-dimensional code 101 does not exist in the image currently subjected to the two-dimensional code recognition processing, and the processing ends.

When the code part detecting process is completed as described above, the process proceeds to step S13 in FIG. Step S
In step 13, it is determined whether or not the code section 202 has been detected in step S12. If it is determined that the code section 202 has been detected, the process proceeds to step S14, where code data verification processing is executed. Details of the code data verification processing in step S14 will be described with reference to the flowchart in FIG.

First, in step S61, the CPU
52 corresponds to step S63 and step S65 described later.
Initializes the value of a counter p that counts the number of times the reference value calculated by 1 is shifted rightward by one to 1.

Next, in step S62, the CPU 52
Is the code part 20 detected in step S12 of FIG.
The values of the code data and the check data are calculated from the code map of No. 2.

In step S63, the CPU 52 performs an exclusive OR operation on the code data value (bit stream) calculated in step S62 and 0xFFFFFF, and uses the resulting value (bit stream) as a reference value (bit stream). Reference bit stream). In step S64, the CPU 52 determines the LSB (Least
It is determined whether or not “1” is set in the Significant Bit). If it is determined that “1” is not set, step S
Proceed to 65.

In step S65, the CPU 52 performs an exclusive OR operation on the reference value (reference bit stream) calculated in step S63 and 0x8408, and obtains the resulting value (bit stream) as a new reference value. (Reference bit stream), and the process proceeds to step S66.

In step S64, if the CPU 52 determines that “1” is set in the LSB of the reference value (reference bit stream) calculated in step S63, it skips the processing in step S65 and proceeds to step S66.

In step S66, the CPU 52 shifts the reference value (reference bit stream) calculated in step S63 or S65 rightward by one bit, and proceeds to step S67, where the value of the counter p is set to 2
4 (predetermined number of shifts) (p = 2
4) It is determined whether or not p is not 24, and the process proceeds to step S68, where the value of the counter p is increased by 1 and then returns to step S64. Hereinafter, the same process is repeatedly executed until it is determined in step S67 that p = 24.

In step S67, the CPU 52 sets p
= 24, the process proceeds to step S69,
The logical product of the bit stream calculated by the processing of steps S64 to S68 and 0x1FF is performed. Next, in step 70, the CPU 52 determines in step S6
9, the value obtained from the logical product operation is calculated in step S62.
It is determined whether or not the value is equal to the value of the check data calculated in the step. If it is determined that the value is equal to the value, the code unit 202 detected in step S13 in FIG. , The code part 202 of the two-dimensional code 101 is determined.
Thereafter, the processing is terminated.

In step S70, step S69
When it is determined that the value calculated in step S62 is not equal to the value of the check data calculated in step S62, the process of step S71 is skipped, and the process ends.

As described above, when the code data verification processing is completed, the process proceeds to step S15 in FIG.
It is determined in step S71 of step 9 whether or not the code section 202 has been determined. If it is determined that the code section 202 has been determined, the process proceeds to step S16, and the CPU 52 proceeds to step S6 of FIG.
The value of the code data calculated in step 2, ie, the value of the two-dimensional code 101, is stored and held in the RAM 54, for example. Thereafter, the processing is terminated.

In step S11, when it is determined that the logo mark cell portion 301 has not been detected, in step S13, it is determined that the code portion 202 has not been detected, or in step S15, the code portion 202 has been detected. If it is determined that the two-dimensional code has not been determined, it is determined that the two-dimensional code 101 does not exist in the image data targeted for the two-dimensional code recognition process this time, and the process ends.

As described above, for example, a logo mark or the like
A logo mark cell unit 301 for displaying the attribute of the dimensional code 101 is used as a reference for recognition processing, and a code unit 202 is used.
Is detected, the area occupied by the two-dimensional code 101 can be minimized. That is, the logo mark cell unit 301 is provided with a function of displaying a logo mark, a character, and the like in addition to the function of indicating the reference.
With the minimum occupied area, the information required for recognition processing standards,
It is possible to simultaneously present the readable information.

A medium used to install a program for executing the above-described series of processes in a computer and to make the computer executable can be, for example, a package medium such as a floppy disk, a CD-ROM, or a DVD. Not only that, the program may be realized by a semiconductor memory or a magnetic disk in which the program is temporarily or permanently stored, and furthermore, a wired and wireless communication medium such as a local area network, the Internet, and digital satellite broadcasting, and the like. May be realized by various communication interfaces such as a router or a modem that transfers or receives a program provided via the communication medium of the present invention, and the medium in the present specification means a broad concept including all these media. Things.

[0115]

The two-dimensional code recognition processing method according to claim 1, the two-dimensional code recognition processing device according to claim 13,
According to the medium for causing a computer to execute the two-dimensional code recognition processing program according to claim 18, the two-dimensional code recognition processing is performed based on a predetermined threshold from image information taken in from the outside.
The binarized data is generated, and based on the binarized data,
A reference cell serving as a reference for recognizing the two-dimensional code is detected. Further, a corner cell existing within a predetermined search range is detected with reference to the reference cell, and a code section surrounded by the reference cell and the corner cell Since the code data assigned to the two-dimensional code existing in the area is detected, the code data can be efficiently and accurately recognized from the image data of the two-dimensional code. In addition, this reference cell contains two
By adding the function to display the attribute of dimension code, etc.,
With the minimum occupied area, the information required for the recognition processing standard,
It becomes possible to present the readable information at the same time.

[Brief description of the drawings]

FIG. 1 shows a usage example of a personal computer 1 to which the present invention is applied.

FIG. 2 is a diagram illustrating specifications of a two-dimensional code.

FIG. 3 is another diagram illustrating specifications of a two-dimensional code.

FIG. 4 is another diagram illustrating the specification of a two-dimensional code.

FIG. 5 is a diagram showing an example of a two-dimensional code.

FIG. 6 is an external perspective view showing a state in which a display unit of a configuration example of a portable personal computer to which the present invention is applied is opened with respect to a main body.

FIG. 7 is a plan view of FIG. 6;

FIG. 8 is a left side view showing a state where the display unit of FIG. 6 is closed with respect to the main body.

9 is a right side view showing a state where the display unit of FIG. 6 is opened 180 degrees with respect to the main body.

FIG. 10 is a front view of FIG. 8;

FIG. 11 is a bottom view of FIG. 9;

FIG. 12 is a block diagram illustrating a configuration example of an electric circuit in FIG. 6;

FIG. 13 is a flowchart illustrating a two-dimensional code recognition process.

FIG. 14 is a diagram illustrating setting of a threshold.

FIG. 15 is a diagram illustrating labeling of a black pixel connection region.

FIG. 16 is a flowchart illustrating a logo mark cell part detection process.

FIG. 17 is a diagram for explaining how to obtain sides AT and BT.

FIG. 18 is a diagram illustrating a code part detection process.

FIG. 19 is a flowchart illustrating a code data verification process.

FIG. 20 is a diagram showing an example of a conventional one-dimensional barcode.

FIG. 21 is a diagram showing an example of a conventional two-dimensional code.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 personal computer, 3 display part, 21
LCD, 23 CCD video camera, 52 CPU, 5
6 HDD, 81 graphic chip, 83 LCD controller, 100 objects, 101 two-dimensional code, 202 code part, 301 logo mark cell part

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Shinji Nakajima, 6-7-35 Kita-Shinagawa, Shinagawa-ku, Tokyo Inside Sony Corporation (72) Inventor Takahiko Sueyoshi 6-35, Kita-Shinagawa, Shinagawa-ku, Tokyo Sony Corporation

Claims (22)

[Claims] 1. A two-dimensional code recognition processing method for recognizing a two-dimensional code in which a plurality of square cells are two-dimensionally arranged according to a predetermined arrangement rule, comprising the steps of: Binarization processing step of generating binarized data; and a reference cell detecting a reference cell serving as a reference in recognizing the two-dimensional code based on the binarized data generated in the binarization processing step A detection processing step, and a corner existing within a predetermined search range based on the binarized data generated in the binarization processing step, based on the reference cell detected in the reference cell detection processing step. A corner cell detection processing step of detecting a cell; and the reference cell and the corner based on the binarized data generated in the binarization processing step. 2-dimensional code recognition processing method characterized by including the code data detecting process step for detecting code data assigned to the two-dimensional code existing in the region of the coding portion surrounded by the Le. 2. The reference cell is configured to include white readable information related to the two-dimensional code in a rectangular black pixel connection area having a predetermined aspect ratio. 2. The two-dimensional code recognition processing method according to claim 1, wherein the rectangular reference cell having a predetermined aspect ratio including the readable information is detected. 3. The two-dimensional code recognition processing method according to claim 2, wherein the readable information is a logo mark attached to a code system of the two-dimensional code. 4. The two-dimensional code recognition processing method according to claim 2, wherein the readable information is a company name related to a code system of the two-dimensional code. 5. The two-dimensional code recognition processing method according to claim 2, wherein the readable information is a URL related to a code system of the two-dimensional code. 6. The reference cell detection processing step includes recognizing the two-dimensional code from a detection start point that can be set arbitrarily based on the binarized data generated in the binarization processing step. 2. The two-dimensional code recognition processing method according to claim 1, wherein a rectangular reference cell having a predetermined aspect ratio is detected as a reference. 7. The two-dimensional code recognition processing method according to claim 6, wherein in the reference cell detection processing step, a start point of a reference cell detected immediately before is set as the detection start point. 8. The reference cell detection processing step, when the start point of the reference cell detected immediately before does not exist, sets a center point of image information fetched from outside as the detection start point. The two-dimensional code recognition processing method according to claim 6, wherein 9. A method for counting the total number of black pixel connected regions in which black pixels are connected based on the binarized data generated in the binarization processing step, and until the total becomes less than a predetermined number. 2. The two-dimensional code recognition processing method according to claim 1, further comprising a threshold changing step of changing a predetermined threshold value in the binarizing step in a stepwise manner. 10. A case where the threshold value is changed step by step in the threshold value changing step, and the total number of the black pixel connected regions is equal to or larger than the predetermined number at the stage when all the threshold values are changed. 10. The two-dimensional code recognition processing method according to claim 9, wherein a series of recognition processing is temporarily terminated, and a series of recognition processing based on new image information fetched from outside is started. 11. The code data detection processing step includes, based on the binarized data generated in the binarization processing step, within a region of the code portion surrounded by the reference cell and the corner cell. Said 2 which exists
A code data calculation processing step of calculating code data from a dimensional code; a check data calculation processing step of calculating check data from the two-dimensional code existing in the area of the code part; and a check data calculation processing step. 2. The two-dimensional code recognition processing method according to claim 1, further comprising a verification processing step of verifying the code data calculated in the code data calculation processing step based on the check data. 12. The binarization processing step includes: capturing the image information captured by an external imaging unit, and generating the binary data from the captured image information based on the predetermined threshold. Claim 1 characterized by the following:
2. A two-dimensional code recognition processing method according to claim 1. 13. A two-dimensional code recognition processing device for recognizing a two-dimensional code in which a plurality of square cells are two-dimensionally arranged according to a predetermined arrangement rule, comprising the steps of: Binarizing means for generating digitized data; and reference cell detecting means for detecting a reference cell serving as a reference in recognizing the two-dimensional code based on the binarized data generated by the binarizing means. Based on the binarized data generated by the binarization unit, a corner for detecting a corner cell existing within a predetermined search range with reference to the reference cell detected by the reference cell detection unit. A cell detecting unit, based on the binarized data generated by the binarizing unit, the two-dimensional data existing in an area of a code part surrounded by the reference cell and the corner cell; 2-dimensional code recognition processing apparatus characterized by comprising a code data detecting means for detecting code data assigned to the original code. 14. The reference cell detecting means, based on the binarized data generated by the binarizing means from a detection start point which can be arbitrarily set, recognizes the two-dimensional code as a reference. 14. The two-dimensional code recognition processing device according to claim 13, wherein a rectangular reference cell having a predetermined aspect ratio is detected. 15. Based on the binarized data generated by the binarization means, count the total number of black pixel connected regions where black pixels are connected, and calculate the total number of black pixel connected regions until the total becomes less than a predetermined number. 14. The two-dimensional code recognition processing device according to claim 13, further comprising a threshold changing unit that changes a predetermined threshold in the binarizing unit in a stepwise manner. 16. The code data detecting means according to claim 2, wherein:
Code data calculating means for calculating code data from the two-dimensional code existing in the area of the code portion surrounded by the reference cell and the corner cell based on the binary data generated by the value converting means Check data calculation means for calculating check data from a two-dimensional code existing in the area of the code part; and check code calculation means for calculating check data based on the check data calculated by the check data calculation means. 14. The two-dimensional code recognition processing device according to claim 13, comprising verification means for verifying said code data. 17. The image processing apparatus according to claim 1, wherein the binarization unit captures the image information captured by an external imaging unit, and generates binary data based on the predetermined threshold value from the captured image information. 14. The method according to claim 13, wherein
Dimension code recognition processing device. 18. A two-dimensional code recognizing program for recognizing a two-dimensional code in which a plurality of rectangular cells are two-dimensionally arranged according to a predetermined arrangement rule, comprising the steps of: Binarization processing step of generating binarized data; and a reference cell detecting a reference cell serving as a reference in recognizing the two-dimensional code based on the binarized data generated in the binarization processing step A detection processing step, and a corner existing within a predetermined search range based on the binarized data generated in the binarization processing step, based on the reference cell detected in the reference cell detection processing step. A corner cell detection processing step of detecting a cell; and the reference cell and the base cell based on the binarized data generated in the binarization processing step. A code data detection processing step of detecting code data assigned to the two-dimensional code existing in the area of the code part surrounded by the inner cell. Medium. 19. The reference cell detection processing step includes recognizing the two-dimensional code from a detection start point that can be set arbitrarily based on the binarized data generated in the binarization processing step. 19. The medium for causing a computer to execute a two-dimensional code recognition processing program according to claim 18, wherein a rectangular reference cell having a predetermined aspect ratio is detected as a reference. 20. Based on the binarized data generated in the binarization processing step, count the total number of black pixel connected regions where black pixels are connected, and calculate the total number of black pixel connected regions until the total becomes less than a predetermined number. 19. The medium for causing a computer to execute a two-dimensional code recognition processing program according to claim 18, further comprising a threshold change processing step of stepwise changing a predetermined threshold value in the binarization processing step. 21. The code data detection processing step includes, based on the binarized data generated in the binarization processing step, within a region of the code portion surrounded by the reference cell and the corner cell. Said 2 which exists
A code data calculation processing step of calculating code data from a dimensional code; a check data calculation processing step of calculating check data from the two-dimensional code existing in the area of the code part; and a check data calculation processing step. 19. The two-dimensional code recognition processing program according to claim 18, further comprising a verification processing step of verifying the code data calculated in the code data calculation processing step based on the check data. The medium to be executed. 22. The binary processing step, wherein image information captured by an external image capturing unit is captured, and binarized data is generated from the captured image information based on the predetermined threshold. A medium for causing a computer to execute the two-dimensional code recognition processing program according to claim 18.