KR20230012651A - Method for generating table information based on the image - Google Patents

Abstract

According to one embodiment of the present disclosure, a method of generating image-based table information performed by a computing device including at least one processor is disclosed. The method includes generating a first virtual table by detecting one or more boundary lines constituting a table included in an image, the table including at least one merged cell; generating a second virtual table by extending the one or more boundary lines constituting the first virtual table; generating a cell set for merging by comparing the first virtual table and the second virtual table; generating content information for at least one content included in the table based on the first virtual table; and generating machine-readable table information based on the cell set for merging and the content information.

Description

Method for generating image-based table information {METHOD FOR GENERATING TABLE INFORMATION BASED ON THE IMAGE}

The present disclosure relates to a method of generating image-based table information, and more particularly, to a method of generating information about a table displayed as an image.

As a representative computer vision technology for identifying characters, tables, etc. included in an image, there is an optical character recognition (OCR) technology. In particular, an image-based table includes borders constituting the table and content composed of characters in the form of an image, and conventionally OCR is used to analyze the content and relative position of the image-based table. to obtain information about the table.

However, in the conventional method, there is a technical limitation that it is difficult to grasp specific information about an image-based table composed of a plurality of cells having a complex structure, such as an empty cell without content or a merged cell in which two or more cells are merged.

In addition, as modern technology develops and more and more types of image data appear, a technology capable of generating detailed information about an image-based table in a computer-readable format is required.

Korean Registered Patent No. 10-1811581

The present disclosure has been made in response to the above background art, and is intended to provide a method for generating specific table information for an image-based table.

The technical problems of the present disclosure are not limited to the technical problems mentioned above, and other technical problems not mentioned will be clearly understood by those skilled in the art from the following description.

A method of generating image-based table information performed by a computing device including at least one processor for solving the above problems is disclosed. The method includes generating a first virtual table by detecting one or more boundary lines constituting a table included in an image, the table including at least one merged cell; generating a second virtual table by extending the one or more boundary lines constituting the first virtual table; generating a cell set for merging by comparing the first virtual table and the second virtual table; generating content information for at least one content included in the table based on the first virtual table; and generating machine-readable table information based on the cell set for merging and the content information.

Alternatively, the one or more boundary lines include at least one of an outline, one or more inner vertical lines, or one or more inner horizontal lines, and one or more boundary lines constituting a table included in the image are detected to obtain a first virtual table The generating may include: detecting the outline by detecting location information of a pixel at an upper left corner of the table and location information of a pixel at a lower right corner of the table in the image; generating a horizontal kernel based on the total horizontal length of the image, and detecting the one or more inner horizontal lines of the table using the horizontal kernel; generating a vertical kernel based on the total vertical length of the image, and detecting the one or more inner vertical lines of the table using the vertical kernel; and generating the first virtual table by merging at least one of the outline, the one or more inner horizontal lines, and the one or more inner vertical lines.

Alternatively, generating a cell set for merging by comparing the first virtual table and the second virtual table may include generating first cell information for each of one or more first cells included in the first virtual table; doing; generating second cell information for each of a plurality of second cells included in the second virtual table; and determining the cell set for merging by comparing the first cell information with the second cell information.

Alternatively, the first cell information may include at least one of first center point location information about a center point location of each of the one or more first cells or first cell location information about a location of each of the one or more first cells. And, the second cell information includes at least one of second center point location information about the location of the center point of each of the plurality of second cells or second cell location information about the location of each of the plurality of second cells can include

Alternatively, the determining of the cell set for merging by comparing the first cell information and the second cell information may include the second cell corresponding to each of the first cell information of the one or more first cells. determining whether there is more than one piece of information; and if the second cell information corresponding to the same first cell information is two or more, determining a cell set for merging including the second cell information of each of the plurality of corresponding second cells. there is.

Alternatively, the step of determining whether the second cell information corresponding to each of the first cell information of each of the one or more first cells is two or more may include the corresponding second cell information based on the first center point location information. 2 determining whether center point location information is two or more; or determining whether the corresponding second cell location information is two or more based on the first cell location information.

Alternatively, generating content information for at least one content included in the table based on the first virtual table may include optically generating information about one or more cells of the table based on the first cell location information. extracting the at least one content by performing character recognition (OCR); and generating the content information including the at least one content matched with the first cell location information.

Alternatively, the generating of machine-readable table information based on the cell set for merging and the content information may include generating the second cell of each of the plurality of second cells based on the cell set for merging and the content information. matching a merge tag or the at least one content with cell information; and generating the second cell information matched with the at least one content or the merge tag as the table information.

Alternatively, the at least one cell set for merging may include: a content cell set associated with a location of the at least one content; and a blank cell set not related to the location of the at least one content, wherein the table information includes: first information on any one cell among a plurality of second cells included in the content cell set; second information about the remaining cells among the plurality of second cells included in the content cell set; third information on each of a plurality of second cells included in the empty cell set; fourth information about a cell of the plurality of second cells that is not related to the at least one cell set for merging and is related to the location of the at least one content; or fifth information about a cell of the plurality of second cells that is not related to the at least one cell set for merging and is not related to the location of the at least one content; The at least one content may be matched with each of the first information and the fourth information, and the merge tag may be matched with each of the second information and the third information.

Alternatively, determining a table center based on at least some of the one or more boundary lines constituting the second virtual table; generating a horizontal reference line and a vertical reference line based on the center of the table; determining the maximum number of rows of the table based on a first number of times that pixel color values are changed along the horizontal reference line; determining the maximum number of columns of the table based on a second number of times the pixel color value is changed along the vertical reference line; and generating the table information including the maximum number of rows and the maximum number of columns.

A computer program stored in a computer readable storage medium for solving the above problems is disclosed. The computer program, when executed on one or more processors, causes image-based table information to be generated, the operations comprising: one or more border lines constituting a table included in an image, the table including at least one merged cell. detecting and generating a first virtual table; generating a second virtual table by extending the one or more boundary lines constituting the first virtual table; generating a cell set for merging by comparing the first virtual table with the second virtual table; generating content information for at least one content included in the table based on the first virtual table; and generating machine-readable table information based on the cell set for merging and the content information.

A computing device for generating image-based table information to solve the above problems is disclosed. processor; network unit; and a memory, wherein the processor generates a first virtual table by detecting one or more boundary lines constituting a table included in an image, the table including at least one merged cell, and A second virtual table is created by extending the one or more boundary lines constituting , a cell set for merging is created by comparing the first virtual table and the second virtual table, and the table is generated based on the first virtual table. It is possible to generate content information for at least one content included in , and create machine-readable table information based on the cell set for merging and the content information.

The present disclosure may generate machine readable table information by analyzing an image-based table.

Effects obtainable in the present disclosure are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art from the description below. .

