CN110910412A - Coastline simplification method based on skeleton line bridging bidirectional buffer area - Google Patents

Coastline simplification method based on skeleton line bridging bidirectional buffer area Download PDF

Info

Publication number
CN110910412A
CN110910412A CN201911240047.4A CN201911240047A CN110910412A CN 110910412 A CN110910412 A CN 110910412A CN 201911240047 A CN201911240047 A CN 201911240047A CN 110910412 A CN110910412 A CN 110910412A
Authority
CN
China
Prior art keywords
buffer area
skeleton line
coastline
line
skeleton
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.)
Granted
Application number
CN201911240047.4A
Other languages
Chinese (zh)
Other versions
CN110910412B (en
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.)
Dalian Naval Vessels College Navy P L A
Original Assignee
Dalian Naval Vessels College Navy P L A
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 Dalian Naval Vessels College Navy P L A filed Critical Dalian Naval Vessels College Navy P L A
Priority to CN201911240047.4A priority Critical patent/CN110910412B/en
Publication of CN110910412A publication Critical patent/CN110910412A/en
Application granted granted Critical
Publication of CN110910412B publication Critical patent/CN110910412B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/13—Edge detection
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/60—Memory management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/10—Segmentation; Edge detection
    • G06T7/174—Segmentation; Edge detection involving the use of two or more images
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/20—Special algorithmic details
    • G06T2207/20212—Image combination
    • G06T2207/20224—Image subtraction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/30—Subject of image; Context of image processing
    • G06T2207/30181—Earth observation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
    • Y02A10/00—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE at coastal zones; at river basins
    • Y02A10/40—Controlling or monitoring, e.g. of flood or hurricane; Forecasting, e.g. risk assessment or mapping

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Processing Or Creating Images (AREA)
  • Image Analysis (AREA)

Abstract

The invention discloses a coastline automatic simplification method based on a skeleton line bridging bidirectional buffer area, which comprises the following steps of: extracting coastline data on the sea map, and making a single-side buffer area on one side of the sea for the coastline; then judging whether the buffer area has an inner ring, if not, making a single-side buffer area on the boundary line of the stored single-side buffer area to one side of the land part; if the inner ring exists, the stored buffer area and the inner ring are reserved as a single-side buffer area towards one side of the land part; utilizing the stored buffer area and the inner ring to obtain a bridging skeleton line, and constructing a visual buffer area for the skeleton line; and performing difference operation by using the stored one-side buffer area on one side of the land part and the visual buffer area of the bridging skeleton line, and extracting a boundary line of an operation result. The method overcomes the problems that the existing bidirectional buffer area method is easy to be blocked in a bottleneck area, the simplification scale is overlarge and the like, realizes the self-adaptive simplification and exaggeration of the coastline, and improves the simplification quality of the coastline.

Description

