A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and im...A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and implementation of spatial data structures and nearest neighbor-finding techniques.This paper is essentially focused on the efficient representation of Digital Ele-vation Models(DEM) that entirely fit into the main memory.We propose a new hierarchical quadtree-like data structure to be built over domains of unrestricted size,and a representation of a quadtree and a binary triangles tree by means of the Hilbert and the Sierpinski space-filling curves,respectively,taking into account the hierarchical nature and the clustering properties of this kind of curves.Some triangulation schemes are described for the space-filling-curves-based approaches to efficiently visualize multiresolu-tion surfaces.展开更多
The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and...The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and the main algorithms for coordinate translation, node Lsequence generation and visiting nodes are presented. In particular,constant time algorithms for generating node Lsequence are advanced by using bit manipulation operations,which can be easily implemented with hardware. In L curve the distance between three nodes of a facet is mostly limited in a range of small value, thus making fast access possible. Though codes of sibling facets are continuous, the difference between codes of some cousins may occasionally be very large and makes the distance of a few facets also very large, thus greatly increasing the mean node distance and the total traversing distance. Therefore an m cluster of nodes is proposed as a basic storage unit fo n cluster, which should store eery shared node in each,and the distance between three nodes of a facet is limited to a controllagle scope.展开更多
Technological advancements in data analysis and data releasing have put forward higher security requirements, such as privacy guarantee and strictly provable security, this new area of research is called differential ...Technological advancements in data analysis and data releasing have put forward higher security requirements, such as privacy guarantee and strictly provable security, this new area of research is called differential privacy. As for geospatial point data, the exiting methods use the tree structure to split the data space to enhance the data utility and usually adopt uniform budgeting method. Different from this, we propose a novel non-uniform allocation scheme for privacy budget which is a parameter to specify the degree of privacy guarantee. Firstly, the spatial data is indexed by quadtree, then, different privacy budget is allocated to each layer of quadtree using Fibonacci series features, and we designate this budgeting method as Fibonacci allocation. Experimental results show that Fibonacci allocation is significantly more accurate in data queries than the state-of-the-art methods under the same privacy guarantee level and fits for arbitrary range queries. Furthermore, data utility can be improved by post-processing and threshold determination.展开更多
In this study,a two-dimensional flow-pollutant coupled model was developed based on a quadtree grid.This model was established to allow the accurate simulation of wind-driven flow in a large-scale shallow lake with ir...In this study,a two-dimensional flow-pollutant coupled model was developed based on a quadtree grid.This model was established to allow the accurate simulation of wind-driven flow in a large-scale shallow lake with irregular natural boundaries when focusing on important smallscale localized flow features.The quadtree grid was created by domain decomposition.The governing equations were solved using the finite volume method,and the normal fluxes of mass,momentum,and pollutants across the interface between cells were computed by means of a Godunov-type Osher scheme.The model was employed to simulate wind-driven flow in a circular basin with non-uniform depth.The computed values were in agreement with analytical data.The results indicate that the quadtree grid has fine local resolution and high efficiency,and is convenient for local refinement.It is clear that the quadtree grid model is effective when applied to complex flow domains.Finally,the model was used to calculate the flow field and concentration field of Taihu Lake,demonstrating its ability to predict the flow and concentration fields in an actual water area with complex geometry.展开更多
Aiming at the shortcomings of the existing wedgelet compression arithmetics, a novel contour-representing algorithm based on wedgelets is presented in this paper. Firstly the input image is binarized and the most opti...Aiming at the shortcomings of the existing wedgelet compression arithmetics, a novel contour-representing algorithm based on wedgelets is presented in this paper. Firstly the input image is binarized and the most optimized wedgelets are found by means of quadtree framework. Then the contours are reconstructed by applying the wedgelets, the data volume is compressed, and the shortcomings of the contour representation based on normal wavelet are ameliorated, the better effect for the visualization is obtained, too.展开更多
The finite cell method (FCM) combines the high-order finite element method (FEM) with the fictitious domain approach for the purpose of simple meshing. In the present study, the FCM is used to the Prandtl-Reuss fl...The finite cell method (FCM) combines the high-order finite element method (FEM) with the fictitious domain approach for the purpose of simple meshing. In the present study, the FCM is used to the Prandtl-Reuss flow theory of plasticity, and the results are compared with the h-version finite element method (h-FEM). The numerical results show that the FCM is more efficient compared to the h-FEM for elasto-plastic problems, although the mesh does not conform to the boundary. It is also demonstrated that the FCM performs well for elasto-plastic loading and unloading.展开更多
A spatially adaptive (SA) two-dimensional (2-D) numerical wave flume is presented based on the quadtree mesh system,in which a new multiple particle level set (MPLS) method is proposed to solve the problem of interfac...A spatially adaptive (SA) two-dimensional (2-D) numerical wave flume is presented based on the quadtree mesh system,in which a new multiple particle level set (MPLS) method is proposed to solve the problem of interface tracking,in which common intersection may be traversed by multiple interfaces.By using the adaptive mesh technique and the MPLS method,mesh resolution is updated automatically with time according to flow characteristics in the modeling process with higher resolution around the free surface and the solid boundary and lower resolution in less important area.The model has good performance in saving computer memory and CPU time and is validated by computational examples of small amplitude wave,second-order Stokes wave and cnoidal wave.Computational results also indicate that standing wave and wave overtopping are also reasonably simulated by the model.展开更多
Aiming to deal with the difficult issues of terrain data model simplification and crack disposal,the paper proposed an improved level of detail(LOD)terrain rendering algorithm,in which a variation coefficient of eleva...Aiming to deal with the difficult issues of terrain data model simplification and crack disposal,the paper proposed an improved level of detail(LOD)terrain rendering algorithm,in which a variation coefficient of elevation is introduced to express the undulation of topography.Then the coefficient is used to construct a node evaluation function in the terrain data model simplification step.Furthermore,an edge reduction strategy is combined with the improved restrictive quadtree segmentation to handle the crack problem.The experiment results demonstrated that the proposed method can reduce the amount of rendering triangles and enhance the rendering speed on the premise of ensuring the rendering effect compared with a traditional LOD algorithm.展开更多
Spatial topology rule is the primary method to insure the consistency and validity of spatial topology relation in GIS software. Topology rule can be divided into three categories according to geographic entity’s geo...Spatial topology rule is the primary method to insure the consistency and validity of spatial topology relation in GIS software. Topology rule can be divided into three categories according to geographic entity’s geometric shape: point topology rule, line topology rule and polygon topology rule. At first, this paper summarizes the various linear geographic entities’ topological relations which have practical application, then designs a series of linear entity topology rules detailedly. Based on these rules, this paper proposes a topology rule checking algorithm using quadtree, which is designed on the basis of MAPGIS7.4 spatial data model. The algorithm has already been applied to MAPGIS platform and gained good effects.展开更多
This paper presents a new wavelet transform image coding method. On the basis of a hierarchical wavelet decomposition of images, entropy constrained vector quantization is employed to encode the wavelet coefficients...This paper presents a new wavelet transform image coding method. On the basis of a hierarchical wavelet decomposition of images, entropy constrained vector quantization is employed to encode the wavelet coefficients at all the high frequency bands with展开更多
Rock glaciers are typical periglacial landforms with tongue or lobate morphological shapes and characterized by the distinct front,lateral margins,and often by ridge-and-furrow surface topography textures as well as k...Rock glaciers are typical periglacial landforms with tongue or lobate morphological shapes and characterized by the distinct front,lateral margins,and often by ridge-and-furrow surface topography textures as well as kinematic characteristics,widely distributed in alpine environments.Multitemporal Synthetic aperture radar interferometry(MT-InSAR),is a remote sensing technique with demonstrated effectiveness for detecting landform kinematics.However,its application to rock glaciers is challenged by temporal decorrelation and atmospheric phase noises due to complex topography and snow cover.We designed a quadtree segmentation and parallel computing-based MT-InSAR method to improve the quality and efficiency of deformation measurement of rock glaciers.We applied the method to a rock glacier inventory of the Nyainqentanglha Range,China,derived from high-resolution Gaofen-2 images,to quantify the activity rate of each rock glacier.Results showed that 32.1%(6,389)of the identified rock glaciers exhibited slope-parallel deformation rates exceeding 100 mm/y.The activities of the rock glaciers exhibited strong correlations with their distance to glaciers,precipitation,freeze-thaw magnitude,and permafrost occurrence probability.The results demonstrate the effectiveness of the developed segmentation-parallel MT-InSAR method for monitoring rock glacier deformation over a large region.展开更多
To improve the embedding capacity of reversible data hiding in encrypted images(RDH-EI),a new RDH-EI scheme is proposed based on adaptive quadtree partitioning and most significant bit(MSB)prediction.First,according t...To improve the embedding capacity of reversible data hiding in encrypted images(RDH-EI),a new RDH-EI scheme is proposed based on adaptive quadtree partitioning and most significant bit(MSB)prediction.First,according to the smoothness of the image,the image is partitioned into blocks based on adaptive quadtree partitioning,and then blocks of different sizes are encrypted and scrambled at the block level to resist the analysis of the encrypted images.In the data embedding stage,the adaptive MSB prediction method proposed by Wang and He(2022)is improved by taking the upper-left pixel in the block as the target pixel,to predict other pixels to free up more embedding space.To the best of our knowledge,quadtree partitioning is first applied to RDH-EI.Simulation results show that the proposed method is reversible and separable,and that its average embedding capacity is improved.For gray images with a size of 512×512,the average embedding capacity is increased by 25565 bits.For all smooth images with improved embedding capacity,the average embedding capacity is increased by about 35530 bits.展开更多
To reduce the complexity of large-scene high-resolution maps while using the dead-end information distributed in the unmanned vehicle driving environment,we propose a novel non-uniform quadtree map-building method inc...To reduce the complexity of large-scene high-resolution maps while using the dead-end information distributed in the unmanned vehicle driving environment,we propose a novel non-uniform quadtree map-building method including dead-end semantic information extraction.By utilizing quadtree data structures,submaps and a positive-order tree depth organization approach,our proposed map can adapt to the large-scale high-resolution requirement and expand more easily to larger environments.To verify the practicality of our proposed map,we have successfully implemented map matching and path planning in real environments.Additionally,we effectively extract the dead-end semantic information that widely distributes in the environment,which can help unmanned vehicles avoid collisions and improve the search efficiency of the planning procedure.We evaluate our method with KITTI datasets,CARLA Simulator,and our self-collected real-world datasets.The experimental results show that our proposed method significantly reduces the complexity of large-scale high-resolution maps,effectively extracts dead-end semantic information,and has good practicality in real environments.The implementation of our method is released here:https://github.com/biter0088/Non-uniform-quadtree-map.展开更多
This paper proposed a virtual quadtree (VQT) based loose architecture of multi-level massive geospatial data for integrating massive geospatial data dispersed in the departments of different hierarchies in the same se...This paper proposed a virtual quadtree (VQT) based loose architecture of multi-level massive geospatial data for integrating massive geospatial data dispersed in the departments of different hierarchies in the same sector into a unified GIS (Geographic Information System) platform. By virtualizing the nodes of the quad-tree,the VQT separates the structure of data organization from data storage,and screens the difference between the data storage in local computer and in the re-mote computers in network environment. And by mounting,VQT easily integrates the data from the remote computers into the local VQT so as to implement seam-less integration of distributed multi-level massive geospatial data. Based on that mode,the paper built an application system with geospatial data over 1200 GB distributed in 12 servers deployed in 12 cities. The experiment showed that all data can be seamlessly rapidly traveled and performed zooming in and zooming out smoothly.展开更多
A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run l...A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.展开更多
Motion segmentation in moving camera videos is a very challenging task because of the motion dependence between the camera and moving objects. Camera motion compensation is recognized as an effective approach. However...Motion segmentation in moving camera videos is a very challenging task because of the motion dependence between the camera and moving objects. Camera motion compensation is recognized as an effective approach. However, existing work depends on prior-knowledge on the camera motion and scene structure for model selection. This is not always available in practice. Moreover, the image plane motion suffers from depth variations, which leads to depth-dependent motion segmentation in 3D scenes. To solve these problems, this paper develops a prior-free dependent motion segmentation algorithm by introducing a modified Helmholtz-Hodge decomposition (HHD) based object-motion oriented map (OOM). By decomposing the image motion (optical flow) into a curl-free and a divergence-free component, all kinds of camera-induced image motions can be represented by these two components in an invariant way. HHD identifies the camera-induced image motion as one segment irrespective of depth variations with the help of OOM. To segment object motions from the scene, we deploy a novel spatio-temporal constrained quadtree labeling. Extensive experimental results on benchmarks demonstrate that our method improves the performance of the state-of-the-art by 10%-20% even over challenging scenes with complex background.展开更多
With the characteristic of the quadtree data structure, a new mesh generation method, which adopts square meshes to decompose a background domain and a cut cell approach to express arbitrary boundaries, is proposed to...With the characteristic of the quadtree data structure, a new mesh generation method, which adopts square meshes to decompose a background domain and a cut cell approach to express arbitrary boundaries, is proposed to keep the grids generated with a good orthogonality easily. The solution of N-S equations via finite volume method for this kind of unstructured meshes is derived. The mesh generator and N-S solver are implemented to study two benchmark cases, i.e. a lid driven flow within an inclined square and a natural convection heat transfer flow in a square duct with an inner hot circular face. The simulation results are in agreement with the benchmark values, verifying that the present methodology is valid and will be a strong tool for two-dimensional flow and heat transfer simulations, especially in the case of complex boundaries.展开更多
Collision detection is an important component in simulation applications which are based on virtual geographic information system(VGIS).In this paper,an effective collision detection algorithm for multiple objects in ...Collision detection is an important component in simulation applications which are based on virtual geographic information system(VGIS).In this paper,an effective collision detection algorithm for multiple objects in VGIS,VGISCOLLIDE,is presented.The algorithm firstly integrates existing quadtree,which is the global hierarchical structure of VGIS,with axis-aligned bounding box of object to perform the broad-phase of collision detection.After that,exact collision detection between two objects which have passed the broad-phase of collision detection is performed.The algorithm makes no assumption about input primitives or object’s motion and is directly applicable to all triangulated models.It can be applicable to both rigid and deformable objects without preprocessing.The performance of the algorithm has been demonstrated in several environments consisting of a high number of objects with hundreds of thousands of triangles.展开更多
Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here,aiming to cope with highly non-uniform resolution simulations employing a meshless method.The new procedure,coined Qu...Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here,aiming to cope with highly non-uniform resolution simulations employing a meshless method.The new procedure,coined Quadtree Cells Grid,has been implemented in Smoothed Particle Hydrodynamics(SPH).The SPH scheme employed is adaptive,thus allowing for particle refinement in desired regions of the flow.Owing to the wide range of coexisting particle mass levels,standard linked-list neighbor search algorithms become ineffective.Hence,an alternative is found based on the use of hierarchical data structures,using quadtrees(in 2D problems).The present algorithm exploits the advantages of both linked-lists and quadtree meth-ods with the goal of increasing computational efficiency,when dealing with highly non-uniform particle distributions.Test cases involving two distinct flow problems have demonstrated that the computational cost of the current adaptive neighbor finding algorithm scales linearly with the total number of particles,thus retrieving this characteristic of linkedlists in uniform grid search.Nevertheless,the memory usage increased as a result of the more complex data structure.展开更多
基金Supported by the GeneSIG Project, University of Informatics Sciences (UCI), Havana, Cuba
文摘A space-filling curve in 2,3,or higher dimensions can be thought as a path of a continuously moving point.As its main goal is to preserve spatial proximity,this type of curves has been widely used in the design and implementation of spatial data structures and nearest neighbor-finding techniques.This paper is essentially focused on the efficient representation of Digital Ele-vation Models(DEM) that entirely fit into the main memory.We propose a new hierarchical quadtree-like data structure to be built over domains of unrestricted size,and a representation of a quadtree and a binary triangles tree by means of the Hilbert and the Sierpinski space-filling curves,respectively,taking into account the hierarchical nature and the clustering properties of this kind of curves.Some triangulation schemes are described for the space-filling-curves-based approaches to efficiently visualize multiresolu-tion surfaces.
文摘The sequence of facets and nodes has a direct influence on the efficiency of access to spherical triangle region quadtree. Based on the labeling schema by Lee, spatial curves both for facets and nodes are proposed and the main algorithms for coordinate translation, node Lsequence generation and visiting nodes are presented. In particular,constant time algorithms for generating node Lsequence are advanced by using bit manipulation operations,which can be easily implemented with hardware. In L curve the distance between three nodes of a facet is mostly limited in a range of small value, thus making fast access possible. Though codes of sibling facets are continuous, the difference between codes of some cousins may occasionally be very large and makes the distance of a few facets also very large, thus greatly increasing the mean node distance and the total traversing distance. Therefore an m cluster of nodes is proposed as a basic storage unit fo n cluster, which should store eery shared node in each,and the distance between three nodes of a facet is limited to a controllagle scope.
基金supported by National Basic Research Program of China(973 Program)under Grant No.2011CB302306The National Natural Science Foundation of China under Grant No.41371402The Fundamental Research Funds for the Central Universities under Grant No.2015211020201
文摘Technological advancements in data analysis and data releasing have put forward higher security requirements, such as privacy guarantee and strictly provable security, this new area of research is called differential privacy. As for geospatial point data, the exiting methods use the tree structure to split the data space to enhance the data utility and usually adopt uniform budgeting method. Different from this, we propose a novel non-uniform allocation scheme for privacy budget which is a parameter to specify the degree of privacy guarantee. Firstly, the spatial data is indexed by quadtree, then, different privacy budget is allocated to each layer of quadtree using Fibonacci series features, and we designate this budgeting method as Fibonacci allocation. Experimental results show that Fibonacci allocation is significantly more accurate in data queries than the state-of-the-art methods under the same privacy guarantee level and fits for arbitrary range queries. Furthermore, data utility can be improved by post-processing and threshold determination.
基金supported by the National Natural Science Foundation of China(Grants No.51739002 and 51479064)the World-Class Universities(Disciplines)and Characteristic Development Guidance Funds for the Central Universitiesthe Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions(Grant No.PPZY2015A051)
文摘In this study,a two-dimensional flow-pollutant coupled model was developed based on a quadtree grid.This model was established to allow the accurate simulation of wind-driven flow in a large-scale shallow lake with irregular natural boundaries when focusing on important smallscale localized flow features.The quadtree grid was created by domain decomposition.The governing equations were solved using the finite volume method,and the normal fluxes of mass,momentum,and pollutants across the interface between cells were computed by means of a Godunov-type Osher scheme.The model was employed to simulate wind-driven flow in a circular basin with non-uniform depth.The computed values were in agreement with analytical data.The results indicate that the quadtree grid has fine local resolution and high efficiency,and is convenient for local refinement.It is clear that the quadtree grid model is effective when applied to complex flow domains.Finally,the model was used to calculate the flow field and concentration field of Taihu Lake,demonstrating its ability to predict the flow and concentration fields in an actual water area with complex geometry.
基金The project was supported by the National Natural Science Foundation of China (60275012) and LiuHui Center for Ap-plied Mathematics , Nankai University & Tianjin University
文摘Aiming at the shortcomings of the existing wedgelet compression arithmetics, a novel contour-representing algorithm based on wedgelets is presented in this paper. Firstly the input image is binarized and the most optimized wedgelets are found by means of quadtree framework. Then the contours are reconstructed by applying the wedgelets, the data volume is compressed, and the shortcomings of the contour representation based on normal wavelet are ameliorated, the better effect for the visualization is obtained, too.
基金supported by the Alexander von Humboldt Foundation
文摘The finite cell method (FCM) combines the high-order finite element method (FEM) with the fictitious domain approach for the purpose of simple meshing. In the present study, the FCM is used to the Prandtl-Reuss flow theory of plasticity, and the results are compared with the h-version finite element method (h-FEM). The numerical results show that the FCM is more efficient compared to the h-FEM for elasto-plastic problems, although the mesh does not conform to the boundary. It is also demonstrated that the FCM performs well for elasto-plastic loading and unloading.
基金The Innovative Research Groups of the National Natural Science Foundation of China under contract No.51021004the National Natural Science Foundation for Youth of China under contract No. 51109018+2 种基金the Open Foundation of Water & Sediment Science and Water Hazard Prevention Hunan Provincial Key Laboratory under contract No. 2011SS05the Open Foundation of Port,Coastal and offshore Engineering Hunan Provincial Key Discipline under contract No. 20110815001the Open Foundation of State Key Laboratory of Hydraulic Engineering Simulation and Safety under contract No.HSSKLTJU-201208.
文摘A spatially adaptive (SA) two-dimensional (2-D) numerical wave flume is presented based on the quadtree mesh system,in which a new multiple particle level set (MPLS) method is proposed to solve the problem of interface tracking,in which common intersection may be traversed by multiple interfaces.By using the adaptive mesh technique and the MPLS method,mesh resolution is updated automatically with time according to flow characteristics in the modeling process with higher resolution around the free surface and the solid boundary and lower resolution in less important area.The model has good performance in saving computer memory and CPU time and is validated by computational examples of small amplitude wave,second-order Stokes wave and cnoidal wave.Computational results also indicate that standing wave and wave overtopping are also reasonably simulated by the model.
基金Supported by the National Natural Science Foundation of China(61363075)the National High Technology Research and Development Program of China(863 Program)(2012AA12A308)the Yue Qi Young Scholars Program of China University of Mining&Technology,Beijing(800015Z1117)
文摘Aiming to deal with the difficult issues of terrain data model simplification and crack disposal,the paper proposed an improved level of detail(LOD)terrain rendering algorithm,in which a variation coefficient of elevation is introduced to express the undulation of topography.Then the coefficient is used to construct a node evaluation function in the terrain data model simplification step.Furthermore,an edge reduction strategy is combined with the improved restrictive quadtree segmentation to handle the crack problem.The experiment results demonstrated that the proposed method can reduce the amount of rendering triangles and enhance the rendering speed on the premise of ensuring the rendering effect compared with a traditional LOD algorithm.
文摘Spatial topology rule is the primary method to insure the consistency and validity of spatial topology relation in GIS software. Topology rule can be divided into three categories according to geographic entity’s geometric shape: point topology rule, line topology rule and polygon topology rule. At first, this paper summarizes the various linear geographic entities’ topological relations which have practical application, then designs a series of linear entity topology rules detailedly. Based on these rules, this paper proposes a topology rule checking algorithm using quadtree, which is designed on the basis of MAPGIS7.4 spatial data model. The algorithm has already been applied to MAPGIS platform and gained good effects.
文摘This paper presents a new wavelet transform image coding method. On the basis of a hierarchical wavelet decomposition of images, entropy constrained vector quantization is employed to encode the wavelet coefficients at all the high frequency bands with
基金funded by the National Natural Science Foundation of China[grant number 4217011817]State Key Laboratory of Tibetan Plateau Earth System Environment and Resources(TPESER)Youth Innovation Key Program[grant number TPESER-QNCX2022ZD-04].
文摘Rock glaciers are typical periglacial landforms with tongue or lobate morphological shapes and characterized by the distinct front,lateral margins,and often by ridge-and-furrow surface topography textures as well as kinematic characteristics,widely distributed in alpine environments.Multitemporal Synthetic aperture radar interferometry(MT-InSAR),is a remote sensing technique with demonstrated effectiveness for detecting landform kinematics.However,its application to rock glaciers is challenged by temporal decorrelation and atmospheric phase noises due to complex topography and snow cover.We designed a quadtree segmentation and parallel computing-based MT-InSAR method to improve the quality and efficiency of deformation measurement of rock glaciers.We applied the method to a rock glacier inventory of the Nyainqentanglha Range,China,derived from high-resolution Gaofen-2 images,to quantify the activity rate of each rock glacier.Results showed that 32.1%(6,389)of the identified rock glaciers exhibited slope-parallel deformation rates exceeding 100 mm/y.The activities of the rock glaciers exhibited strong correlations with their distance to glaciers,precipitation,freeze-thaw magnitude,and permafrost occurrence probability.The results demonstrate the effectiveness of the developed segmentation-parallel MT-InSAR method for monitoring rock glacier deformation over a large region.
基金supported by the National Natural Science Foundation of China(Nos.62272478,61872384,and 62102451)the Basic Frontier Research Foundation of Engineering University of PAP,China(Nos.WJY202012 and WJY202112)。
文摘To improve the embedding capacity of reversible data hiding in encrypted images(RDH-EI),a new RDH-EI scheme is proposed based on adaptive quadtree partitioning and most significant bit(MSB)prediction.First,according to the smoothness of the image,the image is partitioned into blocks based on adaptive quadtree partitioning,and then blocks of different sizes are encrypted and scrambled at the block level to resist the analysis of the encrypted images.In the data embedding stage,the adaptive MSB prediction method proposed by Wang and He(2022)is improved by taking the upper-left pixel in the block as the target pixel,to predict other pixels to free up more embedding space.To the best of our knowledge,quadtree partitioning is first applied to RDH-EI.Simulation results show that the proposed method is reversible and separable,and that its average embedding capacity is improved.For gray images with a size of 512×512,the average embedding capacity is increased by 25565 bits.For all smooth images with improved embedding capacity,the average embedding capacity is increased by about 35530 bits.
文摘To reduce the complexity of large-scene high-resolution maps while using the dead-end information distributed in the unmanned vehicle driving environment,we propose a novel non-uniform quadtree map-building method including dead-end semantic information extraction.By utilizing quadtree data structures,submaps and a positive-order tree depth organization approach,our proposed map can adapt to the large-scale high-resolution requirement and expand more easily to larger environments.To verify the practicality of our proposed map,we have successfully implemented map matching and path planning in real environments.Additionally,we effectively extract the dead-end semantic information that widely distributes in the environment,which can help unmanned vehicles avoid collisions and improve the search efficiency of the planning procedure.We evaluate our method with KITTI datasets,CARLA Simulator,and our self-collected real-world datasets.The experimental results show that our proposed method significantly reduces the complexity of large-scale high-resolution maps,effectively extracts dead-end semantic information,and has good practicality in real environments.The implementation of our method is released here:https://github.com/biter0088/Non-uniform-quadtree-map.
基金the National Natural Science Foundation of China (Grant No. 2006AA12Z208)the CAS Innovation Program (Grant No. KZCX2-YW-304-02)
文摘This paper proposed a virtual quadtree (VQT) based loose architecture of multi-level massive geospatial data for integrating massive geospatial data dispersed in the departments of different hierarchies in the same sector into a unified GIS (Geographic Information System) platform. By virtualizing the nodes of the quad-tree,the VQT separates the structure of data organization from data storage,and screens the difference between the data storage in local computer and in the re-mote computers in network environment. And by mounting,VQT easily integrates the data from the remote computers into the local VQT so as to implement seam-less integration of distributed multi-level massive geospatial data. Based on that mode,the paper built an application system with geospatial data over 1200 GB distributed in 12 servers deployed in 12 cities. The experiment showed that all data can be seamlessly rapidly traveled and performed zooming in and zooming out smoothly.
基金Supported by the National High-Tech Research and Development (863) Program of China (No. 2006AA04Z211)
文摘A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.
基金This work is supported by the National Natural Science Foundation of China under Grant No. 61503277.
文摘Motion segmentation in moving camera videos is a very challenging task because of the motion dependence between the camera and moving objects. Camera motion compensation is recognized as an effective approach. However, existing work depends on prior-knowledge on the camera motion and scene structure for model selection. This is not always available in practice. Moreover, the image plane motion suffers from depth variations, which leads to depth-dependent motion segmentation in 3D scenes. To solve these problems, this paper develops a prior-free dependent motion segmentation algorithm by introducing a modified Helmholtz-Hodge decomposition (HHD) based object-motion oriented map (OOM). By decomposing the image motion (optical flow) into a curl-free and a divergence-free component, all kinds of camera-induced image motions can be represented by these two components in an invariant way. HHD identifies the camera-induced image motion as one segment irrespective of depth variations with the help of OOM. To segment object motions from the scene, we deploy a novel spatio-temporal constrained quadtree labeling. Extensive experimental results on benchmarks demonstrate that our method improves the performance of the state-of-the-art by 10%-20% even over challenging scenes with complex background.
基金Supported by Japan Society for the Promotion of Science (Grant No.C20560175) the National Natural Science Foundation of China (Grant Nos.10872159 and 40675011)
文摘With the characteristic of the quadtree data structure, a new mesh generation method, which adopts square meshes to decompose a background domain and a cut cell approach to express arbitrary boundaries, is proposed to keep the grids generated with a good orthogonality easily. The solution of N-S equations via finite volume method for this kind of unstructured meshes is derived. The mesh generator and N-S solver are implemented to study two benchmark cases, i.e. a lid driven flow within an inclined square and a natural convection heat transfer flow in a square duct with an inner hot circular face. The simulation results are in agreement with the benchmark values, verifying that the present methodology is valid and will be a strong tool for two-dimensional flow and heat transfer simulations, especially in the case of complex boundaries.
基金supported by a Grant from the National High Technology Research and Development Program of China(863 Programme)(No.2009AA12Z331).
文摘Collision detection is an important component in simulation applications which are based on virtual geographic information system(VGIS).In this paper,an effective collision detection algorithm for multiple objects in VGIS,VGISCOLLIDE,is presented.The algorithm firstly integrates existing quadtree,which is the global hierarchical structure of VGIS,with axis-aligned bounding box of object to perform the broad-phase of collision detection.After that,exact collision detection between two objects which have passed the broad-phase of collision detection is performed.The algorithm makes no assumption about input primitives or object’s motion and is directly applicable to all triangulated models.It can be applicable to both rigid and deformable objects without preprocessing.The performance of the algorithm has been demonstrated in several environments consisting of a high number of objects with hundreds of thousands of triangles.
基金supported by Fundacao para a Ciencia e a Tecnologia(FCT),through IDMEC,under LAETA,project UID/EMS/50022/2013The financial support via FCT grant SFRH/BSAB/114588/2016 is also acknowledged.
文摘Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here,aiming to cope with highly non-uniform resolution simulations employing a meshless method.The new procedure,coined Quadtree Cells Grid,has been implemented in Smoothed Particle Hydrodynamics(SPH).The SPH scheme employed is adaptive,thus allowing for particle refinement in desired regions of the flow.Owing to the wide range of coexisting particle mass levels,standard linked-list neighbor search algorithms become ineffective.Hence,an alternative is found based on the use of hierarchical data structures,using quadtrees(in 2D problems).The present algorithm exploits the advantages of both linked-lists and quadtree meth-ods with the goal of increasing computational efficiency,when dealing with highly non-uniform particle distributions.Test cases involving two distinct flow problems have demonstrated that the computational cost of the current adaptive neighbor finding algorithm scales linearly with the total number of particles,thus retrieving this characteristic of linkedlists in uniform grid search.Nevertheless,the memory usage increased as a result of the more complex data structure.