JP2008158904A - Method for analyzing linear graphic - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a method for analyzing a linear graphic for detecting linear elements without carrying out thinning to a linear graphic in an image, and for extracting a series of line elements without generating any error. <P>SOLUTION: A solid region extraction means 1 segments a region occupied by linear graphics from the image of a linear graphic configured of a plurality of linear elements as a solid region. A reference point grouping means 2 arranges a plurality of reference points isolated from each other inside the solid region, and defines one combination of the reference points connected by the connection segments passing through only the inside of the solid region among the connection segments connecting the other reference points as a group candidate, and associates all reference points with any group candidate. A singular point detection means 3 detects reference points associated with a plurality of group candidates among the reference points as singular points. A linear element extraction means 4 evaluates the continuity of the point column of the reference points by using the position relation of the group candidates and the singular points, and extracts the reference point group associated with the linear elements one to one. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention uses an image of a linear figure in which a plurality of line elements intersect or contact each other, such as handwritten characters, fibers and hair, dyed cell genes, and the like. The present invention relates to a linear figure analysis method for extracting a line element from a linear figure by analyzing the figure.

  In general, there are various figures other than characters in the line figure composed of line elements. However, since the explanation is easy, the character is targeted as the line figure. The technology for recognizing characters as linear figures includes a technology that evaluates the degree of matching by pattern matching for regular characters such as printed characters, and a method that decomposes irregular characters such as handwritten characters into line elements. Techniques for evaluating the types, combinations, positional relationships, etc. of line elements are mainly used.

FIG. 13 shows a typical configuration when characters are recognized by the pattern matching technique.
In the configuration shown in FIG. 13, a TV camera (hereinafter abbreviated as “camera”) 11 that captures an object 10 on which characters 20 to be recognized are written, and a video signal output from the camera 11 as a digital image. By converting the digital image generation device 12 to be converted, the storage device 13 storing the grayscale image output from the digital image generation device 12, and performing image processing such as pattern matching on the grayscale image stored in the storage device 13 And an image processing device 14 that recognizes the type of the character 20.

  The digital image generation device 12 samples the video signal output from the camera 11 to assign a sampling value to each pixel arranged in a two-dimensional square lattice, and quantizes the intensity of the sampling value for each pixel. By using this value, a grayscale image is generated from the video signal. For example, if the pixel value having the lowest lightness is set to 0, the pixel value having the highest lightness is set to 255, and an 8-bit pixel value is assigned to each pixel, a gray-scale image in a so-called 8-bit raster format is obtained. The grayscale image is stored in the storage device 13, and the image processing device 14 reads the grayscale image from the storage device 13 and performs image processing described below to recognize the character 20.

  The image processing apparatus 14 includes a microcomputer as a main component, operates according to a program for executing image processing, and various parameters necessary for executing the program are also set. In the illustrated example, the digital image generation device 12 and the storage device 13 are provided separately from the image processing device 14, but may be incorporated in the image processing device 14. The storage device 13 uses a large-capacity and inexpensive hard disk device for storing grayscale images, but uses a semiconductor memory that can be accessed at high speed when performing image processing on grayscale images. In the configuration shown in FIG. 13, an image scanner is often used instead of using the camera 11 and the digital image generating device 12 for the purpose of recognizing the character 20 written on the object 10.

  Here, a case where the grayscale image stored in the storage device 13 includes the linear figure C1 shown in FIG. 14 will be described as an example. A linear figure C1 shown in FIG. 14 is a grayscale image obtained by capturing an image of a paper on which “sa” is written with a writing tool as an object 10 with the camera 11.

  When a person recognizes the line figure C1, the line figure C1 is divided into a line element L1 from the start point sp1 to the end point ep1, and a line element L1 at the intersection jp1 from the start point sp2, as shown in FIG. It is immediately perceived that the line element L2 is formed by three line elements L1 to L3 that intersect and reach the end point ep2 and the line element L3 from the start point sp3 to the end point ep3. And it recognizes that this linear figure C1 is "sa" of hiragana using information, such as a kind (shape), combination, and positional relationship, of each line element L1-L3.

  If such a recognition procedure by a person is also used in the image processing apparatus 14, it is considered that the character 20 can be recognized. Therefore, instead of capturing the image of the object 10 with the camera 11 or the image scanner, a handwritten character is input with a pen tablet or the like, and the stroke order information (referred to as “stroke information”) at the time of input is also used. It is considered that L1 to L3 are extracted (for example, see Patent Document 1).

  When the stroke information is obtained, the information (topology) of the intersection and branching between the line elements L1 to L3 can be correctly recognized from the line figure C1, and the extraction accuracy of the line elements L1 to L3 is increased. However, the stroke information can be easily acquired by reading the character 20 written with a pen tablet or the like (referred to as “online character reading”), but the stroke is not obtained when reading the character 20 already written (referred to as “offline character reading”). Information cannot be obtained in real time.

  Therefore, in offline character reading, stroke information is estimated by performing image processing on the line figure C1 in the image, and line elements L1 to L3 are extracted from the line figure C1 using the obtained stroke information. (For example, refer to Patent Document 2 and Patent Document 3). Hereinafter, a technique for estimating the stroke information and extracting the line elements L1 to L3 from the linear figure C will be described.

  As shown in FIG. 14, the line figure C1 obtained by imaging the target object 10 has a width in which each of the line elements L1 to L3 is larger than one pixel. When extracting the line elements L1 to L3, first, in order to remove the width information, the line elements L1 to L3 are thinned to have a width of one pixel. When the linear figure C1 shown in FIG. 14 is thinned, it is desirable to make the figure thin as shown in FIG.

  Various methods are considered for the thinning process, but generally a method called skeleton extraction is widely adopted. In skeleton extraction, first, an appropriate pixel value within the range of the linear figure C1 is used as a threshold for a grayscale image, and 0 is assigned to a pixel having a pixel value darker than the threshold, and a pixel having a pixel value greater than or equal to the threshold. By assigning 1 to, a binary image is generated from the grayscale image. In the binary image, the pixel value of the pixel included in the linear figure C1 is 1.

  Next, in a binary image, pixels that have a pixel value of 1 (hereinafter referred to as “bright pixels”) and pixels that have a pixel value of 0 (hereinafter referred to as “dark pixels”), The process of setting the bright pixels that do not destroy the connectivity of the bright pixels to 0 even if the bright pixels are replaced with dark pixels is repeated. By replacing bright pixels with dark pixels, the remaining bright pixels gradually decrease, and the linear figure C1 is scraped in order from the periphery, so that a skeleton (core line) having a width of one pixel is finally extracted. Is done. When skeleton extraction is performed on the linear figure C1 in FIG. 14, a skeleton figure C2 as shown in FIG. 16 is extracted.

  When the skeleton extraction described above is performed, as shown in FIG. 16, the line element L1 is discontinuous in the vicinity of the portion (intersection jp1 in FIG. 15) where the line element L1 and the line element L2 intersect in FIG. In some cases, the line element L1 to be extracted as one line is divided into two line elements L1a and L1b. This is because in the linear figure C1 shown in FIG. 14, the part corresponding to the intersection of the line element L1 and the line element L2 is thicker than the other parts, so that the core wire is biased. That is, the two line elements L1a and L1b are in contact with the line element L2 in a T-shape, and a core wire having one intersection jp1 is mistaken as a core wire having two intersections. It becomes impossible to correctly recognize the topology of the linear figure C1.