Coastline simplification method based on skeleton line bridging bidirectional buffer area
Technical Field
The invention relates to the field of ocean mapping, in particular to a coastline simplification method.
Background
The coastline has been spotlighted as an important line element on the chart, and the research of automatic integration has been focused. Different from the simplification of common line elements, the simplification of the coastline needs to consider specific principles such as 'land expansion and sea contraction', and the like, so that the common line element simplification algorithm is not suitable for the simplification of the coastline.
In recent years, to achieve the automatic simplification of coastlines on a chart, a number of algorithms have been proposed by a few expert scholars, of which the bi-directional buffer method is one. The Smith, a foreign scholars, defined a bi-directional buffer algorithm in 2003, which first establishes an outer buffer to one side of a to-be-simplified line element with a fixed radius r, then makes an inner buffer to the outer buffer edge with the fixed radius r, and finally obtains the inner buffer edge as a simplified line element. The national scholars' high-king army follows up with the international frontier technology, and is applied to simplification of the equal-depth line and the coastline. The simplification quality of the coastline is improved.
The method can realize gradual change simplification of line elements along with the scale, has relatively simple process, and has mature application in the simplification of the isopiestic line and the coastline, but the method also has certain defects in the simplification of the coastline, such as the phenomenon of sealing easily occurs in the simplification of a bottleneck area, so that a large sea area is converted into land, and the simplified scale is overlarge, thereby restricting the application of the method in the simplification of the coastline.
Disclosure of Invention
In order to overcome the defect that a bidirectional buffer area method is easy to generate a 'sealing' phenomenon when a 'bottleneck' area is simplified, so that a large sea area is converted into a land area, and the simplification scale is overlarge, the invention provides a coastline simplification method based on a skeleton line bridging bidirectional buffer area.
The technical scheme adopted by the invention for realizing the purpose is as follows: a coastline simplification method based on a skeleton line bridging bidirectional buffer area is characterized by comprising the following steps: the method mainly comprises the following steps:
a. analyzing the chart data, and extracting a coastline on the chart;
b. making a single-side buffer area on one side of the sea part on the coastline, and storing the buffer area;
c. b, judging whether an inner ring exists in the sea part side single-side buffer area obtained in the step b, if so, entering the step d, otherwise, making a single-side buffer area on the stored buffer area boundary line to the land part side, outputting the buffer area boundary line as a simplified result coastline, and updating the sea chart data;
d. b, making a unilateral buffer zone on the boundary line of the unilateral buffer zone on the sea part side and the side of the inner ring facing the land part obtained in the step b, and then storing the unilateral buffer zone;
e. b, constructing a constrained Delaunay triangulation network, extracting a framework line on the sea side of the coastline, and solving a bridging framework line by using the single-side buffer area and the inner ring on the sea side of the coastline obtained in the step b;
f. e, constructing a visual buffer area for the bridging skeleton line obtained in the step e, and storing the visual buffer area;
g. and d, performing difference operation by using the single-side buffer area on one side of the land part obtained in the step d and the bridging skeleton line visual buffer area obtained in the step f, extracting a result boundary line of the operation, outputting the result boundary line as a simplified result coastline, and updating the chart data.
In the step e, the method for obtaining the bridging skeleton line comprises the following steps:
a. matching the inner ring with the skeleton line binary tree nodes, traversing the skeleton line binary tree nodes, judging whether skeleton line parts contained in the nodes are intersected with the inner ring or not, and recording all inner ring numbers intersected with the skeleton line of the node;
b. sequentially selecting end nodes, starting to backtrack upwards from the end nodes, finishing the extraction of the bridged skeleton line if all the end nodes are marked, and outputting the extraction result, otherwise, extracting the bridged skeleton line according to the crossed inner ring number recorded in the step a and the skeleton line contained in the node, starting to backtrack to an upper parent node from the end nodes firstly until finding out the node with the inner ring crossed with the skeleton line, and dividing into the following conditions:
(1) if the inner ring intersected with the skeleton line can not be found, the skeleton line binary tree flow path does not have a part needing bridging, operation is not needed, the end node is marked, and the step b is switched;
(2) if one or more inner rings exist, recording all inner ring numbers, and storing the node skeleton line in a variable LskeletonMarking the end node, and turning to the step c;
c. continuously backtracking to the parent node of the upper layer, if an inner ring intersected with the parent node exists, recording the number of the inner ring, and merging the skeleton line of the parent node into a variable LskeletonIn the step (c), continuously repeating the step (c) until the root node is reached, and turning to the step (d);
d. extracting variable LskeletonAnd b, performing intersection operation on the variable skeleton line and the outer ring polygon to obtain partial skeleton lines in the outer ring, performing difference operation on the skeleton lines in the outer ring and the inner ring polygon to obtain skeleton line segments, judging whether the skeleton line segments are adjacent to the inner ring and the outer ring boundary, extracting the skeleton line segments with the adjacent number of 2 to obtain the bridged skeleton lines, and turning to the step b.
In the step g, the method for extracting the result coastline comprises the following steps: firstly, performing inner buffer area conversion on the boundary of an outer buffer area and each inner ring to obtain an original simplification result line and local details; then, according to the extracted bridging skeleton line, taking the minimum human eye recognition distance as a diameter to serve as a bridging skeleton line visual buffer area; and performing 'difference' operation on the polygon of the original simplification result line, the visual buffer area of the bridging skeleton line and the polygon of the inner ring of the local detail to obtain the coastline of the simplified result after bridging, and outputting the simplified result.
And e, extracting the skeleton line on the sea side of the coastline, and storing by adopting a binary tree.
According to the coastline simplification method based on the skeleton line bridging bidirectional buffer area, the simplification result and the local details of the original bidirectional buffer area are bridged through the skeleton line, the problems that the conventional bidirectional buffer area method is easy to be sealed in a bottleneck area, the simplification scale is overlarge and the like are solved, the coastline is adaptively simplified and exaggerated, and the coastline simplification quality is improved.
Drawings
FIG. 1 is a block flow diagram of the present invention coastline reduction method based on a skeleton line bridging a bi-directional buffer.
FIG. 2 is a main flow chart of the method for extracting a bridging skeleton line according to the present invention.
FIG. 3 is a flow chart of a method for extracting a bridge portion from a variable skeleton line according to the present invention.
FIG. 4 is a flow chart of a method of the present invention for exaggerating a local stenosis using a bridging skeleton line.
Detailed Description
The implementation process of the invention is to implement the coastline automatic simplification by adopting a computer, and assuming the prior chart A, after the scale is reduced, the coastline automatic simplification by adopting the method of the invention comprises the following steps, as shown in figure 1:
step a, reading a chart on a computer, extracting a coastline, and storing the coastline in a memory, wherein a coastline set of the chart A in an assumption is called S (L);
step b, extracting a certain coastline L in the set S (L), and marking the coastline L as a single-side buffer zone on the sea side as L+And storing it;
step c, judging the single-side buffer area L+If there is no inner ring, it indicates that there is no need to exaggerate, and it is directly applied to the single-side buffer L+The boundary line acts as a single-sided buffer L to one side of the line part-The boundary line of the single-side buffer area is extracted and output as a simplified result, and the chart data is updated. Otherwise, indicating that the coastline has an area needing to be exaggerated, and entering the step d;
step d, buffer L stored+And the inner ring serves as a single-side buffer zone L towards one side of the land part-Storing it; e, constructing a constrained Delaunay triangulation network, extracting a skeleton line on the sea side of the coastline, storing the skeleton line by adopting a binary tree, and utilizing the single-side buffer on the sea side of the coastline obtained in the step bAnd the inner ring, and the 'bridging' skeleton line. Extracting a skeleton line on one side of the sea of the coastline as LskeletonUsing the stored buffer L+And an inner ring, wherein the method described in the figure 2 is adopted to obtain a bridging skeleton line, the minimum recognition distance of human eyes is taken as the diameter to construct a visual buffer area, and the visual buffer area is marked as Sbuffer；
In the step e, the method for obtaining the bridging skeleton line comprises the following steps:
a. first, the inner ring is matched with the skeleton line binary tree nodes. Traversing the skeleton line binary tree nodes, judging whether skeleton line parts contained in the nodes are intersected with the inner rings or not, and recording all inner ring numbers intersected with the skeleton lines of the nodes;
b. and (c) sequentially selecting end nodes, starting to trace back upwards from the end nodes (the nodes do not have child nodes), finishing the extraction of the bridged skeleton line if all the end nodes are marked, and outputting the extraction result, otherwise, extracting the bridged skeleton line according to the crossed inner ring number recorded in the step (a) and the skeleton line contained in the node. Firstly, the end node starts to backtrack to the parent node at the upper layer until finding out that the node has an inner ring intersected with the skeleton line, and the following situations are divided:
(1) if the inner ring intersected with the inner ring can not be found
This situation shows that there is no bridge part on the skeleton line binary tree flow path, no operation is needed, the end node is marked, and step b is switched;
(2) if one or more inner rings are present
Recording all inner ring numbers and storing the node skeleton line in a variable LskeletonMarking the end node, and turning to the step c;
c. continuously backtracking to the parent node of the upper layer, if an inner ring intersected with the parent node exists, recording the number of the inner ring, and merging the skeleton line of the parent node into a variable LskeletonIn the step (c), continuously repeating the step (c) until the root node is reached, and turning to the step (d);
d. extracting variable Lskeleton"bridge" portion of a skeleton line (hereinafter referred to as a variable skeleton line). Firstly, the variable skeleton line and an outer ring (outer buffer zone boundary) polygon are subjected to intersection operation to obtain a part of skeleton lines in an outer ring, then the skeleton lines in the outer ring and the inner ring polygon are subjected to difference operation to obtain skeleton line segments, then whether the skeleton line segments are adjacent to the inner ring and the outer ring boundary or not is judged, the adjacent number of the skeleton line segments is 2, namely, the bridge-connected skeleton line is extracted, and then the step b is carried out.
Step f, using the single-side buffer L stored in step d-And the visual buffer S in step ebufferAs a buffer operation L--SbufferExtracting a boundary line of an operation result, taking the boundary line as a simplified result coastline and outputting the simplified result coastline, and updating the data of the chart coastline;
and g, performing difference operation by using the single-side buffer area on one side of the land part obtained in the step d and the visual buffer area of the bridge skeleton line obtained in the step f, extracting a result boundary line of the operation, outputting the result boundary line as a simplified result coastline, and updating the chart data. And repeating the steps b to f continuously until the coastline on the chart is simplified.
The method for extracting the result coastline in the step g comprises the following steps: firstly, performing inner buffer area conversion on the boundary of an outer buffer area and each inner ring to obtain an original simplification result line and local details; then, according to the extracted bridging skeleton line, taking the minimum human eye recognition distance as a diameter to serve as a bridging skeleton line visual buffer area; and performing 'difference' operation on the original simplification result line polygon, the bridging skeleton line visual buffer area and the local detail inner ring polygon to obtain a 'bridged' simplification result coastline, and outputting a simplification result.
While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.