Various aspects are now described with reference to the drawings, wherein like reference numbers are used to collectively refer to like elements. In the following embodiments, for explanation purposes, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. However, it will be apparent that such aspect(s) may be practiced without these specific details.
1 is a block diagram of a computing device in accordance with some embodiments of the present disclosure.
2 illustrates an example of an image-based table according to an embodiment of the present disclosure.
FIG. 3 shows a first virtual table of the exemplary image-based table of FIG. 2;
4 illustrates an arbitrary cell capable of configuring a table according to an embodiment of the present disclosure.
FIG. 5 shows relative coordinates of each of one or more cells constituting the table shown in FIG. 2 .
FIG. 6 shows parts related to the boundary lines of the image-based table of FIG. 2 .
7A illustrates an outline of the image-based table of FIG. 2 detected according to an embodiment of the present disclosure.
7B illustrates boundary lines in a horizontal direction detected according to an embodiment of the present disclosure.
7C illustrates boundary lines in a vertical direction detected according to an embodiment of the present disclosure.
FIG. 8A illustrates the first virtual table of FIG. 2 created according to one embodiment of the present disclosure.
Fig. 8b shows the first virtual table of Fig. 8a with completely disjoint border lines indicated by dotted lines.
9A illustrates the second virtual table of FIG. 2 created according to one embodiment of the present disclosure.
FIG. 9B shows relative coordinates of each of one or more second cells included in the second virtual table of FIG. 9A.
FIG. 10 shows the table center, vertical reference line and horizontal reference line for the second virtual table of FIG. 9A.
FIG. 11A shows the first virtual table of FIG. 8A including one or more first cells marked with center points.
FIG. 11B shows the second virtual table of FIG. 9A including two or more second cells marked with center points.
12A illustrates table information in a Dataframe format for the image-based table of FIG. 2 according to an embodiment of the present disclosure.
12b illustrates table information in html format for the image-based table of FIG. 2 according to an embodiment of the present disclosure.
13 is a flowchart of a method of generating image-based table information according to an embodiment of the present disclosure.
14 depicts a simplified and general schematic diagram of an example computing environment in which embodiments of the present disclosure may be implemented.

Various embodiments are now described with reference to the drawings. In this specification, various descriptions are presented to provide an understanding of the present disclosure. However, it is apparent that these embodiments may be practiced without these specific details.

The terms “component,” “module,” “system,” and the like, as used herein, refer to a computer-related entity, hardware, firmware, software, a combination of software and hardware, or an execution of software. For example, a component may be, but is not limited to, a procedure, processor, object, thread of execution, program, and/or computer running on a processor. For example, both an application running on a computing device and a computing device may be components. One or more components may reside within a processor and/or thread of execution. A component can be localized within a single computer. A component may be distributed between two or more computers. Also, these components can execute from various computer readable media having various data structures stored thereon. Components may be connected, for example, via signals with one or more packets of data (e.g., data and/or signals from one component interacting with another component in a local system, distributed system) to other systems and over a network such as the Internet. data being transmitted) may communicate via local and/or remote processes.

In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless otherwise specified or clear from the context, “X employs A or B” is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, if X uses both A and B, "X uses either A or B" may apply to either of these cases. Also, the term "and/or" as used herein should be understood to refer to and include all possible combinations of one or more of the listed related items.

Also, the terms "comprises" and/or "comprising" should be understood to mean that the features and/or components are present. However, it should be understood that the terms "comprises" and/or "comprising" do not exclude the presence or addition of one or more other features, elements, and/or groups thereof. Also, unless otherwise specified or where the context clearly indicates that the singular form is indicated, in this specification and claims, the singular shall generally be construed to mean "one or more".

In addition, the term “at least one of A or B” should be interpreted as meaning “when only A is included”, “when only B is included”, and “when A and B are combined”.

Those skilled in the art will further understand that the various illustrative logical blocks, components, modules, circuits, means, logics, and algorithm steps described in connection with the embodiments disclosed herein may be implemented using electronic hardware, computer software, or combinations of both. It should be recognized that it can be implemented as To clearly illustrate the interchangeability of hardware and software, various illustrative components, blocks, configurations, means, logics, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented in hardware or as software depends on the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application. However, such implementation decisions should not be interpreted as causing a departure from the scope of this disclosure.

The description of the presented embodiments is provided to enable any person skilled in the art to use or practice the present invention. Various modifications to these embodiments will be apparent to those skilled in the art of this disclosure. The general principles defined herein may be applied to other embodiments without departing from the scope of this disclosure. Thus, the present invention is not limited to the embodiments presented herein. The present invention is to be accorded the widest scope consistent with the principles and novel features set forth herein.

A table of the present disclosure may include one or more cells formed by crossing a plurality of boundary lines. Accordingly, the table of the present disclosure is composed of boundary lines and may be composed of one or more cells. At least one of the one or more cells of the present disclosure may be a merged cell in which two or more cells are merged. That is, the table of the present disclosure may include one or more merged cells. In addition, the table of the present disclosure may be in the form of an image, and another type of table may be created or implemented based on table information generated according to embodiments of the present disclosure.

In the present disclosure, the image format may be a multimedia file format such as a photo, a picture, a scanned image or video scanned with a scanner. Accordingly, the image-based table of the present disclosure is a photo or scanned image of a table obtained in various ways, such as a table image included in a photographed photograph, a scanned image of a document including the table, or a typeface image of a document including the table. , pictures or videos, etc. Photos, scan images, pictures, or videos of the above table are merely examples of image-based tables, and the image-based tables of the present disclosure should not be construed as being limited due to the above-described examples.

The machine-readable table information of the present disclosure may be information stored in a machine-readable format. Specifically, the table information of the present disclosure includes information about the table so that the table of the present disclosure can be generated in a different format, and may specifically include information about one or more cells constituting the table. Table information of the present disclosure will be described in detail with reference to the drawings below. A machine-readable format of the present disclosure is as follows, for example, with reference to FIGS. 12A to 12B.

The machine-readable format of the present disclosure may be, for example, a spreadsheet format of pandas Dataframe, html, or xlsx file extension. The foregoing formats are merely examples, and the machine-readable format of the present disclosure is not limited to the foregoing examples.

The boundary line of the present disclosure may be one or more lines constituting a table, and may be lines constituting a cell of the table. In the present disclosure, one or more cells may be detected using a closed curve detection algorithm for boundary lines constituting an image format table, which will be described in detail with reference to later drawings.

The first virtual table of the present disclosure may be a table composed only of boundary lines of an image-based table. Specifically, in the present disclosure, a first virtual table corresponding to the image format table may be generated by detecting boundaries of the image format table, and a second virtual table may be generated based on the first virtual table. Specifically, the second virtual table of the present disclosure may be a table composed of the maximum number of rows and the maximum number of columns of an image-based table. That is, the first virtual table of the present disclosure may include one or more merged cells corresponding to an image-based table, and the second virtual table of the present disclosure may correspond to an image-based table, but each of the one or more merged cells may be merged. It may be composed of a plurality of cells before becoming. The first virtual table and the second virtual table of the present disclosure will be described in detail with reference to the following drawings.

The number of rows of the present disclosure may be the number of one or more cells arranged in the horizontal and horizontal directions of the table, and the number of columns of the present disclosure may be the number of one or more cells arranged in the vertical and vertical directions of the table. When a table includes one or more merged cells, the number of rows or columns of the table may not be constant. Specifically, the non-constant number of rows or columns of a table including merged cells will be described with reference to FIG. 2 .

2 illustrates an example of an image-based table according to an embodiment of the present disclosure.

FIG. 2 shows a table image including two merged cells as an example of an image-based table, wherein the two merged cells are a first merged cell including “Wastewater Treatment Plant” text in which a plurality of cells in a vertical direction are merged. cell and the second merged cell containing the text "Sludge". Accordingly, it can be seen that the number of columns of the table shown in FIG. 2 is 5 or 8 according to the number of cells in the vertical direction. That is, it can be seen that the number of rows in the image-based table of FIG. 2 is constant at three, but the number of columns is not constant. Also, in this case, the maximum number of rows in the table of FIG. 2 may be 3 and the maximum number of columns may be determined to be 8.

