首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6篇
  免费   0篇
测绘学   5篇
地质学   1篇
  2011年   1篇
  2007年   1篇
  2006年   2篇
  1998年   1篇
  1996年   1篇
排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
A quadtree-based image segmentation procedure (HQ) is presented to map complex environmental conditions. It applies a hierarchical nested analysis of variance within the framework of multiresolution wavelet approximation. The procedure leads to an optimal solution for determining mapping units based on spatial variability with constraints on the arrangement and shape of the units. Linkages to geostatisiics are pointed out, but the HQ decomposition algorithm does not require any homogeneity criteria. The computer implementation can be parameterized by either the number of required mapping units or the maximum within-unit variance, or it can provide a spectrum of significances of nested ANOVA. The detailed mathematical background and methodology is illustrated by a salt-affected grassland mapping study (Hortobágy, Hungary), where heterogeneous environmental characteristics have been sampled and predicted based on remotely sensed images using these principles.  相似文献   
2.
介绍了将多源遥感影像数据应用于战场环境可视化之前的主要预处理方法,如影像金字塔生成、纹理数据结构准备、纹理快速调用等。该过程中所用到的小波变换、四叉树数据结构与细节层次算法等关键技术,能够有效地提高战场建模的真实感和效率。  相似文献   
3.
介绍了将多源遥感影像数据应用于战场环境可视化之前的主要预处理方法,如影像金字塔生成、纹理数据结构准备、纹理快速调用等.该过程中所用到的小波变换、四叉树数据结构与细节层次算法等关键技术,能够有效地提高战场建模的真实感和效率.  相似文献   
4.
阐述了地理信息系统空间数据库的发展,分析了全球地形数据管理对数据组织结构的要求和数据高效索引的需求。在此基础上提出了适合于网络环境下地理信息系统中海量地形数据管理以及全球地形环境构建的多分辨率四叉树金字塔地形数据管理模型,并阐述了其中涉及到的主要技术问题的解决方案。  相似文献   
5.
线性四叉树和线性八叉树邻域寻找的一种新算法   总被引:26,自引:0,他引:26  
线性四叉树和线性八叉树邻域寻找的一种新算法肖乐斌①龚建华②谢传节①(①中国科学院地理研究所资源与环境信息系统国家重点实验室,北京,100101)(②香港中文大学地理系地球信息科学联合实验室,香港)ANEWALGORITHMFORSEARCHINGNE...  相似文献   
6.
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.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号