CN115330960A - Live-action three-dimensional modeling method, device, server and storage medium - Google Patents
Live-action three-dimensional modeling method, device, server and storage medium Download PDFInfo
- Publication number
- CN115330960A CN115330960A CN202210161311.0A CN202210161311A CN115330960A CN 115330960 A CN115330960 A CN 115330960A CN 202210161311 A CN202210161311 A CN 202210161311A CN 115330960 A CN115330960 A CN 115330960A
- Authority
- CN
- China
- Prior art keywords
- sub
- space
- result
- modeled
- live
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- 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/11—Region-based segmentation
Abstract
The application discloses a live-action three-dimensional modeling method, a live-action three-dimensional modeling device, a server and a storage medium, and belongs to the field of modeling. The method comprises the following steps: acquiring a tilted photography photo set of a region to be modeled; and (3) performing judgment and null three operation processes: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be the size of the Beidou grid code with the preselected precision; if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode; otherwise, directly performing space-three operation without partitioning; partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file of each sub-block model in a preset format; and updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model. The method and the device can simplify the live-action three-dimensional modeling, inquiring or local data updating.
Description
Technical Field
The present application relates to the field of modeling technologies, and in particular, to a live-action three-dimensional modeling method, apparatus, server, and storage medium.
Background
The Beidou grid code, also known as a Beidou grid position code, is a set of novel global spatial position framework and a coding method, and is named as a new spatial position output standard listed by the national Beidou system. The Beidou grid code has the basic characteristics of global unity, multi-scale three-dimensional property, super-strong computability, good inclusive interactivity and the like.
For a future urban dynamic update scene, a crowdsourcing mode gradually becomes a mainstream mode, so that the problem of multi-source three-dimensional data query fusion update is bound to be faced. For tilt models acquired in different regions, different data formats are generally existed at present, effective fusion and utilization are difficult, querying of data in a certain region is troublesome, updating of model data in a certain region is difficult, model data in a larger range even needs to be replaced, consumed time and resources are multiplied, and accordingly real three-dimensional modeling, querying or local data updating is difficult.
Disclosure of Invention
The embodiment of the application provides a live-action three-dimensional modeling method, a live-action three-dimensional modeling device, a server and a storage medium, and can solve the problem that existing live-action three-dimensional modeling, local data query or local data update are difficult.
In a first aspect, an embodiment of the present invention provides a live-action three-dimensional modeling method, including:
acquiring an oblique photograph photo set of a region to be modeled;
performing a judgment and null-three operation process, wherein the judgment and null-three operation process comprises the following steps: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be a Beidou grid code size with a preselected precision;
if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode;
otherwise, the space-time-three operation is directly carried out without partitioning;
partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file of each sub-block model in a preset format;
and updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model.
With reference to the first aspect, in a possible implementation manner, before the partitioning according to the result of the space-three operation to obtain a plurality of sub-block models and respectively generating a three-dimensional model result file of each sub-block model in a preset format, the method further includes:
and checking whether the result of the space-time-three operation covers all Beidou grid code areas corresponding to the area to be modeled or not, if the result of the space-time-three operation does not cover all Beidou grid code areas corresponding to the area to be modeled, performing additional shooting on the uncovered area to be modeled to obtain an additional shot photo, adding the additional shot photo into the oblique photo set, and continuing the judging and space-time-three operation processes until the result of the space-time-three operation covers all Beidou grid code areas corresponding to the area to be modeled.
With reference to the first aspect, in a possible implementation manner, the partitioning according to the result of the space-three operation to obtain a plurality of sub-block models, and generating a three-dimensional model result file of each sub-block model in a preset format respectively includes:
and partitioning the result of the space-three operation according to a preset size matched with the size of the Beidou grid code set to be in the preselected precision to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file in a preset format of each sub-block model.
With reference to the first aspect, in a possible implementation manner, after the partitioning according to the result of the space-three operation to obtain a plurality of sub-block models, the method further includes:
and performing boundary alignment on each subblock model through a seed point algorithm or an edge cutting algorithm.
With reference to the first aspect, in one possible implementation manner, acquiring a tilted photographic photo set of a region to be modeled includes:
and searching the photos stored in the Beidou grid code corresponding to the area to be modeled or shooting to obtain an oblique photography photo set of the area to be modeled.
With reference to the first aspect, in one possible implementation manner, the preset size is 4"× 4".
With reference to the first aspect, in a possible implementation manner, after performing the space-three operation on the multiple subblocks in a parallel manner, the method further includes:
and carrying out merging iterative operation on the empty three results of the subblocks to obtain a merged empty three operation result.
In a second aspect, another embodiment of the present invention provides a live-action three-dimensional modeling apparatus, including:
the acquisition module is used for acquiring an oblique photography photo set of the region to be modeled;
the judgment and null-three operation module is used for carrying out a judgment and null-three operation process, and the judgment and null-three operation process comprises the following steps: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be a Beidou grid code size with a preselected precision;
if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode;
otherwise, the space-time-three operation is directly carried out without partitioning;
the generating module is used for partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models and respectively generating a three-dimensional model result file of each sub-block model in a preset format;
and the updating module is used for updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model.
In a third aspect, another embodiment of the present invention provides a server, including: a memory and a processor;
the memory is to store program instructions;
the processor is used for executing program instructions in the server, so that the server executes the real-scene three-dimensional modeling method.
In a fourth aspect, another embodiment of the present invention provides a computer-readable storage medium, where executable instructions are stored in the computer-readable storage medium, and when the executable instructions are executed by a computer, the method for real three-dimensional modeling can be implemented.
One or more technical solutions provided in the embodiments of the present invention have at least the following technical effects or advantages:
the embodiment of the invention provides a real scene three-dimensional modeling method, which comprises the following steps: a set of oblique photography photographs of a region to be modeled is obtained. And performing judgment and null-triplet operation processes, wherein the judgment and null-triplet operation processes comprise: judging whether the coverage area of the oblique photograph photo set is larger than a preset size, wherein the preset size is set to be the size of the Beidou grid code with the preselected precision; if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode; otherwise, directly performing space-three operation without partitioning; and partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file of each sub-block model in a preset format. And updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model.
According to the real-scene three-dimensional modeling method provided by the embodiment of the invention, the oblique photography photo set is divided into a plurality of sub-blocks according to the preset size, and the space-three operation is performed on the plurality of sub-blocks in a parallel mode, so that the resolving speed is increased, and the computing resources are saved. In addition, a plurality of sub-block models are obtained by partitioning according to the result of the space-three operation, and a three-dimensional model result file with a preset format of each sub-block model is generated respectively, so that the data format of the result file of each sub-block model is changed into the preset format, and further, the data can be effectively fused and utilized even for inclined models collected in different regions. And updating the original file of the Beidou grid code with preselected precision of the region to be modeled by using the result file of each sub-block model, and embedding the oblique photography module into the Beidou grid block, so that the data query of a certain region is simplified. The live-action three-dimensional modeling method is based on the Beidou grid codes, multi-source inclined data are fused with one another, updating of model data in a certain area is simplified, consumed time and resources are reduced when model data in a larger range need to be replaced, and therefore live-action three-dimensional modeling, local data inquiring or local data updating are simplified.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is apparent that the drawings in the description below are some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings may be obtained according to the drawings without creative efforts.
Fig. 1 is a flow chart of a live-action three-dimensional modeling method provided in an embodiment of the present application;
fig. 2 is a flow chart of a judgment and null-triplet operation flow provided in the embodiment of the present application;
fig. 3 is a block diagram of a flow chart for checking blank three provided in an embodiment of the present application;
fig. 4 is a schematic structural diagram of a live-action three-dimensional modeling apparatus provided in an embodiment of the present application;
FIG. 5 is a schematic diagram of a height domain direction unequal distance partitioning method (equatorial plane) provided in an embodiment of the present application;
fig. 6 is a schematic diagram of sub-block empty three results provided in the embodiment of the present application;
FIG. 7 is a schematic diagram of the entire empty three results provided by the embodiments of the present application;
fig. 8 is a picture without boundary area alignment according to an embodiment of the present application;
fig. 9 is a picture of boundary region alignment performed by a seed point algorithm according to an embodiment of the present application;
fig. 10 shows a result of sub-block reconstruction performed on a picture aligned by a boundary region according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. 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 invention.
First, related techniques or concepts related to the embodiments of the present application will be briefly described.
Big dipper grid code: the Beidou grid code is also called Beidou grid position code, and is a multi-scale discrete global geographic grid coding model suitable for navigation positioning service developed on the basis of global subdivision grid. The grid coding model provides a set of unified identification and expression method for global spatial region position information, which can identify positions and regions and better accord with the use habits and characteristics of people, so that the problems that a longitude and latitude system is difficult to solve, the uniqueness, readability, multi-scale, hierarchical association, seamless and non-overlapping of massive spatial information on identification and expression, the expression of internal information of an object and the like can be satisfactorily solved. With the deep integration of satellite navigation and sensors, cloud computing, internet and mobile communication, modern information technology has developed the development trend of big data, intellectualization and popularization, the design of the Beidou grid code is far superior to that of the existing various grid codes, the Beidou grid code has uniformity and uniqueness on global application space and objects, is a typical military and civil integration technical system, and is very suitable to be used as a big data inlet of space information and position service. In view of the above, the national standard Beidou grid position code (GB/T39409-2020) is established. The Beidou grid position code specifies grid selection and coding rules of the Beidou grid position code. The standard is suitable for the design and application of the output information of the terminal position of the Beidou satellite navigation system, and the identification, transmission and big data processing of the spatial position information.
And (3) performing a null three operation: continuously shot aerial photographic images with certain overlap are utilized, and according to a small number of field control points, a corresponding flight path model or area network model (optical or digital) on the same site is established by a photogrammetry method, so that the plane coordinates and the elevation of the encrypted points are obtained.
Referring to fig. 1, a method for real three-dimensional modeling according to an embodiment of the present invention includes steps 101 to 104.
Step 101: an oblique photography photo set of the region to be modeled, i.e., an image, is acquired.
Further, a photo stored in the Beidou grid code corresponding to the area to be modeled is searched or a tilted photography photo set of the area to be modeled is obtained through shooting. Specifically, each Beidou grid code has a corresponding geographic area, and when a tilted photograph photo set of an area to be modeled needs to be obtained, the Beidou grid codes of the area to be modeled are input, namely geographic position information and elevation information corresponding to the area to be modeled are input, and stored photos can be searched and obtained from the corresponding Beidou grid codes, so that the tilted photograph set can be obtained simply, conveniently and quickly. Alternatively, the oblique photograph album of the region to be modeled may be directly taken, so that the oblique photograph album can be accurately obtained.
Step 102: performing a judging and null-triplet operation flow, as shown in fig. 2, the judging and null-triplet operation flow includes:
step 201: and judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be the size of the Beidou grid code with the preselected precision. The coverage area of the oblique photograph album is the area of the region to be modeled which can be shot by the oblique photograph album.
Step 202: if the coverage area of the oblique photography photo set is larger than the preset size, the oblique photography photo set is divided into a plurality of subblocks according to the preset size, and the space-three operation is performed on the plurality of subblocks in a parallel mode, so that space-three results of the corresponding subblocks can be obtained (for example, fig. 6 shows a schematic diagram of the space-three results of the subblocks), the resolving speed can be accelerated, and the computing resources can be saved.
Further, after the space-three operation is performed on the plurality of subblocks in a parallel manner, the method further includes: and carrying out merging iterative operation on the empty three results of the sub-blocks to obtain a result of the merged empty three operation, so that the precision of the whole model can be improved.
Step 203: otherwise, the block division is not carried out and the space-three operation is directly carried out. For example, the preset value may be five.
After dividing the oblique photograph album into a plurality of sub-blocks according to the preset size, calculating the size (unit: meter) of each sub-block according to the longitude and latitude, namely the elevation information, as shown in fig. 5, the height (granularity in the height direction of the earth) of each grid at the same level is equal to the height of each grid at the same layer, and the height of each grid is matched with the length of the grid in the weft direction formed by corresponding level subdivision at the equator of the equal height surface corresponding to the layer, namely as shown in fig. 5, L 3 ＝h 3 ，L 2 ＝h 2 \8230noted n ＝(1+θ 0 ) n R 0 θ 0 Wherein, θ 0 The unit of the geocentric angle corresponding to the grid is rad, n is the nth three-dimensional grid counted from the bottom surface upwards (or downwards), n is an integer, n is more than or equal to 0 and is above the ground, R 0 Is the average radius of the earth in m, L n The granularity (height) of the nth grid above (or below) the earth's surface, when n =0 near the equator, L 0 Approximately 123.69m.
Alternatively, the preset size is 4 "x 4". In practice, there are many kinds of precision of the beidou trellis code, such as 15 'x 10',2 "x 2", etc. If the precision grade of the selected Beidou grid code is low, the blocking area is large, the number of oblique photographic images is increased, the modeling speed is low, the file format is large, and the change is not facilitated. And the precision of the selected Beidou grid code is low, so that a plurality of modeling sub-blocks are caused, the space-time-space-three operation is inaccurate, and the model is inaccurate. And the precision of selecting the Beidou gridding code to be 4 '× 4' can ensure that the modeling speed is high, the modeling has better effect, the file size is proper, and the Beidou gridding code is suitable for indexing and updating operations.
Step 103: and partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file with a preset format of each sub-block model, namely, block reconstruction.
Wherein the preset format is three formats of obj, osgb and 3 dtiles. Each sub-module model can generate a file in three formats, or one of the three formats can be selected, and each sub-module can generate the selected format, or one format can be selected for each sub-module. Preferably, each sub-module model generates files in three formats, so that subsequent query, fusion and the like are facilitated.
When the space-three operation is performed on a plurality of subblocks in a parallel mode, the method further comprises the following steps: and when the empty and three results of the sub-blocks are subjected to merging iterative operation to obtain a merged empty and three operation result, partitioning the empty and three operation result to obtain a plurality of sub-block models, and respectively generating the empty and three operation result in the three-dimensional model result file with the preset format of each sub-block model, namely the merged empty and three operation result.
Step 103 specifically includes: the method has the advantages that the file is blocked, the subblock models are reconstructed in parallel, the reconstruction speed is increased, the blocked three-dimensional model data file is small, conversion among different formats is facilitated, and the index speed block is updated.
Further, after the partitioning is performed according to the result of the space-three operation to obtain a plurality of sub-block models, the method further includes:
and performing boundary alignment on each sub-block model through a seed point algorithm or an edge cutting algorithm. In practice, an important step in block reconstruction is to align sub-block model boundary regions, so that sub-block modules can be perfectly embedded into Beidou grids, and it is required to ensure that no gap exists between adjacent Beidou grid blocks. The boundary region alignment can be realized through a seed point algorithm or an edge cutting algorithm. The seed point algorithm is a nearest neighbor boundary interpolation method, and removes dense point clouds outside the boundary, the calculated amount is relatively small, and the model boundary is relatively smooth. The edge cutting algorithm is a boundary surface cutting method adopted after reconstruction is completed, an external area is directly cut off, and the edge cutting algorithm is convenient to apply. Fig. 8 shows a picture without boundary region alignment, fig. 9 shows a picture with boundary region alignment performed by a seed point algorithm, and fig. 10 shows a result of sub-block reconstruction performed on the picture with boundary region alignment.
Step 104: and updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model. Therefore, the Beidou grid coding multi-level precision corresponds to the block division oblique photography three-dimensional model through geographic information and elevation information, and one block oblique photography three-dimensional model corresponds to one or more Beidou grid codes. And gridding the Beidou three-dimensional real scene model, and endowing urban objects such as buildings, landforms and the like with grid information to form the real scene model of the Beidou three-dimensional grid. By calling the Beidou grid codes of the blocks, the actual oblique photography model can be found, the space structure of the natural resources is gridded, and grid information is given to natural resource objects such as mountains, rivers and the like. By calling Beidou grid code information of an object and comparing oblique photography models of grid codes at different times, applications such as checking, analyzing and supervising of natural resources are formed.
According to the live-action three-dimensional modeling method provided by the embodiment of the invention, the oblique photography photo set is divided into a plurality of sub-blocks according to the preset size, and the space-three operation is performed on the plurality of sub-blocks in a parallel mode, so that the resolving speed is increased, and the computing resources are saved. In addition, a plurality of sub-block models are obtained by partitioning according to the result of the space-three operation, and a three-dimensional model result file with a preset format of each sub-block model is generated respectively, so that the data format of the result file of each sub-block model is changed into the preset format, and further, the data can be effectively fused and utilized even for inclined models collected in different regions. And updating the original file of the Beidou grid code with preselected precision of the region to be modeled by using the result file of each sub-block model, and embedding the oblique photography module into the Beidou grid block, so that the data query of a certain region is simplified. The live-action three-dimensional modeling method is based on the Beidou grid codes, multi-source inclined data are fused with one another, updating of model data in a certain area is simplified, consumed time and resources are reduced when model data in a larger range need to be replaced, and therefore live-action three-dimensional modeling, local data inquiring or local data updating are simplified. And only need to use the precision of presetting the size as the unit to remove the update data, overlap each other between each precision of big dipper grid code, include the high accuracy region that corresponds according to the low accuracy, preset the precision and can correspond high accuracy grid code downwards, upwards correspond low accuracy big dipper grid code, consequently the data of other each precision also can be updated. The gridding of the modeling process and the gridding of modeling data are realized.
Further, as shown in fig. 3, the method for real three-dimensional modeling according to the embodiment of the present application further includes, before step 103:
step 301: and checking whether the result of the space-three operation covers all Beidou grid code areas corresponding to the area to be modeled. Step 302: if the result of the space-three operation does not cover all Beidou grid code areas corresponding to the area to be modeled, namely, a missing area exists, the uncovered area to be modeled is subjected to additional shooting to obtain an additional shot photo, the additional shot photo is added into the oblique shot photo set, and the judgment and space-three operation processes are continued until the result of the space-three operation covers all Beidou grid code areas corresponding to the area to be modeled, namely, the step is to detect space-three, whether the result of the space-three operation is complete can be judged, for example, a schematic diagram of the whole space-three result is shown in fig. 7, and the schematic diagram indicates that the result of the space-three operation covers all Beidou grid code areas corresponding to the area to be modeled.
Another embodiment of the present application provides a live-action three-dimensional modeling apparatus 400, as shown in fig. 4, including:
an obtaining module 401 is configured to obtain a set of oblique photography photos of a region to be modeled.
Optionally, the obtaining module 401 is configured to obtain a tilted photography photo set of the region to be modeled by searching for a photo stored in the beidou grid code corresponding to the region to be modeled or by shooting.
A judgment and null-three operation module 402, configured to perform a judgment and null-three operation procedure, where the judgment and null-three operation procedure includes: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be the size of the Beidou grid code with the preselected precision; if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode; otherwise, the block division is not carried out and the space-three operation is directly carried out.
Further, the determining and null-triplet calculating module 402 is configured to perform a determining and null-triplet calculating process, where the determining and null-triplet calculating process includes: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be the size of the Beidou grid code with the preselected precision; if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub blocks according to the preset size, performing space-three operation on the plurality of sub blocks in a parallel mode, and then performing combined iterative operation on the space-three results of the sub blocks to obtain a combined space-three operation result; otherwise, the block division is not carried out and the space-three operation is directly carried out.
Optionally, the predetermined size is 4 "x 4".
The generating module 403 is configured to perform blocking according to the result of the space-time-three operation to obtain a plurality of sub-block models, and generate a three-dimensional model result file in a preset format for each sub-block model.
Further, the generating module 403 is configured to block the result of the space-three operation according to a preset size matched with the size of the beidou grid code set to the preselected precision to obtain a plurality of sub-block models, and generate a three-dimensional model result file in a preset format for each sub-block model respectively.
Further, the generating module 403 is further configured to perform blocking according to the result of the space-time-three operation to obtain a plurality of sub-block models, perform boundary alignment on each sub-block model through a seed point algorithm or an edge cutting algorithm, and then generate a three-dimensional model result file in a preset format for each sub-block model.
And the updating module 404 is configured to update the original file of the beidou grid code with the preselected accuracy of the region to be modeled with the result file of each sub-block model.
Further, the live-action three-dimensional modeling apparatus provided in the embodiment of the present application further includes:
and the checking module is used for checking whether the result of the space-three operation covers all Beidou grid code areas corresponding to the area to be modeled, if the result of the space-three operation does not cover all Beidou grid code areas corresponding to the area to be modeled, performing additional shooting on the uncovered area to be modeled to obtain an additional shot photo, adding the additional shot photo into the oblique photo set, and continuing judging and space-three operation processes until the result of the space-three operation covers all Beidou grid code areas corresponding to the area to be modeled.
Another embodiment of the present application provides a server, including: a memory and a processor.
The memory is for storing program instructions.
The processor is used for executing program instructions in the server, so that the server executes the real three-dimensional modeling method.
Another embodiment of the present application provides a computer-readable storage medium, where executable instructions are stored in the computer-readable storage medium, and when the computer executes the executable instructions, the real-scene three-dimensional modeling method described above can be implemented.
The storage medium includes, but is not limited to, a Random Access Memory (RAM), a Read-Only Memory (ROM), a Cache, a Hard Disk Drive (HDD), or a Memory Card (Memory Card). The memory may be used to store computer program instructions.
Although the present application provides method steps as in an embodiment or a flowchart, more or fewer steps may be included based on conventional or non-inventive labor. The sequence of steps recited in this embodiment is only one of many steps performed and does not represent a unique order of execution. When the device or the client product in practice executes, it can execute sequentially or in parallel according to the method shown in the embodiment or the figures (for example, in the context of parallel processors or multi-thread processing).
The apparatuses or modules illustrated in the above embodiments may be specifically implemented by a computer chip or an entity, or implemented by a product with certain functions. For convenience of description, the above devices are described as being divided into various modules by functions, which are described separately. The functionality of the modules may be implemented in the same one or more software and/or hardware implementations of the present application. Of course, a module that implements a certain function may also be implemented by a plurality of sub-modules or a combination of sub-units.
The methods, apparatus or modules herein may be implemented in a computer readable program code means for a controller in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium storing computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, application Specific Integrated Circuits (ASICs), programmable logic controllers and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, atmel AT91SAM, microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be conceived to be both a software module implementing the method and a structure within a hardware component.
Some of the modules in the apparatus of the present application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, classes, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary hardware. Based on such understanding, the technical solutions of the present application may be embodied in the form of software products or in the implementation process of data migration, which essentially or partially contributes to the prior art. The computer software product may be stored in a storage medium such as ROM/RAM, magnetic disk, optical disk, etc. and includes instructions for causing a computer device (which may be a personal computer, mobile terminal, server, or network device, etc.) to perform the methods of the various embodiments or portions of embodiments of the present application.
The embodiments in the present specification are described in a progressive manner, and the same or similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. All or portions of the present application are operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, mobile communication terminals, multiprocessor systems, microprocessor-based systems, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The above embodiments are only used to illustrate the technical solutions of the present application, and are not intended to limit the present application; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications or substitutions do not depart from the spirit and scope of the present disclosure.
Claims (10)
1. A live-action three-dimensional modeling method is characterized by comprising the following steps:
acquiring an oblique photograph photo set of a region to be modeled;
and performing a judging and null-triplet operation process, wherein the judging and null-triplet operation process comprises the following steps: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be a Beidou grid code size with a preselected precision;
if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode;
otherwise, the space-time-three operation is directly carried out without partitioning;
partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file of each sub-block model in a preset format;
and updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model.
2. The live-action three-dimensional modeling method according to claim 1, wherein before the partitioning according to the result of the space-three operation to obtain a plurality of sub-block models and respectively generating a three-dimensional model result file of each sub-block model in a preset format, the method further comprises:
and checking whether the result of the space-time-three operation covers all Beidou grid code areas corresponding to the area to be modeled or not, if the result of the space-time-three operation does not cover all Beidou grid code areas corresponding to the area to be modeled, performing additional shooting on the uncovered area to be modeled to obtain an additional shot photo, adding the additional shot photo into the oblique photo set, and continuing the judging and space-time-three operation processes until the result of the space-time-three operation covers all Beidou grid code areas corresponding to the area to be modeled.
3. A live-action three-dimensional modeling method according to claim 1 or 2, wherein the step of obtaining a plurality of sub-block models by partitioning according to the result of the space-three operation, and generating a three-dimensional model result file of each sub-block model in a preset format comprises:
and partitioning the result of the space-three operation according to a preset size matched with the size of the Beidou grid code set to be in the preselected precision to obtain a plurality of sub-block models, and respectively generating a three-dimensional model result file in a preset format of each sub-block model.
4. The live-action three-dimensional modeling method according to claim 1, wherein after obtaining a plurality of sub-block models by partitioning according to the result of the space-time-three operation, the method further comprises:
and carrying out boundary alignment on each subblock model through a seed point algorithm or an edge cutting algorithm.
5. A live-action three-dimensional modeling method according to claim 1, wherein obtaining a set of oblique photographs of the area to be modeled comprises:
and searching the photos stored in the Beidou grid code corresponding to the area to be modeled or shooting to obtain an oblique photography photo set of the area to be modeled.
6. A live-action three-dimensional modeling method according to claim 1, wherein said preset size is 4 "x 4".
7. The live-action three-dimensional modeling method according to claim 1, further comprising, after performing the space-three operation on the plurality of sub-blocks in a parallel manner:
and carrying out merging iterative operation on the empty three results of the subblocks to obtain a merged empty three operation result.
8. A live-action three-dimensional modeling apparatus, comprising:
the acquisition module is used for acquiring an oblique photography photo set of the region to be modeled;
the judgment and null-three operation module is used for carrying out a judgment and null-three operation process, and the judgment and null-three operation process comprises the following steps: judging whether the coverage area of the oblique photography photo set is larger than a preset size, wherein the preset size is set to be a Beidou grid code size with a preselected precision;
if the coverage area of the oblique photography photo set is larger than the preset size, dividing the oblique photography photo set into a plurality of sub-blocks according to the preset size, and performing space-three operation on the plurality of sub-blocks in a parallel mode;
otherwise, the space-time-three operation is directly carried out without partitioning;
the generating module is used for partitioning according to the result of the space-time-three operation to obtain a plurality of sub-block models and respectively generating a three-dimensional model result file of each sub-block model in a preset format;
and the updating module is used for updating the original file of the Beidou grid code with the preselected precision of the region to be modeled by using the result file of each sub-block model.
9. A server, comprising: a memory and a processor;
the memory is to store program instructions;
the processor is configured to execute program instructions in a server to cause the server to perform the method of three-dimensional modeling of real scenes according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores executable instructions, which when executed by a computer, can implement the method for real three-dimensional modeling according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210161311.0A CN115330960A (en) | 2022-02-22 | 2022-02-22 | Live-action three-dimensional modeling method, device, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210161311.0A CN115330960A (en) | 2022-02-22 | 2022-02-22 | Live-action three-dimensional modeling method, device, server and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115330960A true CN115330960A (en) | 2022-11-11 |
Family
ID=83915607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210161311.0A Pending CN115330960A (en) | 2022-02-22 | 2022-02-22 | Live-action three-dimensional modeling method, device, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115330960A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116206077A (en) * | 2023-03-24 | 2023-06-02 | 清华大学 | Three-dimensional reconstruction model local optimization method and device based on non-global repeated modeling |
| CN116206077B (en) * | 2023-03-24 | 2024-05-17 | 清华大学 | Three-dimensional reconstruction model local optimization method and device based on non-global repeated modeling |
-
2022
- 2022-02-22 CN CN202210161311.0A patent/CN115330960A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116206077A (en) * | 2023-03-24 | 2023-06-02 | 清华大学 | Three-dimensional reconstruction model local optimization method and device based on non-global repeated modeling |
| CN116206077B (en) * | 2023-03-24 | 2024-05-17 | 清华大学 | Three-dimensional reconstruction model local optimization method and device based on non-global repeated modeling |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109949399B (en) | Scene three-dimensional reconstruction method based on unmanned aerial vehicle aerial image | |
| US9424373B2 (en) | Site modeling using image data fusion | |
| US9189862B2 (en) | Outline approximation for point cloud of building | |
| JP7300797B2 (en) | Fusion of scalable spatio-temporal density data | |
| US20130328862A1 (en) | Geospatial representation of data-less map areas | |
| CN112069285B (en) | Map generation method and device based on three-dimensional high-precision map slice and electronic equipment | |
| EP4116935B1 (en) | High-definition map creation method and device, and electronic device | |
| CN111090712A (en) | Data processing method, device and equipment and computer storage medium | |
| Wang et al. | Fast 3D reconstruction method based on UAV photography | |
| CN115265489A (en) | Territorial mapping method and system for dynamic remote sensing monitoring | |
| CN114328795B (en) | Live-action three-dimensional data processing method, device, server and storage medium | |
| US20230394705A1 (en) | Location determination in a gps-denied environment with user annotation | |
| CN112632303A (en) | Distributed storage method, analysis method and device for image data | |
| CN115330960A (en) | Live-action three-dimensional modeling method, device, server and storage medium | |
| CN113724229B (en) | Method and device for determining elevation difference and electronic equipment | |
| CN115345990A (en) | Oblique photography three-dimensional reconstruction method and device for weak texture scene | |
| Di Staso et al. | Heterogeneous-Resolution and multi-source terrain builder for CesiumJS WebGL virtual globe | |
| Vo et al. | A parallel algorithm for local point density index computation of large point clouds | |
| CN113284238A (en) | Contour line extraction method and device, electronic equipment and storage medium | |
| Prescott et al. | A Multiresolution approach for viewsheds on 2D terrains | |
| Wu et al. | Building Facade Reconstruction Using Crowd-Sourced Photos and Two-Dimensional Maps | |
| CN113112603B (en) | Method and device for optimizing three-dimensional model | |
| CN117132744B (en) | Virtual scene construction method, device, medium and electronic equipment | |
| Lallement et al. | Bulldozer, a Free Open Source Scalable Software for DTM Extraction | |
| Haverkort et al. | A Comparison of I/O-efficient algorithms for visibility computation on massive grid terrains |
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 |