This is because the above-described skeleton extraction technique only extracts a set of pixels farthest from the outline of the linear figure C1, and does not consider the extraction of the topology.
Japanese Patent No. 3471194 Japanese Patent No. 2798402 JP 2002-334301 A

  As described above, the technique described in Patent Document 1 is a technique corresponding to online character reading, and cannot be applied to offline character reading. Further, in the techniques described in Patent Document 2 and Patent Document 3, it is possible to estimate stroke information even in the case of offline character reading. However, if thinning is performed by skeleton processing in order to estimate stroke information, In a line figure with a wide line width, a line figure whose line width changes due to ink bleeding, or a line figure whose outline is not smoothly continuous, the topology cannot be extracted correctly, and the line element There are cases where the data cannot be extracted correctly.

  In the above description, the case of character recognition was taken up. However, when extracting each fiber and hair individually from an image in which fibers and hair overlap, or when extracting each gene from a stained cell gene image individually. A similar problem occurs.

  The present invention has been made in view of the above reasons, and detects a line element without thinning a line figure in an image, and evaluates intersection, contact, and continuity of the line element. Therefore, it is intended to provide a method for analyzing a linear figure that makes it possible to extract a continuous line element without error.

  The invention according to claim 1 is a method of analyzing a linear figure in which line elements are individually separated from an image of a linear figure composed of a plurality of line elements. A reference that is connected by a connecting line segment that passes through only the inside of the lump area among the area extracting means and a plurality of reference points that are spaced apart from each other inside the lump area and that connect other reference points to each other. A reference point grouping unit that associates a single combination of points as a group candidate and associates all reference points with one of the group candidates, and singular point detection that detects a reference point associated with a plurality of group candidates among the reference points as a singular point A line element extractor that evaluates the continuity of a sequence of reference points using a means, a positional relationship between group candidates and singular points, and extracts a reference point group corresponding to the line element one-to-one. Characterized by including and.

  According to a second aspect of the present invention, in the first aspect of the invention, the line element extraction means uses a reference point included in the extracted reference point group to obtain a reference point that is an end point of the line element, and a bending point and a branch point. It is characterized by determining the presence or absence of a reference point corresponding to either a point or an intersection.

  According to a third aspect of the present invention, in the first or second aspect of the invention, the reference point grouping means obtains a core line of the lump region, and then arranges the reference point on the core line. .

  According to a fourth aspect of the present invention, in the first or second aspect of the invention, the reference point grouping means obtains the outline of the mass region, and then determines the reference point inside the outline and from the outline. It is characterized by being arranged at a specified distance.

  According to a fifth aspect of the present invention, in the first to third aspects of the invention, the length and the maximum width of a line element that constitutes the lump region using a reference point for each reference point group obtained by the line element extraction means. And a feature amount measuring means for measuring at least one feature amount of average width, area, perimeter, barycentric coordinates, and average luminance.

  In the invention of claim 6, in the invention of claim 5, the feature amount measuring means obtains the shortest line segment that passes through the reference point and reaches the outline of the lump region for each reference point group, and One of the polygon that connects the ends and the polygon that connects the common tangents of a circle having a diameter of the line segment is used as a pseudo-line element that approximates the line element, and the feature amount is obtained for the pseudo-line element. Features.

  In the invention of claim 7, in the invention of claim 5 or claim 6, the feature amount measuring means obtains the shortest line segment that passes through the reference point for each reference point group and reaches the outline of the mass region, The center of the circle whose diameter is the line segment is obtained, and the line connecting the centers of the circles is used as the core line of the lump region.

  According to the configuration of the first aspect of the present invention, a plurality of reference points are set inside the lump area extracted from the image of the linear figure, and the reference points that can be confirmed to exist inside one lump area are substantially straight lines. Each reference point arranged above is grouped as a group candidate, and a reference point shared by multiple group candidates or a reference point that joins multiple group candidates is used as an intersection, branch point, bending point, etc. in a linear figure The reference point group corresponding to the line element is obtained in a one-to-one correspondence by appropriately integrating the group candidate using the positional relationship between the group candidate and the singular point. That is, line elements that are connected are extracted. Therefore, even for a line figure having a large line width, it is possible to accurately detect a topology and detect a line element without error.

  According to the configuration of the second aspect of the invention, the reference point that is the end point of the line element is obtained, and the presence / absence of the reference point that is the bending point, the branch point, or the intersection is determined, so the topology information is obtained from the relationship between the line elements. When used for handwritten character recognition, topology information necessary for improving recognition accuracy can be acquired.

  According to the configuration of the invention of claim 3, a reference point group corresponding to a line element in a one-to-one correspondence with a small number of reference points by arranging reference points on a core line including topology information of a linear figure. Can be extracted.

  According to the configuration of the fourth aspect of the present invention, since the reference point can be easily arranged even in a linear figure having a large line width that takes a long time to obtain the core wire, the linear shape having a large line width. When the reference points are arranged with respect to the figure, the processing load can be reduced as compared with the case of obtaining the core line.

  According to the configuration of the invention of claim 5, the feature quantity of the linear figure can be obtained using the image. Therefore, it can be used for the purpose of measuring the length and width of hair and fibers.

  According to the configuration of the invention of claim 6, since the characteristic amount is obtained by setting the pseudo line element that approximates the line element, it is difficult to define the line width such as the part where the line element intersects. Can also determine the line width of the line element (such as the intersection of the pseudo-line elements u1 ′ and u2 ′ in FIG. 11).

  According to the configuration of the seventh aspect of the invention, since the center of the circle arranged along the contour line is the core line, the core line for each line element can be obtained without impairing the topology of the linear figure.

  The apparatus used in the present embodiment is the same as the conventional configuration shown in FIG. 10, and the difference from the conventional configuration is the configuration of the image processing apparatus 14. Therefore, only the image processing apparatus 14 will be described below. A case where a character 20 such as a handwritten character written on the object 10 such as paper is recognized will be described as an example.

  As shown in FIG. 1, the image processing apparatus 14 according to the present embodiment includes a lump area extraction unit 1 that cuts out an area occupied by a line figure from a grayscale image stored in a storage device 13 as a lump area. The lump area cut out by the lump area extracting unit 1 is transferred to the reference point grouping unit 2, and the reference point grouping unit 2 sets a plurality of reference points separated from each other inside the lump region. The reference point grouping means 2 generates a connecting line segment that connects the set reference points to each other, and a reference that satisfies the conditions described later among the combinations of reference points that are connected by a connecting line segment that passes only inside the block region. Consider a point as a reference point that may be contained in the same line element. A group of reference points corresponding to a line element is referred to as a reference point group (described later), and a group of reference points that are candidates for a reference point group is referred to as a group candidate. Note that the group candidate may include only one reference point. The reference point grouping means 2 classifies all reference points into any group candidate.

  The image processing device 14 is provided with singular point detection means 3 for detecting, as singular points, reference points that can be associated with each other among a plurality of group candidates for the group candidates classified by the reference point grouping means 2. Based on the positional relationship between each group candidate and a singular point, there is provided a linear figure extracting means 4 for evaluating the continuity (that is, the continuity of the line elements) of the intersection, contact (branch), and point sequence of reference points . The linear figure extraction means 4 extracts a point sequence of smoothly connected reference points as a linear figure.

  Hereinafter, each unit of the image processing apparatus 14 will be described in more detail.

