共查询到20条相似文献，搜索用时 200 毫秒
1.
Tao Wang 《地球空间信息科学学报》2008,11(2):103-106
This paper proposes a new algorithm for determining the starting points of contour lines. The new algorithm is based on the interval tree. The result improves the algorithm＇s efficiency remarkably. Further, a new strategy is designed to constrain the direction of threading and the resulting contour bears more meaningful information. 相似文献
2.
Yibin Yao 《地球空间信息科学学报》2008,11(1):1-5
The algorithm of using one-day-arc to integrate n-days-arc by orbit overlaying is discussed in detail. An example is given, which proves that the orbit integration method can improve the precision of the orbit efficiently, especially in the determination of a local area＇s orbit. 相似文献
3.
MWRI (MicroWave Radiation Imager) is one of the payloads on our next generation polar meteorological satellite FY-3. MWRI conically scans with a fixed incident angle on the earth surface. It is the first time for Chinese remote sensor to use this scan mode. In this work, we present a geolocation method for FY-3 MWRI’s remote sensing image based on its special scan geometry. The integrated coordinate systems and the specific relationships with these coordinate systems are defined. A spatial relationship model between the remote sensing data and the earth-based coordinate system is established. This method also includes an algorithm of satellite orbit computation, which is used to get the satellite’s instantaneous velocity vector from its position. This method has been applied to MWRI’s remote sensing image geolocation. The results show that the accuracy of this method can achieve 1 pixel. The 33 GCPs (Ground Control Points) which are in the regiones of FY-3 MWRI’s observation have been collected and used to analyze the precision of the geolocation. By statistical analysis, the error along-track is about 1.5km, and the error along-scan is about 3.0km. It is obvious that this method fulfills the requirement of precision for FY-3 MWRI whose space resolution exceeds 5km. 相似文献
4.
Classification is always the key point in the field of remote sensing. Fuzzy c-Means is a traditional clustering algorithm that has been widely used in fuzzy clustering. However, this algorithm usually has some weaknesses, such as the problems of falling into a local minimum, and it needs much time to accomplish the classification for a large number of data. In order to overcome these shortcomings and increase the classification accuracy, Gustafson-Kessel （GK） and Gath-Geva （GG） algorithms are proposed to improve the traditional FCM algorithm which adopts Euclidean distance norm in this paper. The experimental result shows that these two methods are able to detect clusters of varying shapes, sizes and densities which FCM cannot do. Moreover, they can improve the classification accuracy of remote sensing images. 相似文献
5.
应用FY-1D气象卫星监测雾(英文) 总被引：1，自引：0，他引：1
FY-1D is the second national operation meteorological satellite of China, and is much better compared to monitoring fog. However, research on monitoring fog using FY-1D is very few. In this paper, based on the typical FY-1D data, a fog＇s spectral characteristics in the different channels are analyzed using the histogram analysis method, and a method of monitoring fog using FY-1D is suggested. The results indicate that the 1st and 4th channels are the representative channels of FY-1D for the identification of fog. In the 1st channel, the fog is with uniform veins, smooth top, and clear-cut boundary, and its albedo is 20%-48%. In the 4th channel, the fog＇s brightness and temperature is 272-289K, and the difference value between the fog＇s and the ground surface＇s is not more than 6K. 相似文献
6.
WU HuayiWANG YandongGONG Jianya WU Huayi Associate Professor National Laooratory for momation tngineering in Surveying Mapping Remote Sensing Luoyu Road 《地球空间信息科学学报》1999,2(1):63-67
Polygonal object is a fundamental type of geometric data in vector GIS. The key step of cleaning topological relationship after data collection of polygonal layer is to build polygonal objects from digital arcs. The raw digital arcs may intersect with each other. The algorithm for building polygonal objects after the raw arcs have been split at all intersections is presented. The build-up of polygonal objects in this paper is designed to be implemented by two steps. The first step is to extract all the polygons needed for build-up of polygonal objects from arcs. The second step is to organize polygonal objects from these polygons. For the first step, a tracing algorithm is proposed. The algorithm merely extracts the polygons needed for the build-up of polygonal objects, which is a subset of all the possible polygons that can be induced from the arcs. For the second step, an algorithm based on a specially designed order of polygons is advanced. All the topological relationships among the polygons are sho 相似文献
7.
An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning 总被引：5，自引：0，他引：5
Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks. 相似文献
8.
The basic principle of interval arithmetic and the basic algorithm of the interval Newton methods are introduced.The prototype algorithm can not find any zero in an interval that has zero sometimes,that is ,it is instable.So the prototype relaxation procedure is improved in this paper.Additionally,an immediate test of the existence of a solution following branch-and-bound is proposed,which avoids unwanted computations in those intervals that have no solution.The numerical results demonstrat that the improved interval Newton method is superior to prototype algorithm in terms of solution quality,stability and convergent speed. 相似文献
9.
Evaluation of CHAMP satellite orbit with SLR measurements 总被引：1，自引：0，他引：1
QIN Xianping YANG Yuanxi 《地球空间信息科学学报》2005,8(3):209-213
The technique of Evaluating CHAMP satellite orbit with SLR measurements iS presented. As an independent evaluation of the orbit solution, SLR data observed from January 1 to 16, 2002 are processed to compute the residuals after fixing the GFZ＇s post science orbits solutions. The SLR residuals are computed as the differences of the SLR measurements minus the corresponding distances between the SLR station and the GPS-derived orbit positions. On the basis of the SLR residuals analysis, it is found that the accuracy of GFZ＇ s post science orbits is better than 10 cm and that there is no systematic error in GFZ＇s post science orbits. 相似文献
10.
The coherence coefficient map and residue guided least square phase unwrapping algorithm 总被引：1，自引：0，他引：1
ZHANG LiLIAO MingshengZHANG ZuxunZHANG Yong ZHANG Li Doctoral Candidate National Laboratory for Information Engineering in Surveying Mapping Remote Sensing WTUSM Luoyu Road Wuhan China 《地球空间信息科学学报》1999,2(1):55-62
11.
分析了球面Quaternary编码的特点，给出了三角格网方向判断的规则，并对该算法与Bartholdi邻近搜索算法的时间复杂度进行了对比。结果表明，分解算法的平均时间耗时量约是Bartholdi邻近搜索算法的23．66％。 相似文献
12.
The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out. An algorithm of neighbor finding by decomposing the Quaternary code from back to front is presented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi’s algorithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi’s algorithm. 相似文献
13.
平面影像到退化四叉树格网(Degenerate Quadtree Grid,DQG)的转换是实现全球DQG无缝可视化建模的前提任务。以相交面积为权重,提出平面影像到球面退化四叉树格网的转换算法。实验利用4km分辨率256级灰度图像数据Wsiearth.tif和30m分辨率Landsat5 Level4遥感数据,详细对比分了平面影像到退化四叉树格网与平面影像到四元三角格网(Quaternary Triangular Mesh,QTM)的转换精度和效率。 相似文献
14.
随着格网层次的增大,基于全球离散格网的球面Voronoi图生成算法的格网数据量与Voronoi图生成时间都呈指数增长,在高层次时容易出现算法效率较低,甚至内存溢出无法执行等情况。利用球面四元三角格网的层次性,提出了一个基于多层次QTM的球面Voronoi图生成算法。首先用全球低层次QTM格网生成Voronoi图,然后对Voronoi边界格网进行再次剖分,得到下一层次的Voronoi图,重复进行,直至达到目标层次。实验结果表明,相对于单一层次的确定归属算法和扩张算法,该算法能够生成更高层次的Voronoi图,且效率较前两者分别提高了22倍和25倍(第9层)。 相似文献
15.
16.
17.
18.
19.
根据球面四元三角网（quaternary triangular mesh,QTM）的离散特征及图形处理器（graphics processing unit,GPU）的多线程原理,用距离的计算与比较代替传统的扩张操作,提出了一种基于QTM的球面Voronoi图并行生成算法,并给出了Voronoi边界提取算法。利用C++语言及统一计算设备架构（compute unified device architecture,CUDA）开发了实验系统。实验结果表明,本文算法能够在球面上快速生成点、线、面数据集的Voronoi图,且能够将Voronoi误差控制在两个格网以内。同时,GPU并行计算的使用,提高了算法的效率。 相似文献
20.
基于O-QTM的球面VORONOI图的生成算法 总被引：8，自引：3，他引：8
提出了基于“Q－QTM”（Octahedral Quaternary Triangular Mesh）剖分的球面Voronoi图的格网生成算法；首先介绍了球面的QTM格网划发和编码方法，并根据地址码进行邻近球面三角形的探索；然后，参照数学形态学原理，重新定义了球面三角网的膨胀操作和膨胀算子，利用球面实体的递归膨胀来生成球面Voronoi图。应用VC^ 语言在OpenGL3维平台上开发了相应的实验程序，实验结果表明：利用此算法可生成球面上任意实体的Voronoi图，且生成点、弧和曲面Voronoi图的时间复杂度是一样的；而其误差受球面距离的影响较小，主要与球面实体的位置有关。最后给出了本文研究的结论及进一步的工作。 相似文献