JPH1015150A - Recognition device for pieces on japanese chess board - Google Patents

Abstract

PROBLEM TO BE SOLVED: To accurately identify the existence or non-existence of Japanese chess pieces by using a sum of picture elements having the first luminance values obtained for each square as a histogram value for each square, and setting a threshold value equal to or less than the preset histogram value in the case of the assumption that histogram values are arrayed in order from a small value to a large value. SOLUTION: An edge extracted image is generated from the images of pieces on a Japanese chess board picked up via a CCD camera 1, using the first luminance value of square lines on the board and characters on each piece, and the second luminance value of the bare surface of the board. A sum of picture elements having the first luminance value is calculated for each square on the basis of the edge extracted image, and used as a histogram value for each square. A threshold is set at a value equal to or larger than the smaller of the values of two adjacent histograms having a difference equal to or more than the preset value, and equal to or smaller than the larger histogram value, in case of the assumption that the histogram values are arrayed in order from a small value to a large value. Then, the threshold value is compared with the histogram values, and the existence or non-existence of Japanese chess pieces are thereby identified.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus for recognizing the presence or absence of a piece on a shogi board based on a captured image of the piece on the shogi board.

[0002]

2. Description of the Related Art The present applicant has proposed a piece presence / absence recognizing means for recognizing the presence / absence of a piece for each square based on a captured image of a piece on a shogi board. A changed area extracting means for extracting a changed area, and when an area in which the state of the presence or absence of a piece is changed is extracted,
Identify the type and position of the changed piece, and, based on the type and position of the specified piece, develop a game record recording device including a recording unit that records the change content of the piece for each move in a storage device,
We have applied for a patent. However, at the time of filing the present application, it has not been published yet.

[0003]

In the game record recording device developed by the present applicant, the piece presence / absence recognizing means uses, from a captured image of a piece on the shogi board, a line separating the squares on the shogi board and characters drawn on each piece. Is the first luminance value, and an edge-extracted image in which the luminance value of the background inside the square on the chessboard is the second luminance value is generated. A sum total of pixels having the first luminance value (hereinafter, referred to as a histogram value for each square) is calculated for each square from the edge extracted image. Then, it is determined that there is a piece in a cell whose histogram value is larger than a predetermined threshold value, and it is determined that there is no piece in a cell whose histogram value is equal to or less than the predetermined threshold value.

However, since the histogram value for each cell depends on the size of the input image, if a fixed value is used as the threshold value, there is a problem that the presence or absence of a frame cannot be accurately determined.

An object of the present invention is to provide a piece presence / absence recognition device on a shogi board capable of accurately recognizing the presence / absence of a piece regardless of the size of an input image.

[0006]

SUMMARY OF THE INVENTION A piece presence / absence recognition device on a shogi board according to the present invention recognizes the presence / absence of a piece for each square based on a captured image of the pieces on the shogi board. In, from the captured image of the pieces on the shogi board,
The luminance value of the line separating the squares on the shogi board and the character drawn on each piece is the first luminance value, and the luminance value of the background inside the squares on the shogi board is different from the first luminance value. Edge extraction image generating means for generating an edge extraction image, calculating means for calculating the sum of pixels having a first luminance value for each square from the edge extraction image, and calculating the first luminance value obtained for each square Assuming that the sum of the pixels possessed is the histogram value for each cell, and that the histogram values are arranged in ascending order, the difference between adjacent histogram values is equal to or greater than the smaller of the two histogram values that are equal to or greater than the predetermined value. Threshold setting means for setting a threshold to a value equal to or less than the larger histogram value, and comparing the histogram value for each cell with the above threshold, There characterized in that it comprises determining means for determining whether present.

In the apparatus for recognizing the presence or absence of a piece on a chess board according to the present invention, it is assumed that the sum of pixels having the first luminance value obtained for each cell is set as a histogram value for each cell, and the histogram values are arranged in ascending order. In this case, the threshold value is set to a value equal to or larger than the smaller histogram value and equal to or smaller than the larger histogram value in the two histogram values in which the difference between the adjacent histogram values is equal to or larger than the predetermined value. Regardless, the presence or absence of a piece can be accurately determined.