(Lump area extraction means)
As shown in FIG. 2, the lump area extracting unit 1 extracts lump areas rb1 and rb2 that form a line figure C1 from a grayscale image. In extracting the lump areas rb1 and rb2, the grayscale image is sufficiently clear and sufficiently large for the pixel values (brightness values) inside the lump areas rb1 and rb2 and the brightness values other than the lump areas rb1 and rb2. When there is a difference, the lump areas rb1 and rb2 can be extracted simply by binarization.

  However, for example, when the object 10 has uneven illuminance, the character 20 has uneven density, or the background has a pattern, the lump areas rb1 and rb2 cannot be extracted even if binarization is simply performed. Sometimes. In such a case, the edges are extracted from the grayscale image using a Sobel filter or the like and the continuous edges are traced to find the circular and sufficiently long edges cb1 and cb2 shown in FIG. The insides of the edges cb1 and cb2 are defined as lump areas rb1 and rb2. The technique for extracting the edges and tracking the contour lines of the mass regions rb1 and rb2 is well known and will not be described in detail.

  In the lump area extraction means 1, regardless of the method of extracting the lump areas rb1 and rb2, the inner pixel value and the outer pixel value of the lump areas rb1 and rb2 are made different from each other from the grayscale image. Generate a binary image. In the following description, it is assumed that 1 is assigned to the inner pixels of the mass regions rb1 and rb2, and 0 is assigned to the outer pixels.

