Geoinformatica . vol 17 n° 1Paru le : 01/01/2013 ISBN/ISSN/EAN : 1384-6175 |
[n° ou bulletin]
[n° ou bulletin]
|
Exemplaires(1)
Code-barres | Cote | Support | Localisation | Section | Disponibilité |
---|---|---|---|---|---|
057-2013011 | RAB | Revue | Centre de documentation | En réserve L003 | Disponible |
Dépouillements
Ajouter le résultat dans votre panierBuilding pattern recognition in topographic data: examples on collinear and curvilinear alignments / Xiang Zhang in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : Building pattern recognition in topographic data: examples on collinear and curvilinear alignments Type de document : Article/Communication Auteurs : Xiang Zhang, Auteur ; Tinghua Ai, Auteur ; Jantien E. Stoter, Auteur ; Menno-Jan Kraak, Auteur ; Martien Molenaar, Auteur Année de publication : 2013 Article en page(s) : pp 1 - 33 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] alignement
[Termes IGN] colinéarité
[Termes IGN] détection du bâti
[Termes IGN] données topographiques
[Termes IGN] enrichissement sémantique
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] géomètrie algorithmique
[Termes IGN] géométrie euclidienne
[Termes IGN] géométrie vectorielle
[Termes IGN] reconnaissance de formes
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Building patterns are important features that should be preserved in the map generalization process. However, the patterns are not explicitly accessible to automated systems. This paper proposes a framework and several algorithms that automatically recognize building patterns from topographic data, with a focus on collinear and curvilinear alignments. For both patterns two algorithms are developed, which are able to recognize alignment-of-center and alignment-of-side patterns. The presented approach integrates aspects of computational geometry, graph-theoretic concepts and theories of visual perception. Although the individual algorithms for collinear and curvilinear patterns show great potential for each type of the patterns, the recognized patterns are neither complete nor of enough good quality. We therefore advocate the use of a multi-algorithm paradigm, where a mechanism is proposed to combine results from different algorithms to improve the recognition quality. The potential of our method is demonstrated by an application of the framework to several real topographic datasets. The quality of the recognition results are validated in an expert survey. Numéro de notice : A2013-045 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-011-0146-3 En ligne : https://doi.org/10.1007/s10707-011-0146-3 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32183
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 1 - 33[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible Computer-based synthetic data to assess the tree delineation algorithm from airborne LiDAR survey / L. Wang in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : Computer-based synthetic data to assess the tree delineation algorithm from airborne LiDAR survey Type de document : Article/Communication Auteurs : L. Wang, Auteur ; A. Birt, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 35 - 61 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] arbre (flore)
[Termes IGN] détection de contours
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] inventaire forestier (techniques et méthodes)
[Termes IGN] modèle géométrique
[Termes IGN] Pinophyta
[Termes IGN] Pinus taeda
[Termes IGN] segmentationRésumé : (Auteur) Small Footprint LiDAR (Light Detection And Ranging) has been proposed as an effective tool for measuring detailed biophysical characteristics of forests over broad spatial scales. However, by itself LiDAR yields only a sample of the true 3D structure of a forest. In order to extract useful forestry relevant information, this data must be interpreted using mathematical models and computer algorithms that infer or estimate specific forest metrics. For these outputs to be useful, algorithms must be validated and/or calibrated using a sub-sample of ‘known’ metrics measured using more detailed, reliable methods such as field sampling. In this paper, we describe a novel method for delineating and deriving metrics of individual trees from LiDAR data based on watershed segmentation. Because of the costs involved with collecting both LiDAR data and field samples for validation, we use synthetic LiDAR data to validate and assess the accuracy of our algorithm. This synthetic LiDAR data is generated using a simple geometric model of Loblolly pine (Pinus taeda) trees and a simulation of LiDAR sampling. Our results suggest that point densities greater than 2 and preferably greater than 4 points per m2 are necessary to obtain accurate forest inventory data from Loblolly pine stands. However the results also demonstrate that the detection errors (i.e. the accuracy and biases of the algorithm) are intrinsically related to the structural characteristics of the forest being measured. We argue that experiments with synthetic data are directly useful to forest managers to guide the design of operational forest inventory studies. In addition, we argue that the development of LiDAR simulation models and experiments with the data they generate represents a fundamental and useful approach to designing, improving and exploring the accuracy and efficiency of LiDAR algorithms. Numéro de notice : A2013-046 Affiliation des auteurs : non IGN Thématique : FORET/IMAGERIE Nature : Article DOI : 10.1007/s10707-011-0148-1 Date de publication en ligne : 29/11/2011 En ligne : https://doi.org/10.1007/s10707-011-0148-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32184
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 35 - 61[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible Continuous aggregate nearest neighbor queries / H. Elmongui in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : Continuous aggregate nearest neighbor queries Type de document : Article/Communication Auteurs : H. Elmongui, Auteur ; M. Mokbel, Auteur ; W. Aref, Auteur Année de publication : 2013 Article en page(s) : pp 63 - 95 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] agrégation spatiale
[Termes IGN] données spatiotemporelles
[Termes IGN] flux de données
[Termes IGN] objet mobile
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] requête continue
[Termes IGN] requête spatiotemporelleRésumé : (Auteur) This paper addresses the problem of continuous aggregate nearest-neighbor (CANN) queries for moving objects in spatio-temporal data stream management systems. A CANN query specifies a set of landmarks, an integer k, and an aggregate distance function f (e.g., min, max, or sum), where f computes the aggregate distance between a moving object and each of the landmarks. The answer to this continuous query is the set of k moving objects that have the smallest aggregate distance f. A CANN query may also be viewed as a combined set of nearest neighbor queries. We introduce several algorithms to continuously and incrementally answer CANN queries. Extensive experimentation shows that the proposed operators outperform the state-of-the-art algorithms by up to a factor of 3 and incur low memory overhead. Numéro de notice : A2013-047 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-011-0149-0 En ligne : https://doi.org/10.1007/s10707-011-0149-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32185
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 63 - 95[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible A query integrity assurance scheme for accessing outsourced spatial databases / W. Ku in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : A query integrity assurance scheme for accessing outsourced spatial databases Type de document : Article/Communication Auteurs : W. Ku, Auteur ; L. Hu, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 97 - 124 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] base de données localisées
[Termes IGN] courbe de Hilbert
[Termes IGN] cryptage
[Termes IGN] externalisation
[Termes IGN] intégrité des données
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] protection de la vie privéeRésumé : (Auteur) With the trend of cloud computing, outsourcing databases to third party service providers is becoming a common practice for data owners to decrease the cost of managing and maintaining databases in-house. In conjunction, due to the popularity of location-based-services (LBS), the need for spatial data (e.g., gazetteers, vector data) is increasing dramatically. Consequently, there is a noticeably new tendency of outsourcing spatial datasets by data collectors. Two main challenges with outsourcing datasets are to keep the data private (from the data provider) and to ensure the integrity of the query result (for the clients). Unfortunately, most of the techniques proposed for privacy and integrity do not extend to spatial data in a straightforward manner. Hence, recent studies proposed various techniques to support either privacy or integrity (but not both) on spatial datasets. In this paper, for the first time, we propose a technique that can ensure both privacy and integrity for outsourced spatial data. In particular, we first use a one-way spatial transformation method based on Hilbert curves, which encrypts the spatial data before outsourcing and, hence, ensures its privacy. Next, by probabilistically replicating a portion of the data and encrypting it with a different encryption key, we devise a technique for the client to audit the trustworthiness of the query results. We show the applicability of our approach for both k-nearest-neighbor queries and spatial range queries, which are the building blocks of any LBS application. We also design solutions to guarantee the freshness of outsourced spatial databases. Finally, we evaluate the validity and performance of our algorithms with security analyses and extensive simulations. Numéro de notice : A2013-048 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0156-9 Date de publication en ligne : 15/03/2012 En ligne : https://doi.org/10.1007/s10707-012-0156-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32186
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 97 - 124[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible
[article]
Titre : A generic data model for moving objects Type de document : Article/Communication Auteurs : Jingsi Xu, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2013 Article en page(s) : pp 125 - 172 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] environnement géographique virtuel
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] objet mobile
[Termes IGN] réseau de transport
[Termes IGN] transport intermodalRésumé : (Auteur) Moving objects databases should be able to manage trips that pass through several real world environments, e.g., road network, indoor. However, the current data models only deal with the movement in one situation and cannot represent comprehensive trips for humans who can move inside a building, walk on the pavement, drive on the road, take the public vehicles (bus or train), etc. As a result, existing queries are solely limited to one environment. In this paper, we design a data model that is able to represent moving objects in multiple environments in order to support novel queries on trips in different surroundings and various transportation modes (e.g., Car, Walk, Bus). A generic and precise location representation is proposed that can apply in all environments. The idea is to let the space for moving objects be covered by a set of so-called infrastructures each of which corresponds to an environment and defines the available places for moving objects. Then, the location is represented by referencing to the infrastructure. We formulate the concept of space and infrastructure and propose the methodology to represent moving objects in different environments with the integration of precise transportation modes. Due to different infrastructure characteristics, a set of novel data types is defined to represent infrastructure components. To efficiently support new queries, we design a group of operators to access the data. We present how such a data model is implemented in a database system and report the experimental results. The new model is designed with attention to the data models of previous work for free space and road networks to have a consistent type system and framework of operators. In this way, a powerful set of generic query operations is available for querying, together with those dealing with infrastructures and transportation modes. We demonstrate these capabilities by formulating a set of sophisticated queries across all infrastructures. Numéro de notice : A2013-049 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0158-7 En ligne : https://doi.org/10.1007/s10707-012-0158-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32187
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 125 - 172[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible Users plan optimization for participatory urban texture documentation / H. Shirani-Mehr in Geoinformatica, vol 17 n° 1 (January 2013)
[article]
Titre : Users plan optimization for participatory urban texture documentation Type de document : Article/Communication Auteurs : H. Shirani-Mehr, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 173 - 205 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] acquisition de données
[Termes IGN] données localisées des bénévoles
[Termes IGN] milieu urbain
[Termes IGN] participation du public
[Termes IGN] prise de vue terrestre
[Termes IGN] production participative
[Termes IGN] téléphone intelligent
[Termes IGN] téléphonie mobileRésumé : (Auteur) We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones participate in collaborative collection of urban texture information. PTD enables inexpensive, scalable and high quality urban texture documentation. We propose to implement PTD in two steps. At the first step, termed viewpoint selection, a minimum number of viewpoints in the urban environment are selected from which the texture of the entire urban environment (the part visible to cameras) with a desirable quality can be collected/captured. At the second step, called viewpoint assignment, the selected viewpoints are assigned to the participating users such that given a limited number of users with various constraints (e.g., restricted available time) users can collectively capture the maximum amount of texture information within a limited time interval. In this paper, we define each of these steps and prove that both are NP-hard problems. Accordingly, we propose efficient algorithms to implement the viewpoint selection and assignment problems. We study, profile and verify our proposed solutions comparatively by both rigorous analysis and extensive experiments. Numéro de notice : A2013-050 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-012-0166-7 Date de publication en ligne : 11/08/2012 En ligne : https://doi.org/10.1007/s10707-012-0166-7 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32188
in Geoinformatica > vol 17 n° 1 (January 2013) . - pp 173 - 205[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013011 RAB Revue Centre de documentation En réserve L003 Disponible