Specifically, the threshold value setting means includes, as a histogram value for each cell, the sum of pixels having the first luminance value obtained for each cell, taking the number of pixels on the horizontal axis, The distribution of the cumulative value of the number of squares with respect to the number of pixels is created by taking the cumulative value of the number of squares whose number is equal to or less than the number of pixels on the horizontal axis, and searching for a portion where the cumulative value of the number of squares does not change over a certain interval. Then, a threshold value is set from the range of the number of pixels corresponding to the searched portion.

The search for a portion where the cumulative value of the number of cells does not change over a certain interval may be started from the point where the cumulative value of the number of cells is 41. This is because the total number of squares is 81 and the total number of frames is 40, so that there are at least 41 squares with no frames.

[0010]

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 shows the appearance of a game record recording apparatus.

The game record recording device is a CCD for imaging a shogi board.
The camera includes a camera 1 and a personal computer (hereinafter, referred to as a host) 19. The host 19 has an internal monitor 22 for displaying a game record image. Further, the host 19 is equipped with an image processing board 30 for performing image processing on an image captured by the CCD camera 1.
The external monitor 5 is connected to the image processing board 30.

FIG. 2 shows the electrical configuration of the game record recording apparatus, and in particular, the image processing board 3 mounted on the host 19.
0 shows a detailed configuration.

1 is a CCD for taking in an image of a shogi board
Camera. An analog image signal captured by the CCD camera 1 is converted by the A / D converter 2 into a digital image signal.

The image bus 6 is connected to a frame memory 7, an image processing unit 11, and an image memory 13.

A digital image obtained by the A / D converter 2 is stored in the frame memory 7. The first memory control unit 8 and the video control unit 9 control writing of an image to the frame memory 7 in synchronization with the output of the CCD camera 1. The image stored in the frame memory 7 (hereinafter, referred to as a captured image) is displayed on the external monitor 5 via the D / A converter 4.

The image processing unit 11 performs image processing such as filter processing, binarization processing, projection processing, histogram processing, and template matching.

The image memory 13 stores various processing results by the image processing section 11 and template of frames used for template matching. The image memory 13
An area (hereinafter, referred to as a queue) for storing and holding an image captured by the CCD camera 1 by the interrupt processing is provided in the area. In this example, the queue has an area in which ten captured images can be stored. The image memory 13 is controlled by the second memory control unit 14.

The CPU 16 is a central processing unit mounted on the image processing board 30. In the CPU bus 15,
In addition to the CPU 16, the first and second memory control units 8 and 14, the frame memory 7, the image memory 13, and the image processing unit 11, a processor EPROM 18 and a host interface 17 are connected.

The program of the CPU 16, that is, the control program of the image processing board 30 is stored in the EPROM 18. The host interface 17 exchanges data between the CPU bus of the host 19 and the CPU bus 15 of the image processing board 30.

The host 19 has a storage device 23 for storing the program, the game record, and other necessary data. The host 19 issues commands to the image processing board 30 and performs various processes related to a user interface and the like.

FIG. 3 shows the procedure of the main processing of the game record recording apparatus.

First, before a game is started, an initialization process is performed (step 1). In the initialization processing, area setting of the shogi board, creation of a template for each piece, and the like are performed.

At the start of the game, information relating to the type and position of each frame according to the arrangement of the frames at the start of the game is stored in the storage device 23 of the host 19, and the internal monitor 22 of the host 19 stores the information at the time of the start of the game. The arrangement image of the pieces is displayed.

When the game starts (step 2), an image input process is executed (step 3). In this image input processing, when no captured image is stored in the queue, a game image is captured from the CCD camera 1. When captured images are stored in the queue, the game image is captured from the queue. The details of this image input processing will be described later.

Next, frame movement detection and moving frame identification processing in steps 4 to 9 are executed. In the frame movement detection and moving frame identification processing, first, an invalid area extraction processing is performed based on the captured image (step 4). The invalid area is an area where an obstacle such as a player's hand exists in the captured image. Details of the invalid area extraction processing will be described later.

Thereafter, a frame presence / absence recognition process is performed (step 5). That is, the presence or absence of a piece is determined for each square in an area (effective area) excluding the invalid area on the chess board.
The details of the frame presence / absence recognition processing will be described later.

