CN111915488A - Method for generating high-performance image tile map under big data - Google Patents
Method for generating high-performance image tile map under big data Download PDFInfo
- Publication number
- CN111915488A CN111915488A CN202010779132.4A CN202010779132A CN111915488A CN 111915488 A CN111915488 A CN 111915488A CN 202010779132 A CN202010779132 A CN 202010779132A CN 111915488 A CN111915488 A CN 111915488A
- Authority
- CN
- China
- Prior art keywords
- image
- map
- tile map
- tile
- level
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 239000011159 matrix material Substances 0.000 claims abstract description 35
- 238000013507 mapping Methods 0.000 claims abstract description 8
- 238000005192 partition Methods 0.000 claims abstract description 7
- 230000009466 transformation Effects 0.000 claims description 3
- 238000000638 solvent extraction Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 101100134058 Caenorhabditis elegans nth-1 gene Proteins 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000002194 synthesizing effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T3/00—Geometric image transformation in the plane of the image
- G06T3/40—Scaling the whole image or part thereof
- G06T3/4038—Scaling the whole image or part thereof for image mosaicing, i.e. plane images composed of plane sub-images
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a method for generating a high-performance image tile map under big data, which comprises the following steps: establishing a coordinate system according to the tile map levels from top to bottom, and obtaining a position mapping table of any image in the large mosaic; traversing the coordinate range of any image, and solving a rectangular area of any image in a splicing plane and a minimum external rectangular bounding box after the image is projected; splitting an image of a large splicing map into a plurality of subtasks with fixed sizes; and solving the number of tile maps of any level and the optimal partition number; putting the image of the large spliced image into a minimum circumscribed rectangle bounding box, and solving tile map indexes of the sub-regions on a coordinate system by adopting a division strategy; obtaining a matrix of any image at the tile map level according to the overlapping relation between the sub-region and the minimum circumscribed rectangle bounding box of any image; and producing a sub-region map according to a matrix of any image at the tile map level, and segmenting to obtain the tile map.
Description
Technical Field
The invention relates to the technical field of image processing, in particular to a method for generating a high-performance image tile map under big data.
Background
The tile map (in a WebGIS system, a tile map pyramid) is a multi-resolution hierarchical model, and the resolution is lower from the bottom layer to the top layer of the tile pyramid, but the represented geographic range is unchanged. The building process of the pyramid model of the tile map in the prior art is as follows:
firstly, determining the number N of zoom levels to be provided by a map service platform, taking a map picture with the highest zoom level and the largest map scale as the bottom layer of a pyramid, namely a layer 0, partitioning the map picture, cutting the map picture from the left upper corner of the map picture to the right and from the top to the bottom, and dividing the map picture into square map tiles with the same size (such as 256x256 pixels) to form a layer 0 tile matrix; on the basis of the map picture of the layer 0, generating the map picture of the layer 1 by a method of synthesizing one pixel by every 2x2 pixels, partitioning the map picture of the layer 1, and dividing the map picture into square map tiles with the same size as the next layer to form a tile matrix of the layer 1; generating a layer 2 tile matrix by the same method; …, respectively; this continues until the nth 1 layer, which constitutes the entire tile pyramid.
At present, the technology for rapidly generating the tile map under the condition of large data is not dealt with in the prior art, and the technology is in a blank state in the technical field of tile map generation. Therefore, it is urgently needed to provide a high-performance image tile map generation method with simple logic and less calculation workload.
Disclosure of Invention
In view of the above problems, an object of the present invention is to provide a method for generating a high-performance tile map under big data, and the technical solution adopted by the present invention is as follows:
the method for generating the high-performance image tile map under the big data comprises the following steps:
establishing a coordinate system according to the tile map levels from top to bottom, and obtaining a position mapping table of any image in the large mosaic;
traversing the coordinate range of any image, and solving a rectangular area of any image in a splicing plane and a minimum external rectangular bounding box after the image is projected;
splitting an image of a large splicing map into a plurality of subtasks with fixed sizes;
and solving the number of tile maps of any level and the optimal partition number;
putting the image of the large spliced image into a minimum circumscribed rectangle bounding box, and solving tile map indexes of the sub-regions on a coordinate system by adopting a division strategy;
obtaining a matrix of any image at the tile map level according to the overlapping relation between the sub-region and the minimum circumscribed rectangle bounding box of any image;
and producing a sub-region map according to a matrix of any image at the tile map level, and segmenting to obtain the tile map.
Further, the method for generating the tile map of the high-performance image under the big data further comprises the step of segmenting the stored large tile map to obtain the tile map if the memory required under the tile map level cannot have the integral large tile map.
Preferably, the obtaining of the position mapping table of any image in the stitched large image includes the following steps:
and selecting a plane where the center of the acquired image is located as a splicing plane, obtaining a homography matrix of any image in a coordinate system, and projecting the homography matrix to the splicing plane.
Further, the image is projected to a transformed image matrix M 'in the jth graph at the ith level'ijThe expression of (a) is:
M′ij=Si*Hj*Mij
wherein M isijMatrix representing the image at i level, SiRepresenting a scaling matrix, HjA projection matrix for representing the projection of the jth graph at the ith level to the splicing plane at the Nth level of the tile graph; and N is a natural number greater than 1.
Further, the step of traversing the coordinate range of any image to obtain the rectangular area of any image in the splicing plane and the minimum circumscribed rectangular bounding box after the image is projected comprises the following steps:
obtaining four vertex coordinates P of any image in large mosaici1(xi1,yi1) X is saidi1,yi1Representing pixel coordinates in the stitched large image; the i1 is a natural number greater than 0 and less than 5;
coordinate P of four vertexes of any imagei1(xi1,yi1) Converted into three-dimensional homogeneous coordinate P'i1(xi1,yi1,1);
Obtaining the coordinate P' after projection according to the homography matrix corresponding to the imagei1(x′i1,y′i1,1);
According to the projected coordinate P ″)i1(x′i1,y′i11) obtaining a minimum bounding box of the circumscribed rectangle after the image projection, wherein the expression is
Wi=Xmaxi-Xmaxi
Hi=Ymaxi-Ymaxi
Wherein, YmaxiRepresenting the maximum ordinate, Ymin, of the images in the stitched atlasiMinimum ordinate, Xmax, representing images in a stitched atlasiMaximum abscissa, Ymax, representing the image in the stitched atlasiThe smallest abscissa representing the image in the stitched large map.
Further, the step of determining the number of tile maps at any level comprises the following steps:
obtaining a start index and an end index, expressed as
XStarti=floor(Xmini/B)
YStarti=floor(Ymini/B)
XEndi=floor((Xmini+Wi)/B+1)
YEndi=floor((Ymini+Hi)/B+1)
Wherein XStartiDenotes the starting index, XEnd, of the tile map in the X direction at level iiIndicates the ending index, YSTA, of the X-direction tile map at level irtiDenotes the starting index, YEnd, of the tile map in the Y direction at level iiRepresenting the ending index of the tile map in the Y direction at the ith level, and B representing the side length of the tile map;
obtaining the number of the tile graphs in the X direction and the Y direction, wherein the expression is as follows:
Xi2=XEndi-XStarti
Yi2=YEndi-YStarti。
compared with the prior art, the invention has the following beneficial effects:
(1) the invention skillfully establishes a tile map-level coordinate system, obtains a position mapping table of the image in the mosaic large map, and carries out image mosaic by using the image matrix after projection transformation, and has the advantages that: the projection transformation can ensure that the splicing is more accurate and can adapt to a larger angle; in addition, the position mapping table is established, the splicing result can be replaced by one table, and the image operation is not involved, so that the calculation is more efficient, and the memory is not consumed.
(2) The invention skillfully traverses the coordinate range of any image, and obtains the rectangular area of any image in the splicing plane and the minimum external rectangular bounding box after the image is projected, and the invention has the advantages that: any image size is obtained and it is clear to which tile map the image belongs.
(3) The invention has the advantages that by obtaining the number of the tile maps of any level and the optimal partition number: firstly, for the big data splicing condition, the memory is limited, and all graphs stored in the memory which is large enough cannot be created without partitioning; secondly, reasonable partitioning is beneficial to greatly improving the generation efficiency of the tile map.
(4) The invention puts the image of the small spliced graph into the minimum external rectangular bounding box corresponding to the large spliced graph, and adopts the division strategy to obtain the tile map index of the sub-region on the coordinate system, and the invention has the advantages that: the invention can generate the large splicing image while segmenting the local tile image by only reading the original image once.
(5) The invention obtains the matrix of any image at the tile map level according to the overlapping relation of the minimum circumscribed rectangle bounding boxes of the subareas and any image, and has the advantages that: the invention only carries out matching once and calculates the H matrix once, thus being suitable for generating the tile maps at different levels.
In conclusion, the method has the advantages of simple logic, less calculation workload and the like, and has high practical value and popularization value in the technical field of image processing.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope of protection, and it is obvious for those skilled in the art that other related drawings can be obtained according to these drawings without inventive efforts.
FIG. 1 is a schematic flow chart of the present invention.
FIG. 2 is a diagram of the position relationship of the image in the coordinate system according to the present invention.
FIG. 3 is a schematic diagram of image projection stitching according to the present invention.
FIG. 4 is a diagram of the original image of the present invention placed in a minimum bounding rectangle.
Detailed Description
To further clarify the objects, technical solutions and advantages of the present application, the present invention will be further described with reference to the accompanying drawings and examples, and embodiments of the present invention include, but are not limited to, the following examples. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Examples
As shown in fig. 1 to 4, the present embodiment provides a method for generating a high-performance image tile map under big data, including the following steps:
first, the resolution of the artwork is 1800 × 900, the PPM (pixel per meter) 1071 in the present embodiment, and the tile map level of the present embodiment is from 0 to 10, and the i-th tile map represents the PPMi=2i. Wherein, the tile map unit is square, the side length is B, and the size is B × B, wherein B ═ 256, then under different levels, the view size of each tile map unit is B × PPMi. In the embodiment, a rectangular region Rect (x, y, w, h) is defined, as shown in FIG. 2, x and y represent pixel coordinates of the upper left corner point of the region, and can be used as Rect.x; y represents; w, h represents the width and height of the region, which may be referred to as rect.w; h.
Firstly, establishing a coordinate system according to tile map levels from top to bottom, and obtaining a position mapping table of any image in a large mosaic image; in this embodiment, the location map represents the location of each graph in the entire stitched large graph. The stitching plane in this embodiment is a plane where the images in the centers of all the images are located, and this plane is a plane where the large images are stitched. For each map there is an H matrix (homography) by which the map can be projected onto the stitching plane.
Here, the image is projected into the transformed image matrix M 'from the jth image at the ith level'ijThe expression of (a) is:
M′ij=Si*Hj*Mij
wherein M isijMatrix representing the image at i level, SiRepresenting a scaling matrix, HjA projection matrix for representing the projection of the jth graph at the ith level to the splicing plane at the Nth level of the tile graph; and N is a natural number greater than 1.
In the present embodiment, the scaling matrix SiIs expressed as
Where s is a scaling factor, s is 1/210-i。
Secondly, traversing the coordinate range of any image to obtain a rectangular area of any image in a splicing plane and a minimum circumscribed rectangular bounding box (M ') after the image is projected'ijRange of (1)
(1) In splicingObtaining four vertex coordinates P of any image in large imagei1(xi1,yi1) X is saidi1,yi1Representing pixel coordinates in the stitched large image; the i1 is a natural number greater than 0 and less than 5;
(2) coordinate P of four vertexes of any imagei1(xi1,yi1) Converted into three-dimensional homogeneous coordinate P'i1(xi1,yi1,1);
(3) Obtaining the coordinate P' after projection according to the homography matrix corresponding to the imagei1(x′i1,y′i1,1);
(4) According to the projected coordinate P ″)i(x′i1,y′i11) obtaining a minimum bounding box of the circumscribed rectangle after the image projection, wherein the expression is
Wi=Xmaxi-Xmaxi
Hi=Ymaxi-Ymaxi
Wherein, YmaxiRepresenting the maximum ordinate, Ymin, of the images in the stitched atlasiMinimum ordinate, Xmax, representing images in a stitched atlasiMaximum abscissa, Ymax, representing the image in the stitched atlasiThe smallest abscissa representing the image in the stitched large map.
Thirdly, detecting whether the memory can store the whole graph:
for example: at a certain tile map level, the required memory M, unit byte, Mi=Wi*Hi*C
Wherein, WiSplicing the width of the large graph at a certain level; hSplicing big pictureSplicing the width of the large graph at a certain level; c represents the number of image channels, which in this example is 4.
If M < f MSystem for controlling a power supplyAnd the table represents that the current memory can store the spliced big graph.
MSystem for controlling a power supplyIs the current idle memory of the system; f is the memory usage coefficient, and in this example, f is 0.8.
And fourthly, dividing the whole large spliced graph into a plurality of subtasks according to the size of the fixed block. If the tasks are not divided, the reasons are mainly as follows: firstly, most data volume cannot be stored in a limited memory; second, not dividing would greatly slow down efficiency. Continuous operation of data in Mat of Opencv can be slow
Fifthly, the number of the tile maps at any level and the optimal partition number are obtained;
(1) obtaining the quantity of tile maps of any level:
obtaining a start index and an end index, expressed as
XStarti=floor(Xmini/B)
YStarti=floor(Ymini/B)
XEndi=floor((Xmini+Wi)/B+1)
YEndi=floor((Ymini+Hi)/B+1)
Wherein XStartiDenotes the starting index, XEnd, of the tile map in the X direction at level iiIndicates the ending index, YSTart, of the X-direction tile map at level iiDenotes the starting index, YEnd, of the tile map in the Y direction at level iiRepresenting the ending index of the tile map in the Y direction at the ith level, and B representing the side length of the tile map;
obtaining the number of the tile graphs in the X direction and the Y direction, wherein the expression is as follows:
Xi2=XEndi-XStarti
Yi2=YEndi-YStarti。
(2) calculating the optimal partition number:
total partition number SplitNum: split Numi=Wi/Nopt*Hi/NoptIn which N isoptFor the best scale, this example Nopt3000, number split in X direction, SplitXiSplit number SplitY in Y directioni。
SplitXi*SplitYi>=splitNum
min(SplitXi+SplitYi)
(3) the method is divided into subtasks:
putting the image of the large spliced image into a minimum circumscribed rectangle bounding box, and solving tile map indexes of the sub-regions on a coordinate system by adopting a division strategy;
as shown in FIG. 4, the total area is Sketchi(Xmini,Ymini,Wi,Hi) All the original pictures are placed in the smallest bounding rectangle bounding box of the stitching plane. Each sub-region SubSketchm(Xsubm,Ysubm,Wsubm,Hsubm) In the present example, the length and width are a, and in accordance with the test result, a is 3000 pixels.
Under the ith-level tile map, each sub-region can be represented as Xsubm、Ysubm、Wsubm、Hsubm;Xsubm、YsubmFor the upper left pixel coordinate of the region block, Wsubm=A,Hsubm=A;SubXStarti、SubYStarti、SubXEndi、SubYEndiRespectively, the index of the tile map in the x, y direction for the sub-region.
M is more than or equal to 0 and less than split X for the mth sub-regioni*SplitYi,
SubXStarti=j*StepXi+XStarti
SubYStarti=k*StepYi+YStarti
SubXEndi=min(SubXStarti+StepXi,XEndi)
SubYEndi=min(SubYStarti+StepYi,YEndi)
Xsubm=SubXStarti*B+Xmini
Ysubm=SubYStarti*B+Ymini
Wherein j is more than or equal to 0 and is less than SplitXi,0≤k<SplitYi。
Sixthly, according to the overlapping relation of the sub-area and the minimum circumscribed rectangle bounding box of any image, obtaining a matrix M of any image at the tile map levelij。
And seventhly, generating a subregion map:
(1) if the mosaic big picture is generated, the mosaic big picture MSketch generated at the previous level is directly usedK+1Zoom, MSkeyK=0.5*MSketchK+1。
Corresponding region SketchK+1Scaling was also performed as follows:
SketchK(XK,YK,WK,HK)
XK=0.5*XK+1,YK=0.5*YK+1,WK=0.5*WK+1,HK=0.5*HK+1。
(2) if the big mosaic is not generated, loading the searched map in the sixth step into the MSubSketch according to the positional relation table in the second stepmLi, MSubSketchmI.e. a sub-region mosaic generated for each sub-region.
And eighthly, producing a sub-region map according to the matrix of any image at the tile map level, and segmenting to obtain the tile map. In this embodiment, each tile map BlockiEach BlociIs noted as Blocki(Bxi,ByiBw, By), where Bw is equal to B and By is equal to B.
In this embodiment, Rect0 represents a region of Block in a sub-tile region map or a tile map, and Rect1 is Rect0 in Block.
In this embodiment, two cases can be divided:
(1) if a stitched big picture has been generated:
direct pair splicing large image MSkeyKCutting, the corresponding region is the scaled region Sketch in the seventh stepK
Blocki(Rect1)=MSketchK(Rect0)
Wherein. CrossRef is BlockiWith SketchKIntersection if crossselect planeProduct greater than 0(w x h)>0) Then Block needs to be generatedi
Rect0=(CrossRect.x-SketchK.x,CrossRect.y-SketchK.y,B,B)
Rect1=(CrossRect.x-Blocki.x,CrossRect.y-Blocki.y,B,B)
(2) If no big stitched graph has been generated:
for each seventh step, the subtask splicing map MSubScutmPerforming segmentation, wherein the corresponding region is SubSketch in the fifth stepmGo through each SubSketchmSubXStart in (1)i、SubYStarti、SubXEndi、SubYEndi
SubXStarti≤j<SubXEndi
SubYStarti≤k<SubYEndi
Bxi=j*B+Xmini
Byi=k*B+Ymini
Rect0=(CrossRect.x-SubSketchm.x,CrossRect.y-SubSketchm.y,B,B)
Rect1=(CrossRect.x-Blocki.x,CrossRect.y-Blocki.y,B,B)
Blocki(Rect1)=MSubSketchm(Rect0)
The ninth step, copy the small picture cut to splice the big picture, MSkeyKIndicating that a stitched big graph can be generated at level K. When the memory is enough to store a certain big mosaic, the MSubScut is usedmAnd copying to the corresponding area of the large mosaic according to the subarea division.
The above-mentioned embodiments are only preferred embodiments of the present invention, and do not limit the scope of the present invention, but all the modifications made by the principles of the present invention and the non-inventive efforts based on the above-mentioned embodiments shall fall within the scope of the present invention.
Claims (6)
1. The method for generating the high-performance image tile map under the condition of big data is characterized by comprising the following steps of:
establishing a coordinate system according to the tile map levels from top to bottom, and obtaining a position mapping table of any image in the large mosaic;
traversing the coordinate range of any image, and solving a rectangular area of any image in a splicing plane and a minimum external rectangular bounding box after the image is projected;
splitting an image of a large splicing map into a plurality of subtasks with fixed sizes;
and solving the number of tile maps of any level and the optimal partition number;
putting the image of the large spliced image into a minimum circumscribed rectangle bounding box, and solving tile map indexes of the sub-regions on a coordinate system by adopting a division strategy;
obtaining a matrix of any image at the tile map level according to the overlapping relation between the sub-region and the minimum circumscribed rectangle bounding box of any image;
and producing a sub-region map according to a matrix of any image at the tile map level, and segmenting to obtain the tile map.
2. The method for generating a tile map of a high-performance image under big data according to claim 1, further comprising splitting the stored tile map to obtain the tile map if the memory required under the tile map level cannot have an integral large tile map.
3. The method for generating a high-performance image tile map under big data according to claim 1, wherein the obtaining of the position mapping table of any image in the stitched big map comprises the following steps:
and selecting a plane where the center of the acquired image is located as a splicing plane, obtaining a homography matrix of any image in a coordinate system, and projecting the homography matrix to the splicing plane.
4. The method of generating high-performance image tile map under big data according to claim 3, wherein the image is an image matrix M 'after j map projection transformation at ith level'ijIs expressed as:
M′ij=Si*Hj*Mij
Wherein M isijMatrix representing the image at i level, SiRepresenting a scaling matrix, HjA projection matrix for representing the projection of the jth graph at the ith level to the splicing plane at the Nth level of the tile graph; and N is a natural number greater than 1.
5. The method for generating a tile map of a high-performance image under big data according to claim 4, wherein the step of traversing the coordinate range of any image to obtain the rectangular area of any image in the stitching plane and the minimum bounding box of the rectangle after the image is projected comprises the following steps:
obtaining four vertex coordinates P of any image in large mosaici1(xi1,yi1) X is saidi1,yi1Representing pixel coordinates in the stitched large image; the i1 is a natural number greater than 0 and less than 5;
coordinate P of four vertexes of any imagei1(xi1,yi1) Converted into three-dimensional homogeneous coordinate P'i1(xi1,yi1,1);
Obtaining the coordinate P' after projection according to the homography matrix corresponding to the imagei1(x′i1,y′i1,1);
According to the projected coordinate P ″)i1(x′i1,y′i11) obtaining a minimum bounding box of the circumscribed rectangle after the image projection, wherein the expression is
Wi=Xmaxi-Xmaxi
Hi=Ymaxi-Ymaxi
Wherein, YmaxiRepresenting the maximum ordinate, Ymin, of the images in the stitched atlasiMinimum ordinate, Xmax, representing images in a stitched atlasiMaximum abscissa, Ymax, representing the image in the stitched atlasiThe smallest abscissa representing the image in the stitched large map.
6. The method for generating tile map of high-performance image under big data according to claim 5, wherein said determining the number of any level tile map comprises the following steps:
obtaining a start index and an end index, expressed as
XStarti=floor(Xmini/B)
YStarti=floor(Ymini/B)
XEndi=floor((Xmini+Wi)/B+1)
YEndi=floor((Ymini+Hi)/B+1)
Wherein XStartiDenotes the starting index, XEnd, of the tile map in the X direction at level iiIndicates the ending index, YSTart, of the X-direction tile map at level iiDenotes the starting index, YEnd, of the tile map in the Y direction at level iiRepresenting the ending index of the tile map in the Y direction at the ith level, and B representing the side length of the tile map;
obtaining the number of the tile graphs in the X direction and the Y direction, wherein the expression is as follows:
Xi2=XEndi-XStarti
Yi2=YEndi-YStarti。
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010779132.4A CN111915488B (en) | 2020-08-05 | 2020-08-05 | High-performance image tile graph generation method under big data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010779132.4A CN111915488B (en) | 2020-08-05 | 2020-08-05 | High-performance image tile graph generation method under big data |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111915488A true CN111915488A (en) | 2020-11-10 |
CN111915488B CN111915488B (en) | 2023-11-28 |
Family
ID=73288263
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010779132.4A Active CN111915488B (en) | 2020-08-05 | 2020-08-05 | High-performance image tile graph generation method under big data |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111915488B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114594107A (en) * | 2022-05-09 | 2022-06-07 | 武汉精立电子技术有限公司 | Optimization method and application of scanning path and detection method of surface of semiconductor material |
CN114627262A (en) * | 2022-05-11 | 2022-06-14 | 武汉大势智慧科技有限公司 | Image generation method and system based on oblique grid data |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020100009A1 (en) * | 2000-12-01 | 2002-07-25 | Sun Microsystem, Inc. | Piecewise linear cost propagation for path searching |
US20020104061A1 (en) * | 2000-12-01 | 2002-08-01 | Sun Microsystems, Inc. | Systems and methods for linear minimal convolution |
US20040216072A1 (en) * | 2003-04-17 | 2004-10-28 | International Business Machines Corporation | Porosity aware buffered steiner tree construction |
US20060241878A1 (en) * | 2002-12-10 | 2006-10-26 | Infineon Technologies Ag | Surface paneling module, surface paneling module arrangement and method for determining the distence of surface paneling modules of the surface paneling module arrangement to at least one reference position, processor arrangement, textile fabric structure and surface paneling structure |
CN102254312A (en) * | 2011-07-08 | 2011-11-23 | 国电南瑞科技股份有限公司 | Method for splicing geographical tile graphs |
CN103177577A (en) * | 2011-12-26 | 2013-06-26 | 北京掌城科技有限公司 | Dynamic traffic information service providing method based on map layer overlapping |
CN103699439A (en) * | 2013-12-30 | 2014-04-02 | 北京奇虎科技有限公司 | Device and method for calculating tiles in electronic map visual area |
US20140114984A1 (en) * | 2012-04-19 | 2014-04-24 | Wonga Technology Limited | Method and system for user authentication |
CN103793496A (en) * | 2014-01-22 | 2014-05-14 | 百度在线网络技术(北京)有限公司 | Processing method and system of tile images |
CN103793494A (en) * | 2014-01-22 | 2014-05-14 | 百度在线网络技术(北京)有限公司 | Processing method and system for spatial data |
CN104574339A (en) * | 2015-02-09 | 2015-04-29 | 上海安威士科技股份有限公司 | Multi-scale cylindrical projection panorama image generating method for video monitoring |
CN105072681A (en) * | 2015-07-27 | 2015-11-18 | 北京博阳世通信息技术有限公司 | Arrangement device and method for location system based on indoor space position |
US20190258251A1 (en) * | 2017-11-10 | 2019-08-22 | Nvidia Corporation | Systems and methods for safe and reliable autonomous vehicles |
CN111024087A (en) * | 2019-12-26 | 2020-04-17 | 国网上海市电力公司 | Substation inspection navigation system and navigation method |
-
2020
- 2020-08-05 CN CN202010779132.4A patent/CN111915488B/en active Active
Patent Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020104061A1 (en) * | 2000-12-01 | 2002-08-01 | Sun Microsystems, Inc. | Systems and methods for linear minimal convolution |
US20020100009A1 (en) * | 2000-12-01 | 2002-07-25 | Sun Microsystem, Inc. | Piecewise linear cost propagation for path searching |
US20060241878A1 (en) * | 2002-12-10 | 2006-10-26 | Infineon Technologies Ag | Surface paneling module, surface paneling module arrangement and method for determining the distence of surface paneling modules of the surface paneling module arrangement to at least one reference position, processor arrangement, textile fabric structure and surface paneling structure |
US20040216072A1 (en) * | 2003-04-17 | 2004-10-28 | International Business Machines Corporation | Porosity aware buffered steiner tree construction |
CN102254312A (en) * | 2011-07-08 | 2011-11-23 | 国电南瑞科技股份有限公司 | Method for splicing geographical tile graphs |
CN103177577A (en) * | 2011-12-26 | 2013-06-26 | 北京掌城科技有限公司 | Dynamic traffic information service providing method based on map layer overlapping |
US20140114984A1 (en) * | 2012-04-19 | 2014-04-24 | Wonga Technology Limited | Method and system for user authentication |
CN103699439A (en) * | 2013-12-30 | 2014-04-02 | 北京奇虎科技有限公司 | Device and method for calculating tiles in electronic map visual area |
CN103793496A (en) * | 2014-01-22 | 2014-05-14 | 百度在线网络技术(北京)有限公司 | Processing method and system of tile images |
CN103793494A (en) * | 2014-01-22 | 2014-05-14 | 百度在线网络技术(北京)有限公司 | Processing method and system for spatial data |
CN104574339A (en) * | 2015-02-09 | 2015-04-29 | 上海安威士科技股份有限公司 | Multi-scale cylindrical projection panorama image generating method for video monitoring |
CN105072681A (en) * | 2015-07-27 | 2015-11-18 | 北京博阳世通信息技术有限公司 | Arrangement device and method for location system based on indoor space position |
US20190258251A1 (en) * | 2017-11-10 | 2019-08-22 | Nvidia Corporation | Systems and methods for safe and reliable autonomous vehicles |
CN111024087A (en) * | 2019-12-26 | 2020-04-17 | 国网上海市电力公司 | Substation inspection navigation system and navigation method |
Non-Patent Citations (2)
Title |
---|
SAHELI GHOSH: "Interactive Visualizaiton For Big Spatial Data", 《PROCEEDING OF THE 2019 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA》, pages 1826 - 1828 * |
刘兆宏: "矢量室内地图建模与制作方法", 《数字通信》, vol. 39, no. 4, pages 77 - 80 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114594107A (en) * | 2022-05-09 | 2022-06-07 | 武汉精立电子技术有限公司 | Optimization method and application of scanning path and detection method of surface of semiconductor material |
CN114594107B (en) * | 2022-05-09 | 2022-08-16 | 武汉精立电子技术有限公司 | Optimization method and application of scanning path and detection method of surface of semiconductor material |
CN114627262A (en) * | 2022-05-11 | 2022-06-14 | 武汉大势智慧科技有限公司 | Image generation method and system based on oblique grid data |
Also Published As
Publication number | Publication date |
---|---|
CN111915488B (en) | 2023-11-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4981135B2 (en) | How to create a diagonal mosaic image | |
US20140125654A1 (en) | Modeling and Editing Image Panoramas | |
EP1008112B1 (en) | Techniques for creating and modifying 3d models and correlating such models with 2d pictures | |
KR100443552B1 (en) | System and method for embodying virtual reality | |
US4970666A (en) | Computerized video imaging system for creating a realistic depiction of a simulated object in an actual environment | |
US20030014224A1 (en) | Method and apparatus for automatically generating a site model | |
CN112734641A (en) | Training method and device of target detection model, computer equipment and medium | |
CN106683068A (en) | Three-dimensional digital image acquisition method and equipment thereof | |
Gao et al. | Complete scene reconstruction by merging images and laser scans | |
CA2489364A1 (en) | System for generating three-dimensional electronic models of objects | |
CN115272591B (en) | Geographic entity polymorphic expression method based on three-dimensional semantic model | |
CN111915488B (en) | High-performance image tile graph generation method under big data | |
KR19980024033A (en) | Method and apparatus for overlaying a bitmap image on an environment map | |
CN111311662A (en) | Method and device for reconstructing three-dimensional scene in real time | |
CN110245199A (en) | A kind of fusion method of high inclination-angle video and 2D map | |
CN108629742B (en) | True ortho image shadow detection and compensation method, device and storage medium | |
CN115409957A (en) | Map construction method based on illusion engine, electronic device and storage medium | |
JP2832463B2 (en) | 3D model reconstruction method and display method | |
WO2016054859A1 (en) | Electronic map hierarchical management method | |
CN115409962A (en) | Method for constructing coordinate system in illusion engine, electronic equipment and storage medium | |
CN114894198A (en) | Navigation method and system based on market three-dimensional navigation map | |
CN115170688A (en) | Optimal projection plane solving and drawing automatic generation method for spatial structure construction drawing | |
CN111563929B (en) | 2.5D webpage development method based on browser | |
CN111311745B (en) | Model placement method and device | |
JP3149389B2 (en) | Method and apparatus for overlaying a bitmap image on an environment map |
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 |