(Reference point grouping means)
The reference point grouping means 2 arranges the reference points p1 to p19 at appropriate positions inside the lump areas rb1 and rb2, for example, as shown in FIG. The reference points p1 to p19 are arranged at appropriate intervals on the core lines bb1 and bb2 extracted by the skeleton extraction described as the conventional technique. As the distance between the reference points p1 to p19 is smaller, the line elements can be extracted without error. However, if the number of the reference points p1 to p19 increases, the processing load when extracting the group candidates increases. The distance between the reference points p1 to p19 is determined so that two or more reference points p1 to p19 are set in the shortest line element to be detected. Therefore, the interval between the reference points p <b> 1 to p <b> 19 is first determined by the person according to the object 10.

  In the example shown in FIG. 3, the numerical value given to distinguish the reference points p1 to p19 is a large value from the top to the bottom in the image, and from the left to the right when the vertical position is the same. A large value is set. That is, numerical values are assigned in a so-called raster order. Here, the coordinates of the reference points p1 to p19 in the image are known.

  In the above example, the skeleton extraction is performed and the reference points p1 to p19 are set on the core lines bb1 and bb2. However, in the skeleton extraction process, the pixels of the lump areas rb1 and rb2 are scraped in order from the periphery. Since the process is repeated, it is necessary to search the outlines of the lump areas rb1 and rb2 as many times as the number of pixels of the part having the largest line width. When the line width of the character 20 is large, the processing load is extremely increased. There are things to do.

  Therefore, instead of arranging the reference points p1 to p19 on the core lines bb1 and bb2 extracted by the skeleton processing as described above, as shown in FIG. 4, from the contour lines (edges cb1 and cb2) of the lump areas rb1 and rb2 Alternatively, a reference point pn (n is a positive integer) may be arranged at an inner portion of about one quarter of the line width of the mass regions rb1 and rb2. That is, the reference point pn is arranged at a distance defined from the edges cb1 and cb2. The intervals between the reference points pn along the contour lines cb1 and cb2 are the same as when the reference points p1 to p19 are set on the core lines bb1 and bb2. Also, the numerical value given to distinguish each reference point pn is also in raster order.

  In the reference point grouping means 2, after setting the reference points p1 to p19, as shown in FIG. 5, the connecting line segments s (i, j) (i, j are connecting line segments) that connect the reference points p1 to p19 to each other. Set a numerical value that represents the reference point connected by. For example, a connecting line segment drawn from the reference point p11 toward the reference point p1 is represented as s (11,1).

  In the example shown in FIG. 5, for each of the reference points p1 to p19, the connecting line segment s (i, j) toward all the other reference points p1 to p19 is set, so that each of the 19 reference points p1 to p19 is set. 18 connecting line segments s (i, j) are set. Therefore, the number of connecting line segments s (i, j) is 342 in consideration of the direction, but the connecting line segment s (i, i) whose start point and end point coincide with each other is also included. If the direction is ignored in s (i, i), a total of 361 connecting line segments s (i, j) exist.

  Here, as a first condition for obtaining the group candidates described above, a set of reference points p1 to p19 connected by a connecting line segment s (i, j) passing only inside the lump areas rb1 and rb2 is extracted. . When the connecting line segment s (i, j) passes outside the block regions rb1 and rb2, a pixel having a pixel value of 0 exists on the connecting line segment s (i, j). A condition determination can be made for each connecting line segment s (i, j) only by determination.

  For example, as shown in FIG. 5, the connecting line segment s (11, j) starting from the reference point p11 is represented by s (11,1), s (11,3), s (11,12), s ( 11, 17) and the like, and among these three, the connecting line segments s (11, 1) and s (11, 12) pass only inside the mass region rb 1.

  In the example shown in FIG. 5, a connecting line segment s (i, j) that passes only inside the lump areas rb1 and rb2 is represented by ◯, and a connecting line segment s (i, j) that passes the outside is represented by ×. It becomes like 1. Note that the connecting line segment s (i, i) where the start point and the end point coincide with each other is ◯. In the left column of Table 1, the connecting line segment s (i, j) is the reference points p1 to p19 having the starting point (that is, the reference point pi), and the horizontal column in the upper column of Table 1 is the connecting line segment s (i, j, i). j) are the end point reference points p1 to p19 (that is, the reference point pj). The column in the right column of Table 1 indicates the number of all connected line segments s (ij) starting from the reference points p1 to p19 in the left column that pass only inside the mass regions rb1 and rb2. (That is, it represents the number of circles lined up horizontally). Hereinafter, the numerical values in the right column are referred to as “corresponding points”.

  The purpose of obtaining the group candidates is to separate the reference points p1 to p19 existing in the same block region rb1 and rb2 (in the example of FIG. 9, reference point groups (described later) of the reference points p1 to p15 and the reference points p14 to p14). Therefore, the reference point group is obtained by using the connecting line segment s (i, j) corresponding to ◯ in Table 1.

  As shown in FIG. 5, if four connected line segments s (11,1), s (11,3), s (11,12), and s (11,17) starting from the reference point p11 are evaluated, Since the connecting line segments s (11,1) and s (11,12) pass only inside the same lump area rb1, the reference points p1 and p12 exist inside the same lump area rb1 as the reference point p11. You can confirm that you are. On the other hand, since the connecting line segments s (11,3) and s (11,17) pass outside the lump area rb1, whether or not the reference points p3 and p17 exist inside the lump area rb1 that is the same as the reference point p11. I can not confirm. Actually, the reference point p3 exists inside the same lump area rb1 as the reference point p11. However, depending on the connecting line segment s (11, j) starting from the reference point p11, it may be the same lump area rb1. I can't confirm.

  As is clear from the above-described example, for each reference point p1 to p19, a connecting line segment s (i, j) starting from the reference point p1 to p19 is set, and each connecting line segment s (i, j) is set. Is evaluated whether it passes only inside or outside of the mass regions rb1 and rb2, the reference points p1 to p19 that are the start points of the respective connecting line segments s (i, j) and the reference points p1 to p19 that are the end points Can exist in the same lump area rb1, rb2. Therefore, if the reference points p1 to p19 at both ends of the connecting line segment s (i, j) that do not pass outside the lump areas rb1 and rb2 are the same group candidates, the lump areas rb1 and rb2 can be separated.

  Further, when the connecting line segment s (i, j) connecting the two reference points p1 to p19 that are separated from each other does not pass outside the mass regions rb1 and rb2, the reference points p1 to p19 are connected. The mass regions rb1 and rb2 are considered to be linear, and it can be said that the reference points p1 to p19 arranged between the two reference points p1 to p19 are generally arranged on one straight line.

  A method for obtaining group candidates based on the above viewpoint will be described below. First, group candidates are obtained in order from reference points p1 to p12 having a small number of corresponding points in Table 1. At this time, the next group candidate is obtained by removing the reference points p1 to p19 included in the other group candidates. When there are a plurality of reference points p1 to p19 having the same number of corresponding points, group candidates are obtained in the raster order of the reference points p1 to p19. Here, in the group candidate obtained later, the reference points p1 to p19 included in the previously obtained group candidate are removed and set as the group candidate. The reason for selecting from the smaller number of corresponding points is to facilitate the search for singular points in the processing by the singular point detection means 3 described later.

  As an example, when the group candidate is obtained based on Table 1, first, since the number of corresponding points of the reference point p15 is 2 and the smallest, the reference points p13 and p15 to which the circle is given for the reference point p15 are set as the first group candidates. To do. Except for the reference points p13 and p15, the next smallest number of corresponding points is 4 of the reference point p14 and the reference point p19. Let p16, p17, and p18 be the second group candidates. Next, the reference point p19 is selected. Among the reference points p16, p17, p18, and p19 to which the circle is given for the reference point p19, the reference points p16, p17, and p18 are included in the second group candidate. Therefore, only the reference point p19 is set as the third group candidate.

  If the same processing is repeated, the next selected point is the reference point p1, and the reference points p1, p2, p5, p7, p9, and p11 become the fourth group candidates and are selected next. Is the reference point p3, and the reference points p3, p4, p6, p8, and p10 are the fifth group candidates. Finally, the reference point p12 remains and the reference point p12 becomes the sixth group candidate.

  The reference point grouping means 2 performs the above processing, and in the example shown in FIG. 5, six group candidates are obtained. The first group candidate is reference points p13, p15, the second group candidate is reference points p14, p16, p17, p18, the third group candidate is reference point p19, and the fourth group candidate is reference points p1, p2, p5, p7, p9, p11, the fifth group candidate includes reference points p3, p4, p6, p8, p10, and the sixth group candidate includes a reference point p12.

