共查询到20条相似文献，搜索用时 78 毫秒
1.
针对点状符号神经网络识别中的旋转、缩放不变性问题,利用不变性特征输入和构建旋转、缩放不变性网络两种方法加以实现。前者的关键是提取符号的不变性特征作为网络的输入,后者的重点是构造复合神经网络实现不变性识别分类。 相似文献
2.
3.
4.
针对目前矢量地理数据零水印算法鲁棒性差的问题,提出了一种基于DFT的矢量地理数据零水印算法。首先,利用Douglas-Peucker压缩算法提取矢量地理数据特征点;其次,对特征点进行DFT变换,得到矢量特征点的相位序列;接着,计算相位序列符号值,若该相位符号值大于等于0,其符号值为1,否则为0;然后,对N×N大小的水印图像进行Arnold置乱,得到置乱后水印图像;最后,从第2个相位符号值开始,选取前N×N个相位符号值构成特征矩阵并与置乱后的水印图像进行异或运算来构造零水印图像。实验结果表明该算法对平移、旋转等几何攻击具有鲁棒性,并对增点、删点攻击和坐标系转换攻击鲁棒性较好,具有一定的实用性。 相似文献
5.
6.
目前网络动态地图符号主要分为两种,一种是实时数据动态符号;另一种是由符号内的动画表现动态性,其变化与地物实时属性变化没有关系。第一种研究较多,应用领域也比较广泛。而第二种研究一般是作为第一种的辅助,并没有进行系统的研究。本文基于静态符号的设计基础和原则上,提出了网络动画类动态符号的相关概念、设计原则,以及动态符号在地图中显示原则。 相似文献
7.
针埘GDI＋绘制复杂线状符号存在符号不可编辑与遮捎等问题,设计了一种可编辑的复杂线状符号的组织方法,该方法将复杂线状符号分解为实线、虚线和点线蔓种基本单元,进而设计了基于这一种基本单元的复杂线状符号参数描述方法,解决了GDI＋绘制复杂线状符号存在符号不可编辑与遮挡等问题。采用C#实现了可编辑线状符弓库的设计与开发．建立了1：10000地形图符号库。最后,对本文方法与GDI＋方法的绘制效率进行了比较试验。试验表明本文方法不仅解决了GDI＋绘制复杂线状符号存在符号不可编辑与遮挡等问题．并且绘制效率也明显优于GDI＋方法． 相似文献
8.
9.
10.
11.
为了系统验证SINS／GPS紧组合系统的性能,基于GPS软件接收机,进行了仿真系统构建。仿真系统由轨迹发生器、GPS中频信号模拟器、IMU信号模拟器、GPS软件接收机、SINS导航解算模块、组合滤波算法和导航性能分析模块等部分构成,其中详细设计了GPS软件接收机中的捕获和跟踪算法、SINS解算以及基于伪距和伪距率的组合滤波算法。仿真结果表明：紧组合导航系统收敛性较好,能够一定程度上抑制惯导系统误差的积累,有较好的导航性能。设计的该系统满足紧组合导航系统性能验证的需要,也为后续的超紧组合研究奠定了良好的基础。 相似文献
12.
GPS控制网优化设计系统 总被引：3，自引：0，他引：3
PS控制网优化设计系统是应用面向对象的可视化语言Visual Basic编写的，系统具有网形设计、精度估算、可靠性估算、误差可视化、图形显示与绘制、坐标系统转换、换萨计算、不同投影面之间的换算和数据查询等功能。 相似文献
13.
14.
Tarek M.A. ZHU Qing 《地球空间信息科学学报》2007,10(4):269-275
In general, to reconstruct the accurate shape of buildings, we need at least one stereomodel (two photographs) for each building. In most cases, however, only a single non-metric photograph is availabl... 相似文献
15.
《International Journal of Digital Earth》2013,6(6):431-450
Typhoons are usually accompanied by strong winds, heavy rain, storm surges and other disastrous events, and they are the most severe weather phenomena in the western part of the North Pacific Ocean. Visualisation is a key technology for analysing and presenting climate simulations and observations together with related social and ecological data. Virtual globes are a logical platform for visualising such geospatial data via the Internet. To implement interactive visualisation of typhoon data within virtual globes, this study provides a 3D texture-mapping algorithm to render volume textures on a globe. In addition, a systematic framework is proposed in which a hierarchical octree-based multiresolution data structure is implemented to organise the large volume dataset, and a graphics processing unit-based dynamic interpolation approach is proposed to obtain a smooth effect. Finally, the structure is combined with a level of detail strategy to enable the rendering of dynamic volumetric data at an acceptable interactive frame rate. To demonstrate the capabilities of this framework, data for a simulated typhoon event were rendered in World Wind, an open-source virtual globe. The experimental results demonstrate that the application of the proposed strategies can result in an interactive visualisation performance that renders typhoon data on virtual globes. 相似文献
16.
SHILing 《地球空间信息科学学报》2005,8(2):148-151
Parallel machine problems with a single server and release times are generahzatlons ot classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All thesesetups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases. 相似文献
17.
针对目前精度评价尺度单一的问题,提出基于直方变差图的多尺度精度评价方法,分别在像元尺度和亚像元尺度进行土地覆盖数据集精度评价。在像元尺度利用驻点作为采样工具直接评价数据集精度;亚像元尺度上,则利用非严格定义的驻点和驻点直方变差图对不同面积和空间结构的优势类进行精度评价。并以浙江北部典型区域为实验区,Landsat TM/ETM+为参考数据,对UMD、IGBP DISCover、MOD12Q1-2001、GLC2000、GlobCover2009等5种大尺度土地覆盖数据集进行多尺度精度评价实验。结果表明,多尺度精度评价方法能够全面地评价土地覆盖数据集的精度,提供更加丰富的多尺度精度信息。像元尺度精度评价可在一定程度上消除由于参考数据与数据集间的空间匹配造成的误差,评价结果更加客观;亚像元尺度精度评价能有效反映亚像元尺度优势地物面积及空间结构与精度的关系。 相似文献
18.
土壤养分数据库的建设是我国数字土壤建设的重要基础性工作之一。本文基于县域大比例尺耕地土壤养分数据,以山东省耕地土壤养分数据库建设为例,对数据库构建中的土壤养分空间数据库建立、属性数据库建立、空间与属性数据库关联、土壤养分分析等具体环节和关键技术进行研究,基本形成了省域跨尺度耕地土壤养分数据库构建关键技术体系。本文研究结果可为省域耕地土壤养分数据库建设提供技术支撑,为区域耕地资源的利用管理提供科学依据。 相似文献
19.
A general framework for error analysis in measurement-based GIS Part 2: The algebra-based probability model for point-in-polygon analysis 总被引：2，自引：1，他引：1
This is the second paper of a four-part series of papers on the development of a general framework for error analysis in measurement-based geographic information systems (MBGIS). In this paper, we discuss the problem of point-in-polygon analysis under randomness, i.e., with random measurement error (ME). It is well known that overlay is one of the most important operations in GIS, and point-in-polygon analysis is a basic class of overlay and query problems. Though it is a classic problem, it has, however, not been addressed appropriately. With ME in the location of the vertices of a polygon, the resulting random polygons may undergo complex changes, so that the point-in-polygon problem may become theoretically and practically ill-defined. That is, there is a possibility that we cannot answer whether a random point is inside a random polygon if the polygon is not simple and cannot form a region. For the point-in-triangle problem, however, such a case need not be considered since any triangle always forms an interior or region. To formulate the general point-in-polygon problem in a suitable way, a conditional probability mechanism is first introduced in order to accurately characterize the nature of the problem and establish the basis for further analysis. For the point-in-triangle problem, four quadratic forms in the joint coordinate vectors of a point and the vertices of the triangle are constructed. The probability model for the point-in-triangle problem is then established by the identification of signs of these quadratic form variables. Our basic idea for solving a general point-in-polygon (concave or convex) problem is to convert it into several point-in-triangle problems under a certain condition. By solving each point-in-triangle problem and summing the solutions, the probability model for a general point-in-polygon analysis is constructed. The simplicity of the algebra-based approach is that from using these quadratic forms, we can circumvent the complex geometrical relations between a random point and a random polygon (convex or concave) that one has to deal with in any geometric method when probability is computed. The theoretical arguments are substantiated by simulation experiments.This project was supported by the earmarked grant CUHK 4362/00H of the Hong Kong Research grants Council. 相似文献