The content of the present disclosure may be content included in at least some of one or more cells constituting the table, and in an image-based table, the content may be composed of image-type letters or numbers. Specifically, when the content of the present disclosure is described with reference to FIG. 2 , characters and numbers included in each of one or more cells divided by boundary lines constituting the table shown in FIG. 2 can be regarded as content. Content included in the image-based table of FIG. 2 may also be an image, and OCR may be performed to identify the content. However, it is necessary to distinguish the content identified in the image from which cell of the image-based table. Accordingly, in the present disclosure, content information about a location of content is generated using cell information, and a detailed description thereof will be described later with reference to drawings.

The content information of the present disclosure is information about at least one content included in the image-based table, and may be information in which the position of the content is matched with respect to each of the at least one content. In the present disclosure, a location of content may be a location of a cell of an image-based table each including at least one piece of content. That is, at least some of the one or more cells constituting the image-based table may include content, and the location of each cell including the content may be the location of the content.

Specifically, the description is as follows with reference to FIG. 2 exemplarily illustrating an image-based table. The location of the cell containing the “Source” content may be the location of the “Source” content, and the location of another cell including the “Sludge” content may be the location of the “Sludge” content.

The above descriptions referring to the image-based table of FIG. 2 are only examples, and the image-based table, content, and cell of the present disclosure should not be construed as being limited to FIG. 2 of the present disclosure.

The cell information of the present disclosure is information on each of one or more cells included in the table, and may be unique information capable of identifying each cell. Specifically, the cell information of the present disclosure may include coordinate information, which is information about the location of each of one or more cells, and specifically, the coordinate information is absolute for at least one of the center point of the cell, the upper left point or the lower right point of the cell. It may be information on coordinates, or information on relative coordinates indicating whether a cell corresponds to the next row and column from the reference cell. More specifically, the center point of the cell, the upper left point and the lower right point of the cell will be described with reference to FIGS. 3 and 4 .

FIG. 3 shows a first virtual table of the exemplary image-based table of FIG. 2;

That is, FIG. 3 shows a plurality of boundary lines and one or more cells 2100 constituting the first virtual table 2000 for the image-based table of FIG. 2, and the center point 2130 of each cell 2100 marked with this dot. In addition, in FIG. 3, one arbitrary cell 2100 among one or more cells 2100 constituting the table is displayed in gray shade. As indicated by gray shading, the cell 2100 of the table may be a closed figure surrounded by border lines, and the geometric center of the cell 2100 may be the center point 2130 of the cell 2100 . More specifically, the cell 2100 will be described with reference to FIG. 4 .

4 illustrates an arbitrary cell capable of configuring a table according to an embodiment of the present disclosure.

FIG. 4 shows a center point 2130, an upper left point 2110, and a lower right point 2120 for one cell 2100. Referring to FIG. Specifically, as shown in FIG. 4 , the geometric center of one cell 2100 may be the center point 2130 of the cell 2100, and the upper left point 2110 is the upper left corner along the boundary line forming the cell 2100. , and the lower right point 2120 may be a lower right point along the boundary of the cell 2100 .

In the present disclosure, absolute coordinates may be coordinates of a predetermined absolute coordinate system. For example, the absolute coordinates are coordinate values in an absolute coordinate system based on a predetermined origin for the entire table or the entire image including the image-based table. can include That is, the center of the table, which is the center of the entire table, or the center of the entire image may be set as the origin of (0,0), and the horizontal x-axis and vertical y-axis may be determined as an absolute coordinate system. Here, the absolute coordinates may include an x-axis coordinate value and a y-axis coordinate value.

Specifically, for example, the absolute coordinates of the present disclosure may be coordinate values in an absolute coordinate system having the center of an entire document image including a table as an origin. Alternatively, the absolute coordinates of the present disclosure may be coordinate values in an absolute coordinate system having the center of the entire table as the origin. The above-described absolute coordinates and absolute coordinate system are only examples, and the absolute coordinates and absolute coordinate system of the present disclosure should not be construed as being limited due to the above-described examples.

In the present disclosure, relative coordinates may mean relative row coordinates and column coordinates of one or more cells according to positions of rows and columns of a table. Specifically, an arbitrary cell among one or more cells constituting the table may be set as a reference cell, and row coordinates and column coordinates of the reference cell may be displayed as (0,0), which is a zero point. Here, in the zero point (0,0), which is the relative coordinate of the reference cell, the left number may mean row coordinates, and the right number may mean column coordinates. Accordingly, the relative coordinates for the remaining cells disposed in the row and column directions from the reference cell may be coordinates indicating the cell corresponding to the next row and next column from the reference cell of (0,0) zero point coordinates. there is. Specifically, one cell located at the top left of the table may be determined as a reference cell, and relative coordinates of the reference cell may be set to (0,0), which is a zero point. Relative coordinates may be determined with respect to the reference cell and other cells disposed in the row and column directions. The relative coordinates of the present disclosure are described in detail with reference to FIG. 5 as follows.

FIG. 5 shows relative coordinates of each of one or more cells constituting the table shown in FIG. 2 .

As shown in FIG. 5, the upper left cell having the relative coordinates of (0,0) is the reference cell, and the relative coordinates of the other cells from the reference cell to the right in the row direction are from (0,0) of the reference cell. It can be seen that the row coordinates increase by 1, and the relative coordinates of other cells in the column direction from the reference cell increase by 1 from (0,0) of the reference cell. That is, as shown in FIG. 5, looking at the relative coordinates of each of one or more cells, a cell having relative coordinates of (2,5) corresponds to the next 2nd row and the next 5th column from the reference cell of (0,0). It can be seen that the cell

Tables and one or more cells shown in FIGS. 3 to 5 are merely examples, and the tables and one or more cells of the present disclosure should not be construed as being limited to FIGS. 3 to 5 . In addition, examples of relative coordinates described with reference to FIG. 5 are only examples, and relative coordinates for each of one or more cells of the present disclosure are not limited to the above-described examples.

The cell information of the present disclosure may include at least one of center point location information and cell location information as location information for each of one or more cells included in the table. Center point location information of the present disclosure may be information about center points of one or more cells included in the table. Specifically, the center point location information of the present disclosure may be information including absolute coordinates of the center point of each of the one or more cells described above.

In addition, the cell location information of the present disclosure may be information on the location of each of one or more cells included in the table. Specifically, the cell location information may include at least one of absolute coordinates of an upper left point and lower right point of a corresponding cell, or relative coordinate information of a cell. Here, the upper left point, the lower right point, absolute coordinates, and relative coordinates of the cell are the same as described above.

According to an embodiment of the present disclosure, a location of content in an image-based table and information about two or more merged cells may be determined based on the cell information of the present disclosure described above. Cell information of the present disclosure will be described in more detail with reference to the following drawings.

A cell set for merging according to the present disclosure may be a set of information about two or more cells merged to form one merged cell. Specifically, one merging cell set may correspond to one merging cell, and each of two or more cells constituting one merging cell may be a merging cell. That is, a merged cell is a merged cell, and a merged cell refers to a divided single cell before being merged. Accordingly, one cell set for merging may include cell information on each of two or more cells for merging constituting one merge cell.

For example, in the table, a merged cell may include a first merged cell and two second merged cells, the first merged cell may be a merged cell of two cells, and the second merged cell may be a merged cell of three cells. In this case, each of the two cells constituting the first merge cell may be a first merge cell. Also, the first merging cell set for the first merging cell may include cell information on each of the two first merging cells. Also, each of the three cells constituting the second merge cell may be a second merge cell. Also, the second merging cell set for the second merging cell may include cell information on each of the three second merging cells.