(Singularity detection means)
When the group candidate is obtained as described above, the singularity detection means 3 includes the same group regions rb1 and rb2 as the reference points p1 to p19 of other group candidates among the reference points p1 to p19 of one group candidate. Extracted reference points p1 to p19 are extracted. That is, the reference points p1 to p19 that can combine two group candidates and combine them into one lump area rb1, rb2 are extracted. Hereinafter, such reference points p1 to p19 are referred to as “singular points”. A singular point is a point that is expected to correspond to a site where crossing, branching, contact, bending, or the like occurs. The singular point detection means 3 sets the singular point as a new group candidate together with the reference points of other group candidates that have been confirmed to be included in the same lump region rb1, rb2.

  For example, if a singular point is obtained for two reference points p13 and p15 included in the first group candidate, it is included in the first group candidate that the same lump region rb1 can be confirmed for the reference point p15. Since it is only the reference point p13, it does not have a singular point, but it can be confirmed that the reference point p13 exists in the same lump area rb1 as the reference point p12 included in the sixth group candidate other than the reference point p15. . Therefore, the reference point p13 becomes a singular point in the first group candidate. Therefore, the reference point p12 that has been confirmed to exist in the same lump region rb1 as the singular point reference point p13 is set as the seventh group candidate together with the singular point reference point p13. In the sixth group candidate, the reference point p12 is a singular point.

  Regarding the second group candidate, among the reference points p14, p16, p17, and p18, the reference points p16, p17, and p18 are present in the same lump region rb2 as the reference point p19 of the third group candidate. Since there are the reference points p16, p17, and p18, the reference point p18 that is closest to the reference point p19 is set as a singular point obtained from the second group candidate. Further, the reference point p19 is set as a singular point of the third group candidate. That is, the reference points p18 and p19 are set as eighth group candidates.

  In the fourth group candidate, the reference point p7 among the reference points p1, p2, p5, p7, p9, and p11 is the same block region as all the reference points p3, p4, p6, p8, and p10 of the fifth group candidate. Since it can be confirmed that it exists in rb1, the reference point p7 is set as a singular point common to the fourth group candidate and the fifth group candidate. The reference point p7 is not included in the reference points p3, p4, p6, p8, and p10 of the fifth group candidate, but all the reference points p3, p4, p6 of the fifth group candidate are included in the reference point p7. Since it exists in the same lump area rb1 as p8 and p10, the reference point p7 is treated as the reference point of the fifth group candidate.

  Therefore, the fourth group candidate reference points p1, p2, p5, p7, p9, and p11 and the fifth group candidate reference points p3, p4, p6, p8, and p10 are the same lump region rb1. Reference points p5, p6 and reference points p8, p9 that can be confirmed are not adopted as singular points. Further, since only one reference point p7 is independent, it is not necessary to provide a new group candidate.

  Furthermore, since the reference point p12 of the sixth group candidate is the same lump region rb1 as the reference point p11 of the fourth group candidate, the reference point p11 and the reference point p12 are set as singular points. That is, the reference points p11 and p12 are set as the ninth group candidate.

  To summarize the singular points, the reference point p13 for the first group candidate, the reference point p18 for the second group candidate, the reference point p19 for the third group candidate, the reference point p7 and the reference point p11 for the fourth group candidate, The fifth group candidate is the reference point p7, and the sixth group candidate is the reference point p12. In addition, the seventh group candidate generated by the singular point detection means 3 is composed of reference points p12 and p13 which are singular points, and the eighth group candidate is composed of reference points p18 and p19 which are singular points. A group candidate consists of reference points p11 and p12 which are singular points.

  When Table 1 is rearranged so that the reference points p1 to p19 are grouped for each group candidate obtained as described above, Table 2 is obtained. According to Table 2, the regions where the circles are gathered in a square shape including the diagonal components are the group candidates g1 to g9. Further, the reference points p1 to p19 that overlap in the group candidates g1 to g9 are singular points. FIG. 6 shows the shape corresponding to the shape of FIG. Reference points p7, p11, p12, p13, p18, and p19 indicated by black circles in FIG. 6 are singular points.