Next, a process of extracting a change area of the frame presence / absence state is performed (step 6). That is, in the area (effective area) excluding the invalid area on the shogi board, an area where the state of the presence or absence of the piece has changed from the previous game record is extracted.

If an area in which the state of the presence or absence of a frame has been extracted is extracted (YES in step 7), a process of specifying a moving frame is performed (step 8). In other words, the type of the moved piece and the position of the moved piece are specified by the shogi rule and the pattern matching.

If the type and position of the moved piece cannot be specified in the moving piece specifying process in step 8 (including the case where the movement of the piece is determined to be invalid (rule violation)) (NO in step 9) ), Returning to step 3 to perform image input processing.

If the type and position of the moved piece can be specified in the moving piece specifying process in step 8 (YES in step 9), the game record is recorded in the storage device 23 in the host 19 (step 10). .

If there is no input for ending the record of the game record (NO in step 11), the process returns to step 3 to perform the image input processing. If there is an input to end the game record recording (YES in step 11), the game record recording process ends.

If it is determined in step 6 that the area in which the state of the presence or absence of the frame has changed is not extracted (step 7).
NO), it is determined that the game record has not changed, and the routine proceeds to step 12.

In step 12, it is determined whether or not to check whether the latest game record stored in the storage device 23 of the host 19 is correct. In this example, step 1
The number of transitions to 2 is counted, and when the counted number reaches a predetermined value, it is determined that a check is to be performed, and the count value is set to 0.

If it is determined that no check is performed, the process proceeds to step S11. If it is determined that the check is to be performed, the latest game record stored in the storage device 23 is stored based on the latest game record stored in the storage device 23 of the host 19 and the currently captured image. It is checked whether it is correct (step 13). In this check processing, a timer for starting the interrupt processing is started. For more information about the check process,
It will be described later.

As a result of the check processing, when it is determined that the latest game record stored in the storage device 23 of the host 19 is correct (YES in step 14), the process proceeds to step 11.

As a result of the check processing, if it is determined that the latest game record stored in the storage device 23 of the host 19 is incorrect (NO in step 14), recovery processing for recognizing a correct game record is performed. Executed (step 1
5). The details of the recovery process will be described later.

When the correct game record is recognized by the recovery process, the process proceeds to step 10, and the recognized correct game record is stored in the storage device 23 of the host 19.

FIG. 4 shows a detailed procedure of the invalid area extraction processing in step 4 of FIG.

FIG. 5 shows an example of a captured image.
In this example, the player's hand (obstacle) appears on the shogi board of the captured image. The captured image is represented by 0 to 255 gradations (black: 0, white: 255). As shown in FIG. 5, it is assumed that the lines dividing the squares on the chess board are black, and the characters drawn on each piece are also black. In the captured image, the luminance value of the player's hand is lower (darker) than the luminance value of the shogi board against the background.

Hereinafter, the invalid area extraction processing procedure will be described with reference to the captured image of FIG. 5 as an example. First, a noise removal process is performed on a captured image using a low-pass filter (step 101). An edge extraction process is performed on the image from which noise has been removed by the noise removal process using a high-pass filter (step 10).
2). Then, a binarization process is performed on the obtained image (step 103). As a result, as shown in FIG. 6, the edge portion, that is, the line separating the squares on the shogi board, the character drawn on each piece and the outline of the hand are white “1”, and the portion other than the edge portion, that is, Then, a binarized image in which the inside of the square on the shogi board and the inside of the outline of the hand are black “0” is obtained.

Next, projection processing is performed (step 104). The line dividing the cell is composed of 10 horizontal lines and 10 vertical lines. An elongated rectangular projection calculation area including one straight line is set for each horizontal line and each vertical line that constitutes a line separating the cells. FIG. 7 shows a projection calculation area S set for the third horizontal line from the bottom.

Then, for each projection calculation area, the projection of the image in that area is calculated. A vertical projection is calculated for the projection calculation area set for each horizontal line, and a horizontal projection is calculated for the projection calculation area set for each vertical line. FIG. 8 shows a projection result for the image in the projection calculation area S shown in FIG.

As described above, when the projections are calculated for all the straight lines (all the horizontal lines and the vertical lines) constituting the line dividing the cell, an invalid area is extracted based on the obtained projection result. (Step 10
5).

