CN102881028A - Method for quickly vectorizing grid digital image - Google Patents
Method for quickly vectorizing grid digital image Download PDFInfo
- Publication number
- CN102881028A CN102881028A CN2012101593931A CN201210159393A CN102881028A CN 102881028 A CN102881028 A CN 102881028A CN 2012101593931 A CN2012101593931 A CN 2012101593931A CN 201210159393 A CN201210159393 A CN 201210159393A CN 102881028 A CN102881028 A CN 102881028A
- Authority
- CN
- China
- Prior art keywords
- polygon
- pixel
- directed edge
- polygonal
- vectorizing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Image Generation (AREA)
Abstract
The invention discloses a method for quickly vectorizing a grid digital image. According to the method, on the basis of an image element, an adjacency relation between grid pattern spots is fully utilized, the large-scale searching process which is generated due to construction of a region boundary by tracking node generation arc sections is fundamentally avoided, and the complex processing situation caused by eliminating a complex region with a hole by constructing a polygonal topological relation by tracking arc sections is avoided, so vectorizing efficiency is greatly improved. Meanwhile, the method has the advantages that a single image element serves as a basic operating unit, the grid pattern spots in the grid digital image are directly converted into vector regions in the scanning process of a scanning line, any intermediate data are not generated in the vectorizing process, and the vectorizing process is independent of the intermediate data, so a computer memory is high in utilization efficiency and convenient to manage. According to the characteristics, the vectorizing efficiency of the grid digital image is improved.
Description
Technical field
The invention belongs to data conversion technique field in process in remote sensing digital image processing and the Geographic Information System (GIS), be specifically related to a kind of grid digital picture rapid vector method of extracting planar figure spot information in the grid digital picture.
Technical background
Grid digital picture vector quantization is the figure spot in the grid digital picture to be carried out the edge sketch, and take the planar information of extraction figure spot as purpose, is converted into the technology of vector area information.Grid and vector often need mutually conversion as two kinds of basic data types of GIS, because remotely-sensed data constantly rolls up, the application of GIS is enriched constantly, and the demand of grid digital picture vector quantization is grown with each passing day, in the face of mass data, in the urgent need to being arranged, new method improves vector quantization efficient.
Mainly contain 2 critical process to extract planar information in the grid digital picture as the vector quantization process of purpose: (1) is that the grid map spot of sketching generates the vector area border; (2) be to describe the Polygon Topology relation of inclusion to form complete area information.At present, in above-mentioned two processing procedures, the grid map spot forms the vector border for sketching, forefathers have proposed the technical methods such as oriented boundary method, Run-Length Coding method and quaternary tree compressed encoding method, although these technical methods have improved the efficient of following the trail of grid map spot border to a certain extent, but wherein still have segmental arc search and the connection judgment of a large amount of redundancies, therefore efficient is still lower when processing a large amount of even mass data; Form complete area information for describing the Polygon Topology relation of inclusion, the vectorization method that forefathers propose all is to solve by constructing complete Polygon Topology relation, because the Polygon Topology relation makes up very complicated, therefore efficient is lower, it is topmost efficiency bottle neck in the present grid digital picture vectorization method.Thereby magnanimity grid digital picture is being carried out in the process of planar grid map spot vector quantization, because the low problem of conversion efficiency, classic method more and more can not satisfy the demand of association area production and application.
Summary of the invention:
The object of the invention is to propose a kind of grid digital picture rapid vector method, the method takes full advantage of the figure spot spatial information that contains in resource for computer system and the grid digital picture, can solve the not high shortcoming of efficient that existing vectorization method exists.
The objective of the invention is to be achieved through the following technical solutions: a kind of grid digital picture rapid vector method, the method are determined the pixel directed edge type of this pixel at first according to the similarities and differences of single pixel and its neighbours territory pixel attribute (pixel value); Then by record pixel directed edge head and the tail node phasor coordinate and both sides polygon information structuring join index thereof, from following four kinds of modes, select a kind of mode that pixel is processed according to pixel directed edge type and join index again, after having scanned all pixels, each inner polygon and belong to that all outer polygons of this internal polygon are common to consist of a vector area:
(1) makes up inner polygon;
(2) make up outer polygon, utilize implicit rays method to judge outer polygon ownership;
(3) connect pixel directed edge, dynamic construction Polygonal Boundary according to join index;
(4) carrying out the polygon merger according to the Polygonal Boundary annexation processes.
Further, described pixel directed edge has direction, and this direction is consistent with vector quantization zone boundary topology forward.
Further, described join index is the discrepancy information of record pixel directed edge head and the tail node.
Further, described implicit rays method judges that outer polygon ownership is specially: in scanning process, realize implicit rays method by the inner polygon of record latest scanned, and judge outer polygonal ownership with this.
Further, describedly carry out the polygon merger according to the Polygonal Boundary annexation and process and to be specially: by connecting Polygonal Boundary, upgrading inner polygon isolated island chained list, update area domain list and upgrade the polygon type and realize polygonal merger.
The invention has the beneficial effects as follows:
(1) makes up new polygon according to scanning sequency and pixel directed edge type, make the structure vector area simply efficient.According to from top to bottom when using scanning line method traversal raster data, order is from left to right carried out, therefore for any one figure spot, always traverse first its upper left corner pixel, when being scanned up to " upper left corner pixel ", just run into a new grid map spot, need to make up new inner polygon, i.e. a new zone.For the figure spot that contains arbitrarily " hole ", always run into first the top margin in " hole ", the pixel directed edge that namely has the D score limit and can not be inserted into existing Polygonal Boundary need to make up new outer polygon.Owing to taking full advantage of the syntople that contains in the grid map spot, directly having avoided making up the initial search segmental arc process of vector area.
(2) directly connect the pixel directed edge according to join index, make structure vector area border simply efficient.Use scanning line method according to from left to right, during from top to bottom order traversal raster data, the pixel directed edge only may connect at two node places about directly over the affiliated pixel.To its pixel directed edge of each phasor coordinate row record information of coming in and going out from beginning to end, just can guide other pixel directed edge to be connected directly to corresponding polygonal border, the judgement of complexity and tracing process when directly having avoided organizing Polygonal Boundary, thus the efficient that makes up grid map spot vector border significantly improved.
(3) realize the differentiation of quick isolated island ownership by implicit rays method.Complete area is made of jointly an inner polygon and the some outer polygon that comprises thereof, and outer polygon can not independently exist, and must belong to certain inner polygon as isolated island.From left to right travel through line by line the characteristics of raster data according to sweep trace, Polygonal Boundary is sent a ray (i.e. implicit ray) left outside any one, and first inner polygon that runs into is exactly the inner polygon that it belongs to.Therefore in every line scanning process, constantly record the inner polygon that intersects with renewal border and sweep trace, this inner polygon namely is the inner polygon that newly-generated outer polygon belongs to, thereby the complex process of directly avoiding the Polygon Topology relation to make up has significantly improved the efficient that makes up the complete vector area information.
(4) according to any pixel directed edge unique characteristics that belong to certain Polygonal Boundary all, connect with merger by polygon and to process, realize in scanning process because the uncertain discrete polygon that produces of scanning area is not integrated and the final vector area of complete.The grid digital picture because sweep trace is lined by line scan, scanning is progressively finished to the figure spot.In scanning process because to the uncertainty of scanning area not, will inevitably produce the polygon of some discrete polygons or type error, characteristics according to pixel directed edge uniqueness, by connecting the join index of these polygonal pixel directed edges, can directly judge these polygonal annexation or Mergers, thereby significantly improve the efficient of dynamic construction vector area.
(5) the present invention is take single pixel as basic processing unit, and processing procedure does not rely on out of Memory, can realize easily the block parallel processing.
(6) the present invention is take single pixel as basic processing unit, and algorithm complex is linear rank substantially, has higher treatment effeciency.
(7) algorithm structure of the present invention is simply clear, and it is convenient to realize.
Description of drawings
Here the accompanying drawing that comprises is used for better understanding the present invention, and is attached in the instructions the as an illustration ingredient of book, but the present invention is not limited to the chart in the accompanying drawing, in these accompanying drawings:
Fig. 1 is relevant defined declaration figure among the present invention.Be the grid digital picture of a 3*3 size among the figure, each grid represents a pixel, the pixel value (such as 230,179) of this pixel of numeral in the middle of the pixel; Heavy black line represents Polygonal Boundary, superficial arrow direction represents that (in fact Polygonal Boundary overlaps with the pixel border for the direction of this Polygonal Boundary, because may there be two polygonal borders of difference in same pixel border, therefore clear in order to represent, institute of the present invention drawings attached is with the inboard drafting to actual pixel border of inner polygon border, and outer Polygonal Boundary is drawn to the outside, pixel border, the world); R1, R2 represent inner polygon, and I1 represents outer polygon; The common compositing area of the common factor of R1 and I1.
Fig. 2 is 16 kinds of pixel directed edge type schematic diagram.
When Fig. 3 is scanning pixel P1, make up inner polygon Region1 schematic diagram.Literal among the figure in the middle of the pixel is to the numbering (such as P1, P2 etc.) of pixel in order to narrate conveniently; The phasor coordinate that the numeral of pixel boundary is set up as the basis take pixel ranks number is coordinate (such as 0,1,2,3 etc.); The current pixel that is scanning of black pentagram indication; The black thick dashed line represents the pixel directed edge of current scanning pixel; The black heavy line represents the Polygonal Boundary that vector quantization generates; The square frame Chinese word of the corresponding pixel longitudinal boundary in grid digital picture top represents the join index that this vector node goes out (such as N/R1 etc., wherein N represents without polygon, and R1 represents Region1, and R2 represents Region2 in the following drawings, and I1 represents Island1); The right side data content (such as regional chained list etc.) that minute textual representation vector quantization process Computer is stored, in the following drawings of the present invention with this figure in identical diagram all with to the figure shows content consistent.
When Fig. 4 is scanning pixel P2, its " on " limit according to join index directly and inner polygon Region1 border connection diagram.
Fig. 5 is join index construction method figure.The figure shows construction method and the recording mode of join index, wherein LeftCode, RightCode are the polygon pointer that generates in the vector quantization process.
Fig. 6 is concatenate rule figure.The figure shows the concatenate rule that the border directly is connected with corresponding Polygonal Boundary according to join index.
Fig. 7 is join index update rule figure.After the figure shows the pixel directed edge and being connected directly to corresponding Polygonal Boundary according to index, the update rule of join index.
Fig. 8 is when being scanned up to pixel P2, and its D score limit makes up outer polygon Island1 schematic diagram.
Fig. 9 is that implicit rays method is judged outer polygon ownership schematic diagram.
Figure 10 is when being scanned up to pixel P3, P4, and its pixel directed edge is according to join index and corresponding Polygonal Boundary connection diagram.
Figure 11 is when being scanned up to pixel P5, makes up inner polygon Region2 schematic diagram.
Figure 12 is when being scanned up to P6, P7, P8, P9, and its pixel directed edge is according to join index and corresponding Polygonal Boundary connection diagram.
Figure 13 is when having scanned all pixels, the vector quantization result schematic diagram.
Figure 14 is two inner polygon methods of merger schematic diagram.
Figure 15 is two outer Polygon schematic diagram of merger.
Figure 16 is that the outer polygon of merger is to inner polygon method schematic diagram.
Figure 17 is that the merger inner polygon is to outer Polygon schematic diagram.
Embodiment
The below specifies the present invention for having extensively grid digital picture (accompanying drawing 1) the vector quantization process of representational 3 * 3 sizes.
Be convenient following description, the spy is defined as follows:
Definition 1.Inner polygon: the border of simple polygon is divided into inside and outside two parts with the plane, and the interior zone that its border surrounds is called inner polygon, referring to the R1 in the accompanying drawing 1.
Definition 2.Outer polygon (isolated island): the border of simple polygon is divided into inside and outside two parts with the plane, and the perimeter that its border is partitioned into is called outer polygon, referring to the supplementary set of I1 in the accompanying drawing 1.
Definition 3.The zone: a zone can be comprised of an inner polygon and limited outer polygon, inner polygon and outer polygonal common factor have consisted of a complete zone, its China and foreign countries' polygon is and belongs to the internal polygon isolated island, includes an isolated island G referring to the regional R1 in the accompanying drawing 1.
Definition 4.The topology forward: when advancing in the zone boundary along a direction, always when its right side, this direction is topological forward in the zone that the border surrounds.Definition is timing when vertical paper makes progress among the present invention, and clockwise direction is topological forward.
Definition 5.The pixel directed edge: definition is the pixel directed edge with the figure spot border of the single pixel generation of topological forward.Single pixel is the least unit in the raster data, is the square area with space size, and its pixel directed edge is the least unit on pie graph spot border, total following 16 types, and referring to accompanying drawing 2.
The inventive method is with the grid cell, raster cell in the mode of sweep trace successively sequential scanning grid digital picture, according to the pixel Rankine-Hugoniot relations, for processing of dissimilar pixel directed edge, by organizing pixel directed edge dynamic construction vector polygon border, by organizing Polygon Topology relation of inclusion structure complete vector area information.In following concrete example, according to from left to right, scanning sequency from top to bottom, successively sequential scanning and processing grid cell, raster cell, concrete steps are:
Step 1:When being scanned up to the P1 pixel, make up inner polygon Region1, as shown in Figure 3.
The inventive method is because according to from left to right, order from top to bottom scans successively and processes grid cell, raster cell, when being scanned up to first pixel, its place grid map spot must be first grid map spot that runs in the vector quantization process, therefore needs to make up new inner polygon.
According to definition 3, the zone is made of jointly inner polygon and all outer polygons of comprising thereof, namely all inner polygons finally all can form the zone, therefore all inner polygons that vector quantization produced are organized into chained list (such as the regional chained list in the accompanying drawing 3), as final vector quantization result's output foundation.
Step 2:When being scanned up to the P2 pixel, the P2 pixel " on " limit can directly be connected with inner polygon Region1 border according to join index, as shown in Figure 4.
The inventive method can directly be connected the pixel directed edge by join index in sweep trace scanning grid cell, raster cell process with corresponding Polygonal Boundary.The join index construction method is in the inventive method: in the process of raster data of lining by line scan, the polygon of the left and right sides came pointer when record pixel directed edge was put the border, place from beginning to end along topological forward, referring to accompanying drawing 5.
The specific rules that the pixel directed edge directly is connected with corresponding Polygonal Boundary according to join index in the inventive method is referring to accompanying drawing 6.
Need to upgrade the pixel directed edge of join index below instructing and connect after finishing the pixel directed edge and corresponding Polygonal Boundary is connected, concrete join index update rule is referring to accompanying drawing 7; Just vertically extend after the pixel directed edge of vertical direction connects, do not need to upgrade join index; Need to upgrade simultaneously the LeftCode of left node and the RightCode of right node when making up accurate outer polygon.
Step 3:When being scanned up to pixel P2, its D score limit makes up new outer polygon Island1, and judges that it is attributed to inner polygon Region1, as shown in Figure 8.
The inventive method is in sweep trace scanning grid data procedures, when the pixel directed edge of scanning pixel has the D score limit and can not be connected with existing Polygonal Boundary according to join index, need to make up new outer polygon, utilize simultaneously implicit rays method to judge outer polygonal ownership.
The method of judging outer polygon ownership in the inventive method by implying rays method is: the inner polygon that continuous record and renewal border and sweep trace intersect in every line scanning process.This inner polygon namely is the inner polygon that newly-generated outer polygon belongs to, and the outer polygon G that for example current scanning pixel generates in the accompanying drawing 9 belongs to inner polygon C.
Step 4:When being scanned up to P3, P4 pixel, its pixel directed edge can be connected directly in the border of corresponding inner polygon Region1 and outer polygon Island1, as shown in Figure 10 according to join index.Join index construction method, concatenate rule and join index update rule are described in detail in step 2, so locate to repeat no more.
Step 5:When being scanned up to the P5 pixel, make up new inner polygon Region2, as shown in Figure 11.
The inventive method is in sweep trace scanning grid cell, raster cell process, (be the pixel that the pixel directed edge has upper left corner structure when being scanned up to " upper left corner pixel ", such as " left-on " in the accompanying drawing 2 and " lower-left side-on ") time, and this pixel directed edge can not be connected with existing polygon according to join index, needs to make up new inner polygon.
Step 6:When being scanned up to P6, P7, P8, P9 pixel, its pixel directed edge can be connected directly in the corresponding Polygonal Boundary, as shown in Figure 12 according to join index.Join index construction method, concatenate rule and join index update rule are described in detail in step 2, so locate to repeat no more.
Step 7:After having scanned all grid cell, raster cells, namely finished the vector quantization process to whole grid digital picture.Formed by an inner polygon and the outer polygon that comprises thereof according to 3, one zones of definition.Therefore need only the island boundaries chained list of exporting successively internal polygon border chained list and comprising and both can obtain corresponding vector area border, the internal polygon attribute is the attribute of vector area, thereby obtain having the complete vector area information of topological relation of inclusion, as shown in Figure 13.
Special circumstances 1:The inventive method is in sweep trace scanning grid cell, raster cell process, when certain pixel directed edge head and the tail all can directly connect and when being connected to two different inner polygons, needs to connect these two inner polygons according to join index.Method of attachment is: 1) inner polygon to be connected border is connected to target inner polygon border; 2) the outer polygon ownership of all that inner polygon to be connected are comprised attribute modification is the target inner polygon and is connected to target internal polygon isolated island chained list; 3) fresh target inner polygon border head and the tail node join index more; 4) destroy inner polygon to be connected.As shown in Figure 14.
Special circumstances 2:The inventive method when certain pixel directed edge head and the tail all can directly connect and be connected to two differences outside polygon according to join index, needs these two outer polygons of connection in sweep trace scanning grid cell, raster cell process.Method of attachment is: 1) outer Polygonal Boundary to be connected is connected to the outer Polygonal Boundary of target; 2) the outer Polygonal Boundary head and the tail of fresh target node join index more; 3) deletion outer polygon to be connected in comprising outer polygonal inner polygon isolated island chained list to be connected; 4) destroy outer polygon to be connected.As shown in Figure 15.
Special circumstances 3:The inventive method is in sweep trace scanning grid cell, raster cell process, when certain pixel directed edge head and the tail all can and be connected to two dissimilar polygons according to the join index connection, when inner polygon generates first than outer polygon simultaneously, need to connect outer polygon (outer polygon to be connected) to inner polygon (target inner polygon).Method of attachment is: 1) outer Polygonal Boundary to be connected is connected to target inner polygon border; 2) fresh target inner polygon border head and the tail node join index more; 3) deletion outer polygon to be connected in comprising outer polygonal inner polygon isolated island chained list to be connected; 4) destroy outer polygon to be connected.As shown in Figure 16.
Special circumstances 4:The inventive method is in sweep trace scanning grid cell, raster cell process, when certain pixel directed edge head and the tail all can and be connected to two dissimilar polygons according to the join index connection, when outer polygon generates first than inner polygon simultaneously, need to connect inner polygon (inner polygon to be connected) to outer polygon (the outer polygon of target).Method of attachment is: 1) inner polygon to be connected border is connected to the outer Polygonal Boundary of target; 2) will belong to all outer polygonal ownership attribute modification of internal polygon to be connected is the outer polygonal ownership attribute of target, and is connected to and comprises in the outer polygonal internal polygon isolated island chained list of target; 3) the outer Polygonal Boundary head and the tail of fresh target node join index more; 4) destroy inner polygon to be connected.As shown in Figure 17.
Above-described embodiment is used for the present invention that explains, rather than limits the invention, and in the protection domain of spirit of the present invention and claim, any modification and change to the present invention makes all fall into protection scope of the present invention.
Claims (5)
1. a grid digital picture rapid vector method is characterized in that, the method is determined the pixel directed edge type of this pixel at first according to the similarities and differences of single pixel and its neighbours territory pixel attribute; Then by record pixel directed edge head and the tail node phasor coordinate and both sides polygon information structuring join index thereof, from following four kinds of modes, select a kind of mode that pixel is processed according to pixel directed edge type and join index again, after having scanned all pixels, each inner polygon and belong to that all outer polygons of this internal polygon are common to consist of a vector area:
(1) makes up inner polygon;
(2) make up outer polygon, utilize implicit rays method to judge outer polygon ownership;
(3) connect pixel directed edge, dynamic construction Polygonal Boundary according to join index;
(4) carrying out the polygon merger according to the Polygonal Boundary annexation processes.
2. method according to claim 1 is characterized in that, described pixel directed edge has direction, and this direction is consistent with vector quantization zone boundary topology forward.
3. method according to claim 1 is characterized in that, described join index is the polygon information of the record pixel directed edge head and the tail left and right sides, pixel border, node place.
4. method according to claim 1 is characterized in that, described implicit rays method judges that outer polygon ownership is specially: in scanning process, realize implicit rays method by the inner polygon of record latest scanned, and judge outer polygonal ownership with this.
5. method according to claim 1, it is characterized in that, describedly carry out the polygon merger according to the Polygonal Boundary annexation and process and to be specially: by connecting Polygonal Boundary, upgrading inner polygon isolated island chained list, update area domain list and upgrade the polygon type and realize polygonal merger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101593931A CN102881028A (en) | 2012-05-22 | 2012-05-22 | Method for quickly vectorizing grid digital image |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101593931A CN102881028A (en) | 2012-05-22 | 2012-05-22 | Method for quickly vectorizing grid digital image |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102881028A true CN102881028A (en) | 2013-01-16 |
Family
ID=47482341
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012101593931A Pending CN102881028A (en) | 2012-05-22 | 2012-05-22 | Method for quickly vectorizing grid digital image |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102881028A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198496A (en) * | 2013-03-29 | 2013-07-10 | 浙江大学 | Method for carrying out vectorization on abstract image |
| CN105469094A (en) * | 2015-11-28 | 2016-04-06 | 重庆交通大学 | Edge vector line extraction algorithm of binary image of road surface |
| CN105468693A (en) * | 2015-11-17 | 2016-04-06 | 南京师范大学 | High-efficiency topological relation calculation method |
| CN106952324A (en) * | 2017-04-07 | 2017-07-14 | 山东理工大学 | The parallel overlap-add procedure device and method of vector polygon rasterizing |
| CN110246173A (en) * | 2018-08-14 | 2019-09-17 | 浙江大华技术股份有限公司 | A kind of method and apparatus judging shape area |
| CN110675417A (en) * | 2019-09-25 | 2020-01-10 | 自然资源部第六地形测量队(自然资源部地下管线勘测工程院、四川省第三测绘工程院) | Raster data fast vectorization method combining run length coding and edge tracking |
| CN111753726A (en) * | 2020-06-24 | 2020-10-09 | 中国林业科学研究院资源信息研究所 | Crown code-based magnetic marker crown boundary vectorization method |
| CN117292210A (en) * | 2023-11-27 | 2023-12-26 | 航天宏图信息技术股份有限公司 | Method, device, electronic equipment and storage medium for vectorizing classified images |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101630463A (en) * | 2009-07-30 | 2010-01-20 | 上海交通大学 | Method for automatic vectorization of road network digital raster map |
| CN101840582A (en) * | 2010-02-05 | 2010-09-22 | 北京交通大学 | Boundary digitizing method of cadastral plot |
| CN102314696A (en) * | 2011-07-13 | 2012-01-11 | 北京华迪宏图信息技术有限公司 | Vectorization method for raster data of remote sensing images |
-
2012
- 2012-05-22 CN CN2012101593931A patent/CN102881028A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101630463A (en) * | 2009-07-30 | 2010-01-20 | 上海交通大学 | Method for automatic vectorization of road network digital raster map |
| CN101840582A (en) * | 2010-02-05 | 2010-09-22 | 北京交通大学 | Boundary digitizing method of cadastral plot |
| CN102314696A (en) * | 2011-07-13 | 2012-01-11 | 北京华迪宏图信息技术有限公司 | Vectorization method for raster data of remote sensing images |
Non-Patent Citations (1)
| Title |
|---|
| 苏程 等: "基于像元有向边的栅格数据扫描线矢量化方法", 《计算机辅助设计与图形学学报》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198496B (en) * | 2013-03-29 | 2015-08-26 | 浙江大学 | A kind of method of abstracted image being carried out to vector quantization |
| CN103198496A (en) * | 2013-03-29 | 2013-07-10 | 浙江大学 | Method for carrying out vectorization on abstract image |
| CN105468693B (en) * | 2015-11-17 | 2019-01-18 | 南京师范大学 | A kind of efficient topological relationship calculation method |
| CN105468693A (en) * | 2015-11-17 | 2016-04-06 | 南京师范大学 | High-efficiency topological relation calculation method |
| CN105469094B (en) * | 2015-11-28 | 2019-02-26 | 重庆交通大学 | A kind of edge vectors line drawing method of road surface bianry image |
| CN105469094A (en) * | 2015-11-28 | 2016-04-06 | 重庆交通大学 | Edge vector line extraction algorithm of binary image of road surface |
| CN106952324A (en) * | 2017-04-07 | 2017-07-14 | 山东理工大学 | The parallel overlap-add procedure device and method of vector polygon rasterizing |
| CN110246173A (en) * | 2018-08-14 | 2019-09-17 | 浙江大华技术股份有限公司 | A kind of method and apparatus judging shape area |
| CN110246173B (en) * | 2018-08-14 | 2023-11-03 | 浙江大华技术股份有限公司 | Method and device for judging shape area |
| CN110675417A (en) * | 2019-09-25 | 2020-01-10 | 自然资源部第六地形测量队(自然资源部地下管线勘测工程院、四川省第三测绘工程院) | Raster data fast vectorization method combining run length coding and edge tracking |
| CN110675417B (en) * | 2019-09-25 | 2022-08-30 | 自然资源部第六地形测量队(自然资源部地下管线勘测工程院、四川省第三测绘工程院) | Raster data fast vectorization method combining run length coding and edge tracking |
| CN111753726A (en) * | 2020-06-24 | 2020-10-09 | 中国林业科学研究院资源信息研究所 | Crown code-based magnetic marker crown boundary vectorization method |
| CN111753726B (en) * | 2020-06-24 | 2024-01-19 | 中国林业科学研究院资源信息研究所 | Magnetic marker crown boundary vectorization method based on crown coding |
| CN117292210A (en) * | 2023-11-27 | 2023-12-26 | 航天宏图信息技术股份有限公司 | Method, device, electronic equipment and storage medium for vectorizing classified images |
| CN117292210B (en) * | 2023-11-27 | 2024-02-23 | 航天宏图信息技术股份有限公司 | Method, device, electronic equipment and storage medium for vectorizing classified images |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102881028A (en) | Method for quickly vectorizing grid digital image | |
| CN102930561B (en) | Delaunay-triangulation-based grid map vectorizing method | |
| US11302060B2 (en) | Method and system for vector-raster overlay analysis of ground surface image area based on edge clipping | |
| KR101420237B1 (en) | 3D Image Processing Method and Apparatus for Enabling Efficient Retrieval of Neighbor Point | |
| US8879839B2 (en) | Image processing apparatus, image processing method, and storage medium | |
| CN107025323A (en) | A kind of transformer station's fast modeling method based on ATL | |
| CN106600697B (en) | A kind of navigation grid cartographic representation towards 3D scene | |
| CN101751449A (en) | Spatial overlap analysis method and system used in geographic information system | |
| CN104112007B (en) | A kind of data storage, tissue and the search method of image level segmentation result | |
| CN104331928B (en) | A kind of contour automatic labeling method based on the triangulation network | |
| US11227433B2 (en) | Device and method for extracting terrain boundary | |
| CN112115534A (en) | Method for converting three-dimensional house model into two-dimensional vector plane with height attribute | |
| CN103838829A (en) | Raster vectorization system based on hierarchical boundary-topology search model | |
| CN101840582B (en) | Boundary digitizing method of cadastral plot | |
| CN112307553A (en) | Method for extracting and simplifying three-dimensional road model | |
| CN106204719B (en) | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval | |
| CN110489511B (en) | Contour line edge-contact elevation error correction method and system, electronic device and medium | |
| CN101533525B (en) | Method for analyzing the overlay of point and face | |
| CN115937461A (en) | Multi-source fusion model construction and texture generation method, device, medium and equipment | |
| CN104200501A (en) | Rail transit train flow diagram automatic preparation method | |
| CN102236721B (en) | Method for extracting complex window space information in space data engine | |
| CN108986212B (en) | Three-dimensional virtual terrain LOD model generation method based on crack elimination | |
| CN113204607B (en) | Vector polygon rasterization method for balancing area, topology and shape characteristics | |
| CN102938230B (en) | Dynamic layering rendering expression method of two-dimensional scalar field on electronic map | |
| CN114756932A (en) | Method for calculating topological relation between building and green land based on V-TMM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130116 |