The above-mentioned merging cells, merging cells, and merging cell sets are only examples, and due to the above-described examples, the merging cells, merging cell sets, merging cells, and cell information of the present disclosure should not be construed as being limited. .

Also, the cell set for merging according to the present disclosure may include a content cell set related to the location of at least one content described above and a blank cell set not related to the location of at least one content. Specifically, the image-based table of the present disclosure includes one or more merged cells, and each of the one or more merged cells may include content. Also, the image-based table of the present disclosure may include one or more merged cells that are empty cells that do not contain content. Accordingly, the cell set for merging according to the present disclosure may be divided into a content cell set or an empty cell set according to whether a related merge cell is an empty cell.

The content cell set of the present disclosure may be a merged cell set related to a merged cell including content among cell sets for merging. That is, the merge cell contains content. A cell set for merging including cell information of each of two or more merging cells for the merged cell may be a content cell set.

An empty cell set according to the present disclosure may be a merged cell set related to a merged cell of an empty cell that does not contain content among cell sets for merging. That is, if the merged cell is an empty cell that does not contain content, a cell set for merging including cell information of each of two or more merging cells for the merged cell may be an empty cell set.

In addition, according to the present disclosure, table information may be generated by matching a merge tag or content to cell information included in the cell set for merging based on the aforementioned content information and the cell set for merging. The merge tag of the present disclosure may be a tag indicating that matched cell information is cell information of a cell for merging associated with a certain merged cell.

For example, if there are two merging cells for a table, the merging cell set may be a first merging cell set and a second merging cell set. In addition, the first merge tag is matched with each of two or more cells for first merge included in the cell set for first merge, and the second merge tag is matched with two or more cells for second merge included in the cell set for second merge. It can be matched to each cell. That is, it can be recognized that a cell matching the first merge tag is a cell for merging related to the first merge cell, and a cell matching the second merge tag is a cell for merging related to the second merge cell.

The aforementioned merge tags and cell sets for merging are only examples, and the merge tags and cell sets for merging of the present disclosure should not be construed as being limited due to the above examples.

Hereinafter, a method of generating table information according to an embodiment of the present disclosure will be described.

1 is a block diagram of a computing device in accordance with some embodiments of the present disclosure.

The configuration of the computing device 100 shown in FIG. 1 is only a simplified example. In some embodiments of the present disclosure, the computing device 100 may include other components for performing a computing environment of the computing device 100, and only some of the disclosed components may constitute the computing device 100.

The computing device 100 may include at least one processor 110 , a memory 130 , and a network unit 150 .

The memory 130 according to some embodiments of the present disclosure may store any type of information generated or determined by the processor 110 and any type of information received by the network unit 150 .

According to some embodiments of the present disclosure, the memory 130 may be a flash memory type, a hard disk type, a multimedia card micro type, or a card type memory (eg, SD or XD memory, etc.), RAM (Random Access Memory, RAM), SRAM (Static Random Access Memory), ROM (Read-Only Memory, ROM), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory) -Only Memory), a magnetic memory, a magnetic disk, and an optical disk may include at least one type of storage medium. The computing device 100 may operate in relation to a web storage performing a storage function of the memory 130 on the Internet. The description of the above memory is only an example, and the present disclosure is not limited thereto.

The network unit 150 according to some embodiments of the present disclosure may include any wired/wireless communication network capable of transmitting and receiving data and signals in any format, which is represented in the present disclosure. The techniques described herein may be used in the networks mentioned above as well as other networks.

Hereinafter, a method of generating image-based table information will be described.

According to an embodiment of the present disclosure, the processor 110 may generate a first virtual table by detecting one or more boundary lines constituting a table included in an image.

In the present disclosure, a table may include at least one merged cell. Also, the one or more boundary lines constituting the table may include at least one of an outline, one or more inner vertical lines, and one or more inner horizontal lines. In the present disclosure, outlines are the outermost boundary lines constituting the entire table, inner vertical lines are vertical boundary lines excluding the outline, and inner horizontal lines are horizontal boundary lines excluding the outline.

According to an embodiment of the present disclosure, the processor 110 may detect an outline by detecting location information of a pixel at an upper left corner and a lower right corner of a table in an image. The boundary lines of the image-based table may be lines made of pixels, and the processor 110 uses a pixel point located at the upper left corner and a pixel point located at the lower right corner of the table among the pixels constituting the table to form the table. outlines can be detected. The generation of the first virtual table by detecting the boundary lines according to the present disclosure will be described with reference to FIGS. 6 to 8 .

FIG. 6 shows parts related to the boundary lines of the image-based table of FIG. 2 .

As shown in FIG. 6 , the image-based table 1000 may include inner vertical lines 220 and inner horizontal lines 230 and may include an outermost outline. The outline of the present disclosure may be detected based on the pixel point 10 at the upper left and the pixel point 20 at the lower right in the image-based table. That is, the processor 110 detects absolute coordinates, which is the location information of the upper left pixel point 10 in the image-based table 1000 shown in FIG. 6, and the location information of the lower right pixel point 20, Absolute coordinates can be detected. As described above, the absolute coordinates herein may mean coordinate values of an absolute coordinate system whose origin is the center of the entire table or image.

Accordingly, the outline 210 of the table of FIG. 2 detected by the processor 110 is as shown in FIG. 7A.

7A illustrates an outline of the image-based table of FIG. 2 detected according to an embodiment of the present disclosure.

The processor 110 of the present disclosure may generate a horizontal kernel based on the total horizontal length of an image including a table. In addition, the processor 110 may detect horizontal boundary lines that are horizontal edges by using the generated horizontal kernel. Here, the processor 110 may detect border lines in a horizontal direction having a predetermined length or more, and may additionally remove noise from the image by performing image erosion and expansion. Accordingly, the processor 110 may detect one or more inner horizontal lines 230 of the table using the horizontal kernel. In addition, the detected boundary lines in the horizontal direction may also include boundary lines corresponding to the inner horizontal lines 230 and the horizontal outer line 210 . Internal horizontal lines 230 of the table of FIG. 2 detected by the processor 110 and horizontal boundary lines that are part of the outer line 210 are shown in FIG. 7B.

7B illustrates boundary lines in a horizontal direction detected according to an embodiment of the present disclosure.

The processor 110 of the present disclosure may detect horizontal boundary lines corresponding to the inner horizontal lines 230 and the outer line shown in FIG. 7B by using the generated horizontal kernel.

Also, the processor 110 may generate a vertical kernel based on the total vertical length of the image. Also, the processor 110 may detect vertical boundary lines that are vertical edges included in the image by using the generated vertical kernel. Accordingly, the processor 110 may detect one or more inner vertical lines 220 of the table. Here, the processor 110 may detect vertical boundary lines having a predetermined length or longer, and may additionally remove noise from the image by performing image erosion and expansion. Also, the detected vertical boundary lines may also include boundary lines corresponding to the inner vertical lines 220 and the vertical outline 210 . The inner vertical lines 220 of the table of FIG. 2 detected by the processor 110 and vertical boundary lines that are part of the outer line 210 are shown in FIG. 7C.

7C illustrates boundary lines in a vertical direction detected according to an embodiment of the present disclosure.