(Line element extraction means)
The group candidates g1 to g9 and the singular points obtained by the singular point detection means 3 are given to the line element extraction means 4, and the line elements L1 to L3 are extracted. First, for each group candidate g1 to g9, the distance between the reference points p1 to p19 belonging to the group candidates g1 to g9 is obtained, and the two reference points p1 to p1 having the maximum distance among the group candidates g1 to g9 are obtained. p19 is extracted as an end point of the group candidates g1 to g9.

  In the example shown in FIG. 6, the end points of the group candidate g1 are p13 and p15, the end points of the group candidate g2 are p14 and p18, the end points of the group candidate g3 are p19, the end points of the group candidate g4 are p1 and p11, and the end points of the group candidate g5 Are p3, p10, the end point of the group candidate g6 is p12, the end points of the group candidate g7 are p12, p13, the end points of the group candidate g8 are p18, p19, and the end points of the group candidate g9 are p11, p12.

  When the singular point obtained by the singular point detecting means 3 also serves as the end point extracted as described above, the singular point is a singular point of a site that binds two group candidates g1 to g9. I can say that. In addition, since the reference points p1 to p19 included in the group candidates g1 to g9 are arranged substantially on a straight line, the singular point that also serves as an end point can be specified as a bending point in the topology concept. The group candidates g1 to g9 joined at the bending point constitute the same lump areas rb1 and rb2.

  In the example shown in FIG. 6, the group candidates g1, g4, and g7 form one group candidate having the reference points p12 and p13 as bending points. The group candidates g2, g3, and g8 form one group candidate with the reference points p18 and p19 as the inflection points, and the group candidates g4, g7, and g9 have one group candidate with the reference points p11 and p12 as the inflection points. Form. By repeating such processing, there are no singular points that also serve as end points, and finally three groups are formed as shown in FIG. Each such group is called a reference point. The reference point group is considered to correspond one-to-one with the line elements u1 to u3.

  When the singular point is not an end point of the group candidates g1 to g9, the singular point can be said to be a branch point or an intersection. That is, when the group candidate g1 to g9 to which the singular point belongs is not an end point, the singular point is an intersection, and at all one group candidate g1 to g9 to which the singular point belongs, at least one group candidate g1 to g9 is an end point. In this case, it can be determined that the singular point is a branch point.

  In the example shown in FIG. 6, the reference point p7 is a singular point, and this singular point belongs to the two group candidates g4 and g5, and is not an end point in either group candidate g4 or g5. p7 is determined to be an intersection. That is, it can be determined that these group candidates g4 and g5 are independent line elements. Further, the group candidate g4 constitutes the same lump area rb1 as the group candidates g1, g6, and g7, and no intersection or branch point occurs in the group candidates g1, g4, g6, and g7. Group candidates g1, g4, g6, and g7 are extracted as reference point groups corresponding to the line element u1, and group candidate g5 is extracted as a reference point group corresponding to the line element u2. Further, since the group candidates g2, g3, and g8 do not have singular points that are intersections or branch points, they are extracted as reference point groups corresponding to line elements u3 that are independent from other reference point groups.

  Since each reference point group corresponds to the line elements u1 to u3, the line figure C1 can be decomposed into the line elements u1 to u3 by the above-described processing by the line element extraction means 4.

(Additional processing)
By the way, in the above-mentioned example, the case where two group candidates share a singular point with respect to the group candidate has been described as a case where only one singular point is shared. In some cases, singularities are shared.

  For example, in the linear figure C2 having the shape shown in FIG. 8, the two reference points p5 and p6 are both singular points shared by the group candidates g1 and g2. In the illustrated example, the singular points (reference points p5 and p6) in the illustrated example are determined to be the intersection and the reference point p6 is determined to be a bending point in the above-described determination method. That is, although the group candidates g1 and g2 are the same, different types of singular points are determined. In preparation for such a case, priorities are determined for the types of singular points, and the types of singular points are determined in the order of bending points, branch points, and intersections. That is, in the example shown in FIG. 8, the reference point p6 that is the bending point among the singular points (reference points p5 and p6) shared by the group candidates g1 and g2 is adopted, and the group candidates g1 and g2 are connected at the bending point. Judged as a reference point group. That is, the linear figure C2 as shown in FIG. 8 is extracted as a continuous line element.

  Further, in the linear figure C3 such as a handwritten character, as shown in FIG. 9A, a portion that should become one lump area may be separated into a plurality of lump areas rb1 and rb2 due to fading or the like. In addition, as shown in FIG. 9B, a part that should become a branch point may be separated into two reference point groups that intersect because the singular point is determined to be an intersection due to bleeding or the like. Alternatively, as shown in FIG. 9C, the parts to be connected may be separated into a plurality of lump areas rb1 and rb2 instead of one lump area. In such a case, the correct topology of the line element cannot be extracted. Hereinafter, a method for restoring the topology in each case illustrated in FIG. 9 will be briefly described.

  In the example shown in FIG. 9A, two reference point groups are detected and it is determined as if there are two line elements u1 and u2, but they need to be combined into one line element. Therefore, the straight lines k1 and k2 passing through the two reference points p11, p12, p21 and p22 that are the end points in the respective line elements u1 and u2 are obtained, and the angle δ formed by both the straight lines k1 and k2 is different from the line elements u1 and u2 The distance d0 between the reference points p12 and p21 that are the end points closer to each other is obtained, and the angle δ and the distance d0 are evaluated. When the angle δ is larger than the prescribed angle and the distance d0 is shorter than the prescribed length, the line elements u1 and u2 are integrated as a group of line elements.

  In the example shown in FIG. 9B, it is determined that the two line elements u3 and u4 intersect, but the reference point p31 that is an end point from the singular point cp determined to be the intersection for both line elements u3 and u4. , P32, p41, and p42, the distance d1 to the reference point p41 that is the end point with the shortest distance from the singular point cp is obtained, and the distance d1 is evaluated. When the distance d1 is shorter than the specified length, the singular point cp is corrected as a branch point instead of a branch point. Further, since the singular point cp is corrected to the branch point, no reference point is required from the singular point cp to the reference point p41 as the end point in the line element u4, and therefore, between the singular point cp and the reference point p41 as the end point. All existing reference points are discarded, and the singular point cp is set as one end point of the line element u4.

  In the example shown in FIG. 9C, the line element u5 among the reference points p61 and p62 serving as the end points of the line element u6 is connected to the straight line connecting the two reference points p51 and p52 serving as the end points of the line element u5. The length d2 is evaluated by obtaining the length d2 of the perpendicular when the perpendicular is drawn from the reference point p61 which is the near end point. When the length d2 of the perpendicular is shorter than the specified length, the perpendicular leg is set as a virtual branch point bp, and the branch point bp is added to the line elements u5 and u6. That is, by adding the branch point bp shared by the line elements u5 and u6, the line elements u5 and u6 are integrated as a group of line elements.

  By performing the processing described above, it is possible to extract smoothly connected line elements from a linear graphic image having a relatively large line width and to analyze the topology of the extracted line elements. When it is sufficient to obtain information about the topology of a linear figure and the length of the line elements constituting the linear figure as in character recognition, the above-described processing can be used.

(Measurement of linear figures)
In the above example, the technique for extracting line elements in order to analyze the topology of the line figure has been described. However, it is possible to measure the feature amount of the line elements detected from the grayscale image by the line element extraction unit 4. . Features include geometric features such as length, maximum width, average width, area, perimeter, and barycentric coordinates, as well as average brightness obtained from the grayscale image of the part corresponding to the line element region. The maximum luminance is also a feature amount of the line element. When measuring the feature amount, a feature amount measuring means (not shown) is added. Hereinafter, the feature amount measuring unit will be described.

  In order to measure the feature amount of the line element by the feature amount measuring means, first, as shown in FIG. 10, among the reference points p1 to p19 (see FIG. 7) used for extracting the line element, a plurality of line elements are used. For all the reference points p1 to 6, p8 to p19 except for the reference point p7 shared in step 1, the shortest line segment that passes through the reference points p1 to 6 and p8 to p19 and reaches the boundary of the mass regions rb1 and rb2 is obtained. Even if it is a singular point, if it is not an intersection, the same line segment will be calculated without being excluded. For example, in FIG. 7, reference points p12 and p13 are singular points, but both reference points p12 and p13 are not excluded because they are included in one line element. In short, inflection points are not excluded, but branching points or intersections are excluded.

  Since the obtained line segments substantially coincide with the line width of the linear figure C1 at the portions corresponding to the reference points p1 to 6, p8 to p19, as shown in FIG. 11, the reference points p1 to p6 and p8 A circle having the diameter of the line segment is defined around ~ p19. As shown in FIG. 11, pseudo-line elements u1 ′ to u3 ′ approximated to the line elements u1 to u3 are obtained by connecting adjacent circles with tangent lines for each circle set in this way.

  If a pseudo-line element is generated by the above-described processing, each line element constituting the line figure is not affected by a change in the line width near the intersection and the line is drawn using a simple geometric figure with the reference point as a reference point. It is possible to approximate a figure. In the above example, a pseudo-line element that is polygonalized by a tangent to a circle is generated, but a polygon that connects the ends of line segments set for each reference point may be formed and used as a pseudo-line element. .

  Since the pseudo-line element substantially coincides with the line element, if the feature amount is measured for each pseudo-line element, the feature amount of each line element can be measured. As for the pseudo-line element, the higher the density of reference points, the higher the accuracy of approximation of each line element, and as a result, the measurement accuracy of the feature amount also increases. Therefore, the feature quantity measuring means may add not only the reference points used for extracting the line elements but also auxiliary reference points for extracting the feature quantities before generating the pseudo-line elements. .

  Further, in order to increase the accuracy of approximation by the pseudo-line element, the mass regions rb1 and rb2 are completely included by extending the radius of the circle used for generating the pseudo-line element by a predetermined width. Alternatively, the pseudo-line element may be enlarged, and the feature amount may be obtained only for the pixels in the areas that are the mass areas rb1 and rb2 inside the pseudo-line element.

  The example described with reference to FIGS. 10 and 11 is an example in which the reference points p1 to p19 are arranged along the core lines bb1 and bb2 of the linear figure C1 as shown in FIG. Thus, even when the reference points p1 to p36 are arranged in the vicinity of the outlines cb1 and cb2 of the mass regions rb1 and rb2, pseudowire elements can be generated by the same processing procedure.

  That is, as shown in FIG. 12, the pixels on the contour lines cb1 and cb2 located at the shortest distance from the respective reference points p1 to p36 are determined as one end of the diameter of the circle, and the straight line connecting the pixel and the reference point is opposite. The circle is set with the position reaching the side contour line as the other end of the diameter of the circle. The subsequent processing is the same as the processing described with reference to FIGS. 10 and 11, and a pseudo-line element on the polygon is formed by the common tangent of each circle.

  When the pseudo-line element is generated as shown in FIG. 12, the broken line connecting the center points of the circles approximates the core line of the linear figure. Unlike the core line obtained by the skeleton extraction process, this core line is a core line that preserves the topology of the linear figure. Further, as in the example illustrated in FIG. 4, the core wire can be obtained even when the core wire is not obtained first. In addition, when a circle is set as shown in FIG. 11, there is a case where the bent part cannot be accurately approximated with respect to the original linear figure (the broken line part at the right end of FIG. 11 cannot be approximated). If a circle is set as shown in FIG. 12, the accuracy of approximation of the bent portion can be increased.

  The technique described above can also be used for linear figures other than handwritten characters. For example, it is possible to separate and extract individual hair and fibers from the image of hair and fibers, and to determine not only the number of hairs and fibers but also the characteristic quantities such as the individual thickness and length of the hair and fibers. . Taking hair as an example, it can be used for purposes such as diagnosing the degree of hair loss by determining the average value of the thickness of the hair and the number per unit area. Alternatively, it can also be used when analyzing the shape of a gene from an image of a stained cell or measuring the number and shape of wrinkles from an image of a facial part of a human body.

  When using in the field | area which makes hair and fiber object, not only the shape of a line element but the information of the thickness of a line element is also required about each extracted line element. For example, when evaluating hair loss by analyzing hair images, it is necessary to measure the average value of the thickness of the hair along with the density of the hair, the proportion of the hair of the specified thickness or more, etc. as an evaluation index. There is. These requests can be met by extracting feature amounts as described above.

  By the way, it can be used as known knowledge that there is no line element bent at an acute angle in hair. When this kind of a priori knowledge can be used, when extracting a line element, a feature quantity such as an intersection angle of the line element may be used as a condition for separating the line element. . For example, in the example shown in FIG. 8, the connecting line segments s (1,6) and s (11 corresponding to the reference points p1 and p6 that are the end points of the group candidate g1 and the reference points p6 and p11 that are the end points of the group candidate g2. , 6), a predetermined threshold value is set for the angle, and if this angle is equal to or smaller than the set threshold value, the reference point p6 is not a bending point but is regarded as an “overlapping end point” and group candidates g1, g2 Are extracted as independent line elements. That is, when extracting line elements, the conditions for extracting line elements are changed as appropriate according to the target to be extracted.