As can be seen from FIG. 8, on one straight line included in the projection calculation area S, at a position where the straight line is not covered by an obstacle such as a hand, the projection result is H level. Become. On the other hand, on one straight line included in the projection calculation area S, at a position where the straight line is covered by an obstacle such as a hand, the projection result is L
Level.

Therefore, the projection calculation area S
If there is a portion of one straight line included in the area where the straight line is covered by an obstacle such as a hand, a discontinuous portion having a predetermined length or more appears in the projection result. Therefore, it is determined that an obstacle exists in a square corresponding to a discontinuous portion having a predetermined length or more in the projection result. In addition, even if a discontinuous portion exists in the projection result, if the length is less than a predetermined value, it is determined to be due to noise or a piece, and it is determined that there is an obstacle in a square corresponding to the discontinuous portion. Is not determined. Such a process is referred to as an obstacle presence / absence determination process.

In this way, the obstacle presence / absence determination processing is performed for each projection result for all the projection calculation areas. Then, an area determined to have an obstacle by the obstacle presence / absence determination is extracted as an invalid area. The invalid area thus extracted is shown as a shaded area in FIG. An area other than the invalid area on the shogi board is referred to as an effective area.

According to the above-described invalid area extraction processing, the presence / absence of an obstacle is determined using the information of the line of the cell.
An area where an obstacle exists can be extracted regardless of the size and shape of the obstacle, and an area where an obstacle exists can be accurately extracted even if there is a change in illumination. In the above-described invalid area extraction processing, a projection calculation area is set for each horizontal line and each vertical line that constitutes a line dividing a cell, but only for each horizontal line that constitutes a line dividing a cell or The projection calculation area may be set only for each vertical line.

FIG. 10 shows a detailed procedure of the frame presence / absence recognition process in step 5 of FIG.

The frame presence / absence recognition processing is performed based on the binarized image of FIG. 6 obtained in step 103 of the invalid area extraction processing.

In the frame presence / absence recognition processing, first, as shown in FIG. 11, the sum of the white pixels for each cell (histogram value)
Is created (step 111).
In the binarized image, since the character drawn on each frame is white "1", the histogram value is large in the square where the frame exists.

Therefore, it is possible to determine that there is a frame in a square where the sum of white pixels is larger than a certain threshold value, and that there is no frame in a square where the sum of white pixels is equal to or less than a certain threshold value. . However, since the sum of the white pixels for each cell depends on the size of the input image, using a fixed value as the threshold value has a problem in that the presence / absence of a frame cannot be accurately determined. Therefore, in this embodiment, the threshold value is obtained as follows.

That is, as shown in FIG. 12, the horizontal axis represents the number of white pixels, and the vertical axis represents the number of squares whose histogram value is the number of white pixels on the horizontal axis. It is created (step 112).

Next, as shown in FIG. 13, the horizontal axis represents the number of white pixels, and the vertical axis represents the cumulative value of the number of squares whose histogram value is equal to or less than the number of white pixels on the horizontal axis. A distribution of the cumulative value of the number is created (step 11).
3).

Next, based on the obtained cumulative frequency distribution,
A threshold is searched (step 114). by the way,
There must be a certain difference or more between the maximum value of the sum of the white pixels of the cell where the piece does not exist and the minimum value of the total of the white pixels of the cell where the piece exists. For this reason, in the range between the maximum value of the sum of the white pixels of the cell where the piece does not exist and the minimum value of the sum of the white pixels of the cell where the piece exists, the sum of the white pixels within the cell is No cell has such a value. Therefore, when the above-described cumulative frequency distribution is created, a portion where the cumulative value of the number of cells does not change appears. Therefore, a portion in which the cumulative value of the number of squares in the obtained cumulative frequency distribution does not change over a certain interval is searched,
The number TH of white pixels with respect to the start point P1 of the searched portion is determined as a threshold value.

