CN109034234A - A kind of identification of adjacent area feature and automatic processing method - Google Patents

A kind of identification of adjacent area feature and automatic processing method Download PDF

Info

Publication number
CN109034234A
CN109034234A CN201810795251.1A CN201810795251A CN109034234A CN 109034234 A CN109034234 A CN 109034234A CN 201810795251 A CN201810795251 A CN 201810795251A CN 109034234 A CN109034234 A CN 109034234A
Authority
CN
China
Prior art keywords
face
adjacent area
adjoining
boundary
index
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.)
Withdrawn
Application number
CN201810795251.1A
Other languages
Chinese (zh)
Inventor
李成名
刘振东
刘坡
赵占杰
王飞
武鹏达
刘晓丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chinese Academy of Surveying and Mapping
Original Assignee
Chinese Academy of Surveying and Mapping
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chinese Academy of Surveying and Mapping filed Critical Chinese Academy of Surveying and Mapping
Priority to CN201810795251.1A priority Critical patent/CN109034234A/en
Publication of CN109034234A publication Critical patent/CN109034234A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
    • G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
    • G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
    • G06V10/751—Comparing pixel values or logical combinations thereof, or feature values having positional relevance, e.g. template matching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/22—Matching criteria, e.g. proximity measures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
    • G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
    • G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
    • G06V10/751—Comparing pixel values or logical combinations thereof, or feature values having positional relevance, e.g. template matching
    • G06V10/7515—Shifting the patterns to accommodate for positional errors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
    • G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
    • G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
    • G06V10/758—Involving statistics of pixels or of feature values, e.g. histogram matching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V10/00—Arrangements for image or video recognition or understanding
    • G06V10/70—Arrangements for image or video recognition or understanding using pattern recognition or machine learning
    • G06V10/74—Image or video pattern matching; Proximity measures in feature spaces
    • G06V10/75—Organisation of the matching processes, e.g. simultaneous or sequential comparisons of image or video features; Coarse-fine approaches, e.g. multi-scale approaches; using context analysis; Selection of dictionaries
    • G06V10/759—Region-based matching

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Databases & Information Systems (AREA)
  • Multimedia (AREA)
  • Medical Informatics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention discloses a kind of identification of adjacent area feature and automatic processing methods, the specific steps are as follows: Step 1: the structure feature according to face element, establishes structure feature interpretation index automatic identification adjacent area；Step 2: accurately calculating each adjacent area boundary using expansion-corrosion transformation；Each adjacent area internal bridge junction is extracted Step 3: calculating by space overlapping；Step 4: extracting bridge joint face adjoining line based on Delaunay triangulation network and being modified to adjoining line；Step 5: carrying out division fusion treatment to bridge joint face according to resulting the adjoining line of step 4, the face element for being bridged face segmentation is made to become abutment surface element；Step 6: repeating step 1 to five, until there is no the face elements that can carry out adjoining operation using the adjoining of formation result as new face element.The present invention is a kind of process of Dynamic iterations, and gradual the adjoining processing for realizing adjacent area element operates machine intelligenceization processing for adjoining and establishes theory and method basis.

Description

