CN105513008B - A kind of image processing method and device - Google Patents
A kind of image processing method and device Download PDFInfo
- Publication number
- CN105513008B CN105513008B CN201510937091.6A CN201510937091A CN105513008B CN 105513008 B CN105513008 B CN 105513008B CN 201510937091 A CN201510937091 A CN 201510937091A CN 105513008 B CN105513008 B CN 105513008B
- Authority
- CN
- China
- Prior art keywords
- point
- intersection
- scan line
- coordinate
- points
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 21
- 230000011218 segmentation Effects 0.000 claims abstract description 93
- 238000005520 cutting process Methods 0.000 claims abstract description 84
- 238000005192 partition Methods 0.000 claims abstract description 12
- 238000000034 method Methods 0.000 claims description 54
- 239000012141 concentrate Substances 0.000 claims description 22
- 238000012217 deletion Methods 0.000 claims description 9
- 230000037430 deletion Effects 0.000 claims description 9
- 238000010276 construction Methods 0.000 claims description 7
- 239000000284 extract Substances 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 23
- 230000008569 process Effects 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 238000009966 trimming Methods 0.000 description 8
- 230000008901 benefit Effects 0.000 description 4
- 230000002093 peripheral effect Effects 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
Classifications
-
- G06T3/04—
Abstract
The present invention provides a kind of image processing method and devices, cutting and segmentation applied to polygon, belong to technical field of image processing, which comprises the first point set of building and the second point set, and all the points that all the points concentrated for described first point and the second point are concentrated set a property；The redundant points removal that first point set and the second point are concentrated；According to first point set and second point set building third point set after removal redundant points；Scan line set is constructed according to the third point set；Two scan lines adjacent in the scan line set are built into scan line pair, each scan line pair is constituted into segmentation intersection point sequence with all intersection points for cutting out result figure constructed by the third point set；By the redundant points removal in the segmentation intersection point sequence；According to the segmentation intersection point sequence structure partition graph after removal redundant points.Image processing method and device provided by the invention effectively improve the accuracy of polygon clipping and segmentation result.
Description
Technical field
The present invention relates to technical field of image processing to be applied in particular to a kind of image processing method and device
The cutting and segmentation of polygon.
Background technique
In the electronic record of printed circuit board (Printed Circuit Board, PCB), usually with positive figure and
Some figures of the form representative circuit schematic of negative film figure combination, are overlapped that is, being subtracted with positive figure with negative film figure
Part, remainder are the shape that circuit diagram needs.Since in actual circuit G- Design, required figure is not advised often
The shape of polygon then, designed positive and negative film is also irregular polygon accordingly.It is corresponding therefore, it is necessary to design
Polygon clipping method, the difference set of positive figure Yu negative film figure is obtained, to obtain desired figure.Further, since positive
Figure may have intersection with multiple negative film figures, i.e. a positive figure, which may may require that, repeatedly does trimming operation.By
It may be concave polygon in the figure that trimming operation generates, concave polygon be cut again it is possible that self intersection figure
Shape, and self intersection figure can not carry out trimming operation again.Therefore need to reduce the segmentation of result figure after trimming operation each time
For several simple convex polygons, in order to carry out clip operation next time, and then required figure in circuit diagram is obtained.
However, there is the same problem in existing polygon clipping method and dividing method, it is exactly the cutting when polygon
Or when encountering the case where intersection point is polygon vertex in cutting procedure, due to the shared point that vertex is two adjacent edges, acquire
Intersection point often more than two, and there are the incorrect situations of discrepancy determined property of intersection point, to be made to subsequent treatment process
At very big interference, it is unable to get correctly cutting and segmentation result.
Summary of the invention
In view of this, the present invention provides a kind of image processing method and device, applied to the cutting and segmentation of polygon, benefit
With the image processing method and device, the accuracy of the determined property of intersection point can not only be improved, and effectively removes polygon
Cutting and cutting procedure in redundant points, correctly cut and segmentation result.
To achieve the goals above, technical solution used in the embodiment of the present invention is as follows:
In a first aspect, the embodiment of the present invention provides a kind of image processing method, applied to the cutting and segmentation of polygon, institute
The method of stating includes: the first point set of building and the second point set, and is all the points and second point concentration of described first point concentration
All the points set a property, wherein first point set by be tailored all vertex of polygon and be tailored polygon and cut out
All intersection points for cutting polygon are rearranged according to preset order, and second point set is by all vertex of cutting polygon and described
Intersection point is rearranged according to preset order；The redundant points removal that first point set and the second point are concentrated；According to removal
First point set and second point set after redundant points construct third point set；Scan line collection is constructed according to the third point set
It closes；Two scan lines adjacent in the scan line set are built into scan line pair, by each scan line pair and by described
All intersection points for cutting out result figure of third point set construction constitute segmentation intersection point sequence；It will be superfluous in the segmentation intersection point sequence
Remaining point removal；According to the segmentation intersection point sequence structure partition graph after removal redundant points.
Second aspect, a kind of image processing apparatus, applied to the cutting and segmentation of polygon, described device includes: first
Module is constructed, for constructing the first point set and the second point set, and all the points concentrated for described first point and second point set
In all the points set a property, wherein first point set by be tailored all vertex of polygon and be tailored polygon with
All intersection points for cutting polygon are rearranged according to preset order, and second point set is by all vertex of cutting polygon and institute
Intersection point is stated to rearrange according to preset order；First redundant points remove module, are used for first point set and the second point
The redundant points of concentration remove；Second building module, for according to first point set and the second point after removal redundant points
Collection building third point set；Third constructs module, for constructing scan line set according to the third point set；4th building module；
For two adjacent scan lines to be built into scan line pair, each scan line is cut to by the third point set construction
All intersection points for cutting out result figure constitute segmentation intersection point sequence；Second redundant points remove module, are used for the segmentation intersection point sequence
Redundant points removal in column；Partition graph constructing module, for being divided according to the segmentation intersection point sequence structure after removal redundant points
Figure.
By above-mentioned image processing method, applied to the cutting and segmentation of polygon, during the cutting process, first by first point
Collection and second point concentrate redundant points removal, further according to removal redundant points after the first point set and the second point set building thirdly
Collection, has effectively obtained accurate cutting result；Further, during partition, cutting result figure, first segmentation is handed over
Redundant points removal in point sequence is effectively obtained further according to the segmentation intersection point sequence structure partition graph after removal redundant points
Correct segmentation result.
Other features and advantages of the present invention will be illustrated in subsequent specification, also, partly be become from specification
It is clear that being understood by implementing the embodiment of the present invention.The objectives and other advantages of the invention can be by written
Specifically noted structure is achieved and obtained in specification, claims and attached drawing.
Detailed description of the invention
It in order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, below will be to institute in embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the invention
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.By the way that shown in attached drawing, above and other purpose of the invention, feature and advantage will be more clear.In whole
Identical appended drawing reference indicates identical part in attached drawing.Attached drawing, emphasis deliberately are not drawn by actual size equal proportion scaling
It is to show the gist of the present invention.
Fig. 1 shows the block diagram of the computer of present pre-ferred embodiments offer；
Fig. 2 shows a kind of flow charts for image processing method that the first specific embodiment of the invention provides；
Fig. 3 shows the position for cutting polygon A and cutting polygon B provided in the first specific embodiment of the invention and closes
It is schematic diagram；
Fig. 4 show in a kind of image processing method that first specific embodiment of the invention provides according to preceding point and rear point and
The positional relationship for cutting polygon resets the first point set and second point concentrates attribute for the side of the attribute of the point of vertex intersection point
Method flow chart；
It is more that Fig. 5 shows the cutting that a kind of image processing method provided in the first specific embodiment according to the present invention obtains
Side shape A and the cutting result pictorial diagram for cutting polygon B；
It is more that Fig. 6 shows the cutting that a kind of image processing method provided in the first specific embodiment according to the present invention obtains
Side shape A and the cutting result figure for cutting polygon B establish the schematic diagram of scan line set；
Fig. 7 is shown one of scan line in a kind of image processing method that the first specific embodiment of the invention provides
The method flow diagram of redundancy point deletion in the corresponding segmentation intersection point sequence of one scan line of centering；
Fig. 8, which is shown, deletes current repetition intersection point in a kind of image processing method that the first specific embodiment of the invention provides
In include redundant points method flow diagram；
Fig. 9 show that a kind of image processing method provided in the first specific embodiment according to the present invention obtains to cutting
Polygon A and the cutting result figure for cutting polygon B carry out the result schematic diagram of trapezoidal segmentation；
Figure 10 shows a kind of structural block diagram for image processing apparatus that the second specific embodiment of the invention provides.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Whole description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
As shown in Figure 1, being the block diagram for the computer that present pre-ferred embodiments provide.The computer 700 wraps
Include image processing apparatus 600, memory 701, storage control 702, processor 703, Peripheral Interface.
The memory 701, storage control 702, processor 703, each element of Peripheral Interface 704 between each other directly or
It is electrically connected indirectly, to realize the transmission or interaction of data.For example, these elements between each other can be logical by one or more
It interrogates bus or signal wire is realized and is electrically connected.Described image processing unit 600 includes at least one can be with software or firmware
(firmware) form is stored in the software function module in the memory 701.The processor 703 is for executing storage
The executable module stored in device 701, such as the software function module that includes of described image processing unit 600 or computer journey
Sequence.
Wherein, memory 701 may be, but not limited to, random access memory 701 (Random Access Memory,
RAM), read-only memory 701 (Read Only Memory, ROM), 701 (Programmable of programmable read only memory
Read-Only Memory, PROM), (the Erasable Programmable Read-Only of erasable read-only memory 701
Memory, EPROM), (the Electric Erasable Programmable Read-Only of electricallyerasable ROM (EEROM) 701
Memory, EEPROM) etc..Wherein, memory 701 is for storing program, the processor 703 after receiving and executing instruction,
Execute described program, side performed by the server/computer that the stream process that any embodiment of the embodiment of the present invention discloses defines
Method can be applied in processor 703, or be realized by processor 703.
Processor 703 may be a kind of IC chip, the processing capacity with signal.Above-mentioned processor 703 can
To be general processor, including central processing unit (Central Processing Unit, abbreviation CPU), network processing unit
(Network Processor, abbreviation NP) etc.；Can also be digital signal processor (DSP), specific integrated circuit (ASIC),
Ready-made programmable gate array (FPGA) either other programmable logic device, discrete gate or transistor logic, discrete hard
Part component.It may be implemented or execute disclosed each method, step and the logic diagram in the embodiment of the present invention.General processor
It can be microprocessor or the processor be also possible to any conventional processor etc..
The Peripheral Interface 704 is used to couple processor 703 and memory 701 for various input/output devices.?
In some embodiments, Peripheral Interface 704, processor 703 and storage control 702 can be realized in one single chip.At it
In his some examples, they can be realized by independent chip respectively.
In the electronic record of PCB, some figures of the form representative circuit schematic usually combined with positive and negative film, i.e. phase
When in subtracting the part being overlapped with negative film figure with positive figure, remainder is the shape that circuit diagram needs.Further, since just
Piece figure may have intersection with multiple negative film figures, i.e. a positive figure, which may may require that, repeatedly does trimming operation.
Since the figure that trimming operation generates may be concave polygon, concave polygon is cut again it is possible that self intersection figure
Shape, and self intersection figure can not carry out trimming operation again.Therefore need to reduce the segmentation of result figure after trimming operation each time
For several simple convex polygons, in order to carry out clip operation next time, and then required figure in circuit diagram is obtained.
Therefore, it is necessary to design corresponding polygon clipping and dividing method, multiple clip operation is carried out to positive figure, with
Obtain desired circuit diagram figure.The cutting of existing common polygon and dividing method are usual are as follows: first seek two polygons
All intersection points and judge the discrepancy attribute of intersection point, the discrepancy attribute includes access point or point out；Intersection point is inserted into order again
Into the vertex sequence of two polygons, directly according to the difference set figure for entering and leaving attribute and searching for two polygons of intersection point, in turn
Cutting result figure is split again.In cutting and cutting procedure, when the intersection point acquired is the vertex of polygon, due to
Polygon vertex is the shared point of two adjacent edges, and will lead to two problems: (1) there are redundant points in the intersection point acquired；(2) it hands over
The discrepancy determined property of point is incorrect.Both of these problems will cause very big interference to subsequent processing, be unable to get correct
Cutting and segmentation result.Therefore, the present invention provides a kind of image processing method and device, for polygon cutting with point
It cuts, effectively improves above-mentioned two problems, correctly cut and segmentation result, to ensure that Design PCB product
Accurate required figure can be obtained when circuit diagram, in order to carry out the processing of PCB.
In addition, the segmented shape of polygon can there are many, such as may be partitioned into triangle, starlike polygon, trapezoidal etc.
Simple graph unit.Wherein, it is easy to carry out space orientation and retrieval, and three since trapezoidal form is simple, two bottom edges are parallel to each other
It is angular also to may be regarded as a bottom edge to degenerate being the special trapezoidal of a bit, therefore to sanction in a kind of image processing method provided by the invention
The dividing method for cutting result figure is the method for constructing trapezoidal cutting unit.
First specific embodiment
Fig. 2 shows a kind of flow charts for image processing method that the first specific embodiment of the invention provides.Such as Fig. 2 institute
Show, image processing method in the present embodiment may include step S110 to step S170.
Step S110 constructs the first point set and the second point set, and is all the points and described second of described first point concentration
The all the points that point is concentrated set a property, wherein first point set is by being tailored all vertex of polygon and being tailored polygon
Shape and all intersection points for cutting polygon are rearranged according to preset order, and second point set is by all vertex of cutting polygon
It is rearranged with the intersection point according to preset order.
When cutting figure, need to extract respectively by preset order by the first vertex sequence of vertex building of reduction polygon,
Extract the second vertex sequence of vertex building for cutting polygon.Wherein, the preset order can be to be with some vertex
Point, along the clock-wise order or sequence counter-clockwise of graphic edge.In the embodiment of the present invention, preferably clock-wise order.And according to
The first fixed point sequence and second vertex sequence seek cropped polygon and cut all intersection points of polygon, i.e., with
Every two point is a line in first vertex sequence, and each edge is found intersection with all sides of the second vertex sequence respectively.
Then the first point set and the second point set are constructed respectively, by all vertex for being tailored polygon and are tailored polygon
With cut polygon all intersection points according to preset order deposit it is described first point concentration, will cut all vertex of polygon and by
All intersection points for cutting out polygon and cutting polygon are stored in the second point concentration according to preset order, and are described first point
The all the points that all the points of concentration and the second point are concentrated set a property.Wherein, the attribute include non-access point, access point,
Point and vertex intersection point out.The access point indicates to cut out the side in polygon and enters when cutting out polygon by preset direction and cut out more
The intersection point of side shape；The point out indicates that the side for being tailored polygon is left when cutting out polygon by preset direction and cuts out polygon
Intersection point；The vertex intersection point indicates coordinate be tailored polygon or cut out the identical intersection point of the apex coordinate of polygon；Institute
State the attribute for other points that non-access point indicates other than access point, out point and vertex intersection point.In addition, for ease of calculation at machine
Non- access point can be labeled as 0 by reason, and access point is labeled as 1, and point is labeled as 2 out, and vertex intersection point is labeled as 3.
Therefore, cropped polygon A as shown in Figure 3 and cutting polygon B, establishes cropped polygon A and sanction respectively
The vertex set PA and PB of polygon B are cut, is respectively starting point with the vertex A1 in Fig. 3, B1, the first vertex sequence PA of building A1,
A2, A3, A4, A5, A6, A7 } and the second vertex sequence PB { B1, B2, B3, B4 }.And cropped polygon A and cutting polygon B
Intersection point have: I1, I2 and I3.That first vertex sequence PA and intersection I 1, I2 and I3 are constructed in advance by preset order deposit
One point set obtains IA { A1, A2, I1, A3, I2, A4, A5, I3, A6, A7 }, and the second vertex sequence PB and intersection I 1, I2 and I3 are pressed
The second point set that preset order deposit constructs in advance obtains IB { B1, I1, B2, B3, I2, B4, I3 }.Wherein, the attribute of I1 be into
Point is labeled as 1；The attribute of I2, I3 are vertex intersection point, are labeled as 3；The attribute of remaining point is non-access point, is labeled as 0.
The method of the setting intersection point attribute provided in the embodiment of the present invention, with the existing discrepancy attribute for directly judging intersection point
Method is compared, and is conducive to correctly judge the attribute of intersection point, meanwhile, be also beneficial to due to vertex intersection point there are bring redundancies
The removal of point.
Step S120 removes the redundant points that first point set and the second point are concentrated.
The attribute for the point that the attribute and the second point of the point of first point of concentration are concentrated includes non-access point and top
Point intersection point.The attribute for the point that the attribute that first point set and the second point are concentrated is vertex intersection point is reset respectively.
In this specific embodiment, above-mentioned is respectively vertex intersection point by the attribute that first point set and the second point are concentrated
The preferred realization step that resets of attribute of point may include: that first to search all properties of first point of concentration be top
The point of point intersection point resets the attribute for the point that all properties are vertex intersection point further according to step 210 to step 220.
Step 210, it is concentrated at described first point, searching with current attribute is that vertex intersection point puts the different preceding point of coordinate
With rear point.
Wherein, point be the forward point of point that the relatively described current attribute of arrangement is vertex intersection point, the point afterwards before described
It is the point of the point of vertex intersection point rearward to arrange the relatively described current attribute.It should be noted that according to put in order
The preset order of element is concentrated for described first point.For example, from IA it is available to attribute be vertex intersection point point I2 and I3,
It is adjacent with I2 in IA by taking I2 as an example, and the different point of coordinate is I1 and A4.Therefore, I1 is that opposite I2 forward point is arranged in IA,
I.e. preceding point；A4 is that the opposite point of I2 rearward is arranged in IA, i.e., after point.
Step 220, it is reset according to the preceding point found and rear point with the positional relationship for cutting polygon described
It is the attribute of the point of vertex intersection point that first point set and the second point, which concentrate current attribute,.
Fig. 4 show according to the preceding point found and rear point reset with the positional relationship for cutting polygon it is described
It is the specific method process of the attribute of the point of vertex intersection point that first point set and the second point, which concentrate current attribute, comprising: step
Rapid S310 to step S350.
Step S310, judge searched it is described before point and it is described after point all or not cut polygonal internal.If
It is to enter step S320, if it is not, entering step 330.
Step S320 concentrates first point set and the second point identical with the coordinate of current vertex intersection point all
The attribute of point is changed to non-access point.
Step S330 judges that the preceding point searched is cutting polygonal internal and the rear point not in cutting polygon
It is internal.If so, S340 is entered step, if it is not, entering step 250.
Described first point is concentrated the attribute of first point identical with current vertex intersecting point coordinate to be changed to out by step S340
The second point is concentrated the attribute of identical with the coordinate of current vertex intersection point first point to be changed to access point by point, by described the
One point set and the second point concentrate the attribute of remaining point identical with the current vertex intersecting point coordinate to be changed to non-access point.
Step S350, by the attribute that described first point is concentrated identical with current vertex intersecting point coordinate first point be changed into
The second point is concentrated the attribute of first point identical with current vertex intersecting point coordinate to be changed to out point, by described first by point
Point set and the second point concentrate the attribute of remaining point identical with the current vertex intersecting point coordinate to be changed to non-access point.
According to above-mentioned steps S310 to step S350, the current attribute is concentrated to be first point set and the second point
The attribute of all the points of vertex intersection point is reset.
For example, the attribute of intersection I 2 in IA and IB can be disposed as non-according to above-mentioned steps S310 to step S350
Attribute is labeled as 0 by access point；The attribute of the midpoint IA A5 is re-set as out point, i.e., attribute is labeled as 2, it will be in IB
The attribute of point I2 is re-set as access point, i.e., attribute is labeled as 1.At this point, IA A1, A2, I1, A3, I2, A4, A5, I3, A6,
A7 } in the attributes of all the points respectively be: A1 (0), A2 (0), I1 (1), A3 (0), I2 (0), A4 (0), A5 (2), I3 (0),
A6 (0), A7 (0)；The attribute of all the points respectively is in IB { B1, I1, B2, B3, I2, B4, I3 }: B1 (0), I1 (1), B2
(0), (0) B3, I2 (0), B4 (0), I3 (1).It should be noted that the tag value in bracket is the attribute for indicating point.
By step 220, it is all of vertex intersection point that first point set and the second point, which are concentrated current attribute,
Point attribute reset after, then respectively by after described reset first point set and the second point concentrate it is adjacent
An and point deletion in equal two points of coordinate, wherein the attribute for the point deleted is non-access point.Specific implementation
Can preferably use following steps: (A) search respectively described in reset after first point set and the second point concentrate
Two adjacent and equal coordinate points；(B) it makes deletion according to lookup result to determine, if that is searched belongs to the two of same point set
The attribute of a point is non-access point, is deleted in two searched points to arrange point rearward in the preset order；If institute
The attribute that the attribute for two points for belonging to same point set searched only has a point is non-access point, deletes searched attribute and is
The point of non-access point.
According to above-mentioned steps (A) and step (B), respectively by first point set and described second after described reset
After all redundancy point deletions that point is concentrated, S130 is entered step.For example, I2 and I3 is deleted in IA at this time, IA is changed to KA
{ A1, A2, I1, A3, A4, A5, A6, A7 }, IB are changed to KB { B1, I1, B2, B3, I2, B4, I3 }.
In the embodiment of the present invention, with existing directly according to the difference set figure for entering and leaving attribute two polygons of search of intersection point
The step of method is compared, and the redundant points removal by first point set and second point concentration is increased, is conducive to obtain just
True cutting result.
Step S130, according to first point set and second point set building third point set after removal redundant points.
After above-mentioned processing, first point set and the second point concentrate irredundant point, can be according to common
Polygon clipping method handles first point set and second point set to obtain the vertex sequence for cutting result figure,
The i.e. described third point set.For example, Weiler-Atherton algorithm for polygon clipping can be used in this specific embodiment, specifically
Implementation may comprise steps of:
(1) point set R is established for storing the vertex sequence for cutting result figure.
(2) it is the point PAc for point that first point after removing redundant points, which concentrates search attribute, with clockwise since the point
Order traversal removes the first point set after redundant points, until searching the point PAr that attribute is access point.
(3) by all the points in the search order deposit search process of point in point set R, wherein deposit point includes search
Beginning and end in the process.
(4) second point after removing redundant points, which is concentrated, searches for and arrives point PBc identical with PAr coordinate；Since point PBc
The second point set after traversing removal redundant points with sequence counter-clockwise, searches the point PBr that attribute is access point.
(5) all the points being stored in point set R in search process, wherein deposit point does not include the starting point in search process
And terminal.
(6) first point of concentration after removing redundant points obtains point PAe identical with PBr coordinate value, judges PAe and PAc
Coordinate it is whether identical.
If PAe is identical as the coordinate of PAc, terminate operation, point set R is the vertex sequence for cutting result figure at this time, i.e.,
For third point set；
If the coordinate of PAe and PAc is not identical, saving current R Point Set is Ri, create Ri+1, wherein i=1,2,3 ...
The step of n, n are positive integer, continue (2) to (6) obtains the multiple vertex sequence R1~Rn for cutting result figure.At this point,
Third point set is multiple vertex sequence R1~Rn.
For example, figure as shown in Figure 3, after step (1) to step (6), by the first point set after removal redundant points
KA { A1, A2, I1, A3, A4, A5, A6, A7 } and removal redundant points after the second point set KB { B1, I1, B2, B3, I2, B4, I3 } can
To obtain third point set as PR { A5, A6, A7, A1, A2, I1, B1 }, cutting result figure as shown in Figure 5 is obtained.
It is of course also possible to use other algorithm for polygon clipping obtain the third point set.
Step S140 constructs scan line set according to the third point set.
It is easy to carry out space orientation and retrieval since trapezoidal form is simple, two bottom edges are parallel to each other, in the embodiment of the present invention,
Result figure will be reduced and continue dividing method using trapezoidal dividing method, be divided into if will further reduce result figure
Dry trapezoidal.It degenerates it should be noted that triangle also may be regarded as a bottom edge for the special trapezoidal of a bit.
Therefore the construction method of the scan line set is specifically as follows: obtaining the x for thirdly concentrating each to put
Coordinate constructs a scan line with the x coordinate of each point, it is preferred that deletes the scan line being wherein overlapped, again to construct scanning
Line set.It should be noted that preferred, scan line puts in order according to x coordinate size in the scan line set, from small
To longer spread.
Two scan lines adjacent in the scan line set are built into scan line pair, by each scanning by step S150
Line pair constitutes segmentation intersection point sequence with all intersection points for cutting out result figure constructed by the third point set.
Wherein, each scan line pair is constituted with all intersection points for cutting out result figure constructed by the third point set
Segmentation intersection point sequence specifically includes:
A scan line for obtaining current scan line centering respectively cuts out result figure with what is constructed by the third point set
Another scan line of segmentation intersection point and current scan line centering of shape cuts out result figure with what is constructed by the third point set
Segmentation intersection point.It should be noted that the segmentation intersection point is the intersection point of scan line and cutting result figure, i.e., it will wherein one
Scan line intersect being calculated with each edge for cutting result figure, if scan line is overlapped with the sideline of figure, only will
Two endvertexes in the sideline are calculated as segmentation intersection point.
Again by the current scan line centering, the corresponding segmentation intersection point of each scan line establishes segmentation intersection point sequence.This
In specific embodiment, each segmentation intersection point sequence is preferably from small to large suitable according to the y value size of segmentation intersecting point coordinate
Sequence is arranged.
For example, according to above-mentioned point set PR { A5, A6, A7, A1, A2, I1, B1 } available scan line set L L1, L2,
L3, L4, L5, L6 }, as shown in Figure 6.Wherein, x coordinate of x coordinate of the x coordinate of L1 less than L2 less than L3 is less than the x coordinate of L4
X coordinate less than L5 is less than the x coordinate of L6.Two scan lines adjacent in scan line set are built into scan line pair, i.e. institute
There is the scan line of composition to for (L1, L2), (L2, L3), (L3, L4), (L4, L5), (L5, L6).Wherein, each scan line is equal
A corresponding segmentation intersection point sequence.
Step S160 removes the redundant points in the segmentation intersection point sequence.
Due to the shared point that polygon vertex is two sides, therefore during obtaining segmentation intersection point, by third point set
Each of will appear repetition intersection point at point, the intersection point that repeats is two equal intersection points of coordinate.Therefore, it is necessary to bases
Further judgement, removal repeat unwanted point in intersection point.
In the present embodiment, the method for the removal of the redundant points in intersection point sequence will be divided specifically: delete each respectively and sweep
Retouch the redundant points in the corresponding segmentation intersection point sequence of each scan line of line centering.
Fig. 7 is shown will be superfluous in the corresponding segmentation intersection point sequence of a scan line of one of scan line centering
The method flow diagram of remaining point deletion, specifically includes the following steps:
Step S410 extracts the repetition intersection point in current segmentation intersection point sequence.
It should be noted that therefore, it is necessary to be directed to since the repetition intersection point currently divided in intersection point sequence may have multiple
Each of current segmentation intersection point sequence repeats intersection point and carries out operation of the step S420 into step S440.
Step S420 is thirdly concentrated described, searches the point equal with the current repetition coordinate of intersection point.
Step S430, extract it is described thirdly concentrate searched with the preceding point of the current point that repeat intersecting point coordinate equal and
Point afterwards.
Step S440 is opposite according to a scan line corresponding with current segmentation intersection point sequence in current scan line pair
In the laterally opposed position of another scan line, the transverse direction of the preceding point and the rear point and the current scan line is judged respectively
Relative position, to delete the current redundant points for repeating to include in intersection point.Fig. 8 show delete it is current repeat to include in intersection point it is superfluous
The method flow diagram of remaining point, specifically includes the following steps:
Step S510, judges in current scan line pair, a scan line corresponding with current segmentation intersection point sequence
X coordinate whether be less than the x coordinate in another scan line；
If so, step S520 is carried out, if it is not, then carrying out rapid S560；
It is described corresponding with currently segmentation intersection point sequence to judge whether that the preceding point and the rear point are located at by step S520
A scan line two sides or it is described before point and it is described after a point in point x coordinate be greater than it is described with current segmentation friendship
The x coordinate of the x coordinate of the corresponding scan line of point sequence and another point is equal to described corresponding with current segmentation intersection point sequence
A scan line x coordinate；
If so, step S530 is carried out, if it is not, then carrying out step S540；
Step S530 deletes the current intersection point repeated in intersection point；
Step S540, judge whether it is described before point and it is described after have in point the x coordinate of a point be less than it is described with currently minute
The x coordinate for cutting the x coordinate of the corresponding scan line of intersection point sequence and another point is equal to described and current segmentation intersection point sequence
The x coordinate of a corresponding scan line or it is described before the x coordinate put and it is described after the x coordinate put be respectively less than it is described with current minute
Cut the x coordinate of the corresponding scan line of intersection point sequence；
If so, step S550 is carried out, if it is not, then retaining two intersection points included by current repetition intersection point；
Step S550 deletes two intersection points included by the current repetition intersection point；
It is described corresponding with currently segmentation intersection point sequence to judge whether that the preceding point and the rear point are located at by step S560
A scan line two sides or it is described before point and it is described after a point in point x coordinate be less than it is described with current segmentation friendship
The x coordinate of the x coordinate of the corresponding scan line of point sequence and another point is equal to described corresponding with current segmentation intersection point sequence
A scan line x coordinate；
If so, step S570 is carried out, if it is not, then carrying out step S580.
Step S570 deletes two intersection points included by the current repetition intersection point.
Step S580 judges whether that the x coordinate of the preceding point and the rear x coordinate put are all larger than described and currently divide
The x coordinate of the x coordinate of the corresponding scan line of intersection point sequence or the preceding point and a point in the rear point is greater than described
The x coordinate and another x coordinate put of a scan line corresponding with current segmentation intersection point sequence are divided described in being equal to current
The x coordinate of the corresponding scan line of intersection point sequence；
If so, step S590 is carried out, if it is not, then retaining two intersection points included by current repetition intersection point；
Step S590 deletes the current intersection point repeated in intersection point.
Intersection point, which is repeated, for each of current segmentation intersection point sequence carries out operation of the step S420 into step S440,
And after step S440 has been executed each time, judge whether that all repetition intersection points currently divided in intersection point sequence have been handled
Afterwards, if so, entering step S450, if it is not, currently next intersection point that repeats in segmentation intersection point sequence is as in step S420
It is current repeat intersection point, and execute subsequent step.
Step S450 judges the weight in segmentation intersection point sequence corresponding to each scan line of each scan line centering
It reestablishes diplomatic relations and a little whether has handled.
If so, executing step S170；Work as if it is not, extracting next segmentation intersection point sequence as described in S410 step
Preceding segmentation intersection point sequence, and execute subsequent step.
In this specific implementation, scan line is multiple to having, it is therefore desirable to carry out each for each scan line centering
Segmentation intersection point sequence corresponding to scan line carries out operation of the step S410 into step S440, until by each scan line pair
In each scan line corresponding to segmentation intersection point sequence in redundant points remove, be further continued for carry out step 170.
In the embodiment of the present invention, compared with the existing method for constructing partition graph by establishing scan line set, increase
The step of removal of the redundant points in intersection point sequence will be divided, can selectively delete the extra point repeated in intersection point
It removes, is conducive to obtain correct segmentation result.
Step S170, according to the segmentation intersection point sequence structure partition graph after removal redundant points.
Segmentation intersection point sequence according to each scan line centering, after the corresponding removal redundant points of each scan line
Column, it is trapezoidal to be divided into several for the cutting result figure that third point set is constituted.
For example, corresponding above-mentioned scan line is to (L1, L2), (L2, L3), (L3, L4), (L4, L5), (L5, L6), (L6, L7),
Remove redundant points after segmentation intersection point sequence be (CL1, CL2), (DL2, DL3), (EL3, EL4), (FL4, FL5), (GL5,
GL6), (HL6, HL7).With scan line to (L1, L2) for, corresponding segmentation intersection point sequence be (CL1, CL2), according to CL1
Point set is constructed with CL2, obtains segmentation result.For example, a set can be first constructed, first be first stored in CL1 in order
Point and second point, second point and first point being then stored in CL2, then may make up one it is trapezoidal, and so on by CL1
It is configured to all the points in CL2 trapezoidal.Therefore, as shown in figure 9, cut result figure can be divided into 6 it is trapezoidal, it is described
6 trapezoidal vertex sequences be respectively (A7, A1, M6), (M6, A1, M1, A6), (A6, M1, M2, M5), (B1, M2, M3, M4),
(M5, B1, A5), (M4, M3, A2, I1).
Second specific embodiment
Figure 10 shows a kind of structural block diagram for image processing apparatus that the second specific embodiment of the invention provides, and is applied to
The cutting and segmentation of polygon.Fig. 9 is please referred to, described image processing unit includes:
First building module 610 for constructing the first point set and the second point set, and is all the points of described first point concentration
With the second point concentrate all the points set a property, wherein first point set by be tailored polygon all vertex and
It is tailored polygon and is rearranged with all intersection points for cutting polygon according to preset order, second point set is polygon by cutting
All vertex of shape and the intersection point are rearranged according to preset order；
First redundant points remove module 620, for removing the redundant points of first point set and second point concentration；
Second building module 630, for according to removal redundant points after first point set and second point set construct
Third point set；
Third constructs module 640, for constructing scan line set according to the third point set；
4th building module 650, for two adjacent scan lines to be built into scan line pair, by each scan line pair with
Segmentation intersection point sequence is constituted by all intersection points for cutting out result figure that the third point set constructs；
Second redundant points remove module 660, for removing the redundant points in the segmentation intersection point sequence；
Partition graph constructing module 670, for according to the segmentation intersection point sequence structure partition graph after removal redundant points.
The technical effect and preceding method embodiment phase of device provided by the embodiment of the present invention, realization principle and generation
Together, to briefly describe, Installation practice part does not refer to place, can refer to corresponding contents in preceding method embodiment.
In several embodiments provided herein, it should be understood that disclosed device and method can also pass through
Other modes are realized.The apparatus embodiments described above are merely exemplary, for example, flow chart and block diagram in attached drawing
Show the device of multiple embodiments according to the present invention, the architectural framework in the cards of method and computer program product,
Function and operation.In this regard, each box in flowchart or block diagram can represent the one of a module, section or code
Part, a part of the module, section or code, which includes that one or more is for implementing the specified logical function, to be held
Row instruction.It should also be noted that function marked in the box can also be to be different from some implementations as replacement
The sequence marked in attached drawing occurs.For example, two continuous boxes can actually be basically executed in parallel, they are sometimes
It can execute in the opposite order, this depends on the function involved.It is also noted that every in block diagram and or flow chart
The combination of box in a box and block diagram and or flow chart can use the dedicated base for executing defined function or movement
It realizes, or can realize using a combination of dedicated hardware and computer instructions in the system of hardware.
In addition, each functional module in each embodiment of the present invention can integrate one independent portion of formation together
Point, it is also possible to modules individualism, an independent part can also be integrated to form with two or more modules.
It, can be with if the function is realized and when sold or used as an independent product in the form of software function module
It is stored in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be a
People's computer, server or network equipment etc.) it performs all or part of the steps of the method described in the various embodiments of the present invention.
And storage medium above-mentioned includes: that USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access are deposited
The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic or disk.It needs
Illustrate, herein, relational terms such as first and second and the like be used merely to by an entity or operation with
Another entity or operation distinguish, and without necessarily requiring or implying between these entities or operation, there are any this realities
The relationship or sequence on border.Moreover, the terms "include", "comprise" or its any other variant are intended to the packet of nonexcludability
Contain, so that the process, method, article or equipment for including a series of elements not only includes those elements, but also including
Other elements that are not explicitly listed, or further include for elements inherent to such a process, method, article, or device.
In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including the element
Process, method, article or equipment in there is also other identical elements.
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made any to repair
Change, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.It should also be noted that similar label and letter exist
Similar terms are indicated in following attached drawing, therefore, once being defined in a certain Xiang Yi attached drawing, are then not required in subsequent attached drawing
It is further defined and explained.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain
Lid is within protection scope of the present invention.Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (9)
1. a kind of image processing method, cutting and segmentation applied to polygon, which is characterized in that the described method includes:
Construct the first point set and the second point set, and all the points that all the points concentrated for described first point and the second point are concentrated
It sets a property, wherein first point set is by being tailored all vertex of polygon and being tailored polygon and cutting polygon
All intersection points rearranged according to preset order, second point set by all vertex of cutting polygon and the intersection point according to
Preset order rearranges；
The redundant points removal that first point set and the second point are concentrated；
According to first point set and second point set building third point set after removal redundant points；
Scan line set is constructed according to the third point set；
Two scan lines adjacent in the scan line set are built into scan line pair, by each scan line pair and by described
All intersection points for cutting out result figure of third point set construction constitute segmentation intersection point sequence；
By the redundant points removal in the segmentation intersection point sequence；
According to the segmentation intersection point sequence structure partition graph after removal redundant points；
Wherein, the attribute for the point that the attribute of the point of first point of concentration and the second point are concentrated includes non-access point and top
Point intersection point, the redundant points that first point set and the second point are concentrated are removed, are specifically included:
The attribute for the point that the attribute that first point set and the second point are concentrated is vertex intersection point is reset respectively；
Respectively by after described reset first point set and the second point concentrate two adjacent and equal coordinate points
In a point deletion, wherein the attribute for the point deleted be non-access point.
2. the method according to claim 1, wherein described respectively by described first after described reset
Point set and the second point concentrate a point deletion in two adjacent and equal coordinate points, wherein the category for the point deleted
Property be non-access point, comprising:
First point set and the second point after resetting described in searching respectively concentrate adjacent and equal coordinate two
Point；
If the attribute that is searched belong to two points of same point set is non-access point, delete in two searched points with institute
State the point arranged in preset order rearward；
If the attribute that the attribute that is searched belong to two points of same point set only has a point is non-access point, deletion is searched
Attribute be non-access point point.
3. the method according to claim 1, wherein described respectively by first point set and the second point
The attribute of concentration is that the attribute of the point of vertex intersection point is reset, comprising:
The all properties for searching first point of concentration are the point of vertex intersection point, and resetting all properties according to following steps is
The attribute of the point of vertex intersection point:
It is concentrated at described first point, searching with current attribute is that vertex intersection point puts the different preceding point and rear point of coordinate；
First point set and institute are reset with the positional relationship for cutting polygon according to the preceding point found and rear point
Stating second point and concentrating current attribute is the attribute of the point of vertex intersection point.
4. described according to the method described in claim 3, it is characterized in that, the attribute of the point further includes in and out point
First point set and described the are reset according to the preceding point found and rear point and the positional relationship for cutting polygon
It is the attribute of the point of vertex intersection point that 2 points, which are concentrated current attribute, comprising:
Judge to be searched it is described before point and it is described after point all or do not cutting polygonal internal, if so, by described the
One point set and the second point concentrate the attribute of all the points identical with the coordinate of current vertex intersection point to be changed to non-access point；
If it is not, judgement searched it is described before point cut polygonal internal and it is described after point cut polygonal internal,
If so, concentrate the attribute of first point identical with current vertex intersecting point coordinate to be changed to out point for described first point, it will be described
Second point concentrates the attribute of first point identical with the coordinate of current vertex intersection point to be changed to access point, by first point set and institute
Stating second point concentrates the attribute of remaining point identical with the current vertex intersecting point coordinate to be changed to non-access point；
If it is not, then concentrate the attribute of first point identical with current vertex intersecting point coordinate to be changed to access point for described first point,
The attribute of first point identical with current vertex intersecting point coordinate is concentrated to be changed to out point the second point, by first point set
The attribute of remaining point identical with the current vertex intersecting point coordinate is concentrated to be changed to non-access point with the second point.
5. the method according to claim 1, wherein described construct scan line set, tool according to third point set
Body includes: to obtain the x coordinate for thirdly concentrating each to put, and constructs scan line set.
6. according to the method described in claim 5, it is characterized in that, it is described by each scan line pair with by it is described thirdly
All intersection points for cutting out result figure of collection construction constitute segmentation intersection point sequence, specifically include:
A scan line for obtaining current scan line centering respectively cuts out result figure with by third point set construction
Segmentation another scan line of intersection point and current scan line centering and point for cutting out result figure constructed by the third point set
Cut intersection point；
By the current scan line centering, the corresponding segmentation intersection point of each scan line establishes segmentation intersection point sequence.
7. according to the method described in claim 6, it is characterized in that, the redundant points by the segmentation intersection point sequence are gone
It removes, specifically includes:
The repetition intersection point in current segmentation intersection point sequence is extracted, the intersection point that repeats is two equal intersection points of coordinate；
It is thirdly concentrated described, searches the point equal with the current repetition coordinate of intersection point；
Extract the preceding point and rear point of the point equal with current repetition intersecting point coordinate thirdly concentrated and searched；
In current scan line pair, according to a scan line corresponding with current segmentation intersection point sequence relative to another scan line
Laterally opposed position, judge respectively it is described before point and it is described after point and the current scan line laterally opposed position, to delete
Except the current redundant points for repeating to include in intersection point.
8. the method according to the description of claim 7 is characterized in that dividing intersection point according to current in current scan line pair
Laterally opposed position of the corresponding scan line of sequence relative to another scan line, judge respectively it is described before point and it is described after
The laterally opposed position of point and the current scan line is specifically included with deleting the current redundant points for repeating to include in intersection point:
Judge in current scan line pair, whether the x coordinate of a scan line corresponding with current segmentation intersection point sequence is small
In the x coordinate in another scan line,
If so, it is described one corresponding with currently segmentation intersection point sequence to judge whether that the preceding point and the rear point are located at
The two sides of scan line or it is described before point and it is described after a point in point x coordinate be greater than it is described with currently divide intersection point sequence
The x coordinate of the x coordinate of a corresponding scan line and another point is equal to described one corresponding with current segmentation intersection point sequence
The x coordinate of scan line, if so, the current intersection point repeated in intersection point is deleted, if it is not, then
Judge whether it is described before point and it is described after to have the x coordinate of a point to be less than in point described corresponding with intersection point sequence is currently divided
The x coordinate of a scan line and x coordinate of another point be equal to described one corresponding with current segmentation intersection point sequence and scan
The x coordinate of line or it is described before the x coordinate put and it is described after the x coordinate put be respectively less than it is described corresponding with intersection point sequence is currently divided
A scan line x coordinate, if so, delete it is described it is current repeat intersection point two intersection points including, work as if it is not, then retaining
It is preceding to repeat two intersection points included by intersection point；
If it is not, then judge whether it is described before point and it is described after point be located at it is described with currently divide intersection point sequence corresponding one
The two sides of scan line or it is described before point and it is described after a point in point x coordinate be less than it is described with currently divide intersection point sequence
The x coordinate for arranging the x coordinate of a corresponding scan line and another point divides intersection point sequence corresponding one with current equal to described
The x coordinate of scan line, if so, current two intersection points for repeating intersection point and including are deleted, if it is not, then
It is described corresponding with currently segmentation intersection point sequence to judge whether that the preceding x coordinate put and the rear x coordinate put are all larger than
A scan line x coordinate or it is described before point and it is described after a point in point x coordinate be greater than it is described with current segmentation friendship
The x coordinate of the x coordinate of the corresponding scan line of point sequence and another point is equal to described corresponding with current segmentation intersection point sequence
A scan line x coordinate, if so, the current intersection point repeated in intersection point is deleted, if it is not, then retaining current
Repeat two intersection points included by intersection point.
9. a kind of image processing apparatus, cutting and segmentation applied to polygon characterized by comprising
First building module for constructing the first point set and the second point set, and is all the points of described first point concentration and described
The all the points that second point is concentrated set a property, wherein first point set is by being tailored all vertex of polygon and being tailored
Polygon is rearranged with all intersection points for cutting polygon according to preset order, and second point set is owned by cutting polygon
Vertex and the intersection point are rearranged according to preset order；
First redundant points remove module, for removing the redundant points of first point set and second point concentration；
Second building module, for according to removal redundant points after first point set and second point set building thirdly
Collection；
Third constructs module, for constructing scan line set according to the third point set；
4th building module by each scan line pair and passes through institute for two adjacent scan lines to be built into scan line pair
All intersection points for cutting out result figure for stating third point set construction constitute segmentation intersection point sequence；
Second redundant points remove module, for removing the redundant points in the segmentation intersection point sequence；
Partition graph constructing module, for according to the segmentation intersection point sequence structure partition graph after removal redundant points；
Wherein, the attribute for the point that the attribute of the point of first point of concentration and the second point are concentrated includes non-access point and top
Point intersection point, first redundant points remove module, are also used to the attribute for respectively concentrating first point set and the second point
Attribute for the point of vertex intersection point is reset；
First redundant points remove module, are also used to first point set and described second after described reset respectively
Point concentrates a point deletion in two adjacent and equal coordinate points, wherein the attribute for the point deleted is non-access point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510937091.6A CN105513008B (en) | 2015-12-15 | 2015-12-15 | A kind of image processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510937091.6A CN105513008B (en) | 2015-12-15 | 2015-12-15 | A kind of image processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105513008A CN105513008A (en) | 2016-04-20 |
| CN105513008B true CN105513008B (en) | 2019-01-11 |
Family
ID=55720966
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510937091.6A Active CN105513008B (en) | 2015-12-15 | 2015-12-15 | A kind of image processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105513008B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107633524B (en) * | 2016-07-18 | 2020-09-29 | 中国科学院微电子研究所 | Layout boundary extraction method and device |
| CN110110594B (en) * | 2019-03-28 | 2021-06-22 | 广州广电运通金融电子股份有限公司 | Product distribution identification method and device |
| CN110781541B (en) * | 2019-10-08 | 2022-07-08 | 江苏艾佳家居用品有限公司 | Region merging method and system for home decoration design drawing |
| CN111784695B (en) * | 2020-06-01 | 2024-03-22 | 北京像素软件科技股份有限公司 | Method and device for cutting graph, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102496179A (en) * | 2011-11-08 | 2012-06-13 | 中国测绘科学研究院 | 3-dimensional scene cutting method |
| CN102663792A (en) * | 2012-03-28 | 2012-09-12 | 上海量明科技发展有限公司 | Method and system for deleting redundant area in screenshot |
| CN103514606A (en) * | 2013-10-14 | 2014-01-15 | 武汉大学 | Heterology remote sensing image registration method |
| CN103530882A (en) * | 2013-10-17 | 2014-01-22 | 南京大学 | Improved image segmentation method based on picture and color texture features |
| CN104700404A (en) * | 2015-03-02 | 2015-06-10 | 中国农业大学 | Fruit location identification method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5865113B2 (en) * | 2012-02-20 | 2016-02-17 | 株式会社Pfu | Image processing apparatus, image processing system, image processing method, and image processing program |
-
2015
- 2015-12-15 CN CN201510937091.6A patent/CN105513008B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102496179A (en) * | 2011-11-08 | 2012-06-13 | 中国测绘科学研究院 | 3-dimensional scene cutting method |
| CN102663792A (en) * | 2012-03-28 | 2012-09-12 | 上海量明科技发展有限公司 | Method and system for deleting redundant area in screenshot |
| CN103514606A (en) * | 2013-10-14 | 2014-01-15 | 武汉大学 | Heterology remote sensing image registration method |
| CN103530882A (en) * | 2013-10-17 | 2014-01-22 | 南京大学 | Improved image segmentation method based on picture and color texture features |
| CN104700404A (en) * | 2015-03-02 | 2015-06-10 | 中国农业大学 | Fruit location identification method |
Non-Patent Citations (2)
| Title |
|---|
| 一种任意多边形的剪裁算法;白晨;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20120315;第10-19页 |
| 利用于扫描线与梯形分割的面目标空间拓扑计算;王结臣等;《武汉大学学报》;20100731(第35卷第7期);第773-777页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105513008A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105513008B (en) | A kind of image processing method and device | |
| JP5789525B2 (en) | Document content ordering | |
| US11880382B2 (en) | Systems and methods for generating tables from print-ready digital source documents | |
| US7752543B2 (en) | Applying effects to a merged text path | |
| Lin et al. | Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs | |
| CN103645974B (en) | Method and device for recovering portable document format (PDF) file | |
| WO2018184305A1 (en) | Group search method based on social network, device, server and storage medium | |
| CN106156773A (en) | The dividing method of a kind of text image and device | |
| CN111310426A (en) | Form format recovery method and device based on OCR and storage medium | |
| JP2023509996A (en) | Document Information Extraction System Using Ordered Comparator | |
| CN109740124A (en) | Difference output method, device, storage medium and the electronic equipment of document comparison | |
| CN104834645A (en) | Method and device for presenting layout document | |
| Har-Peled et al. | A time-optimal Delaunay refinement algorithm in two dimensions | |
| CN115546809A (en) | Table structure identification method based on cell constraint and application thereof | |
| US8352890B2 (en) | Method for reading polygon data into an integrated circuit router | |
| Rahul | Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3 | |
| CN113343658B (en) | PDF file information extraction method and device and computer equipment | |
| Chipofya et al. | Matching qualitative spatial scene descriptions á la tabu | |
| Wang et al. | Efficient multi-layer obstacle-avoiding region-to-region rectilinear Steiner tree construction | |
| WO2018064959A1 (en) | Method and device for determining title of multimedia resource | |
| JP7195092B2 (en) | Identifying hand-drawn tables | |
| CN109871517B (en) | Text block ordering method and device, storage medium and electronic equipment | |
| JP6377743B2 (en) | Method and apparatus for building an intermediate character library | |
| CN116009552A (en) | Path planning method, device, equipment and storage medium | |
| CN113538465A (en) | Automatic dividing method and device for regular and irregular polygon areas and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 311100 room 204-5, building 3, No. 16, Longtan Road, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province Patentee after: Zhejiang Jinxin Microelectronics Technology Co.,Ltd. Address before: 300000 133, 302, 303, 305, 306, 307, 309, 310, No. 167, Huanghai Road, Tianjin Economic and Technological Development Zone Patentee before: TIANJIN JINXIN MICROELECTRONIC TECHNOLOGY Co.,Ltd. |