The processor 110 of the present disclosure may detect vertical boundary lines corresponding to the inner vertical lines 220 and the outer line 210 shown in FIG. 7C using the generated vertical kernel.

According to an embodiment of the present disclosure, the processor 110 generates a first virtual table by merging at least one of the detected outline 210, one or more inner horizontal lines 230, or one or more inner vertical lines 220. can do. Specifically, the first virtual table created as shown in FIG. 8 may be created.

FIG. 8A illustrates the first virtual table of FIG. 2 created according to one embodiment of the present disclosure.

As described above, the outline 210 shown in FIGS. 7A to 7C , internal boundary lines in a horizontal direction, and boundary lines in a vertical direction may be detected. Boundary lines in a horizontal direction may include inner horizontal lines 230 , and boundary lines in a vertical direction may include inner vertical lines 220 . Accordingly, the processor 110 may generate the first virtual table 2000 as shown in FIG. 8 by merging the detected outline 210, the horizontal boundary lines, and the vertical boundary lines.

The image-based tables and boundary lines described with reference to FIGS. 6 to 8A are merely examples, and the image-based tables and boundary lines of the present disclosure should not be construed as being limited due to the above-described examples.

Accordingly, the first virtual table 2000 of the present disclosure may include one or more empty cells composed of boundary lines of an image-based table. As described above, when the table includes one or more merged cells, all boundary lines may not be connected to each other.

Specifically, when a merged cell exists in the table, at least one inner boundary line corresponding to at least one of inner horizontal lines or inner vertical lines connected to the outer line of the table may not be completely connected to the outer line. The boundary lines that are not completely connected will be described with reference to FIGS. 8A and 8B .

Fig. 8b shows the first virtual table of Fig. 8a with completely disjoint border lines indicated by dotted lines.

In the first virtual table 2000 shown in FIG. 8A, each of the two first cells 2100 corresponding to relative coordinates (0,1) and (1,1) according to the relative coordinates shown in FIG. 5 is a merged cell. to be. In addition, the inner horizontal lines are completely connected to the outer line by the portion indicated by the dotted line in FIG. Some of the inner horizontal lines 230 that have not been drawn can be seen. The first cell 2100 of the present disclosure refers to a cell included in the first virtual table 2000.

The processor 110 of the present disclosure may generate the second virtual table 3000 by extending one or more boundary lines constituting the first virtual table 2000 including one or more merged cells. In detail, an example will be described with reference to FIGS. 8B to 9B.

9A illustrates the second virtual table of FIG. 2 created according to one embodiment of the present disclosure.

FIG. 9B shows relative coordinates of each of one or more second cells included in the second virtual table of FIG. 9A.

The processor 110 of the present disclosure extends some of the inner horizontal lines 230, which are boundary lines that are not completely connected in the first virtual table 2000 of FIG. 8A, along the dotted line shown in FIG. (3000). Specifically, the relative coordinates of each of the second cells 3100 constituting the second virtual table 3000 generated as shown in FIG. 9A are as shown in FIG. 9B. The second cell 3100 of the present disclosure refers to a cell included in the second virtual table 3000.

The processor 110 of the present disclosure may determine the maximum number of rows and the maximum number of columns of the image-based table based on the second virtual table 3000 . Specifically, the processor 110 may determine the center of the table based on at least a part of one or more boundary lines constituting the second virtual table 3000 . Specifically, the processor 110 may determine the center of the table, which is the center of the entire table, based on the outer line among the boundary lines of the second virtual table 3000 . In addition, the processor 110 determines the table center when the color value of a pixel in the center of the table is the same as the color of the background color of the table, and when the color value of a pixel in the center of the table is the same as the color of the border line, the color value of a pixel in the center of the table is the same as the color value of a pixel of the background color. can be moved. Here, a portion excluding the border line can be viewed as a table background, and the table background can include the inside of a cell. Accordingly, the table background color may refer to a color of a portion excluding the boundary line, or may refer to a color inside a cell.

Also, the processor 110 may create a horizontal reference line and a vertical reference line based on the determined center of the table. Also, the processor 110 may determine the maximum number of rows of the table based on the first number of times, which is the number of times pixel color values are changed along the horizontal reference line. Specifically, the processor 110 may determine a first number, which is the number of times pixel color values are changed along the horizontal reference line, and determine a value obtained by subtracting 1 from the first number as the maximum number of rows. Also, the processor 110 may determine the maximum number of columns of the table based on the second number of times, which is the number of times pixel color values are changed along the vertical reference line. Specifically, the processor 110 may determine the second number of times, which is the number of times pixel color values are changed along the vertical reference line, and determine a value obtained by subtracting 1 from the second number of times as the maximum number of columns.

More specifically, the determination of the maximum number of rows and the maximum number of columns of the present disclosure will be described with reference to FIG. 10 .

FIG. 10 shows the table center, vertical reference line and horizontal reference line for the second virtual table of FIG. 9A.

Specifically, as shown in FIGS. 10 and 2 , the background color of the image-based table may be white and the border line may be black. As described above, the processor 110 may determine the table center 3400 based on an outer line among one or more boundary lines constituting the second virtual table 3000 . Here, when the pixel color value of the table center 3400 is black (0,0,0), which is the color of the border, the processor 110 generates the table center 3400 having white (255,255,255), which is the pixel color value of the background color. The center of the table 3400 may be slightly moved to determine . The direction in which the processor 110 moves the center of the table 3400 may be left, right, or diagonally, but the present disclosure does not limit the direction of movement.

Also, the processor 110 may generate a horizontal reference line 3200 in a horizontal direction and a vertical reference line 3300 in a vertical direction based on the determined table center 3400 . In addition, the processor 110 may determine a first number of times that pixel color values are changed along the horizontal reference line 3200 . Specifically, the processor 110 may determine the first number of times that the pixel color value is changed along the horizontal reference line 3200 in the a' direction shown in FIG. 10 . Also, the processor 110 may determine a value obtained by subtracting 1 from the first number of times as the maximum number of rows of the image-based table corresponding to the second virtual table 3000 of FIG. 10 . Also, the processor 110 may determine the second number of times, which is the number of times the pixel color value is changed along the vertical reference line 3300 in the b' direction shown in FIG. 10 . Also, the processor 110 may determine a value obtained by subtracting 1 from the second count as the maximum number of columns of the image-based table.

The image-based table, the first virtual table, and the second virtual table shown in FIGS. 8A to 10 are merely examples, and the image-based table, the first virtual table, and the second virtual table of the present disclosure are only examples. This should not be construed as limiting.

According to an embodiment of the present disclosure, the processor 110 may compare the first virtual table 2000 and the second virtual table 3000 to generate a cell set for merging. Specifically, the processor 110 may generate first cell information for each of one or more first cells 2100 included in the first virtual table 2000 .

Referring to the first weather table 2000 shown in FIG. 8A , the processor 110 may detect each of the first cells 2100 of the present disclosure using a closed curve algorithm. In addition, the first cell information of the present disclosure is the above-described cell information, and is cell information for each of the first cells 2100, which are cells included in the first virtual table 2000.

Specifically, the first cell information of the present disclosure may include first center point location information about the center point location of each of one or more first cells 2100 . Also, the first cell information may include first cell location information about the location of each of one or more first cells.

Also, the processor 110 may generate second cell information for each of the plurality of second cells 3100 included in the second virtual table 3000 . Specifically, referring to the second virtual table 3000 shown in FIG. 9A, the second cell information of the present disclosure is the above-described cell information, and two or more second virtual tables 3000 are included in the second virtual table 3000. This is cell information for each cell 3100. The second cell 3100 of the present disclosure may be detected based on the first cell 2100 of the first virtual table 2000 or may be detected using a closed curve algorithm.