A kind of identification of adjacent area feature and automatic processing method
Technical field
The present invention relates to a kind of method more particularly to a kind of identification of adjacent area feature and automatic processing methods.
Background technique
Adjoining is to maintain the geometric transformation of aggregation area pattern group structure feature, in particular, refer to pass through by Long and narrow blank segmentation (i.e. bridge joint face) between regularly arranged face group is punctured into line, so that the face element divided by it be made to become The geometric transformation process of abutment surface element.Element group in face mentioned here is not the face element collection with arbitrary structures or shape Close, and refer to it is similar with certain arrangement regulation, individual shapes feature, and by the ribbon bridge joint face with one fixed width In the face elements combination being distributed in flakes.When the scale bar of Map Expression is from big become smaller, inside this aggregation face element group Band-like bridge joint face be typically due to it is more long and narrow be difficult to show on the diagram, and require its structured features necessary in practical application It keeps, it is clear that the less continuity for considering internal structure is distributed face element group's integrated approach, and such as polymerization and blending algorithm are difficult to fit It is operated with the adjoining of face element group.
It in addition, there will be theoretical procedure and operation thinking that research only gives adjoining, be not directed to detail, there is system The operation may be implemented in the professional person of figure experience, but is not enough to that machine intelligenceization is supported to handle；Also, researcher is to adjoining The geographic element for changing feature lacks enough attention, and the rarely seen further investigated to adjoining operation adjoins for influencing aggregation face group Change the critical issue automatically processed and does not also provide answer.
Summary of the invention
In order to solve shortcoming present in above-mentioned technology, the present invention provides a kind of identification of adjacent area feature and automatically Processing method.
In order to solve the above technical problems, the technical solution adopted by the present invention is that: a kind of adjacent area feature identification and automatic Processing method, adjacent area include several face elements；Specific step is as follows for feature identification and automatic processing method:
Step 1: the structure feature according to face element, establishes structure feature interpretation index automatic identification adjacent area；
The structure feature of face element includes band-like bridge joint face width, Distribution Pattern index, shape similarity index, degree of overlapping Index；
The process of structure feature interpretation index automatic identification adjacent area are as follows: for the face element collection { P in regioni(i=1, 2 ..., n), according to band-like bridge joint face width threshold value TBDistanceCandidate adjacent area complete or collected works are determined, for any element Pi, into one Step identifies in its vicinal face element to be suitable for carrying out adjoining according to Distribution Pattern index, shape similarity index, degree of overlapping index The element of operation, and adjacent area subset is constituted, whole elements in candidate adjacent area complete or collected works are traversed, multiple adjacent area collection are formed It closes；
Step 2: accurately calculating each adjacent area boundary using expansion-corrosion transformation；
Each adjacent area internal bridge junction is extracted Step 3: calculating by space overlapping；
Step 4: extracting bridge joint face adjoining line based on Delaunay triangulation network and being modified to adjoining line, wherein Branch's Key dithering method is used for the amendment of adjoining line and is modified using boundary as constraint；
Step 5: carrying out division fusion treatment to bridge joint face according to resulting the adjoining line of step 4, make to be bridged face point The face element cut becomes abutment surface element；
Step 6: repeating step 1 to five, until being not present using the adjoining of formation result as new face element It can carry out the face element of adjoining operation.
Further, band-like bridge joint face width threshold value TB in step 1DistanceCalculation method as shown in formula I:
TBDistance=BWthreshold×Tscale
Ⅰ
Wherein, TBDistanceFor the spacing between vicinal face element, BWthresholdTo divide width threshold value, TscaleFor target The denominator of scale bar；
The determination process of candidate adjacent area subset is as follows:
1. firstly, calculating aggregation face element group boundary using minimum area rectangle；
2. secondly, encryption minimum area square boundary and each face element boundary node, specific encryption method are as follows: setting encryption The value of step-length d, encryption step-length d use the length of element boundary shortest arc section, are adopted between two nodes using d as primitive Sample obtains pass point；
3. then, establishing the Delaunay triangulation network of boundary constraint using incremental inserting algorithm；So that constraint Delaunay Triangle in the triangulation network is connected to two face elements with proximity relations；
4. next, calculating the high h of all Delaunay triangles between two vicinal face elements, and its average value is made Spacing B between vicinal face elementDistance, as shown in formula II:
Wherein, BDistanceFor the spacing between vicinal face element, n between adjacent surface element Delaunay triangle it is total Number,For the sum of the height of n Delaunay triangle；
5. finally, according to band-like bridge joint face width threshold value TBDistance, as the B of two vicinal face elementsDistance≤ TBDistanceWhen, then it is identified as candidate adjacent area subset, and so on, extract candidate adjacent area complete or collected works.
Further, in step 1 Distribution Pattern index by the spacing between the base-height ratio W and vicinal face element of face element BDistanceBuilding, Distribution Pattern index can be calculated by formula III, and formula III is as follows:
Wherein,Two sides element X located adjacent one another in representation spaces、XtThe Distribution Pattern index of formation,Respectively element Xs、XtBase-height ratio,For element Xs、XtBetween spacing；Pass through formula II It is calculatedWhenWhen, expression is suitable for carrying out adjoining operation, conversely, being not suitable for.
Further, in step 1 shape similarity index calculating process are as follows:
1. removing face element side firstly, carrying out abbreviation using segmental arc of the Douglas-Peucker algorithm to composition face element The fine jitter on boundary retains the main angle of face element；
2. secondly, sequentially calculating the direction of each segmental arc in the counterclockwise direction using the lower-left angle point of face element as starting point Angle and the angle for recording reflection 45 ° of body shape or more；
3. then, being counted according to the corner dimension for two elements for participating in calculating and the consistent implementations of sequence by formula IV Calculate the shape similarity index between two elements；
Formula IV is as follows:
Wherein, (α1,α2,...,αn)、(β1,β2,...,βn) it is respectively two sides element X located adjacent one another in spaces、Xt's Interior angle set,For vicinal face element Xs、XtShape similarity；
4. it is compared finally, resulting shape similarity index will be calculated with the threshold value for being set as 10 °, whenIt is determined as being suitable for carrying out adjoining operation, conversely, being not suitable for.
Further, in step 1 degree of overlapping index determination process are as follows: vicinal face element uses its Main skeleton line generation respectively It for long side, mutually projects, determines respective element degree of overlapping index, calculating side compared with Main skeleton line length using projected length Method is as shown in formula V:
Wherein,For element XsRelative factor XtOverlapping index,For element XtRelative factor Xs's Index is overlapped,For element XsMain skeleton line is to element XtThe projected length of Main skeleton line,For element XtIt is main Skeleton line is to element XsThe projected length that Main skeleton line is projected,Respectively element Xs, element Xt's Main skeleton line length；
Degree of overlapping index OI is calculated by formula V, when OI value is between 0-1 and OI >=0.5, be determined as be suitable for Adjoining operation is carried out, conversely, being not suitable for；When wherein OI is equal to 0, belong to mutually by neighbouring, relative proximity special circumstances；OI etc. When 1, belong to completely mutually by adjacent.
Further, expansion-corrosion transform method in step 2 are as follows: first carrying out distance outward to original polygon face group is Expansive homeomorphism in the mathematical morphology meaning of L obtains boundary polygon to merge lap after each polygon expansion Then P1 inwardly carries out the corrosion that distance is L to polygon P1 and converts to obtain polygon P2.
Further, the extraction process of step 4 jackshaft junction adjoining line are as follows: by adjacent area peripheral boundary profile and original Beginning, face group carried out space overlapping operation, and the bridge region of original face group is calculated, the topological relation of adjacent area is updated, by bridge region Switch to bridge joint face element, and calculate the Main skeleton line in bridge joint face, when skeleton line satisfaction accurately reflects the main extension side in bridge joint face , in three conditions on peripheral boundary profile, make adjoining line to body shape feature, naturally smooth, end node；
The detailed process being modified using boundary as constraint are as follows: firstly, by bridge joint face and the unified building of original face group Semantic topological structure, when a certain segmental arc without semantic information and belongs to the composition segmental arc in bridge joint face, then the segmental arc is boundary segmental arc, with The connected skeleton line of this segmental arc is preferentially retained, meanwhile, when the end-node of mentioned skeleton line is not on boundary, then this section of skeleton Line should remove, and wherein skeleton line is adjoining line.
The present invention provides a kind of identification of adjacent area feature and automatic processing methods, pass through the knot of analysis aggregation face group's element Structure feature, automatic identification is suitable for carrying out the region i.e. adjacent area of adjoining processing, and converts accurate extract using expansion-corrosion Adjacent area boundary is taken boundary constraint into account and is corrected to inside adjoining line, and then gradual realizes that adjacent area element adjoins Hua Chu Reason operates machine intelligenceization processing for adjoining and establishes theoretical and method basis.
Detailed description of the invention
Fig. 1 is overall step flow chart of the invention.
Fig. 2 is aggregation face element group's minimum area square boundary schematic diagram in step 1 of the present invention.
Fig. 3 is face element node encryption schematic diagram in step 1 of the present invention.
Fig. 4 is boundary constraint Delaunay triangulation network in step 1 of the present invention.
Fig. 5 is the height of triangle between vicinal face element in step 1 of the present invention.
Fig. 6 is schematic diagram when degree of overlapping index OI is equal to 1 in step 1 of the present invention.
The schematic diagram that Fig. 7, Fig. 8, Fig. 9 are three kinds when degree of overlapping index OI is equal to 0 in step 1 of the present invention.
Figure 10 is that expansion-corrosion converts schematic diagram in step 2 of the present invention.
Figure 11 is to mend recessed process schematic in step 2 of the present invention.
Figure 12 is the original figure of area pattern A, B, C, D, E, F of the present invention.
Figure 13 is adjoining of the present invention process first stage to bridge face schematic diagram.
Figure 14 is adjoining of the present invention process first stage to generate adjoining line schematic diagram.
Figure 15 is that adjoining of present invention process second stage bridges face schematic diagram.
Figure 16 is that adjoining of present invention process second stage generates adjoining line schematic diagram.
Figure 17 is adjoining of present invention process finally adjoining result schematic diagram.
Figure 18 is the geographical national conditions census data schematic diagram of Jiangsu Province's representative region provided in an embodiment of the present invention.
Figure 19 is that the adjacent area that present invention implementation provides identifies the test block schematic diagram selected with processing.
Figure 20 is adjoining process first stage adjacent area result schematic diagram provided in an embodiment of the present invention.
Figure 21 is adjoining process second stage adjacent area provided in an embodiment of the present invention result schematic diagram.
Figure 22 is overall effect schematic diagram after adjoining of adjoining process provided in an embodiment of the present invention.
Specific embodiment
The present invention is described in further detail for specific embodiment with reference to the accompanying drawing.
A kind of adjacent area feature identification as shown in Figure 1 and automatic processing method, adjacent area include several face elements；It is special Specific step is as follows for sign identification and automatic processing method:
Step 1: the structure feature according to aggregation face element, establishes structure feature interpretation index automatic identification adjacent area；
The structure feature of aggregation face element includes band-like bridge joint face width, Distribution Pattern index, shape similarity index, again Folded degree index；
The process of structure feature interpretation index automatic identification adjacent area are as follows: for the face element collection { P in regioni(i=1, 2 ..., n), according to band-like bridge joint face width threshold value TBDistanceCandidate adjacent area complete or collected works are determined, for any element Pi, into one Step identifies in its vicinal face element to be suitable for carrying out adjoining according to Distribution Pattern index, shape similarity index, degree of overlapping index The element of operation, and adjacent area subset is constituted, whole elements in candidate adjacent area complete or collected works are traversed, multiple adjacent area collection are formed It closes；
Step 2: accurately calculating each adjacent area boundary using expansion-corrosion transformation；
Each adjacent area internal bridge junction is extracted Step 3: calculating by space overlapping；
Step 4: extracting bridge joint face adjoining line based on Delaunay (delaunay) triangulation network and being repaired to adjoining line Just, wherein branch's Key dithering method is used for the amendment of adjoining line and is modified using boundary as constraint；
Step 5: carrying out division fusion treatment to bridge joint face according to resulting the adjoining line of step 4, make to be bridged face point The face element cut becomes abutment surface element；
Step 6: repeating step 1 to five, until being not present using the adjoining of formation result as new face element It can carry out the face element of adjoining operation.
Adjacent area feature according to the present invention identification and automatically process be a kind of Dynamic iterations process, firstly, identification Adjacent area calculates the exterior contour of each adjacent area；Secondly, extract bridge joint face skeleton line, and using boundary as constrain into Row amendment, constitutes new adjacent area；Constantly repeat aforesaid operations, can it is gradual, complete adjoining for whole face elements stage by stage Change；Specifically are as follows:
One, for step 1
Adjoining is to the mistake that regularly arranged, shape is similar, is matched, is connected in face group's element of coherent condition distribution Journey, however, in practical map data base, aggregation face group's complex-shaped multiplicity of element, long and narrow bridge joint face width therethrough It is different, it therefore, is intended to carry out adjoining, needs to know the face element region (adjacent area) for meeting adjoining condition first Not, for this purpose, the present invention proposes bridge joint face width, Distribution Pattern index (DPI), shape similarity index (SSI), degree of overlapping index (OI) etc. features recognize adjacent area automatically, wherein
Band-like bridge joint face width is substantially the spacing between vicinal face element in step 1, i.e., between adjacent surface and face Distance.Assuming that from original scale 1:OscaleSynthesis is reduced the staff to target scale 1:Tscale(Tscale> Oscale) when, top priority is logical Over-segmentation width threshold value BWthresholdTo recognize band-like bridge joint face to determine whether aggregation face element group is adjacent area.For normal Map is advised, minimum visual range can be calculated according to target proportion ruler according to formula (1), minimum visual range is band-like bridge joint Face width threshold value TBDistance。
Band-like bridge joint face width threshold value TBDistanceCalculation method as shown in formula I:
TBDistance=BWthreshold×Tscale
Ⅰ
Wherein, TBDistanceFor the spacing between vicinal face element, BWthresholdTo divide width threshold value, TscaleFor target The denominator of scale bar；Wherein, divide width threshold value BWthresholdIt is chosen to be according to the width defining standard of long and narrow element figure spot 0.4mm, thus formula I can simplify as TBDistance=0.4 × Tscale×10-3, unit m.
The determination process of the calculating of band-like bridge joint face width and candidate adjacent area subset is as follows:
1. firstly, as shown in Fig. 2, calculating aggregation face element group boundary using minimum area rectangle；
2. secondly, as shown in figure 3, minimum area square boundary and each face element boundary node are encrypted, due to these nodes It is normally used for describing area feature important morphological feature, such as inflection point, crosspoint, general negligible amounts, to improve subsequent point Width computational accuracy is cut, it must the encryption borderline node of two classes；Specific encryption method are as follows: (two is real in Fig. 3 by setting encryption step-length d Spacing between heart dot), the value of encryption step-length d uses the length of element boundary shortest arc section, ties using d as primitive at two It is sampled to obtain pass point between point；
3. then, as shown in figure 4, establishing the Delaunay triangulation network of boundary constraint using incremental inserting algorithm；So that about Triangle in beam Delaunay triangulation network is connected to the face element that as shown in Figure 5 two have proximity relations, passes through triangle P1 and P2 known to the side AB or AC of shape ABC is vicinal face element；
4. next, calculating the high h of all Delaunay triangles between two vicinal face elements, and its average value is made Spacing B between vicinal face elementDistance, as shown in formula II:
Wherein, BDistanceFor the spacing between vicinal face element, n between adjacent surface element Delaunay triangle it is total Number,For the sum of the height of n Delaunay triangle；
5. finally, according to band-like bridge joint face width threshold value TBDistance, as the B of two vicinal face elementsDistance≤ TBDistanceWhen, then it is identified as candidate adjacent area subset, and so on, extract candidate adjacent area complete or collected works.
Distribution Pattern is by the spacing B between the base-height ratio W and vicinal face element of face element in step 1DistanceBuilding, distribution Pattern index can be calculated by formula III, and formula III is as follows:
Wherein,Two sides element X located adjacent one another in representation spaces、XtThe Distribution Pattern index of formation,Respectively element Xs、XtBase-height ratio,For element Xs、XtBetween spacing；Pass through formula II It is calculatedWhenWhen, expression is suitable for carrying out adjoining operation, conversely, being not suitable for.
For base-height ratio, when the sum of the base-height ratio of two vicinal face group's elements be greater than or long-range long and narrow bridge joint face therebetween between Away from when, adjoining result on the basis of retaining surface group's essential factors space distribution characteristics is constant, can preferably protrude its assemble shape State is suitable for that adjoining processing is carried out to such element at this time；When the sum of base-height ratio of two vicinal face group's elements is less than long and narrow bridge joint When interplanar distance, through adjoining, treated that moderate finite deformation can occur for element, is not suitable for carrying out adjoining Hua Chu to such element at this time Reason calculates high (the i.e. draw width) ratio of irregular face element base using formula VI, and formula VI is as follows:
W=S/BL VI
Wherein, W is the approximate mean breadth of element, and S is figure spot area, and BL is figure spot extreme length baseline, i.e. planar is wanted The length of plain longest skeleton line.
Shape similarity index in step 1, the present invention propose similar using line segment direction angle progress area pattern shape The calculating of degree, specific calculating process are as follows:
1. removing face element side firstly, carrying out abbreviation using segmental arc of the Douglas-Peucker algorithm to composition face element The fine jitter on boundary retains the main angle of face element；
2. secondly, sequentially calculating the direction of each segmental arc in the counterclockwise direction using the lower-left angle point of face element as starting point Angle and the angle for recording reflection 45 ° of body shape or more；
3. then, being counted according to the corner dimension for two elements for participating in calculating and the consistent implementations of sequence by formula IV Calculate the shape similarity index between two elements；
Formula IV is as follows:
Wherein, (α1,α2,...,αn)、(β1,β2,...,βn) it is respectively two sides element X located adjacent one another in spaces、Xt's Interior angle set,For vicinal face element Xs、XtShape similarity；
4. it is compared finally, resulting shape similarity index will be calculated with the threshold value for being set as 10 °, whenIt is determined as being suitable for carrying out adjoining operation, conversely, being not suitable for.
For degree of overlapping index in step 1, according to mutually leaning on adjacent features, the long side relative short edge of the same face element can be with Preferably summarize main structure and the extension direction of element, so being determined as being suitable for carrying out adjoining Hua Chu if long side is mutually leaned on neighbouring Reason；Conversely, being judged to being not suitable for carrying out adjoining processing, therefore the determination process of degree of overlapping index if short side relative proximity Are as follows: vicinal face element replaces long side with its Main skeleton line respectively, mutually projects, using projected length compared with Main skeleton line length Determine respective element degree of overlapping index, calculation method is as shown in formula V:
Wherein,For element XsRelative factor XtOverlapping index,For element XtRelative factor Xs's Index is overlapped,For element XsMain skeleton line is to element XtThe projected length of Main skeleton line,For element XtIt is main Skeleton line is to element XsThe projected length that Main skeleton line is projected,Respectively element Xs, element Xt's Main skeleton line length；
Degree of overlapping index OI is calculated by formula V, when the value of OI is between 0-1, numerical value shows more greatly the two weight Folded degree is bigger, and the suitability for carrying out adjoining operation is stronger；As shown in fig. 6, belong to when OI is equal to 1 completely mutually by adjacent, PL and SL equal length at this time；As shown in Fig. 7, Fig. 8, Fig. 9, when OI is equal to 0, belong to mutually by neighbouring, relative proximity special Situation, at this time PL=0；Under normal conditions, threshold value is set as 0.5, if OI >=0.5, is determined as being suitable for carrying out adjoining operation；Instead It, is not suitable for.
For the face element collection { P in regioni(i=1,2 ..., n), according to band-like bridge joint face width threshold value TBDistance Candidate adjacent area complete or collected works are determined, for any element Pi, further according to Distribution Pattern index, shape similarity index, overlapping Degree index identifies to be suitable for carrying out the element of adjoining operation, and constitute adjacent area subset in its vicinal face element, and traversal candidate is adjoined Whole elements in the complete or collected works of adjacent area form multiple adjacent area set；Thus the identification to adjacent area is completed, and then can be adjoined to each Adjacent area carries out adjoining processing.
Two, for step 2
The calculating of adjacent area peripheral boundary profile is the basis of face adjoining of group, and accuracy directly affects subsequent bridge joint Face and bridge joint facial bone stringing reasonable drawing, therefore the concaveconvex structure of peripheral boundary profile palpus accurate description adjacent area, however, existing side Method is keeping border structure characteristic aspect to there is obvious deficiency, for this purpose, text of the present invention introduces buffer area transformation and semantic topology Carry out peripheral boundary profile as constraint to calculate；
Expansion-corrosion transform method in step 2 are as follows: as shown in Figure 10, first to original polygon face group (original face group point Wei A, B, C, D, E, F) to carry out distance outward be the expansive homeomorphism in the mathematical morphology meaning of L, to merge each polygon Lap after expansion obtains boundary polygon P1, then inwardly carries out converting to obtain apart from the corrosion for being L to polygon P1 more Side shape P2.
Expansion-corrosion, which converts, to be had the characteristics that guarantor is convex, keeps tie, it is recessed to subtract, and transformation front and back, the general morphology of figure is constant, convex Rise and straight line portion form it is unchanged, that is, protect it is convex, keep tie；Figure depressed section merges in conversion process, and form is made to become In smooth, that is, subtract recessed, certainly, it is related to distance L to subtract recessed intensity.
Subtract it is recessed cause circumference inaccurate, next must mend recessed, include by polygon P2 and unified construct of original face group The topological structure of semantic information, if the segmental arc in polygon is only made of a certain semantic and without semantic information segmental arc, this is more Side shape is the recess cast out in corrosion transformation.So, by the segmental arc with semantic information instead of no semantic information segmental arc to be formed New face group boundary polygon P, then the polygon is the minimum envelop polygon of adjacent area, and boundary is adjacent area peripheral boundary Profile.
As shown in figure 11, topological Polygon is made of segmental arc L1, L2, wherein there is the semantic information of polygon D in L2, But because L1 is the segmental arc in P2, therefore, does not have semantic information, thus can determine that polygon O is recess area, L2 is replaced Segmental arc of the L1 as boundary P obtains boundary profile P as shown in figure 11.
Three, for step 3 and step 4
The extraction process of bridge joint face adjoining line are as follows: adjacent area peripheral boundary profile and original face group are subjected to space overlapping Operation can be calculated the bridge region of original face group, update the topological relation of adjacent area, bridge region be switched to bridge joint face element, And calculate the Main skeleton line in bridge joint face.When the skeleton line has the principal spread direction for accurately reflecting bridge joint face and body shape special Sign, naturally smooth, end node can be used as adjoining line in three features such as on peripheral boundary profile.
Amendment for adjoining line is used based on branched backbone line connection point polymerization reconstructing method in invention to work Font shake is modified, and is adjusted according to Main skeleton line extension direction to end skeleton line；And using boundary as about Shu Xiuzheng Main skeleton line is allowed to the defect for overcoming end node to extract inaccuracy；
Using boundary as the detailed process of constraint amendment Main skeleton line are as follows: firstly, bridge joint face and original face group is unified Semantic topological structure is constructed, when a certain segmental arc without semantic information and belongs to the composition segmental arc in bridge joint face, then the segmental arc is boundary arc Section, the skeleton line being connected with this segmental arc preferentially retained, meanwhile, when the end-node of mentioned skeleton line is not on boundary, then this Section skeleton line should remove, and wherein skeleton line is adjoining line.
Four, for step 5 and step 6
Adjoining line drawing is carried out for the adjacent area of automatic identification, and carries out adjoining, then by this result and region Other area patterns constitute new adjacent area, carry out adjoining again.It repeats the above process, until adjoining there is no qualified Adjacent area.
For the original face group shown in Figure 12, judge through adjacent area identification feature, face element A, C, E and face element B, D, F For qualified adjoining of first stage element, bridge joint face adjoining line is calculated, as shown in fig. 13 that overstriking solid line； Division fusion is carried out to bridge joint face according to the bridge joint face after the segmentation of adjoining line is incorporated into adjacent surface element this principle, is obtained To adjoining of first stage as a result, as shown in figure 14；Continue to form element A, C, E whole element O formed and element B, D, F Whole element P judged, meet adjacent area condition, thus it is carried out adjoining of second stage processing, generate bridge joint Face adjoining line overstriking solid line as shown in figure 15, adjoining processing result are as shown in figure 16；To the adjoining line in each stage Extension connection is carried out, finally adjoined is as a result, as shown in figure 17.
[embodiment]
The WJ-III map work station for relying on China Surveying and Mapping Research Academy to develop, the adjoining side that the insertion present invention innovates Method carries out reasonability and validation verification by taking the group of swag face as an example.As shown in figure 18, experimental data is Jiangsu Province's representative region Geographical national conditions census data, have the characteristics that aquaculture is flourishing, swag gathers, marshalling and various shapes, space Distribution characteristics is very representative.The data space ranges are 2.8 × 3.1km2, source scale bar 1:1 ten thousand, target proportion ruler 1:5 ten thousand, Software systems running environment is Windows764 bit manipulation system, CPU is Intel Core I7-3770, dominant frequency 3.2GHz, interior Deposit 16GB, solid state hard disk 1024GB；
It is 20m, the candidate adjacent area of 36 of extraction according to the width threshold value that formula I calculates bridge joint face；Traversal candidate adjoins All elements in area complete or collected works are counted according to Distribution Pattern index (DPI), shape similarity index (SSI), degree of overlapping index (OI) It calculates and obtains multiple adjacent areas set of first stage.
The process is described by taking adjacent area a certain in test block (in Figure 19 shown in rectangle frame A) as an example below: 1. being adjoined to original Adjacent area face element group carries out expanding-corroding transformation and identifies peripheral boundary profile；2. initial data and boundary profile are folded Bonus point is analysed to obtain bridge joint face, and encrypts to bridge joint face boundary, constructs boundary constraint Delaunay triangulation network, extracts bridge joint face Main skeleton line；3. being adjusted to the shake of Main skeleton line end and intermediate region, while using boundary as constraint amendment master Skeleton line obtains adjoining line；4. being based on adjoining line, final the adjoining of realization of division fusion is carried out to bridge joint face, as a result such as Shown in Figure 20.
First stage adjoining result and region other faces element are constituted into second stage adjacent area, such as Figure 21 dark rectangular Shown in frame portion point, adjoining is carried out again, so far completes the processing to all elements in region, obtains the experiment number shown in Figure 22 According to adjoining overall effect.
Adjacent area peripheral boundary profile based on characteristic feature identification is accurate, interior bone stringing natural light is sliding, after adjoining Swag face group maintain the spatial distribution characteristic of original face group, spatial relationship is from phase from adjacent state is become, and coherent condition is more To be obvious, such as adjacent area A, C, wherein adjacent area C have passed through the adjoining processing in two stages.
The present invention provides a kind of identification of adjacent area feature and automatic processing methods, are a kind of processes of Dynamic iterations, first First, it identifies adjacent area, calculates the exterior contour of each adjacent area；Secondly, extract bridge joint face skeleton line, and using boundary as Constraint is modified, and constitutes new adjacent area；Aforesaid operations are constantly repeated, whole planars can be completed gradual, stage by stage and wanted The adjoining of element operates machine intelligenceization processing for adjoining and establishes theoretical and method basis.
Above embodiment is not limitation of the present invention, and the present invention is also not limited to the example above, this technology neck The variations, modifications, additions or substitutions that the technical staff in domain is made within the scope of technical solution of the present invention, also belong to this hair Bright protection scope.

Claims (7)

1. a kind of adjacent area feature identification and automatic processing method, the adjacent area include several face elements；It is characterized by: Specific step is as follows for the feature identification and automatic processing method:
Step 1: the structure feature according to face element, establishes structure feature interpretation index automatic identification adjacent area；
The structure feature of the face element includes band-like bridge joint face width, Distribution Pattern index, shape similarity index, degree of overlapping Index；
The process of structure feature interpretation index automatic identification adjacent area are as follows: for the face element collection { P in regioni(i=1, 2 ..., n), according to band-like bridge joint face width threshold value TBDistanceCandidate adjacent area complete or collected works are determined, for any element Pi, into one Step identifies in its vicinal face element to be suitable for carrying out adjoining according to Distribution Pattern index, shape similarity index, degree of overlapping index The face element of operation, and adjacent area subset is constituted, whole face elements in candidate adjacent area complete or collected works are traversed, multiple adjacent areas are formed Set；
Step 2: accurately calculating each adjacent area boundary using expansion-corrosion transformation；
Each adjacent area internal bridge junction is extracted Step 3: calculating by space overlapping；
Step 4: extracting bridge joint face adjoining line based on Delaunay triangulation network and being modified to adjoining line, wherein for The amendment of adjoining line is modified using branch's Key dithering method and using boundary as constraint；
Step 5: carrying out division fusion treatment to bridge joint face according to resulting the adjoining line of step 4, make to be bridged face segmentation Face element becomes abutment surface element；
Step 6: using the adjoining of formation result as new face element, repeat step 1 to five, until there is no can be with Carry out the face element of adjoining operation.
2. feature identification in adjacent area according to claim 1 and automatic processing method, it is characterised in that: described in step 1 Band-like bridge joint face width threshold value TBDistanceCalculation method as shown in formula I:
TBDistance=BWthreshold×Tscale
I
Wherein, TBDistanceFor the spacing between vicinal face element, BWthresholdTo divide width threshold value, TscaleFor target proportion The denominator of ruler；
The determination process of candidate adjacent area subset is as follows:
1. firstly, calculating aggregation face element group boundary using minimum area rectangle；
2. secondly, encryption minimum area square boundary and each face element boundary node, specific encryption method are as follows: setting encryption step-length The value of d, encryption step-length d use the length of element boundary shortest arc section, between two nodes sample using d as primitive To pass point；
3. then, establishing the Delaunay triangulation network of boundary constraint using incremental inserting algorithm；So that constraint Delaunay triangle Triangle in net is connected to two face elements with proximity relations；
4. next, calculating the high h of all Delaunay triangles between two vicinal face elements, and using its average value as neighbour Spacing B between the element of nearly faceDistance, as shown in formula II:
Wherein, BDistanceFor the spacing between vicinal face element, n is total of Delaunay triangle between adjacent surface element Number,For the sum of the height of n Delaunay triangle；
5. finally, according to band-like bridge joint face width threshold value TBDistance, as the B of two vicinal face elementsDistance≤TBDistance When, then it is identified as candidate adjacent area subset, and so on, extract candidate adjacent area complete or collected works.
3. feature identification in adjacent area according to claim 2 and automatic processing method, it is characterised in that: point in step 1 Cloth pattern index is by the spacing B between the base-height ratio W and vicinal face element of face elementDistanceBuilding, Distribution Pattern index pass through public affairs Formula III can be calculated, and formula III is as follows:
Wherein,Two sides element X located adjacent one another in representation spaces、XtThe Distribution Pattern index of formation, Respectively element Xs、XtBase-height ratio,For element Xs、XtBetween spacing；It is calculated by formula IIWhenWhen, expression is suitable for carrying out adjoining operation, conversely, being not suitable for.
4. feature identification in adjacent area according to claim 3 and automatic processing method, it is characterised in that: described in step 1 The calculating process of shape similarity index are as follows:
1. removing face element boundary firstly, carrying out abbreviation using segmental arc of the Douglas-Peucker algorithm to composition face element Fine jitter retains the main angle of face element；
2. secondly, sequentially calculating the angular separation of each segmental arc in the counterclockwise direction using the lower-left angle point of face element as starting point And record the angle of reflection 45 ° of body shape or more；
3. calculating two by formula IV then, according to the corner dimension for two elements for participating in calculating and the consistent implementations of sequence Shape similarity index between element；
Formula IV is as follows:
Wherein, (α1,α2,...,αn)、(β1,β2,...,βn) it is respectively two sides element X located adjacent one another in spaces、XtInterior angle Set,For vicinal face element Xs、XtShape similarity；
4. it is compared finally, resulting shape similarity index will be calculated with the threshold value for being set as 10 °, whenIt is determined as being suitable for carrying out adjoining operation, conversely, being not suitable for.
5. feature identification in adjacent area according to claim 4 and automatic processing method, it is characterised in that: described in step 1 The determination process of degree of overlapping index are as follows: vicinal face element replaces long side with its Main skeleton line respectively, mutually projects, and is grown using projection Degree determines respective element degree of overlapping index compared with Main skeleton line length, and calculation method is as shown in formula V:
Wherein,For element XsRelative factor XtOverlapping index,For element XtRelative factor XsOverlapping Index,For element XsMain skeleton line is to element XtThe projected length of Main skeleton line,For element XtMain framing Line is to element XsThe projected length that Main skeleton line is projected,Respectively element Xs, element XtMain bone Stringing length；
Degree of overlapping index OI is calculated by formula V, when OI value is between 0-1 and OI >=0.5, is judged to being suitable for progress Adjoining operation, conversely, being not suitable for；When wherein OI is equal to 0, belong to mutually by neighbouring, relative proximity special circumstances；OI is equal to 1 When, belong to completely mutually by adjacent.
6. feature identification in adjacent area according to claim 5 and automatic processing method, it is characterised in that: described in step 2 Expansion-corrosion transform method are as follows: first carry out the expansion in the mathematical morphology meaning that distance is L outward to original polygon face group Transformation obtains boundary polygon P1 to merge lap after the expansion of each polygon, then polygon P1 is inwardly carried out away from It converts to obtain polygon P2 from the corrosion for L.
7. feature identification in adjacent area according to claim 6 and automatic processing method, it is characterised in that: described in step 4 The extraction process of bridge joint face adjoining line are as follows: adjacent area peripheral boundary profile and original face group are subjected to space overlapping operation, meter It calculates and obtains the bridge region of original face group, update the topological relation of adjacent area, bridge region is switched into bridge joint face element, and calculate bridge joint The Main skeleton line in face, when the skeleton line meet accurately reflect bridge joint face principal spread direction and body shape feature, it is naturally smooth, End node makees adjoining line in three conditions on peripheral boundary profile；
The detailed process being modified using boundary as constraint are as follows: firstly, by bridge joint face and the unified building of original face group Semantic topological structure, when a certain segmental arc without semantic information and belongs to the composition segmental arc in bridge joint face, then the segmental arc is boundary segmental arc, with The connected skeleton line of this segmental arc is preferentially retained, meanwhile, when the end-node of mentioned skeleton line is not on boundary, then this section of skeleton Line should remove, and wherein skeleton line is adjoining line.
CN201810795251.1A 2018-07-19 2018-07-19 A kind of identification of adjacent area feature and automatic processing method Withdrawn CN109034234A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810795251.1A CN109034234A (en) 2018-07-19 2018-07-19 A kind of identification of adjacent area feature and automatic processing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810795251.1A CN109034234A (en) 2018-07-19 2018-07-19 A kind of identification of adjacent area feature and automatic processing method

Publications (1)

Publication Number Publication Date
CN109034234A true CN109034234A (en) 2018-12-18

Family

ID=64644295

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810795251.1A Withdrawn CN109034234A (en) 2018-07-19 2018-07-19 A kind of identification of adjacent area feature and automatic processing method

Country Status (1)

Country Link
CN (1) CN109034234A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109816749A (en) * 2019-02-14 2019-05-28 中国测绘科学研究院 Figure spot map symbol fill method, device, computer equipment and storage medium
CN110009649A (en) * 2019-04-10 2019-07-12 中国测绘科学研究院 A kind of skeleton line extracting method of intersection close quarters
CN110176018A (en) * 2019-04-18 2019-08-27 中国测绘科学研究院 A kind of figure spot merging method keeping structuring atural object contour feature
CN111104535A (en) * 2019-11-20 2020-05-05 中国第一汽车股份有限公司 Data management system and data management method
CN115719492A (en) * 2022-11-29 2023-02-28 中国测绘科学研究院 Method, device and equipment for identifying width characteristics of planar elements and readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105139031A (en) * 2015-08-21 2015-12-09 天津中科智能识别产业技术研究院有限公司 Data processing method based on subspace clustering
US20160267758A1 (en) * 2015-03-13 2016-09-15 Morpho Method and device for monitoring individuals in a place equipped with distributed detection means
CN106162548A (en) * 2015-04-28 2016-11-23 ***通信集团公司 A kind of method and device identifying that super remote adjacent area covers
CN106255126A (en) * 2015-06-09 2016-12-21 ***通信集团湖北有限公司 A kind of method and device identifying to arrange flowers in base station location district

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160267758A1 (en) * 2015-03-13 2016-09-15 Morpho Method and device for monitoring individuals in a place equipped with distributed detection means
CN106162548A (en) * 2015-04-28 2016-11-23 ***通信集团公司 A kind of method and device identifying that super remote adjacent area covers
CN106255126A (en) * 2015-06-09 2016-12-21 ***通信集团湖北有限公司 A kind of method and device identifying to arrange flowers in base station location district
CN105139031A (en) * 2015-08-21 2015-12-09 天津中科智能识别产业技术研究院有限公司 Data processing method based on subspace clustering

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CHENGMING LI 等: "An Automated Processing Method for Agglomeration Areas", 《MDPI》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109816749A (en) * 2019-02-14 2019-05-28 中国测绘科学研究院 Figure spot map symbol fill method, device, computer equipment and storage medium
CN110009649A (en) * 2019-04-10 2019-07-12 中国测绘科学研究院 A kind of skeleton line extracting method of intersection close quarters
CN110009649B (en) * 2019-04-10 2020-03-17 中国测绘科学研究院 Method for extracting skeleton line in intersection dense area
CN110176018A (en) * 2019-04-18 2019-08-27 中国测绘科学研究院 A kind of figure spot merging method keeping structuring atural object contour feature
CN111104535A (en) * 2019-11-20 2020-05-05 中国第一汽车股份有限公司 Data management system and data management method
CN115719492A (en) * 2022-11-29 2023-02-28 中国测绘科学研究院 Method, device and equipment for identifying width characteristics of planar elements and readable storage medium
CN115719492B (en) * 2022-11-29 2023-08-11 中国测绘科学研究院 Method, device and equipment for recognizing width characteristics of planar elements and readable storage medium

Similar Documents

Publication Publication Date Title
CN109034234A (en) A kind of identification of adjacent area feature and automatic processing method
KR100810294B1 (en) Method for simplification feature-preserving of 3d mesh data
CN112699623B (en) High-precision heat flow calculation method based on unstructured grid regularized reconstruction technology
CN110276732B (en) Mountain area point cloud cavity repairing method considering topographic characteristic line elements
CN106897445A (en) It is a kind of that the novel method that operation delimited on border is improved based on ArcGIS
CN105205841B (en) The ground drawing generating method and system of GIS-Geographic Information System
CN109636870A (en) A kind of long and narrow figure spot piecemeal melts method and device
Danovaro et al. Morphology-driven simplification and multiresolution modeling of terrains
CN105069181A (en) Customized far-end dissect type bone plate design method based on patient femur parameter
JPH04243487A (en) Three-dimensional contour processing method
Chen et al. Automatic surface repairing, defeaturing and meshing algorithms based on an extended B-rep
Schneider Extraction of hierarchical surface networks from bilinear surface patches
Xin et al. Efficiently computing geodesic offsets on triangle meshes by the extended Xin–Wang algorithm
CN105894553B (en) A kind of Street Space form layout method based on grid selection
CN104143214A (en) Electronic map polygon triangulation method and device
Yin Direct generation of extended STL file from unorganized point data
Regnauld et al. Automatic amalgamation of buildings for producing ordnance survey® 1: 50 000 scale maps
CN111008429B (en) Heterogeneous CAD geometric consistency comparison method based on point cloud
Kieler et al. Matching river datasets of different scales
Diatta et al. On the isotopic meshing of an algebraic implicit surface
Han et al. A fast propagation scheme for approximate geodesic paths
Ng et al. Incremental tessellation of trimmed parametric surfaces
Gold et al. The crust and skeleton–applications in GIS
Djebali et al. Range-image segmentation and model reconstruction based on a fit-and-merge strategy
JP2006277712A (en) Fitting device, method and program for three-dimensional model

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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20181218