共查询到20条相似文献，搜索用时 31 毫秒
1.
讨论了Voronoi图的首最邻近递归收敛特性,即从任一伪最邻近对象开始,递归查找其首最邻近对象,最后必然收敛于最邻近对象.利用该特性,初步实现了移动目标直接邻近对象的连续查询. 相似文献
2.
Studies on small-world networks have received intensive interdisciplinary attention during the past several years. It is well-known
among researchers that a small-world network is often characterized by high connectivity and clustering, but so far there
exist few effective approaches to evaluate small-world properties, especially for spatial networks. This paper proposes a
method to examine the small-world properties of spatial networks from the perspective of network autocorrelation. Two network
autocorrelation statistics, Moran’s I and Getis–Ord’s G, are used to monitor the structural properties of networks in a process of “rewiring” networks from a regular to a random
network. We discovered that Moran’s I and Getis–Ord’s G tend to converge and have relatively low values when properties of small-world networks emerge. Three transportation networks
at the national, metropolitan, and intra-city levels are analyzed using this approach. It is found that spatial networks at
these three scales possess small-world properties when the correlation lag distances reach certain thresholds, implying that
the manifestation of small-world phenomena result from the interplay between the network structure and the dynamics taking
place on the network.
相似文献
3.
4.
This paper introduces a GIS-based toolbox, called SAINF, for analyzing the effects of infrastructural features on the distribution of non-infrastructural features. One of the distinct characteristics of SAINF is that it can deal not only with point-like infrastructural features but also line-like (e.g. railways) and polygon-like (e.g. big parks) features. SAINF analyzes these effects with the conditional nearest neighbor distance method and the cross K-function method. First, the paper briefly refers to these methods. Second, the paper illustrates how to use SAINF with an actual example. SAINF can be downloaded via the Internet without charge for non-profit uses.We express our thanks to Exceed Co. Ltd. for helping us program SAINF, and to Miki Arimoto for making the data of high-class apartment buildings and parks in Kiba. This development was partly supported by Grant-in-aid for Scientific Research No. 10202201 (Spatial information science for human and social sciences) and No. 14350327 (Regional supporting network planning for the elderly) by the Ministry of Education, Culture, Sports, Science and Technology of Japan. 相似文献
5.
Masashi Miyagawa 《Journal of Geographical Systems》2012,14(2):209-222
This paper derives the joint distribution of the distances to the first and the second nearest points for regular and random
patterns. Distance is measured as the Euclidean and the rectilinear distances on a continuous plane. The joint distribution
extends the kth nearest distance distribution of previous works. The kth nearest distance distribution only shows how the distance to the kth nearest point is distributed, whereas the joint distribution provides the relationship between the distances. An application
of the joint distribution can be found in a facility location problem with non-closest facility service where the distance
to the second nearest facility is also important. The joint distribution that allows us to examine the first and the second
nearest distances simultaneously is useful for evaluating the reliability of facility location when some of the existing facilities
are closed. The joint distribution of the road network distances is also obtained to confirm that the model on a continuous
plane can be applied to actual road networks. 相似文献
6.
On comparison of the Earth orientation parameters obtained from different VLBI networks and observing programs 总被引：1，自引：1，他引：0
Z. Malkin 《Journal of Geodesy》2009,83(6):547-556
In this paper, a new geometry index of very long baseline interferometry (VLBI) observing networks, the volume of network
V, is examined as an indicator of the errors in the Earth orientation parameters (EOP) obtained from VLBI observations. It
has been shown that both EOP precision and accuracy can be well described by the power law σ = aV
c
in a wide range of the network size from domestic to global VLBI networks. In other words, as the network volume grows, the
EOP errors become smaller following a power law. This should be taken into account for a proper comparison of EOP estimates
obtained from different VLBI networks. Thus, performing correct EOP comparison allows us to investigate accurately finer factors
affecting the EOP errors. In particular, it was found that the dependence of the EOP precision and accuracy on the recording
data rate can also be described by a power law. One important conclusion is that the EOP accuracy depends primarily on the
network geometry and to lesser extent on other factors, such as recording mode and data rate and scheduling parameters, whereas
these factors have a stronger impact on the EOP precision. 相似文献
7.
Modeling network autocorrelation within migration flows by eigenvector spatial filtering 总被引：8，自引：5，他引：3
Yongwan Chun 《Journal of Geographical Systems》2008,10(4):317-344
Although the assumption of independence among interaction flows frequently is engaged in spatial interaction modeling, in
many circumstances it leads to misspecified models and incorrect inferences. An informed approach is to explicitly incorporate
an assumed relationship structure among the interaction flows, and to explicitly model the network autocorrelation. This paper
illustrates such an approach in the context of U.S. interstate migration flows. Behavioral assumptions, similar to those of
the intervening opportunities or the competing destinations concepts, exemplify how to specify network flows that are related
to particular origin–destination combinations. The stepwise incorporation of eigenvectors, which are extracted from a network
link matrix, captures the network autocorrelation in a Poisson regression model specification context. Spatial autocorrelation
in Poisson regression is measured by the test statistic of Jacqmin-Gadda et al. (Stat Med
16(11):1283–1297, 1997). Results show that estimated regression parameters in the spatial filtering interaction model become
more intuitively interpretable.
相似文献
| Yongwan ChunEmail: |
8.
Tiago M Delboni Karla A V Borges Alberto H F Laender Clodoveu A Davis Jr 《Transactions in GIS》2007,11(3):377-397
The need for better Web search tools is getting increasing attention nowadays. About 20% of the queries currently submitted to search engines include geographic references. Thus, it is particularly important to work with the semantics of such queries, both by understanding the terminology and by recognizing geographic references in natural language text. In this paper, we explore the use of natural language expressions, which we call positioning expressions, to perform geographic searches on the Web, without resorting to geocoded data or gazetteers. Such positioning expressions denote the location of a subject of interest with respect to a landmark. Our approach leads to a query expansion technique that can be explored by virtually any keyword‐based search engine. Results obtained in our experiments show an expressive improvement over the traditional keyword‐based search and a potential path for tackling many kinds of common geographic queries. 相似文献
9.
空间异常检测已成为空间数据挖掘和知识发现的一个重要研究内容.空间异常蕴含着许多意想不到的知识,现有的空间异常检测方法大多依据空间邻近域的非空间属性差异来计算偏离因子,忽略了邻近域内空间实体间距离的影响.本文首先讨论了空间邻近域内实体间距离对空间异常检测的影响,在此基础上,提出了一种顾及邻近域内实体间距离的空间异常度量方法--SOM法,并分析了它的复杂度.由于该方法是利用实体非空间属性的加权内插值与实测值的差值作为度量空间异常程度的参数,从而顾及了邻近域内所有实体相互间距离对非空间属性偏离的影响,并且克服了现有检测方法在不均匀分布空间实体集内寻找空间异常的缺陷.最后,通过一个实际算例验证了所提方法的可行性和正确性. 相似文献
10.
Distances between demand points and potential sites for implementing facilities are essential inputs to location-allocation
models. Computing actual road distances for a given problem can be quite burdensome since it involves digitalizing a network,
while approximating these distances by l
p
-norms, using for instance a geographical information system, is much easier. We may then wonder how sensitive the solutions
of a location-allocation model are to the choice of a particular metric. In this paper, simulations are performed on a lattice
of 225 points using the k-median problem. Systematic changes in p and in the orientation of the orthogonal reference axes are used. Results suggest that the solutions of the k-median are rather insensitive to the specification of the l
p
-norm.
Received: 12 October 1998/Accepted: 17 September 1999 相似文献
11.
In the real world, there are many kinds of phenomena that are represented by points on a network, such as traffic accidents
on a street network. To analyse these phenomena, the basic point pattern methods (i.e. the nearest neighbour distance method,
the quadrat method, the K-function method and the clumping method) defined on a plane (referred to as the planar basic point pattern methods) are extended to the basic point pattern methods on a network (referred to as the network basic point pattern methods). However, like the planar basic point pattern methods, the network basic point pattern methods assume a uniform network
and this assumption is hard to accept when analysing actual phenomena. To overcome this limitation, this paper formulates
a transformation, called the uniform network transformation, that transforms a non-uniform network into a uniform network. This transformation provides a simple procedure for analysing
point patterns on non-uniform networks: first, a given non-uniform network is transformed into a uniform network; second,
the network basic point pattern methods (which assume a uniform network) are applied to this transformed uniform network.
No modification to the network basic point pattern methods is necessary. The paper also shows an actual application of this
transformation to traffic accidents in Chosei, Japan. 相似文献
12.
This article treats the possibility of using artificial neural networks for road detection from high-resolution satellite images on a part of RGB Ikonos and Quick-Bird images from Kish Island and Bushehr Harbor, respectively. Attempts are also made to verify the impacts of different input parameters on network's ability to find out optimum input vector for the problem. A variety of network structures with different iteration times are used to determine the best network structure and termination condition in training stage.It was found that when the input parameters are made up of spectral information and distances of pixels to road mean vector in a 3 × 3 window, the network's ability in both road and background detection can be improved in comparison with simple networks that simply use spectral information of a single pixel in their input vector. 相似文献
13.
以Quickbird影像为研究对象,探讨了利用多种特征信息识别地物目标的技术方法.首先采用区域生长法将影像分割为若干个具有语义信息的对象,然后在此基础上提取对象的光谱、形状和纹理特征并进行描述,最后根据提取的特征参数,采用最近邻方法将影像分为建筑物、公路、铁路、水塘、耕地、林地和荒地7类地物目标,综合分类精度达到91.03%.研究表明,多种特征信息的综合利用,在目标分类与识别方面明显优于传统的基于单一光谱特征的方法,在一定程度内提升了遥感信息的智能化水平. 相似文献
14.
Rule-Based Discovery in Spatial Data Infrastructure 总被引：2，自引：0，他引：2
15.
International compilations of marine gravity, such as the International Gravity Bureau (BGI) contain tens of millions of point
data. Lemoine et al. (The Development of the Joint NASA GSFC and the National Imagery and Mapping Agency (NIMA) Geopotential
Model EGM96, NASA/TP-1998-206861) chose not to include any marine gravity in the construction of the global gravity model
EGM96. Instead they used synthetic anomalies derived from altimetry, so that no independent information about Mean Dynamic
Topography (MDT) can be deduced. Software has been developed not only to identify and correct those aspects of marine gravity
data that are unreliable, but to do so in a way that can be applied to very large, ocean-wide data sets. First, we select
only straight-line parts of ship-tracks and fit each one with a high-degree series of Chebyshev polynomials, whose misfit
standard deviation is σ
line and measures the random error associated with point gravity data. Then, network adjustment determines how the gravity datum is offset for each survey.
A free least squares adjustment minimises the gravity anomaly mismatch at line-crossing points, using σ
line to weight the estimate for each line. For a long, well crossed survey, the instrumental drift rate is also adjusted. For
some 42,000 cross-over points in the northern Atlantic Ocean, network adjustment reduces the unweighted standard deviation
of the cross-over errors from 4.03 to 1.58 mGal; when quality weighted, the statistic reduces from 1.32 to 0.39 mGal. The
geodetic MDT is calculated combining the adjusted gravity anomalies and satellite altimetry, and a priori global ocean model
through a new algorithm called the Iterative Combination Method. This paper reports a first demonstration that geodetic oceanography
can characterise the details of basin wide ocean circulation with a resolution better than global ocean circulation models.
The result matches regional models of ocean circulation from hydrography measurements (Geophys Res Lett 29:1896, 2002; J Geophys
Res 108:3251, 2003). 相似文献
16.
Network Density Estimation: A GIS Approach for Analysing Point Patterns in a Network Space 总被引：4，自引：0，他引：4
Giuseppe Borruso 《Transactions in GIS》2008,12(3):377-402
Human activities and more generally the phenomena related to human behaviour take place in a network‐constrained subset of the geographical space. These phenomena can be expressed as locations having their positions configured by a road network, as address points with street numbers. Although these events are considered as points on a network, point pattern analysis and the techniques implemented in a GIS environment generally consider events as taking place in a uniform space, with distance expressed as Euclidean and over a homogeneous and isotropic space. Network‐spatial analysis has developed as a research agenda where the attention is drawn towards point pattern analytical techniques applied to a space constrained by a road network. Little attention has been put on first order properties of a point pattern (i.e. density) in a network space, while mainly second order analysis such as nearest neighbour and K‐functions have been implemented for network configurations of the geographical space. In this article, a method for examining clusters of human‐related events on a network, called Network Density Estimation (NDE), is implemented using spatial statistical tools and GIS packages. The method is presented and compared to conventional first order spatial analytical techniques such as Kernel Density Estimation (KDE). Network Density Estimation is tested using the locations of a sample of central, urban activities associated with bank and insurance company branches in the central areas of two midsize European cities, Trieste (Italy) and Swindon (UK). 相似文献
17.
Richard A. Snay 《Journal of Geodesy》1990,64(1):1-27
The North American Datum of 1983 (NAD 83) provides horizontal coordinates for more than 250,000 geodetic stations. These coordinates were derived by a least squares
adjustment of existing terrestrial and space-based geodetic data. For pairs of first order stations with interstation distances
between 10km and 100km, therms discrepancy between distances derived fromNAD 83 coordinates and distances derived from independentGPS data may be suitably approximated by the empirical rulee=0.008 K0.7 where e denotes therms discrepancy in meters and K denotes interstation distance in kilometers. For the same station pairs, therms discrepancy in azimuth may be approximated by the empirical rule e=0.020 K0.5. Similar formulas characterize therms discrepancies for pairs involving second and third order stations. Distance and orientation accuracies, moreover, are well
within adopted standards. While these expressions indicate that the magnitudes of relative positional accuracies depend on
station order, absolute positional accuracies are similar in magnitude for first, second, and third order stations. Adjustment
residuals reveal a few local problems with theNAD 83 coordinates and with the weights assigned to certain classes of observations. 相似文献
18.
The Markov chain random field (MCRF) model is a spatial statistical approach for modeling categorical spatial variables in multiple dimensions. However, this approach tends to be computationally costly when dealing with large data sets because of its sequential simulation processes. Therefore, improving its computational efficiency is necessary in order to run this model on larger sizes of spatial data. In this study, we suggested four parallel computing solutions by using both central processing unit (CPU) and graphics processing unit (GPU) for executing the sequential simulation algorithm of the MCRF model, and compared them with the nonparallel computing solution on computation time spent for a land cover post-classification. The four parallel computing solutions are: (1) multicore processor parallel computing (MP), (2) parallel computing by GPU-accelerated nearest neighbor searching (GNNS), (3) MP with GPU-accelerated nearest neighbor searching (MP-GNNS), and (4) parallel computing by GPU-accelerated approximation and GPU-accelerated nearest neighbor searching (GA-GNNS). Experimental results indicated that all of the four parallel computing solutions are at least 1.8× faster than the nonparallel solution. Particularly, the GA-GNNS solution with 512 threads per block is around 83× faster than the nonparallel solution when conducting a land cover post-classification with a remotely sensed image of 1000?×?1000 pixels. 相似文献
19.
Computing and querying strict,approximate, and metrically refined topological relations in linked geographic data 总被引：1，自引：0，他引：1
Geographic entities and the information associated with them play a major role in Web‐scale knowledge graphs such as Linked Data. Interestingly, almost all major datasets represent places and even entire regions as point coordinates. There are two key reasons for this. First, complex geometries are difficult to store and query using the current Linked Data technology stack to a degree where many queries take minutes to return or will simply time out. Second, the absence of complex geometries confirms a common suspicion among GIScientists, namely that for many everyday queries place‐based relational knowledge is more relevant than raw geometries alone. To give an illustrative example, the statement that the White House is in Washington, DC is more important for gaining an understating of the city than the exact geometries of both entities. This does not imply that complex geometries are unimportant but that (topological) relations should also be extracted from them. As Egenhofer and Mark (1995b) put it in their landmark paper on naive geography, topology matters, metric refines. In this work we demonstrate how to compute and utilize strict, approximate, and metrically refined topological relations between several geographic feature types in DBpedia and compare our results to approaches that compute result sets for topological queries on the fly. 相似文献