Specifically, the second cell information of the present disclosure may include second center point location information about the center point location of each of the plurality of second cells 3100 . Also, the second cell information may include second cell location information for each location of the plurality of second cells 3100 .

Also, the processor 110 may determine at least one cell set for merging by comparing the first cell information with the second cell information. Specifically, the processor 110 may determine whether there are two or more pieces of second cell information corresponding to each piece of first cell information of one or more first cells. That is, at least one of the one or more first cells in the first virtual table 2000 may be a merge cell, and a second cell of the second virtual table 3000 corresponding to an arbitrary merge cell of the first virtual table 2000 3100 may be two or more. Accordingly, the processor 110 determines the number of pieces of second cell information of each of the second cells 3100 corresponding to the first cell information of each of one or more first cells, and sets two pieces of information for one piece of first cell information. If the above second cell information corresponds, the first cell information and the second cell information may be determined as information related to the merged cell.

Specifically, the processor 110 may determine whether there are two or more pieces of second center point location information of corresponding second cell information based on first center point location information of first cell information. Also, the processor 110 may determine whether there are two or more pieces of second cell location information corresponding thereto based on the first cell location information. Accordingly, as described above, the processor 110 compares the first cell information and the second cell information, and when there is two or more second cell information corresponding to the same first cell information, the corresponding plurality of second cells 3100 ), a cell set for merging including each of the second cell information may be determined.

In more detail, referring to FIGS. 11A and 11B , generating a cell set for merging by comparing first cell information with second cell information will be described below.

FIG. 11A shows the first virtual table of FIG. 8A including one or more first cells marked with center points.

FIG. 11B shows the second virtual table of FIG. 9A including two or more second cells marked with center points.

The first cell 2100 shown in gray shading in FIG. 11A is one of two merged cells included in the first virtual table 2000. Referring to FIG. 5, the first cell 2100 with relative coordinates corresponding to (0,1) cell 2100. The number of second cells 3100 of the second virtual table 3000 corresponding to the first cell of relative coordinates (0,1), which is a merged cell, is 4, and is indicated in gray shade in FIG. 11B. Specifically, referring to FIG. 9A, the relative coordinates of each of the four second cells 3100 corresponding to the first cell 2100, which is a merged cell shown in gray shading in FIG. 11A, are (0,1), (0,2), are (0,3) and (0,4).

The processor 110 of the present disclosure may detect the first cell 2100 and the second cell 3100 associated with the merged cell by comparing the center points of FIG. 11A with the center points of FIG. 11B. Specifically, the processor 110 determines the location information of the first center point of the first cell 2100, which is one merged cell indicated in gray in FIG. 11A, for each of the four second cells 3100 indicated in gray in FIG. It may be detected that the second center point location information does not match. In addition, the processor 110 determines the location of the second center point of each of the four second cells 3100 indicated in gray in FIG. 11B based on the location information of the first center point of the first cell 2100 indicated in gray in FIG. 11A. Information can also be detected. That is, the detected four second center point location information may correspond to the first center point location information. In addition, the processor 110 may determine the detected four second center point location information and first center point location information as information related to the merged cell.

In addition, the processor 110 determines each of the four second cells 3100 indicated in gray in FIG. 11B based on the first cell location information of the first cell 2100, which is one merged cell indicated in gray in FIG. 11A. Second cell location information may be detected. That is, the detected four pieces of second cell location information may correspond to the first cell location information. Also, the processor 110 may determine the detected four pieces of second cell location information and first cell location information as information related to the merged cell.

Also, the processor 110 of the present disclosure may detect second cell information including second cell location information and second center point location information for each of the four second cells 3100 corresponding to the merge cell. Also, the processor 110 may determine the second cell information for each of the four detected second cells 3100 as one cell set for merging.

The merge cell, first virtual table, and second virtual table shown in FIGS. 11A and 11B are merely examples, and the merge cell, first virtual table, and second virtual table of the present disclosure are based on the above examples. should not be construed as limiting.

According to an embodiment of the present disclosure, the processor 110 may generate content information for at least one content included in the table based on the first virtual table 2000 . Specifically, the processor 110 may extract at least one content by performing optical character recognition (OCR) on each of one or more cells of the table based on the first cell location information.

Specifically, the processor 110 may determine the location of each of the at least one content included in the image-based table based on the first cell location information. Also, the processor 110 may perform optical character recognition on an image-based table using distributed software tesseract. In addition, the processor 110 of the present disclosure generates an OCR model, machine-learns the OCR model using a training data set in which learning content and an image-based table for learning are matched, and uses the learned OCR model to image-based table It is also possible to perform optical character recognition for .

Also, the processor 110 may generate content information including at least one content matched with the first cell location information. Specifically, the processor 110 may determine the location of the content based on the first cell location information, where the location of the content may mean the location of a cell in which the content exists. Content may be extracted by performing optical character recognition as described above for each of one or more cells in which the content of the present disclosure exists. In addition, the processor 110 may generate content information by matching the extracted content with the corresponding first cell location information. Specifically, the processor 110 may generate content information by matching at least one of the absolute coordinates of the center point of the first cell or the relative coordinates of the first cell included in the first cell location information with the extracted content.

According to an embodiment of the present disclosure, the processor 110 may generate machine readable table information based on the cell set for merging and content information.

In detail, the processor 110 may match a merge tag or at least one piece of content with each of the second cell information of each of a plurality of second cells based on the cell set for merging and the content information. Also, the processor 110 may generate second cell information in which at least one content or merge tag is matched as table information.

The image-based table of the present disclosure may include one or more empty cells that are cells that do not contain content, and the empty cells may be merged cells. That is, the image-based table of the present disclosure includes at least one of a single cell that contains content and is not a merge cell or a single cell that does not contain content, and a merge cell that contains content or does not contain content. It may include at least one of merged cells of empty cells.

Accordingly, the at least one cell set for merging according to the present disclosure may include a content cell set related to the location of at least one content and a blank cell set not related to the location of at least one content, as described above.

Specifically, a merge cell included in the image-based table may be a merge cell including at least one piece of content. In this case, the second cell information for each of two or more second cells related to the merged cell is included in one cell set for merging, and the cell set for merging may be determined as a content cell set.

Also, a merge cell included in the image-based table may be a merge cell of empty cells that do not contain content. In this case, the second cell information for each of the two or more second cells related to the empty merge cell is included in one merge cell set, and the merge cell set may be determined as an empty cell set.

Accordingly, the processor 110 may match a merge tag with each of second cell information of a plurality of second cells included in each of one or more cell sets for merging. Also, the processor 110 may identify each of one or more cell sets for merging as one of a content cell set and an empty cell set. In addition, the processor 110 may match corresponding content to any second cell information among second cell information included in the identified content cell set. That is, the processor 110 matches the merge tag with the second cell information related to the merged cell including the content, deletes the merge tag with one of the two or more second cell information for one merged cell, and matches the content. can make it

For example, when three pieces of second cell information correspond to one merge cell included in a table and the corresponding merge cell includes content, two pieces of second cell information among the three pieces of second cell information are merge tags. , and one second cell information may be matched with content.

The above-described number of merged cells and the number of second cell information corresponding to the merged cell are only examples, and should not be construed as limiting the number of merged cells and the number of second cell information corresponding to the merged cell due to the above example. something to do.