Claims (4)

1. A coastline simplification method based on a skeleton line bridging bidirectional buffer area is characterized by comprising the following steps: the method mainly comprises the following steps:
a. analyzing the chart data, and extracting a coastline on the chart;
b. making a single-side buffer area on one side of the sea part on the coastline, and storing the buffer area;
c. b, judging whether an inner ring exists in the sea part side single-side buffer area obtained in the step b, if so, entering the step d, otherwise, making a single-side buffer area on the stored buffer area boundary line to the land part side, outputting the buffer area boundary line as a simplified result coastline, and updating the sea chart data;
d. b, making a unilateral buffer zone on the boundary line of the unilateral buffer zone on the sea part side and the side of the inner ring facing the land part obtained in the step b, and then storing the unilateral buffer zone;
e. b, constructing a constrained Delaunay triangulation network, extracting a framework line on the sea side of the coastline, and solving a bridging framework line by using the single-side buffer area and the inner ring on the sea side of the coastline obtained in the step b;
f. e, constructing a visual buffer area for the bridging skeleton line obtained in the step e, and storing the visual buffer area;
g. and d, performing difference operation by using the single-side buffer area on one side of the land part obtained in the step d and the bridging skeleton line visual buffer area obtained in the step f, extracting a result boundary line of the operation, outputting the result boundary line as a simplified result coastline, and updating the chart data.
2. The coastline simplification method based on skeleton line bridging bidirectional buffer of claim 1, characterized in that: in the step e, the method for obtaining the bridging skeleton line comprises the following steps:
a. matching the inner ring with the skeleton line binary tree nodes, traversing the skeleton line binary tree nodes, judging whether skeleton line parts contained in the nodes are intersected with the inner ring or not, and recording all inner ring numbers intersected with the skeleton line of the node;
b. sequentially selecting end nodes, starting to backtrack upwards from the end nodes, finishing the extraction of the bridged skeleton line if all the end nodes are marked, and outputting the extraction result, otherwise, extracting the bridged skeleton line according to the crossed inner ring number recorded in the step a and the skeleton line contained in the node, starting to backtrack to an upper parent node from the end nodes firstly until finding out the node with the inner ring crossed with the skeleton line, and dividing into the following conditions:
(1) if the inner ring intersected with the skeleton line can not be found, the skeleton line binary tree flow path does not have a part needing bridging, operation is not needed, the end node is marked, and the step b is switched;
(2) if one or more inner rings exist, recording all inner ring numbers, and storing the node skeleton line in a variable LskeletonMarking the end node, and turning to the step c;
c. continuously backtracking to the parent node of the upper layer, if an inner ring intersected with the parent node exists, recording the number of the inner ring, and merging the skeleton line of the parent node into a variable LskeletonIn the step (c), continuously repeating the step (c) until the root node is reached, and turning to the step (d);
d. extracting variable LskeletonAnd b, performing intersection operation on the variable skeleton line and the outer ring polygon to obtain partial skeleton lines in the outer ring, performing difference operation on the skeleton lines in the outer ring and the inner ring polygon to obtain skeleton line segments, judging whether the skeleton line segments are adjacent to the inner ring and the outer ring boundary, extracting the skeleton line segments with the adjacent number of 2 to obtain the bridged skeleton lines, and turning to the step b.
3. The method for automatically generating a course merging several roadblocks of a chart according to claim 1, wherein: in the step g, the method for extracting the result coastline comprises the following steps: firstly, performing inner buffer area conversion on the boundary of an outer buffer area and each inner ring to obtain an original simplification result line and local details; then, according to the extracted bridging skeleton line, taking the minimum human eye recognition distance as a diameter to serve as a bridging skeleton line visual buffer area; and performing 'difference' operation on the polygon of the original simplification result line, the visual buffer area of the bridging skeleton line and the polygon of the inner ring of the local detail to obtain the coastline of the simplified result after bridging, and outputting the simplified result.
4. The method for automatically generating a course merging several roadblocks of a chart according to claim 1, wherein: and e, extracting the skeleton line on the sea side of the coastline, and storing by adopting a binary tree.
CN201911240047.4A 2019-12-06 2019-12-06 Coastline simplifying method based on skeleton line bridging bidirectional buffer area Active CN110910412B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911240047.4A CN110910412B (en) 2019-12-06 2019-12-06 Coastline simplifying method based on skeleton line bridging bidirectional buffer area

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911240047.4A CN110910412B (en) 2019-12-06 2019-12-06 Coastline simplifying method based on skeleton line bridging bidirectional buffer area

