Centre de documentation
scientifique

Dépouillements

Implementation and evaluation of a hypercube-based method for spatiotemporal exploration and analysis / Pierre Marchand in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 1-2 (August 2004 - April 2005)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 59 n° 1-2 (August 2004 - April 2005) . - pp 6 - 20 Titre : Implementation and evaluation of a hypercube-based method for spatiotemporal exploration and analysis Type de document : Article/Communication Auteurs : Pierre Marchand, Auteur ; A. Brisebois, Auteur ; et al., Auteur Année de publication : 2004 Article en page(s) : pp 6 - 20 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] analyse multicritère [Termes IGN] appariement de données localisées [Termes IGN] classe d'objets [Termes IGN] classification hypercube [Termes IGN] données spatiotemporelles [Termes IGN] exploration de données géographiques [Termes IGN] implémentation (informatique) [Termes IGN] positionnement par GPS Résumé : (Auteur) This paper presents the results obtained with a new type of spatiotemporal topological dimension implemented within a hypercube, i.e., within a multidimensional database (MDDB) structure formed by the conjunction of several thematic, spatial and temporal dimensions. Our goal is to support efficient SpatioTemporal Exploration and Analysis (STEA) in the context of Automatic Position Reporting System (APRS), the worldwide amateur radio system for position report transmission. Mobile APRS stations are equipped with GPS navigation systems to provide real-time positioning reports. Previous research about the multidimensional approach has proved good potential for spatiotemporal exploration and analysis despite a lack of explicit topological operators (spatial, temporal and spatiotemporal). Our project implemented such operators through a hierarchy of operators that are applied to pairs of instances of objects. At the top of the hierarchy, users can use simple operators such as "same place", "same time" or "same time, same place". As they drill down into the hierarchy, more detailed topological operators are made available such as "adjacent immediately after", "touch during" or more detailed operators. This hierarchy is structured according to four levels of granularity based on cognitive models, generalized relationships and formal models of topological relationships. In this paper, we also describe the generic approach which allows efficient STEA within the multidimensional approach. Finally, we demonstrate that such an implementation offers query run times which permit to maintain a "train-of-thought" during exploration and analysis operations as they are compatible with Newell's cognitive band (query runtime Numéro de notice : A2004-311 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2003.12.002 En ligne : https://doi.org/10.1016/j.isprsjprs.2003.12.002 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26838 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-04031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Clustering with obstacles for geographical data mining / V. Estivill-Castro in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 1-2 (August 2004 - April 2005)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 59 n° 1-2 (August 2004 - April 2005) . - pp 21 - 34 Titre : Clustering with obstacles for geographical data mining Type de document : Article/Communication Auteurs : V. Estivill-Castro, Auteur ; I. Lee, Auteur Année de publication : 2004 Article en page(s) : pp 21 - 34 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de groupement [Termes IGN] base de données localisées [Termes IGN] classification barycentrique [Termes IGN] classification par la distance de Mahalanobis [Termes IGN] distance euclidienne [Termes IGN] exploration de données géographiques [Termes IGN] système d'information géographique [Termes IGN] triangulation de Delaunay Résumé : (Auteur) Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of user-supplied arguments and incorporates global and local variations. The algorithm detects clusters in complex scenarios and successfully supports association analysis between layers. All this occurs within O(n log n+[s + t] log n) expected time, where n is the number of points, s is the number of line segments that determine the obstacles and t is the number of Delaunay edges intersecting the obstacles. Copyright ISPRS Numéro de notice : A2004-312 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2003.12.003 En ligne : https://doi.org/10.1016/j.isprsjprs.2003.12.003 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26839 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-04031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Semiautomated matching for network database integration / D. Xiong in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 1-2 (August 2004 - April 2005)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 59 n° 1-2 (August 2004 - April 2005) . - pp 35 - 46 Titre : Semiautomated matching for network database integration Type de document : Article/Communication Auteurs : D. Xiong, Auteur ; J. Sperling, Auteur Année de publication : 2004 Article en page(s) : pp 35 - 46 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] appariement de réseaux [Termes IGN] image à haute résolution [Termes IGN] intégration de données [Termes IGN] méthode robuste [Termes IGN] réseau routier [Termes IGN] système d'information géographique [Termes IGN] traitement interactif Résumé : (Auteur) High-resolution imagery is now routinely utilized to acquire geometric and attribute data for road networks. Frequently, these data must be integrated with data from other sources to meet application requirements. A critical first step in this process at data integration is to identify the correspondences between networks, so that data can be merged or transferred from one network to another. This paper introduces a semiautomated method that combines an automated algorithm and an interactive procedure to match networks that are represented differently. The automated algorithm establishes robust correspondences for nodes edges, and segments between two networks using a cluster-based matching mechanism. The interactive procedure allows a user to visually check and correct correspondences that are mismatched by the automated algorithm. Two matching examples are presented in the paper to demonstrate the applicability of the proposed method. The results of these two matching examples illustrate that this semiautomated method is highly effective and can meet the needs of real-world applications. The automated algorithm is capable of generating reliable matching measures, resolving difficult matches, and in both cases, correctly identifying the overwhelming majority of the matching counterparts. The interactive procedure, on the other hand, is useful for checking and correcting mismatched counterparts during the early stage of the matching process, which significantly improves performance and reliability. Copyright ISPRS Numéro de notice : A2004-313 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2003.12.001 En ligne : https://doi.org/10.1016/j.isprsjprs.2003.12.001 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26840 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-04031	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Modelling error propagation in vector-based overlay analysis / Wei Shi in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 1-2 (August 2004 - April 2005)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 59 n° 1-2 (August 2004 - April 2005) . - pp 47 - 59 Titre : Modelling error propagation in vector-based overlay analysis Type de document : Article/Communication Auteurs : Wei Shi, Auteur ; C.K. Cheung, Auteur ; X. Tong-Tong, Auteur Année de publication : 2004 Article en page(s) : pp 47 - 59 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] données vectorielles [Termes IGN] erreur de positionnement [Termes IGN] modèle analytique [Termes IGN] modélisation [Termes IGN] noeud [Termes IGN] polygone [Termes IGN] propagation d'erreur Résumé : (Auteur) This paper proposes two methods for analyzing error propagation in overlay analysis of vector polygons, an analytical and simulation method. First, for the analytical method, the error is derived based on the error propagation law in statistics. In the second method, error propagation of overlay is simulated based on the positional error of the original polygon vertices, assuming a given error distribution of the vertices. For both methods, several geometrical error measures for the derived polygons are defined: (i) error measures for the perimeter, area and center of gravity of a polygon, and (ii) the error intervals for the polygon vertices. A test is performed to compare the differences between the two methods and their applicability. The results indicate that there is no significant difference in estimating the propagated error between the two methods. However, these two methods are suitable for different cases. The analytical method is applicable when the error ellipse of any intersection point of the original polygons does not intersect with error ellipses of all the vertices of the original polygons, if the intersection point or, in case of disjoint polygon boundaries, the error ellipse of any point on the boundary of one original polygon does not intersect with the error ellipse of any point on the boundary of the other original polygons. On the other hand, the simulation method is more generic, but more time consuming. Copyright ISPRS Numéro de notice : A2004-314 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2004.05.003 En ligne : https://doi.org/10.1016/j.isprsjprs.2004.05.003 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26841 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-04031	RAB	Revue	Centre de documentation	En réserve L003	Disponible