Accordingly, the processor 110 may determine the second cell information matched with the content among the second cell information included in the content cell set as the first information of the table information. Also, the processor 110 may determine second cell information to which the merge tag is matched among second cell information included in the content cell set as the second information of the table information. In addition, the processor 110 may determine second cell information included in the empty cell set and matched with the merge tag as third information of the table information.

Also, the image-based table may include one or more single cells that contain content and are not merged cells. In this case, the processor 110 may match the content with the second cell information based on the content information as described above. Specifically, the processor 110 may identify the location of the content based on the content information, match the second cell information corresponding to the location of the content with the corresponding content, and determine the fourth information of the table information. Here, the location of the content may be a location based on the first cell location information.

Also, the image-based table may include one or more single cells that are empty cells that do not contain content. In this case, the processor 110 identifies second cell information corresponding to an empty cell that does not match any content based on the content information as described above, and converts the second cell information into fifth information of the table information. can decide

Accordingly, the processor 110 may generate table information including at least one of the first to fifth information described above according to one or more cells included in the image-based table.

Specifically, the first information of the table information may be information on any one cell among a plurality of second cells included in the content cell set. Second cell information of a second cell to which content is matched in the content cell set may be determined as first information, and accordingly, at least one content may be matched to the first information.

Also, the second information of the table information may be information about the remaining cells among a plurality of cells included in the content cell set. In detail, second cell information of a second cell with a matched merge tag in the content cell set may be determined as the second information. Accordingly, the merge tag may be matched with the second information.

Also, the third information of the table information may be information on each of a plurality of second cells included in the empty cell set. Specifically, second cell information of a second cell to which a merge tag is matched in the empty cell set may be determined as third information. Accordingly, the merge tag may be matched with the third information.

Also, fourth information of the table information may be information about a cell that is not related to at least one cell set for merging among a plurality of second cells and is related to the location of at least one content. That is, second cell information of a second cell that is not included in the cell set for merging and matches the content may be determined as fourth information. Accordingly, at least one piece of content may be matched with the fourth information.

Also, fifth information of the table information may be information about a cell not related to at least one cell set for merging among a plurality of second cells and not related to the location of at least one content. Accordingly, the fifth information may include second cell information of a second cell that is not included in the cell set for merging and is an empty cell having no content.

In addition, the table information of the present disclosure may further include the maximum number of rows and the maximum number of columns determined based on the second virtual table 3000 as described above.

The table information of the present disclosure may be information stored in a machine-readable format as described above, and for example, the table information will be described with reference to FIGS. 12A and 12B.

12A illustrates table information in a Dataframe format for the image-based table of FIG. 2 according to an embodiment of the present disclosure.

12b illustrates table information in html format for the image-based table of FIG. 2 according to an embodiment of the present disclosure.

The table information of the present disclosure may be a pandas Dataframe file as shown in FIG. 12a or may be stored in an html format as shown in FIG. 12b. Also, the table information in the html format of FIG. 12B may be stored after parsing data related to the table in the Dataframe format of FIG. 12A.

The aforementioned Dataframe and html are only examples of machine-readable formats, and due to the aforementioned examples, the format of the table information of the present disclosure is limited and should not be interpreted.

13 is a flowchart of a method of generating image-based table information according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, the computing device 100 may perform a method of generating image-based table information. Specifically, the method of the present disclosure includes a step 510 of generating a first virtual table by detecting one or more boundary lines constituting a table included in an image. Also, the table may include at least one merged cell.

According to one embodiment of the present disclosure, the method of the present disclosure includes generating 520 a second virtual table by extending one or more boundary lines constituting the first virtual table.

According to an embodiment of the present disclosure, the method of the present disclosure includes comparing a first virtual table and a second virtual table to generate a cell set for merging (530).

According to an embodiment of the present disclosure, the method of the present disclosure includes generating content information for at least one content included in a table based on a first virtual table ( 540 ).

According to an embodiment of the present disclosure, the method includes generating 550 machine readable table information based on the cell set for merging and content information.

Alternatively, the one or more boundary lines include at least one of an outline, one or more inner vertical lines, or one or more inner horizontal lines, and the one or more boundary lines constituting a table included in the image are detected to generate the first virtual table. The step of doing this may include: detecting an outline by detecting location information of a pixel at an upper left corner of a table and location information of a pixel at a lower right corner of a table in an image; generating a horizontal kernel based on the total horizontal length of the image, and detecting one or more inner horizontal lines of the table using the horizontal kernel; generating a vertical kernel based on the total vertical length of the image, and detecting one or more inner vertical lines of the table using the vertical kernel; and generating a first virtual table by merging at least one of an outline, one or more inner horizontal lines, or one or more inner vertical lines.

Alternatively, generating a cell set for merging by comparing the first virtual table and the second virtual table may include generating first cell information for each of one or more first cells included in the first virtual table; generating second cell information for each of a plurality of second cells included in a second virtual table; and determining at least one cell set for merging by comparing the first cell information with the second cell information.

Alternatively, the first cell information includes at least one of first center point location information about a location of a center point of each of one or more first cells or first cell location information about a location of each of one or more first cells; The second cell information may include at least one of second center point location information about the location of the center point of each of the plurality of second cells or second cell location information about the location of each of the plurality of second cells.

Alternatively, generating content information for at least one content included in the table based on the first virtual table may include optical character recognition (OCR) for each of one or more cells of the table based on the first cell location information. ) to extract at least one content; and generating content information including at least one content matched with the first cell location information.

Alternatively, generating machine-readable table information based on the cell set for merging and content information may include second cell information of each of a plurality of second cells based on the cell set for merging and content information. matching a merge tag or at least one piece of content with respect to; and generating second cell information matched with at least one content or merge tag as table information.

Alternatively, the at least one cell set for merging may include: a content cell set associated with a location of at least one content; and a blank cell set not related to the location of at least one content, wherein the table information includes: first information on any one cell among a plurality of second cells included in the content cell set; second information about the remaining cells among the plurality of second cells included in the content cell set; third information for each of a plurality of second cells included in the blank cell set; fourth information about a cell of a plurality of second cells that is not related to at least one cell set for merging and is related to the location of at least one content; or fifth information about a cell not related to at least one cell set for merging among a plurality of second cells and not related to the location of at least one content; and at least one content matched with each of the first information and the fourth information, and a merge tag matched with each of the second information and the third information.

Alternatively, determining a table center based on at least some of the one or more boundary lines that make up the second virtual table; creating a horizontal reference line and a vertical reference line based on the center of the table; determining the maximum number of rows of a table based on a first number of times that pixel color values are changed along a horizontal reference line; determining the maximum number of columns of a table based on a second number of times that pixel color values are changed along a vertical reference line; and generating table information including the maximum number of rows and the maximum number of columns.

The order of the steps shown in FIG. 13 described above may be changed as needed, and at least one or more steps may be omitted or added. That is, the above steps are only one embodiment of the present disclosure, and the scope of the present disclosure is not limited thereto.

14 is a simplified and general schematic diagram of an example computing environment in which embodiments of the present disclosure may be implemented.