Publications (2)

Publication Number Publication Date
CN110910412A true CN110910412A (en) 2020-03-24
CN110910412B CN110910412B (en) 2023-06-30

Family

ID=69822696

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911240047.4A Active CN110910412B (en) 2019-12-06 2019-12-06 Coastline simplifying method based on skeleton line bridging bidirectional buffer area

Country Status (1)

Country Link
CN (1) CN110910412B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114019967A (en) * 2021-10-29 2022-02-08 中国船舶重工集团公司第七0七研究所 Unmanned ship route planning method suitable for long and narrow channel

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000322560A (en) * 1999-05-13 2000-11-24 Mitsubishi Electric Corp Method and device for preparing territorial shoreline data and recording medium
CN102609898A (en) * 2012-02-09 2012-07-25 武汉大学 Method for simplifying shoreline of drowned valley by taking geographical features into account

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000322560A (en) * 1999-05-13 2000-11-24 Mitsubishi Electric Corp Method and device for preparing territorial shoreline data and recording medium
CN102609898A (en) * 2012-02-09 2012-07-25 武汉大学 Method for simplifying shoreline of drowned valley by taking geographical features into account

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
BYRON NAKOS 等: "A TRANSITION FROM SIMPLIFICATION TO GENERALISATION OF NATURAL OCCURRING LINES" *
张立华;唐露露;贾帅东;戴泽源;: "多条海岸线协同化简的层次化三角网分区法" *
杜佳威;武芳;李靖涵;行瑞星;巩现勇;: "一种河口湾海岸线渐进化简方法" *
王亮;吴艳兰;汤军;杨辉;: "改进的双向缓冲海岸线综合方法研究" *
艾廷华,郭仁忠,陈晓东: "Delaunay三角网支持下的多边形化简与合并" *
艾廷华,郭仁忠: "支持地图综合的面状目标约束Delaunay三角网剖分" *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114019967A (en) * 2021-10-29 2022-02-08 中国船舶重工集团公司第七0七研究所 Unmanned ship route planning method suitable for long and narrow channel