That is, assuming that the histogram values obtained in step 111 are arranged in ascending order, the smaller one of the two histogram values in which the difference between adjacent histogram values is equal to or greater than a predetermined value. The value is determined as the threshold Th. Note that the threshold value may be set in a range between the smaller histogram value and the larger histogram value of two histogram values in which the difference between adjacent histogram values is equal to or larger than a predetermined value. That is, in FIG. 13, the threshold is within a range from the number of white pixels for the start point of the portion where the cumulative value of the number of squares does not change to the number of white pixels for the end point of the portion where the cumulative value of the number of squares does not change. A value may be set.

By the way, the number of pieces of shogi is 40 pieces, and the sum of squares is 81 pieces. Therefore, the number of squares in which no pieces exist is a minimum of 41. In the binarized image of FIG. 6, the area where an obstacle such as a hand exists is black as in the area where no piece exists, and therefore no piece exists in the area where an obstacle such as a hand exists. Even when a square is included, the number of squares without a piece is a minimum of 41. Therefore, a search for a portion in which the cumulative value of the number of cells does not change over a certain interval is performed at a point P where the cumulative value of the number of cells is 41.
It starts from o.

When the threshold value Th is obtained in this way, the presence or absence of a frame is determined for each cell existing in the effective area excluding the invalid area based on the histogram value for each cell obtained in step 111. Is determined (Step 1
15). That is, it is determined that there is a frame in a square whose histogram value (sum of white pixels in the square) is larger than the threshold Th. Conversely, it is determined that there is no piece in a square whose histogram value is equal to or smaller than the threshold Th. As a result, the frame presence / absence state of each cell existing in the valid area excluding the invalid area is extracted.

As described above, in this embodiment, when it is assumed that the histogram values obtained in step 111 are arranged in ascending order, the difference between the two histogram values in which the difference between the adjacent histogram values is equal to or larger than the predetermined value is obtained. Since the smaller of the histogram values is determined as the threshold value Th, regardless of the size of the input image,
The presence or absence of a piece can be accurately determined.

FIG. 14 shows the procedure of interrupt processing. FIG. 15 shows how the state of the queue changes in the interrupt processing.

This interrupt processing is periodically executed based on the timer started in the check processing (step 13).

In the interrupt processing, first, among the ten areas in the queue, the state of the queue in which the input image is to be stored is set to the "image input state" (step 21).
Here, it is assumed that the input images are accumulated in the ten regions in the queue from the lower region. The queue state of each area in the queue includes a state where an image is stored (state with image), a state where no image is stored (state without image), and a state where an image is input (state during image input). And a state in which the image is read and processed (processing state).

As shown in FIG. 15A, when the input image is accumulated in the fifth area from the bottom, the queue state of the sixth area from the bottom is “image input state”. To be.

Next, an image is captured from the CCD camera 1 (step 22). Then, when the image capture from the CCD camera 1 is completed (step 23), FIG.
As shown in (b), the captured image is stored in the area set to the “image input state” (step 24).
Thereafter, the queue state of the area where the image is stored is shown in FIG.
As shown in (c), the state is “image present state”.

FIG. 16 shows the procedure of the image input process in step 3 of FIG. FIG. 17 shows how the state of the queue changes in the image input processing.

In the image input processing, as shown in FIG. 17A, first, the queue state of the area that is currently in the “processing state” is changed to the “no image state” (step 31). .

Next, it is determined whether or not an area of "image present state" exists in the queue (step 3).
2). If there is no “image present state” area, an image is captured from the CCD camera 1 (step 33). When the timer for interrupt processing is driven by the check processing, the driving of the timer is stopped.

When an area of “image presence state” exists, as shown in FIG. 17B, “image presence state”
Of the regions where the oldest image is stored, that is, the region with the “image present state”, the queue state of the lowermost region is set to the “processing state”, and then the image is extracted from that region. (Step 34).

FIG. 18 shows the procedure of the check processing in step 13 of FIG. FIG. 18 shows the image processing board 3
0 indicates a process.

In the checking process, first, the contents of the queue are cleared (step 41). Next, a timer for starting interrupt processing is started (step 42). Next, a frame arrangement check process is performed (step 43).

In the frame arrangement check processing, first,
The check list created by the host 19 is received (step 51). Checklist for host 1
9 is created as follows. The host 19
As shown in FIG. 19, an arbitrary row or column is randomly selected from the latest recorded game record. And information indicating whether or not there is a piece for each cell on the selected row or column,
If there is a piece, a check list including information indicating the type of the piece is created.