Although the present disclosure has been described above as being generally embodied by a computing device, those skilled in the art will understand that the present disclosure may be combined with computer-executable instructions and/or other program modules that may be executed on one or more computers and/or may be implemented in hardware and software. It will be appreciated that it can be implemented as a combination.

Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In addition, those skilled in the art will understand that the methods of the present disclosure can be applied to single-processor or multiprocessor computer systems, minicomputers, mainframe computers as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like ( It will be appreciated that each of these may be implemented with other computer system configurations, including those that may be operative in connection with one or more associated devices.

The described embodiments of the present disclosure may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Computers typically include a variety of computer readable media. Computer readable media can be any medium that can be accessed by a computer, including volatile and nonvolatile media, transitory and non-transitory media, removable and non-transitory media. Includes removable media. By way of example, and not limitation, computer readable media may include computer readable storage media and computer readable transmission media. Computer readable storage media are volatile and nonvolatile media, transitory and non-transitory, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. includes media Computer readable storage media may include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage device, magnetic cassette, magnetic tape, magnetic disk storage device or other magnetic storage device. device, or any other medium that can be accessed by a computer and used to store desired information.

A computer readable transmission medium typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism. Including all information delivery media. The term modulated data signal means a signal that has one or more of its characteristics set or changed so as to encode information within the signal. By way of example, and not limitation, computer readable transmission media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above are also intended to be included within the scope of computer readable transmission media.

An exemplary environment 1100 implementing various aspects of the present disclosure is shown including a computer 1102, which includes a processing unit 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 couples system components, including but not limited to system memory 1106 , to processing unit 1104 . Processing unit 1104 may be any of a variety of commercially available processors. Dual processor and other multiprocessor architectures may also be used as the processing unit 1104.

System bus 1108 may be any of several types of bus structures that may additionally be interconnected to a memory bus, a peripheral bus, and a local bus using any of a variety of commercial bus architectures. System memory 1106 includes read only memory (ROM) 1110 and random access memory (RAM) 1112 . A basic input/output system (BIOS) is stored in non-volatile memory 1110, such as ROM, EPROM, or EEPROM, and is a basic set of information that helps transfer information between components within computer 1102, such as during startup. contains routines. RAM 1112 may also include high-speed RAM, such as static RAM, for caching data.

The computer 1102 may also include an internal hard disk drive (HDD) 1114 (eg, EIDE, SATA) - the internal hard disk drive 1114 may also be configured for external use within a suitable chassis (not shown). Yes—a magnetic floppy disk drive (FDD) 1116 (e.g., for reading from or writing to a removable diskette 1118), and an optical disk drive 1120 (e.g., a CD-ROM) for reading disc 1122 or reading from or writing to other high capacity optical media such as DVDs). The hard disk drive 1114, magnetic disk drive 1116, and optical disk drive 1120 are connected to the system bus 1108 by a hard disk drive interface 1124, magnetic disk drive interface 1126, and optical drive interface 1128, respectively. ) can be connected to The interface 1124 for external drive implementation includes at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

These drives and their associated computer readable media provide non-volatile storage of data, data structures, computer executable instructions, and the like. In the case of computer 1102, drives and media correspond to storing any data in a suitable digital format. Although the description of computer readable media above refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art can use zip drives, magnetic cassettes, flash memory cards, cartridges, etc. It will be appreciated that other tangible media readable by the computer, such as the like, may also be used in the exemplary operating environment and any such media may include computer executable instructions for performing the methods of the present disclosure.

A number of program modules may be stored on the drive and RAM 1112, including an operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136. All or portions of the operating system, applications, modules and/or data may also be cached in RAM 1112. It will be appreciated that the present disclosure may be implemented in a variety of commercially available operating systems or combinations of operating systems.

A user may enter commands and information into the computer 1102 through one or more wired/wireless input devices, such as a keyboard 1138 and a pointing device such as a mouse 1140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, and the like. Although these and other input devices are often connected to the processing unit 1104 through an input device interface 1142 that is connected to the system bus 1108, a parallel port, IEEE 1394 serial port, game port, USB port, IR interface, may be connected by other interfaces such as the like.

A monitor 1144 or other type of display device is also connected to the system bus 1108 through an interface such as a video adapter 1146. In addition to the monitor 1144, computers typically include other peripheral output devices (not shown) such as speakers, printers, and the like.

Computer 1102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148 via wired and/or wireless communications. Remote computer(s) 1148 may be a workstation, computing device computer, router, personal computer, handheld computer, microprocessor-based entertainment device, peer device, or other common network node, and generally includes It includes many or all of the components described for, but for simplicity, only memory storage device 1150 is shown. The logical connections shown include wired/wireless connections to a local area network (LAN) 1152 and/or a larger network, such as a wide area network (WAN) 1154 . Such LAN and WAN networking environments are common in offices and corporations and facilitate enterprise-wide computer networks, such as intranets, all of which can be connected to worldwide computer networks, such as the Internet.

When used in a LAN networking environment, computer 1102 connects to local network 1152 through wired and/or wireless communication network interfaces or adapters 1156. Adapter 1156 may facilitate wired or wireless communications to LAN 1152, which also includes a wireless access point installed therein to communicate with wireless adapter 1156. When used in a WAN networking environment, computer 1102 may include a modem 1158, be connected to a communicating computing device on WAN 1154, or establish communications over WAN 1154, such as over the Internet. have other means. A modem 1158, which may be internal or external and a wired or wireless device, is connected to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for computer 1102, or portions thereof, may be stored on remote memory/storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communication link between computers may be used.

Computer 1102 is any wireless device or entity that is deployed and operating in wireless communication, eg, printers, scanners, desktop and/or portable computers, portable data assistants (PDAs), communication satellites, wireless detectable tags associated with It operates to communicate with arbitrary equipment or places and telephones. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, the communication may be a predefined structure as in conventional networks or simply an ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) makes it possible to connect to the Internet without wires. Wi-Fi is a wireless technology, such as a cell phone, that allows such devices, eg, computers, to transmit and receive data both indoors and outdoors, i.e. anywhere within coverage of a base station. Wi-Fi networks use a radio technology called IEEE 802.11 (a, b, g, etc.) to provide secure, reliable, and high-speed wireless connections. Wi-Fi can be used to connect computers to each other, to the Internet, and to wired networks (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in the unlicensed 2.4 and 5 GHz radio bands, for example, at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products that include both bands (dual band) .

Those skilled in the art will understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, instructions, information, signals, bits, symbols and chips that may be referenced in the above description are voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields s or particles, or any combination thereof.

Those skilled in the art will understand that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein are electronic hardware, (for convenience) For this purpose, it will be understood that it may be implemented by various forms of program or design code (referred to herein as software) or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and the design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

Various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term article of manufacture includes a computer program, carrier, or media accessible from any computer-readable storage device. For example, computer-readable storage media include magnetic storage devices (eg, hard disks, floppy disks, magnetic strips, etc.), optical disks (eg, CDs, DVDs, etc.), smart cards, and flash memory devices (eg, EEPROM, cards, sticks, key drives, etc.), but are not limited thereto. Additionally, various storage media presented herein include one or more devices and/or other machine-readable media for storing information.

It is to be understood that the specific order or hierarchy of steps in the processes presented is an example of exemplary approaches. Based upon design priorities, it is to be understood that the specific order or hierarchy of steps in the processes may be rearranged within the scope of this disclosure. The accompanying method claims present elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

The description of the presented embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art of this disclosure, and the general principles defined herein may be applied to other embodiments without departing from the scope of this disclosure. Thus, the present disclosure is not to be limited to the embodiments presented herein, but is to be interpreted in the widest scope consistent with the principles and novel features presented herein.

Claims (1)

How to create image-based table information.

Images