Also Published As

Publication number Publication date
CN110910412B (en) 2023-06-30

Similar Documents

Publication Publication Date Title
CN103839268B (en) Method for detecting fissure on surface of subway tunnel
CN100587718C (en) Region growing image segmentation method based on rules
CN109816100B (en) Salient object detection method and device based on bidirectional fusion network
CN110910412A (en) Coastline simplification method based on skeleton line bridging bidirectional buffer area
CN106875364B (en) A kind of true orthophoto generation method
CN102509264B (en) Image-segmentation-based scanning image dedusting method
CN103886561A (en) Criminisi image inpainting method based on mathematical morphology
JP2020038666A (en) Method for generating data set for learning for detection of obstacle in autonomous driving circumstances and computing device, learning method, and learning device using the same
CN110930332A (en) Artificial intelligence-based digital holographic image denoising method
US20230316736A1 (en) Method for feature detection of complex defects based on multimodal data
CN106528622A (en) S57 sea chart data-oriented thinning method
CN113610050A (en) Mask wearing real-time detection method based on YOLOv5
CN115809327B (en) Real-time social network rumor detection method based on multimode fusion and topics
CN110688961A (en) Method and system for extracting topology information of river network
CN114494081B (en) Unmanned aerial vehicle remote sensing mapping image enhancement method
CN111091122B (en) Training and detecting method and device for multi-scale characteristic convolutional neural network
CN115100545A (en) Target detection method for small parts of failed satellite under low illumination
CN114299065B (en) Method for detecting and grading defective appearance forming defects of silk ingots, storage medium and equipment
KR101480670B1 (en) Method for searching shortest path in big graph database
CN108090217A (en) A kind of method and system that meteorological grating image is converted to WMS figure layers
CN113888505A (en) Natural scene text detection method based on semantic segmentation
KR20050078670A (en) Method for auto-detecting edges of building by using lidar data
JP6846216B2 (en) Scene change point model learning device, scene change point detection device and their programs
CN105207793A (en) Node information obtaining method and system in tree-shaped topological structure
Ren et al. DNANet: Dense nested attention network for single image dehazing

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
GR01 Patent grant
GR01 Patent grant