It is a block diagram which shows embodiment of this invention. It is a figure explaining the concept of the lump area | region in the same as the above. It is a figure which shows the example of arrangement | positioning of the reference point in the same as the above. It is a figure which shows the other example of arrangement | positioning of the reference point in the same as the above. It is a figure which shows the example of the connection line segment in the same as the above. It is a figure which shows the concept of the group candidate in the same as the above. It is a figure which shows the example of the reference point group in the same as the above. It is a figure which shows the example of extraction of the group candidate in the same as the above. It is a figure explaining the restoration method of topology in the same as the above. It is a figure explaining the method of extracting a feature-value in the same as the above. It is a figure explaining the method of extracting a feature-value in the same as the above. It is a figure explaining the method of extracting a feature-value using the reference point shown in FIG. 4 in the same as the above. It is a block diagram which shows the structural example of a system. It is a figure which shows an example of a linear figure. It is a figure which shows the example of ideal thinning of the linear figure shown in FIG. It is a figure which shows the example when the linear figure shown in FIG. 14 is thinned.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Lump area extraction means 2 Reference point grouping means 3 Singular point detection means 4 Line element extraction means C1 Line figure cb1, cb2 Outline g1-g9 Group candidate pn Reference point rb1, rb2 Lump area s (i, j) Connection line Minute u1-u3 line element u1-u3 'pseudo-line element

Claims (7)

  In the method of analyzing a linear figure that separates line elements individually from an image of a linear figure composed of a plurality of line elements, a mass area extracting means for extracting an area occupied by the linear figure in the image as a mass area, and a mass area A plurality of reference points that are spaced apart from each other inside and grouping one combination of reference points that are connected by a connecting line segment that passes only inside the block region among the connecting line segments that connect other reference points to each other Reference point grouping means for associating all reference points with any group candidate as candidates, singular point detection means for detecting reference points associated with a plurality of group candidates among the reference points as singular points, group candidates and singularities Line element extraction means for evaluating the continuity of the point sequence of the reference points using the positional relationship with the points and extracting a reference point group corresponding to the line elements on a one-to-one basis; The method of analyzing a linear shape, wherein.   The line element extraction means uses a reference point included in the extracted reference point group to obtain a reference point that is an end point of the line element, and whether there is a reference point corresponding to any of a bending point, a branch point, and an intersection The method for analyzing a linear figure according to claim 1, wherein:   3. The method for analyzing a linear figure according to claim 1, wherein the reference point grouping unit arranges the reference points on the core line after obtaining the core line of the block region.   3. The reference point grouping means, after obtaining the outline of the block region, arranges the reference point at a distance defined inside the outline and defined from the outline. Analysis method of the described linear figure.   With respect to the line elements constituting the mass area using the reference points for each reference point group obtained by the line element extraction means, at least one of length, maximum width, average width, area, perimeter length, barycentric coordinates, and average luminance is used. 4. The method for analyzing a linear figure according to any one of claims 1 to 3, further comprising a feature quantity measuring unit for measuring one feature quantity.   The feature amount measuring means obtains the shortest line segment that passes through the reference point for each reference point group and reaches the outline of the lump region, and connects the polygons connecting the ends of the line segment and the line segment to the diameter. 6. The method of analyzing a linear figure according to claim 5, wherein one of the polygons connecting the common tangents of the circles to be used is a pseudo-line element approximating the line element, and the feature amount is obtained for the pseudo-line element. .   The feature amount measuring means obtains the shortest line segment that passes through the reference point for each reference point group and reaches the outline of the lump region, obtains the center of a circle having the diameter of the line segment, and determines the center of the circle. The method for analyzing a linear figure according to claim 5 or 6, wherein the connecting line is a core line of the lump area.

Images