When the checklist is received, as shown in FIG. 19, it is determined whether or not the content of each cell in the row or column corresponding to the checklist in the latest captured image matches the content of the checklist. Is performed (step 52). This determination is performed for each square by performing template matching using a template corresponding to the content of the checklist on the captured image, thereby determining whether the latest captured image matches the content of the checklist. Is done. If the contents of the latest captured image match the contents of the checklist in all the cells (YES in step 53 and YES in step 54), the latest game record stored in the storage device 23 of the host 19 is obtained. Is determined to be correct (OK).

If there is a cell in which the contents of the latest captured image do not match the contents of the checklist (NO in step 53), the latest game record stored in the storage device 23 of the host 19 is erroneously determined. (NG).

When the frame arrangement check processing is completed, the result of the frame arrangement check processing (OKorNG) is transmitted to the host 19.
(Step 44).

When the latest game record stored in the storage device 23 of the host 19 is determined to be correct (OK) in the frame arrangement check processing, the result of step 14 in FIG. Move to In the process of checking the arrangement of the pieces, the storage device 23 of the host 19
Is determined to be incorrect (NG), the latest game record stored in is determined to be NO in step 14 of FIG.
The process proceeds to the recovery process in step S15.

FIG. 20 shows the procedure of the recovery process in step 15 of FIG. FIG. 20 shows the image processing board 3
0 indicates a process.

First, an invalid area extraction process is performed on the currently captured image in the same manner as in step 4 of FIG. 3 (step 61). The invalid area is an area where an obstacle such as a player's hand exists in the captured image.

If it is determined in the invalid area extraction processing that there is no invalid area (obstacle), step 6
Proceed to 4.

If it is determined in the invalid area extraction processing that an invalid area (obstacle) exists (step 62).
NO), image input processing is performed in the same manner as in step 3 of FIG. 3, and a new image is fetched from the CCD camera 1 or the queue (step 63). Then, the process returns to step 61. Therefore, the processes of steps 61, 62 and 63 are repeated until it is determined that no obstacle exists.

In step 64, the process of acquiring all frame arrangements is performed on the captured image determined in step 62 that no obstacle exists.

In the process of acquiring the arrangement of all frames, first, the host 1
9 is received (step 71). This map data is created by the host 19 as follows. As shown in FIG. 21, the host 19 creates map data including information indicating whether there is a piece or not, and if there is a piece, information indicating the type of the piece for each square of the latest recorded game record. .

When the map data is received, as shown in FIG. 21, it is determined whether or not the content of each square of the captured image determined as having no obstacle in step 62 matches the content of the map data. Is determined (Step 7
2). This determination is made for each square by performing template matching using a template corresponding to the content of the map data on the captured image, thereby determining whether the content of the captured image matches the content of the map data.

If the contents of the captured image match the contents of the map data (YES in step 73), the position and type of the frame are stored (step 74). Then, it is determined whether or not the processing of step 72 has been completed for all the cells (step 75). If the processing in step 72 has not been completed for all cells, the process returns to step 72, and the processing in step 72 is performed for the next cell.

If the content of the captured image does not match the content of the check list (N in step 73)
O), template matching is sequentially performed on the square image in the captured image using the template of each frame (step 76). If the grid image matches the template image (YES in step 77), the position of the piece and the type of the piece are stored (step 74).

If the cell image does not match the template image (NO in step 77), it is determined whether or not the collation with all types of frames has been completed (step 7).
8). If the collation with all types of pieces has not been completed, the flow returns to step 76, and template matching using the next template is performed.

If it is determined in step 78 that the matching with all types of pieces has been completed, the piece corresponding to the template having the highest correlation value is specified as the piece existing in the corresponding cell. (Step 79). Then, the process proceeds to a step 74, wherein the position of the piece and the type of the piece are stored.

When the processing for acquiring the arrangement of all the frames is completed, the information on the positions and types of the frames stored in step 74 is transmitted to the host 19 (step 65). Thereafter, the process proceeds to step 10 in FIG. 3, and information on the position and type of the frame transmitted to the host 19 is recorded in the storage device 23 of the host 19.

[0088]

