CN111627058A - Method, equipment and storage medium for positioning visual center point - Google Patents
Method, equipment and storage medium for positioning visual center point Download PDFInfo
- Publication number
- CN111627058A CN111627058A CN202010307586.1A CN202010307586A CN111627058A CN 111627058 A CN111627058 A CN 111627058A CN 202010307586 A CN202010307586 A CN 202010307586A CN 111627058 A CN111627058 A CN 111627058A
- Authority
- CN
- China
- Prior art keywords
- center point
- geometric center
- rectangle
- basic
- closed polygon
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
- G06T7/66—Analysis of geometric attributes of image moments or centre of gravity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
- G06T7/62—Analysis of geometric attributes of area, perimeter, diameter or volume
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/70—Determining position or orientation of objects or cameras
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention discloses a method, equipment and computer readable storage medium for positioning a visual center point, which comprises the steps of firstly obtaining a closed polygon for representing a basic graph outline; then selecting the maximum available internal wrapping rectangle in the closed polygon; further recording the geometric center point of the maximum available inner package rectangle; and finally, determining the geometric center point as the optimal visual center point of the basic graph.
Description
Technical Field
The present invention relates to the field of graphic labeling, and in particular, to a method and apparatus for positioning a visual center point, and a computer-readable storage medium.
Background
In the existing graphical annotation field, for example, room attribute annotation in a user-type graph, it is usually necessary to select the most suitable visual center point based on user experience as the annotation of the graph. The difficulty is to avoid the unavailable area and automatically select the optimal point based on the available area. Especially, the problem of selecting the visual center point of irregular patterns (such as concave polygons, hollow patterns and the like) is not properly solved.
Disclosure of Invention
The embodiment of the invention provides a method and equipment for positioning a visual center point and a computer readable storage medium, aiming at solving the problem of selecting the visual center point in the prior art.
According to a first aspect of the present invention, there is provided a method of locating a visual centre point, the method comprising: acquiring a closed polygon for representing the outline of the basic graph; selecting a maximum available inner package rectangle in the closed polygon; recording the geometric center point of the maximum available internal inclusion rectangle; and determining the geometric center point as the optimal visual center point of the basic graph.
According to an embodiment of the invention, the method further comprises: and if the number of the recorded geometric center points is multiple, screening the geometric center point with the highest priority from all the geometric center points to serve as the optimal visual center point of the basic graph.
According to an embodiment of the present invention, the screening, as the optimal visual center point of the basic graph, a geometric center point with a highest priority from among all geometric center points includes: using a specific scoring rule to perform priority scoring on all geometric center points; and determining the highest score as the optimal visual center point of the basic graph.
According to an embodiment of the invention, the specific scoring rule comprises at least one of the following rules: the aspect ratio of the maximum available internal inclusion rectangle corresponding to the geometric center point is closer to 1, and the score is higher; the closer the geometric center point is to the centroid of the basic graph, the higher the score is; the more the number of the other maximum available inner protection rectangles overlapped with the maximum available inner protection rectangle corresponding to the geometric center point is, the higher the score is.
According to an embodiment of the present invention, the obtaining a closed polygon for characterizing the outline of the underlying graph includes: separating a plurality of graphic elements aiming at the basic graph; respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline; and selecting a markable area in the basic figure outline to obtain a closed polygon for representing the basic figure outline.
According to an embodiment of the present invention, the selecting a maximum available inner envelope rectangle in the closed polygon includes: determining an inner package rectangle in the closed polygon, wherein four sides of the inner package rectangle are respectively parallel to x and y axes; and step-by-step traversal is carried out on the inner package rectangle along the x axis and the y axis respectively according to preset step length, and the inner package rectangle with the largest area is obtained and serves as the largest available inner package rectangle.
According to a second aspect of the present invention, there is also provided an apparatus for locating a visual center point, the apparatus comprising: the acquisition module is used for acquiring a closed polygon for representing the outline of the basic graph; the selecting module is used for selecting the maximum available internal package rectangle in the closed polygon; the recording module is used for recording the geometric center point of the maximum available internal package rectangle; and the determining module is used for determining the geometric center point as the optimal visual center point of the basic graph.
According to an embodiment of the present invention, the determining module is further configured to, if there are a plurality of recorded geometric center points, screen a geometric center point with a highest priority from all the geometric center points as an optimal visual center point of the basic graph.
According to an embodiment of the invention, the determining module comprises: the scoring unit is used for carrying out priority scoring on all the geometric center points by using a specific scoring rule; and the determining unit is used for determining the highest score as the optimal visual center point of the basic graph.
According to an embodiment of the present invention, the obtaining module is specifically configured to separate a plurality of graphic elements from the basic graphic; respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline; and selecting a markable area in the basic figure outline to obtain a closed polygon for representing the basic figure outline.
According to an embodiment of the present invention, the selecting module is specifically configured to determine an inner packet rectangle in the closed polygon, where four sides of the inner packet rectangle are parallel to x and y axes respectively; and step-by-step traversal is carried out on the inner package rectangle along the x axis and the y axis respectively according to preset step length, and the inner package rectangle with the largest area is obtained and serves as the largest available inner package rectangle.
There is also provided in accordance with the present invention a computer-readable storage medium comprising a set of computer-executable instructions which, when executed, perform the method of locating a visual center point of any of the above.
The embodiment of the invention provides a method, equipment and a computer readable storage medium for positioning a visual center point, which comprises the steps of firstly obtaining a closed polygon for representing a basic graph outline; then selecting the maximum available internal wrapping rectangle in the closed polygon; further recording the geometric center point of the maximum available inner package rectangle; and finally, determining the geometric center point as the optimal visual center point of the basic graph. Therefore, the method provided by the invention replaces the existing method for selecting the optimal visual center based on the user experience by selecting the maximum available internal package rectangle from the closed polygon for representing the image contour and analyzing and determining the optimal visual center according to the geometric center of the maximum available internal package rectangle, and has the advantages of high selection speed and high accuracy, thereby greatly improving the user experience.
It is to be understood that the teachings of the present invention need not achieve all of the above-described benefits, but rather that specific embodiments may achieve specific technical results, and that other embodiments of the present invention may achieve benefits not mentioned above.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
in the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
FIG. 1 is a first flowchart illustrating an implementation of a method for locating a visual center point according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating an application example of the present invention acquiring a closed polygon for characterizing an outline of an underlying graph;
FIG. 3 is a diagram illustrating an exemplary application of the present invention to select a maximum available inner envelope rectangle in a closed polygon;
FIG. 4 is a flowchart illustrating a second implementation of the method for locating a visual center point according to the embodiment of the present invention;
FIG. 5 is a schematic diagram illustrating a scenario of determining an optimal visual center point of the basic graphic in a closed polygon according to an exemplary embodiment of the present invention;
FIG. 6 is a schematic diagram illustrating a scenario of determining an optimal visual center point of the base graph in a closed polygon according to another exemplary application of the present invention;
fig. 7 is a schematic diagram showing a component structure of an apparatus for locating a visual center point according to an embodiment of the present invention.
Detailed Description
The principles and spirit of the present invention will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given only to enable those skilled in the art to better understand and to implement the present invention, and do not limit the scope of the present invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
The technical solution of the present invention is further elaborated below with reference to the drawings and the specific embodiments.
Fig. 1 is a first flowchart illustrating an implementation of a method for locating a visual center point according to an embodiment of the present invention.
Referring to fig. 1, a method for locating a visual center point according to an embodiment of the present invention includes: operation 101, obtaining a closed polygon for representing a basic graph outline; an operation 102 of selecting a maximum available inner envelope rectangle in the closed polygon; operation 103, recording a geometric center point of the maximum available inner inclusion rectangle; in operation 104, the geometric center point is determined as the optimal visual center point of the base graphic.
The embodiment of the invention is applicable to all fields needing graphic information marking, area division, geographic information marking and the like.
In operation 101, first separating a plurality of graphic elements for the basic graphic; then respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic profile; further, a markable area is selected in the basic figure outline, and a closed polygon for representing the basic figure outline is obtained.
Specifically, referring to fig. 2, for a basic graph a formed by a complex combined graph of the home shown in fig. 2, a plurality of graph elements B are first separated; then, respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline C; and selecting a markable area in the basic figure outline to obtain a closed polygon D for representing the basic figure outline. Here, the markable region can be selected in the basic graphic outline by removing the obstacle graphics, so as to obtain a closed polygon D, also called a markable region graphic, for characterizing the basic graphic outline.
Further, it should be clear to those skilled in the art that for any closed polygon, there must be at least one inner enclosing rectangle with four sides parallel to the x, y axes, i.e. the transverse and longitudinal axes, respectively.
In operations 102-103, an inner wrapping rectangle is first determined in the closed polygon, wherein four sides of the inner wrapping rectangle are respectively parallel to x and y axes; then, the inner package rectangle is respectively subjected to step traversal along x and y axes according to preset step length, and the inner package rectangle with the largest area is obtained and is used as the largest available inner package rectangle; after the maximum available inner package rectangle is determined, the geometric center point of the regular geometric figure of the maximum available inner package rectangle is recorded.
Specifically, referring to fig. 3, the side length of the inner-envelope rectangle with the largest area in the direction of the horizontal axis may be determined by determining the vertical direction and traversing in the horizontal direction, as shown in (1); determining the side length of the inner-bag rectangle with the largest area in the longitudinal axis direction by determining the horizontal direction and traversing along the vertical direction, as shown in (2); and then obtaining the inner-wrapped rectangle with the largest area and the optimal visual center point, as shown in (3).
Therefore, in the process of obtaining the inner-bag rectangle with the largest area, only stepping traversal needs to be carried out along the x axis and the y axis respectively, the time complexity is only o (N ^2), and under the condition that the graph size is uniform (namely the optimal step length is determined), the time complexity is o (1), so that the method is very efficient. Meanwhile, the calculation of the rectangular area and the geometric center point is very simple, so that the algorithm efficiency is further improved.
If there is one recorded geometric center point, the geometric center point may be directly determined as the optimal visual center point of the base graphic in operation 104.
The method for positioning the visual center point comprises the steps of firstly obtaining a closed polygon for representing the outline of a basic graph; then selecting the maximum available internal wrapping rectangle in the closed polygon; further recording the geometric center point of the maximum available inner package rectangle; and finally, determining the geometric center point as the optimal visual center point of the basic graph. Therefore, the method provided by the invention replaces the existing method for selecting the optimal visual center based on the user experience by selecting the maximum available internal package rectangle from the closed polygon for representing the image contour and analyzing and determining the optimal visual center according to the geometric center of the maximum available internal package rectangle, and has the advantages of high selection speed and high accuracy, thereby greatly improving the user experience.
Fig. 2 is a schematic flow chart illustrating an implementation of the method for locating a visual center point according to the embodiment of the present invention.
Referring to fig. 4, a method for locating a visual center point according to an embodiment of the present invention includes: operation 401, acquiring a closed polygon for representing a basic graph outline; an operation 402 of selecting a maximum available inner envelope rectangle in the closed polygon; operation 403, recording a geometric center point of the maximum available inner package rectangle; in operation 404, if there are a plurality of recorded geometric center points, the geometric center point with the highest priority is selected from all the geometric center points as the optimal visual center point of the basic graph.
Similarly, the embodiment of the invention can be applied to all fields requiring graphical information labeling, area division, geographic information labeling and the like.
In operation 401, first separating a plurality of graphic elements for the basic graphic; then respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic profile; further, a markable area is selected in the basic figure outline, and a closed polygon for representing the basic figure outline is obtained.
Specifically, referring to fig. 2, for a basic graph a formed by a complex combined graph of the home shown in fig. 2, a plurality of graph elements B are first separated; then, respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline C; and selecting a markable area in the basic figure outline to obtain a closed polygon D for representing the basic figure outline. Here, the markable region can be selected in the basic graphic outline by removing the obstacle graphics, so as to obtain a closed polygon D, also called a markable region graphic, for characterizing the basic graphic outline.
Further, it should be clear to those skilled in the art that for any closed polygon, there must be at least one inner enclosing rectangle with four sides parallel to the x, y axes, i.e. the transverse and longitudinal axes, respectively.
In operations 402-403, an inner wrapping rectangle is first determined in the closed polygon, wherein four sides of the inner wrapping rectangle are respectively parallel to x and y axes; then, the inner package rectangle is respectively subjected to step traversal along x and y axes according to preset step length, and the inner package rectangle with the largest area is obtained and is used as the largest available inner package rectangle; after the maximum available inner package rectangle is determined, the geometric center point of the regular geometric figure of the maximum available inner package rectangle is recorded.
Specifically, referring to fig. 3, the side length of the inner-envelope rectangle with the largest area in the direction of the horizontal axis may be determined by determining the vertical direction and traversing in the horizontal direction, as shown in (1); determining the side length of the inner-bag rectangle with the largest area in the longitudinal axis direction by determining the horizontal direction and traversing along the vertical direction, as shown in (2); and then obtaining the inner-wrapped rectangle with the largest area and the optimal visual center point, as shown in (3).
Therefore, in the process of obtaining the inner-bag rectangle with the largest area, only stepping traversal needs to be carried out along the x axis and the y axis respectively, the time complexity is only o (N ^2), and under the condition that the graph size is uniform (namely the optimal step length is determined), the time complexity is o (1), so that the method is very efficient. Meanwhile, the calculation of the rectangular area and the geometric center point is very simple, so that the algorithm efficiency is further improved.
In operation 404, if there are more than one geometric center points, all the geometric center points are scored according to a specific scoring rule; and determining the highest score as the optimal visual center point of the basic graph.
It should be noted that, if there are a plurality of geometric center points recorded, that is, there are a plurality of obtained inner-containing rectangles with the largest areas, the highest-scoring person may be determined as the optimal visual center point by using a priority model to perform priority scoring according to a specific scoring rule. Specifically, all geometric center points are subjected to priority scoring by using a specific scoring rule; and determining the highest score as the optimal visual center point of the basic graph.
Here, the specific scoring rule includes at least one of the following rules: the aspect ratio of the maximum available internal inclusion rectangle corresponding to the geometric center point is closer to 1, and the score is higher; the closer the geometric center point is to the centroid of the basic graph, the higher the score is; the more the number of the other maximum available inner protection rectangles overlapped with the maximum available inner protection rectangle corresponding to the geometric center point is, the higher the score is.
Taking fig. 5 as an example, since the base pattern bottom width L in this application example is sufficient, we finally select the center point 2 closer to the centroid of the base pattern as the optimal visual center point according to the scoring model after recording two geometric center points of the candidate center 1 and the candidate center 2 according to the above method.
For example, as shown in fig. 6, although the area of the rectangle corresponding to the alternative center 2 is larger, the area corresponding to the alternative center 2 is too thin and long due to too short bottom width L, and is not suitable for displaying information, which affects reading. This area does not therefore produce the largest available envelope rectangle obtained by the above method, and therefore the candidate center 1 is chosen as the optimal visual center point.
It can be readily seen from a comparison of fig. 5-6 that the maximum available inner envelope rectangle is selected based on, but not limited to, area. For better user experience, the most suitable central point can be selected in combination with the display state of the current graph.
The method for positioning the visual center point comprises the steps of firstly obtaining a closed polygon for representing the outline of a basic graph; then selecting the maximum available internal wrapping rectangle in the closed polygon; further recording the geometric center point of the maximum available inner package rectangle; and finally, if the number of the recorded geometric center points is multiple, screening the geometric center point with the highest priority from all the geometric center points to serve as the optimal visual center point of the basic graph. Therefore, the method provided by the invention replaces the existing method for selecting the optimal visual center based on the user experience by selecting the maximum available internal package rectangle from the closed polygon for representing the image contour and analyzing and determining the optimal visual center according to the geometric center of the maximum available internal package rectangle, and has the advantages of high selection speed and high accuracy, thereby greatly improving the user experience.
Similarly, based on the method for locating a visual center point as described above, an embodiment of the present invention further provides a computer-readable storage medium storing a program, which, when executed by a processor, causes the processor to perform at least the following operation steps: operation 101, obtaining a closed polygon for representing a basic graph outline; an operation 102 of selecting a maximum available inner envelope rectangle in the closed polygon; operation 103, recording a geometric center point of the maximum available inner inclusion rectangle; in operation 104, the geometric center point is determined as the optimal visual center point of the base graphic.
Further, based on the method for locating a visual center point described above, an embodiment of the present invention further provides an apparatus for locating a visual center point, as shown in fig. 7, where the apparatus 70 includes: an obtaining module 701, configured to obtain a closed polygon for representing a basic graph profile; a selecting module 702, configured to select a largest available inner package rectangle in the closed polygon; a recording module 703, configured to record a geometric center point of the maximum available inner package rectangle; a determining module 704, configured to determine the geometric center point as an optimal visual center point of the base graph.
According to an embodiment of the present invention, the determining module 703 is further configured to, if there are a plurality of recorded geometric center points, screen a geometric center point with the highest priority from all the geometric center points as the optimal visual center point of the basic graph.
According to an embodiment of the present invention, the determining module 704 includes: the scoring unit is used for carrying out priority scoring on all the geometric center points by using a specific scoring rule; and the determining unit is used for determining the highest score as the optimal visual center point of the basic graph.
According to an embodiment of the present invention, the obtaining module 701 is specifically configured to separate a plurality of graphic elements from the basic graphic; respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline; and selecting a markable area in the basic figure outline to obtain a closed polygon for representing the basic figure outline.
According to an embodiment of the present invention, the selecting module 702 is specifically configured to determine an inner packet rectangle in the closed polygon, where four sides of the inner packet rectangle are parallel to x and y axes respectively; and step-by-step traversal is carried out on the inner package rectangle along the x axis and the y axis respectively according to preset step length, and the inner package rectangle with the largest area is obtained and serves as the largest available inner package rectangle.
Here, it should be noted that: the above description of the embodiment of the apparatus for positioning the visual center point is similar to the description of the embodiment of the method shown in fig. 1 to 6, and has similar beneficial effects to the embodiment of the method shown in fig. 1 to 6, and therefore, the description thereof is omitted. For technical details not disclosed in the embodiment of the apparatus for locating a visual center point of the present invention, please refer to the description of the method embodiment shown in fig. 1 to 6 of the present invention for understanding, and therefore, for brevity, will not be described again.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all the functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk.
Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (10)
1. A method of locating a visual center point, the method comprising:
acquiring a closed polygon for representing the outline of the basic graph;
selecting a maximum available inner package rectangle in the closed polygon;
recording the geometric center point of the maximum available internal inclusion rectangle;
and determining the geometric center point as the optimal visual center point of the basic graph.
2. The method of claim 1, further comprising:
and if the number of the recorded geometric center points is multiple, screening the geometric center point with the highest priority from all the geometric center points to serve as the optimal visual center point of the basic graph.
3. The method of claim 2, wherein the screening the geometric center point with the highest priority from all the geometric center points as the optimal visual center point of the basic graph comprises:
using a specific scoring rule to perform priority scoring on all geometric center points;
and determining the highest score as the optimal visual center point of the basic graph.
4. The method of claim 3, wherein the specific scoring rules include at least one of the following:
the aspect ratio of the maximum available internal inclusion rectangle corresponding to the geometric center point is closer to 1, and the score is higher;
the closer the geometric center point is to the centroid of the basic graph, the higher the score is;
the more the number of the other maximum available inner protection rectangles overlapped with the maximum available inner protection rectangle corresponding to the geometric center point is, the higher the score is.
5. The method according to any one of claims 1 to 4, wherein the obtaining of the closed polygon used for characterizing the outline of the underlying graphic comprises:
separating a plurality of graphic elements aiming at the basic graph;
respectively dividing a frame of each graphic element in the plurality of graphic elements to obtain a basic graphic outline;
and selecting a markable area in the basic figure outline to obtain a closed polygon for representing the basic figure outline.
6. The method according to any one of claims 1 to 4, wherein said selecting a largest available inner envelope rectangle in said closed polygon comprises:
determining an inner package rectangle in the closed polygon, wherein four sides of the inner package rectangle are respectively parallel to x and y axes;
and step-by-step traversal is carried out on the inner package rectangle along the x axis and the y axis respectively according to preset step length, and the inner package rectangle with the largest area is obtained and serves as the largest available inner package rectangle.
7. An apparatus for locating a visual center point, the apparatus comprising:
the acquisition module is used for acquiring a closed polygon for representing the outline of the basic graph;
the selecting module is used for selecting the maximum available internal package rectangle in the closed polygon;
the recording module is used for recording the geometric center point of the maximum available internal package rectangle;
and the determining module is used for determining the geometric center point as the optimal visual center point of the basic graph.
8. The apparatus of claim 7,
the determination module is further configured to, if the number of the recorded geometric center points is multiple, screen a geometric center point with the highest priority from all the geometric center points, and use the geometric center point as the optimal visual center point of the basic graph.
9. The apparatus of claim 8, wherein the determining module comprises:
the scoring unit is used for carrying out priority scoring on all the geometric center points by using a specific scoring rule;
and the determining unit is used for determining the highest score as the optimal visual center point of the basic graph.
10. A computer-readable storage medium comprising a set of computer-executable instructions that, when executed, perform the method of locating a visual center point of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010307586.1A CN111627058A (en) | 2020-04-17 | 2020-04-17 | Method, equipment and storage medium for positioning visual center point |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010307586.1A CN111627058A (en) | 2020-04-17 | 2020-04-17 | Method, equipment and storage medium for positioning visual center point |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111627058A true CN111627058A (en) | 2020-09-04 |
Family
ID=72260975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010307586.1A Pending CN111627058A (en) | 2020-04-17 | 2020-04-17 | Method, equipment and storage medium for positioning visual center point |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111627058A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113793346A (en) * | 2021-09-16 | 2021-12-14 | 北京百度网讯科技有限公司 | Region attribute method and device, electronic equipment and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070046675A1 (en) * | 2005-08-31 | 2007-03-01 | Fujitsu Limited | Polygonal chart drawing processing method, device and computer-readable medium recording a program of the same |
| CN106846404A (en) * | 2017-01-16 | 2017-06-13 | 河海大学常州校区 | A kind of quick position and posture detection method based on workpiece inside and outside contour geometric properties |
| CN108205395A (en) * | 2018-01-16 | 2018-06-26 | 安徽慧视金瞳科技有限公司 | A kind of calibration point centre coordinate precise positioning method |
| CN108364311A (en) * | 2018-01-29 | 2018-08-03 | 深圳市亿图视觉自动化技术有限公司 | A kind of metal parts automatic positioning method and terminal device |
| CN110780797A (en) * | 2019-11-13 | 2020-02-11 | 上海图莱智能科技有限公司 | Method for improving positioning area selection efficiency of visual features and drawing system |
-
2020
- 2020-04-17 CN CN202010307586.1A patent/CN111627058A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070046675A1 (en) * | 2005-08-31 | 2007-03-01 | Fujitsu Limited | Polygonal chart drawing processing method, device and computer-readable medium recording a program of the same |
| CN106846404A (en) * | 2017-01-16 | 2017-06-13 | 河海大学常州校区 | A kind of quick position and posture detection method based on workpiece inside and outside contour geometric properties |
| CN108205395A (en) * | 2018-01-16 | 2018-06-26 | 安徽慧视金瞳科技有限公司 | A kind of calibration point centre coordinate precise positioning method |
| CN108364311A (en) * | 2018-01-29 | 2018-08-03 | 深圳市亿图视觉自动化技术有限公司 | A kind of metal parts automatic positioning method and terminal device |
| CN110780797A (en) * | 2019-11-13 | 2020-02-11 | 上海图莱智能科技有限公司 | Method for improving positioning area selection efficiency of visual features and drawing system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113793346A (en) * | 2021-09-16 | 2021-12-14 | 北京百度网讯科技有限公司 | Region attribute method and device, electronic equipment and readable storage medium |
| CN113793346B (en) * | 2021-09-16 | 2022-08-30 | 北京百度网讯科技有限公司 | Region attribute method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8482582B2 (en) | System and method for labeling maps | |
| US8194974B1 (en) | Merge and removal in a planar map of an image | |
| CN110347499A (en) | A kind of remote sensing image tile generates and the method for deployed in real time | |
| CN110069580A (en) | Road marks display methods, device, electronic equipment and storage medium | |
| CN104835134B (en) | A kind of method and apparatus for calculating commodity image psoriasis score value | |
| CN106484726A (en) | A kind of page display method and device | |
| CN115601672B (en) | VR intelligent shop patrol method and device based on deep learning | |
| US20230267660A1 (en) | Generating simplified map shapes | |
| CN107451317A (en) | Select control method, device for selection controlling and recording medium | |
| CN106297536B (en) | Method and device for determining labeling position of planar graphic element name in electronic map | |
| CN111627058A (en) | Method, equipment and storage medium for positioning visual center point | |
| CN103902633B (en) | A kind of method and its device, system of generation POI hot-zone data | |
| CN110321190A (en) | The method and device of icon optimization in a kind of desktop | |
| JP2009059028A (en) | Contact analysis device, contact analysis program and recording medium recorded with contact analysis program | |
| CN110222056A (en) | A kind of localization method, system and equipment | |
| CN107193815A (en) | A kind of processing method of page code, device and equipment | |
| CN105677843A (en) | Method for automatically obtaining attribute of four boundaries of parcel | |
| CN107818496A (en) | A kind of merchandise news update method and device | |
| CN110826488B (en) | Image identification method and device for electronic document and storage equipment | |
| JP4260827B2 (en) | Land-based land evaluation system, evaluation method, and evaluation program | |
| Chen et al. | Adaptive multi-resolution labeling in virtual landscapes | |
| JP6324175B2 (en) | Map information display system and method, program | |
| CN112989193A (en) | Data processing method and device, electronic equipment and computer storage medium | |
| CN114493734A (en) | Dish die-based ordering method and equipment | |
| CN111783180A (en) | Drawing splitting method and related device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |