Centre de documentation
scientifique

Street-level spatial interpolation using network-based IDW and ordinary kriging / N. Shiode in Transactions in GIS, vol 15 n° 4 (August 2011)  

Public [article]  inTransactions in GIS > vol 15 n° 4 (August 2011) . - pp 457 - 477 Titre : Street-level spatial interpolation using network-based IDW and ordinary kriging Type de document : Article/Communication Auteurs : N. Shiode, Auteur ; S. Shiode, Auteur Année de publication : 2011 Article en page(s) : pp 457 - 477 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] interpolation inversement proportionnelle à la distance [Termes IGN] interpolation spatiale [Termes IGN] krigeage [Termes IGN] lissage de données [Termes IGN] réseau routier Résumé : (Auteur) This study proposes network-based spatial interpolation methods to help predict unknown spatial values along networks more accurately. It expands on two of the commonly used spatial interpolation methods, IDW (inverse distance weighting) and OK (ordinary kriging), and applies them to analyze spatial data observed on a network. The study first provides the methodological framework, and it then examines the validity of the proposed methods by cross-validating elevations from two contrasting patterns of street network and comparing the MSEs (Mean Squared Errors) of the predicted values measured with the two proposed network-based methods and their conventional counterparts. The study suggests that both network-based IDW and network-based OK are generally more accurate than their existing counterparts, with network-based OK constantly outperforming the other methods. The network-based methods also turn out to be more sensitive to the edge effect, and their performance improves after edge correction. Furthermore, the MSEs of standard OK and network-based OK improve as more sample locations are used, whereas those of standard IDW and network-based IDW remain stable regardless of the number of sample locations. The two network-based methods use a similar set of sample locations, and their performance is inherently affected by the difference in their weight distribution among sample locations. Numéro de notice : A2011-346 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2011.01278.x Date de publication en ligne : 16/08/2011 En ligne : https://doi.org/10.1111/j.1467-9671.2011.01278.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=31125 [article]

Detection of multi-scale clusters in network space / S. Shiode in International journal of geographical information science IJGIS, vol 23 n° 1-2 (january 2009)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 23 n° 1-2 (january 2009) . - pp 75 - 92 Titre : Detection of multi-scale clusters in network space Type de document : Article/Communication Auteurs : S. Shiode, Auteur ; N. Shiode, Auteur Année de publication : 2009 Article en page(s) : pp 75 - 92 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de données [Termes IGN] analyse de groupement [Termes IGN] diagramme de Voronoï [Termes IGN] données multiéchelles [Termes IGN] espace euclidien [Termes IGN] réseau routier [Termes IGN] triangulation de Delaunay Résumé : (Auteur) This paper proposes a new type of point-pattern analytical method, Network-Based Variable-Distance Clumping Method (NT-VCM), to analyse the distribution pattern of point objects and phenomena observed on a network. It is an extension of Planar Variable-Distance Clumping Method (PL-VCM) that was previously defined for point pattern analysis in Euclidian space. The purpose for developing NT-VCM is to identify point agglomerations across different scales called multi-scale network-based clumps among distributed points along a network. The paper first defines a network-based clump as a set of points where all its elements are found within a certain shortest-path distance from at least one other element of the same set. It then proposes NT-VCM as a technique to extract statistically significant multi-scale clumps on a network. The paper also proposes an efficient algorithm for computing NT-VCM, which involves the use of the Voronoi diagram, the Delaunay diagram and the minimum spanning tree that are adapted and newly extended for the purpose of analysis on a network. A comparative study of NT-VCM and PL-VCM using commercial facility data reveals a notable difference in the location as well as the size of the significant multi-scale clumps detected in the both cases. Results from the empirical study confirm that NT-VCM accounts for the actual network distance between the points, thus providing a more accurate description of point agglomerations along the network than PL-VCM does. Copyright Taylor & Francis Numéro de notice : A2009-128 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810801949843 En ligne : https://doi.org/10.1080/13658810801949843 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29758 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-09012	RAB	Revue	Centre de documentation	En réserve L003	Disponible