According to the present invention, an apparatus for recognizing the presence or absence of a piece on a shogi board capable of accurately recognizing the presence or absence of a piece regardless of the size of an input image is realized.

[Brief description of the drawings]

FIG. 1 is a schematic diagram showing the appearance of a game record recording device.

FIG. 2 is a block diagram showing an electrical configuration of the game record recording device.

FIG. 3 is a flowchart showing a procedure of a main process of the game record apparatus.

FIG. 4 is a flowchart showing a detailed procedure of an invalid area extraction process in step 4 of FIG. 3;

FIG. 5 is a schematic diagram illustrating an example of a captured image.

FIG. 6 is a schematic diagram showing a binarized image of an edge extraction image.

FIG. 7 is a schematic diagram showing a projection calculation area.

FIG. 8 is a graph showing a projection result for an image in the projection calculation area of FIG. 7;

FIG. 9 is a schematic diagram illustrating an invalid area extracted by an invalid area extraction process.

FIG. 10 is a flowchart showing a detailed procedure of a frame presence / absence recognition process in step 5 of FIG. 3;

FIG. 11 is a graph showing a histogram result obtained in step 111 of FIG. 10;

FIG. 12 is a graph showing a frequency distribution obtained in step 112 of FIG.

FIG. 13 is a graph showing the cumulative frequency distribution obtained in step 113 of FIG.

FIG. 14 is a flowchart showing an interrupt process.

FIG. 15 is a schematic diagram showing a state in which the state of a queue changes in interrupt processing.

FIG. 16 is a flowchart showing a detailed procedure of an image input process in step 3 of FIG. 3;

FIG. 17 is a schematic diagram showing a state in which the state of a queue changes in the image input processing.

FIG. 18 is a flowchart showing a detailed procedure of a check process in step 13 of FIG. 3;

FIG. 19 is a schematic diagram for explaining a check process.

FIG. 20 is a flowchart showing a detailed procedure of a recovery process in step 15 of FIG. 3;

FIG. 21 is a schematic diagram for explaining a recovery process.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 CCD camera 11 Image processing part 13 Image memory 16 CPU 19 Host 23 Storage device 30 Image processing board

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Kozo Miyamoto 2-5-5 Keihanhondori, Moriguchi-shi, Osaka Sanyo Electric Software Co., Ltd.

Claims (3)

[Claims] 1. Based on a captured image of a piece on a shogi board,
In a piece presence / absence recognition device on a shogi board for recognizing the presence / absence of a piece for each square, a luminance value of a line separating the squares on the shogi board and a luminance value of a character drawn on each piece from a captured image of the piece on the shogi board are first. An edge-extracted image generating means for generating an edge-extracted image which is a luminance value and a luminance value of a background inside the square on the chessboard is a second luminance value different from the first luminance value, for each square from the edge-extracted image Calculating means for calculating the sum of the pixels having the first luminance value, assuming that the sum of the pixels having the first luminance value obtained for each cell is a histogram value for each cell, and the histogram values are arranged in ascending order. In this case, the threshold is set to a value equal to or larger than the smaller histogram value and equal to or smaller than the larger histogram value of the two histogram values in which the difference between the adjacent histogram values is equal to or larger than the predetermined value. Shogi board comprising: a threshold value setting means; and a determination means for determining whether or not a piece exists in each square by comparing the histogram value for each square with the threshold value. Upper piece recognition device. 2. The threshold value setting means according to claim 1, wherein the sum of pixels having the first luminance value obtained for each cell is set as a histogram value for each cell, the number of pixels is set on the horizontal axis, and the histogram value is set on the horizontal axis. With the cumulative value of the number of cells that are equal to or less than the number of pixels as the vertical axis, a distribution of the cumulative value of the number of cells with respect to the number of pixels is created, and a portion where the cumulative value of the number of cells does not change over a certain interval is searched for. 2. The apparatus for recognizing pieces on a shogi board according to claim 1, wherein the threshold value is set from within the range of the number of pixels corresponding to the part. 3. The presence or absence of a piece on a chess board according to claim 2, wherein the search for a portion where the cumulative value of the number of squares does not change over a certain interval starts from the point where the cumulative value of the number of squares is 41. Recognition device.