Descripteur
Termes IGN > géomatique > données localisées
données localiséesSynonyme(s)spatial data ;données géospatiales ;données géographiques données à référence spatialeVoir aussi |
Documents disponibles dans cette catégorie (4255)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
Etendre la recherche sur niveau(x) vers le bas
The European information society : Leading the way with geo-information, AGILE 2007 / Sara Irina Fabrikant (2007)
![]()
Titre : The European information society : Leading the way with geo-information, AGILE 2007 : [selected papers, 10th AGILE conference, 2007, Aalborg, Denmark] Type de document : Actes de congrès Auteurs : Sara Irina Fabrikant, Éditeur scientifique ; Monica Wachowicz, Éditeur scientifique Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 2007 Collection : Lecture notes in Geoinformation and Cartography, ISSN 1863-2246 Conférence : AGILE 2007, 10th International Conference on Geographic Information Science Aalborg Danemark OA Proceedings Importance : 486 p. Format : 16 x 24 cm Accompagnement : Sans Cédérom ISBN/ISSN/EAN : 978-3-540-72384-4 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] convivialité
[Termes IGN] données localisées
[Termes IGN] état de l'art
[Termes IGN] Infrastructure de données
[Termes IGN] interopérabilité
[Termes IGN] modèle 3D de l'espace urbain
[Termes IGN] monde virtuel
[Termes IGN] objet mobile
[Termes IGN] ontologie
[Termes IGN] qualité des données
[Termes IGN] raisonnement spatial
[Termes IGN] service web géographiqueRésumé : (éditeur) The Association of Geographic Information Laboratories for Europe (AGILE) was established in early 1998 to promote academic teaching and research on GIS at the European level. AGILE seeks to ensure that the views of the geographic information teaching and research community are fully represented in the discussions that take place on future European - search agendas and it also provides a permanent scientific forum where geographic information researchers can meet and exchange ideas and - periences at the European level. In 2007 AGILE provided - for the first time since its existence - a book constituting a collection of scientific papers that were submitted as full papers to the annual AGILE conference and went through a competitive and thorough review process. Numéro de notice : 17088 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Actes DOI : 10.1007/978-3-540-72385-1 En ligne : https://doi.org/10.1007/978-3-540-72385-1 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79464 Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 17088-01 CG2007 Livre Centre de documentation Congrès Disponible
[article]
Titre : Une topographie plus précise Type de document : Article/Communication Auteurs : Françoise de Blomac, Auteur Année de publication : 2007 Article en page(s) : pp 8 - 9 Langues : Français (fre) Descripteur : [Vedettes matières IGN] Topographie moderne
[Termes IGN] BD Alti
[Termes IGN] bruit (théorie du signal)
[Termes IGN] données bathymétriques
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] France (administrative)
[Termes IGN] hélicoptère
[Termes IGN] Lidar
[Termes IGN] Litto3D
[Termes IGN] modèle numérique de surface
[Termes IGN] modèle numérique de terrain
[Termes IGN] précision altimétrique
[Termes IGN] précision centimétrique
[Termes IGN] signal laser
[Termes IGN] Suisse
[Termes IGN] télémétrie laser aéroporté
[Termes IGN] végétationRésumé : (Auteur) Même si les volumes de données générés par les LIDAR sont très importants, ils permettent de créer des modèles numériques très précis, fort prisés dans le domaine de la topographie. Nos collègues suisses sont les premiers à s'être lancés dans un projet d'envergure nationale. Numéro de notice : A2007-003 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28369
in SIG la lettre > n° 83 (janvier 2007) . - pp 8 - 9[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 286-07011 RAB Revue Centre de documentation En réserve L003 Disponible
Titre : Towards a rigorous logic for spatial data representation Type de document : Thèse/HDR Auteurs : Rodney James Thompson, Auteur Editeur : Delft : Netherlands Geodetic Commission NGC Année de publication : 2007 Collection : Netherlands Geodetic Commission Publications on Geodesy, ISSN 0165-1706 num. 65 Importance : 332 p. Format : 17 x 24 cm ISBN/ISSN/EAN : 978-90-6132-303-7 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] données localisées
[Termes IGN] données vectorielles
[Termes IGN] logique
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] primitive géométrique
[Termes IGN] représentation des données
[Termes IGN] traitement automatique de donnéesRésumé : (Auteur) The storage and retrieval of spatial data in computer systems has matured greatly over recent years, from the earliest approaches (of simple digitised linework and text) to the representation of features and their attributes, with the semantics of their behaviour associated. This has led to massive cost savings where data, which might have been captured for a specific purpose, can be shared and reused for other purposes.
In this first generation of Geographic Information Systems (GIS), the data is stored locally, with each vendor using different nomenclature and definitions of spatial objects and having very different rules for what is accepted as ''valid''. As a result a scientist using a desktop GIS may need to expend a considerable portion of his/her research effort and funds in translating, cleaning and preparing pre-existing data to convert to the form required for the study.
For some years now, there has been a trend towards spatial data being housed within a database management system, these being considered as a corporate resource, leading to the realisation that the geographic data itself is in fact an infrastructure, in the same way as is, for example, a telephone network. This moves the ownership of the data from the desktop, firstly to the corporation, and ultimately to being a shared resource between public and private organisations - a Geographic Information Infrastructure (GII).
An inhibiting factor in these trends is the lack of standardisation alluded to above. Where every data sharing operation involves manual intervention, it is difficult, if not impossible to create a GII. Thus a strong and consistent set of standards is needed, with the most basic requirement being for consistency in the geometric concepts used. While progress is being made by groups such as the International Standards Organisation Technical Committee 211 (ISO TC211) and the Open Geospatial Consortium (OGC), there is still much to be done.
The success of these standardisation efforts has been compromised by the requirement to be vendor neutral - i.e. to avoid specifying an internal representation to be used for storage. For example, the standards will remain silent on whether coordinate values should be stored in floating point or integer format.
As a result, definitions of spatial objects are expressed in mathematical terms assuming an infinite precision real number system, with the details of how this is to be translated into the computational representation being left to the implementer. Therefore there is no agreed normative meaning of the ''equals'' predicate when applied to geometric objects, and definitions of validity are in general left to the implementers.
If the standardisation effort is to allow spatial data to be interchanged without expensive manual intervention, a well defined logic is needed to underpin the standards and support the definition of validity of that data. This would also ensure that inferences drawn from the digital model remain consistent and do not lead to logical fallacies.
The language of spatial databases is couched in the language of mathematics, with operations being given names such as ''union'' and ''intersection'' and using vector-like representations. This naturally leads to the impression that the representations form a topological and/or vector space. Unfortunately this is not the case. Generally speaking, the rigorous mathematics used in the definition of spatial objects ends outside the database representation, which is only an approximation of the theoretical formalism used to define it.
This thesis documents a number of cases that illustrate the potential breakdown of logic to be found in current technology, for example, cases where the union or intersection operations lead to inconsistent results. Various alternative approaches that have been investigated in search of solutions are discussed, and their advantages and disadvantages indicated.
This current research has been motivated by an attempt to apply the mathematical approach to the actual representation of spatial features within the computer system. In this rigorous approach, the assumptions (or ''axioms'') are clearly identified, and used to develop a chain of argument, leading to a proof of the required proposition. The advantage of this approach in the field of spatial data representation is that, if the computer hardware can be verified to obey the axioms, then the correct results of the algorithms are assured.
In order to facilitate such a chain of proof, a form of representation known as the regular polytope has been defined, based on a small set of axioms and definitions, and shown to possess a consistent and complete logic. That is to say, the computational representation itself expresses the algebraic formalism, rather than being an approximation to an idealized mathematical model.
Thus this representation is capable of providing a potential storage structure for a useful class of features, but this should not be seen as the sole object of the research. Rather the regular polytope should be seen as an exemplar for any approach to spatial data representation and storage.
The fact that this particular representation can be axiomatically defined and implemented demonstrates that such an approach is feasible, and opens the possibility that all computational representations can be similarly analysed. The regular polytope is a particularly tractable construct for this type of analysis, which is the reason for choosing it. By contrast the kind of structure embedded in many current systems is far more complex. In particular, floating point numbers add a significant level of complexity, and only the most basic topological behaviour has been proved where floating point operations are assumed.
Based on integer and domain restricted rational arithmetic, it is shown that the logic of topology, the Boolean connection algebra and the region connection calculus can be expressed directly by the database implementation. Thus a database built on this structure cannot suffer from the kinds of breakdown of logic discussed above. In addition, this raises the prospect of a definition of validity and robustness of representation that is not vendor specific.
A regular polytope representation of spatial objects is defined as the union of a finite set of (possibly overlapping) "convex regular polytopes", which are in turn defined as the intersection of a finite set of half spaces. These half spaces are defined by finite precision number representations. The term ''Regular Polytope'' here does not carry its conventional meaning as the generalisation of a regular polyhedron (one having equal sides, faces and angles etc.). In the form used here, it combines the topological term ''regular'' with the conventional geometric meaning of ''polyhedron''.
The actual definition is given in axiomatic form, structured so as to form a ''boundary free'' representation, valid in any number of dimensions. Although it is explored here principally in 3D, particular reference is made to the mixture of 2D and 3D found in many current application areas such as cadastral property boundaries. Particular attention is paid to the issue of connectivity, both within and between regular polytopes, and the resultant logic is developed in terms of well studied concepts such as the region connection calculus.
The particular representation chosen for the half space is such that adjoining regular polytopes will have no points in common, and no points will exist between them. Thus it is possible to define a complete partition of space where every point that can be represented computationally is defined to exist in one and only one region. In the traditional representations of 2D polygons and 3D polyhedrons, points play a very important role of carrying the metric information. This is in contrast to regular polytopes where points do not play a role in the definition at all. Instead the metric is specified via the half planes using 3 or 4 integers (in 2D and 3D respectively).
This theoretic basis is then applied to actual database schema design, and several alternative models proposed and analysed. As a check on the practicality of the algorithms, ''proof of concept'' classes have been developed in the Java programming language, and tested on a significant set of cadastral parcels (2D and 3D) from the Queensland cadastre.
Finally, further areas of research are identified, including extensions of the approach to wider problem domains.Note de contenu : 1. Introduction
1.1. Research Question
1.2. Research Approach
1.3. Scope of Research
1.4. Nomenclature
1.5. Computational Representation of Vector Spatial Data
1.6. Contribution of this Work
1.7. Organisation of the Thesis
2. Case Studies
2.1. Case 1. Polygon Union
2.2. Case 2. Data Interchange
2.3. Case 3. ISO 19107 Definition of Equality
2.4. Case 4. ISO 19107 Definition of Simplicity
2.5. Case 5. Intersection of a Point with a Line
2.6. Case 6. Narrow Cadastral Parcels
2.7. Case 7. 3D Surfaces and Lines
2.8. Case 8. ISO 19107 Definition of "interior to" association
2.9. Case 9. Adjoining polygon points
3. Related Work and Theory
3.1. Historic Perspective
3.2. Spatial Logic
3.3. Precision of Calculations and Representation
3.4. The Digital Representation
3.5. Conclusions
4. The Regular Polytope Representation
4.1. The Regular Polytope
4.2. Properties of the Regular Polytope Representation
4.3. Integer Approach
4.4. Domain-Restricted Rational Number Approach
4.5. Floating Point Number Approach
4.6. Conclusion
5. Connectivity in the Regular Polytope Representation
5.1. Connectivity of Geometric Objects
5.2. Connectivity of Convex Polytopes
5.3. Connectivity of Regular Polytopes
5.4. Properties of CA and CB
5.5. Further Connectivity Relations
5.6. Partitioning of Space
5.7. Robustness of Regular Polytopes
5.8. Robustness of Connected Regular Polytopes
5.9. Conclusions
6. Algebras of Connectivity
6.1. The Region Connection Calculus (RCC)
6.2. The Spatial Relations on Regular Polytopes
6.3. Dimensionality of Overlap
6.4. Proximity Space
6.5. Boolean Connection Algebra
6.6. Properties of the Space of Regular Polytopes
6.7. The Convex Hull
6.8. Expressiveness of the Relations and Functions
6.9. Relationship with Constraint Databases
6.10. Conclusions
7. The Data Model
7.1. Vertex-based Representations
7.2 The Discrete Regular Polytope Model
7.3. Topological Encoding of Regular Polytopes
7.4. The Approximated Polytope Model
7.5. Extension to Topological Encoding
7.6. Spatial Indexing of the Regular Polytope
7.7. Relationship with Other Approaches
7.8. Summary of Data Volumes
7.9. Conclusions
8. Implementation Issues
8.1. Rationale for the Approach Taken
8.2. Description of the Java Objects
8.3. Proof of Concept Data
8.4. Algorithmic Complexity
8.5. Optimising the Model
8.6. Data Load Issues
8.7. Conclusions
9. Review of Case Studies
9.1. Case 1. Polygon Union
9.2. Case 2. Data Interchange
9.3. Case 3. ISO 19107 Definition of equalsQ
9.4. Case 4. ISO 19107 Definition of isSimpleQ
9.5. Case 5. Intersection of a Point with a Line
9.6. Case 6. Narrow Cadastral Parcels
9.7. Case 7. 3D Surfaces and Lines
9.8. Case 8. ISO 19107 Definition of "interior to" Association
9.9. Case 9. Adjoining Polygon Points
9.10. Case 10. 3D Cadastre Issues
9.11. Case 11. Datum Conversion
9.12. Case 12. Uniqueness Of Representation
9.13. Case 13. GeoTools/GeoAPI definition of Object.equalsQ
9.14. Conclusions
10. Conclusions
10.1. Application of the Regular Polytope to Lower Dimensionality
10.2. Learnings and Future Research
10.3. ConclusionNuméro de notice : 15360 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Thèse étrangère DOI : sans En ligne : https://www.ncgeo.nl/downloads/65Thompson.pdf Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=62702 Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 15360-01 37.30 Livre Centre de documentation Géomatique Disponible 3D physical versus empirical models for HR sensor orientation and elevation extraction: examples with Ikonos and Quickbird / Thierry Toutin in Revue Française de Photogrammétrie et de Télédétection, n° 184 (Décembre 2006)
![]()
[article]
Titre : 3D physical versus empirical models for HR sensor orientation and elevation extraction: examples with Ikonos and Quickbird Type de document : Article/Communication Auteurs : Thierry Toutin , Auteur ; P. Schauer, Auteur
Année de publication : 2006 Conférence : ISPRS 2006, Commission 1 Symposium, From sensors to imagery 03/07/2006 06/07/2006 Champs-sur-Marne [Paris Marne-la-Vallée] France OA ISPRS Archives Article en page(s) : pp 115 - 120 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] altitude
[Termes IGN] analyse comparative
[Termes IGN] compensation par moindres carrés
[Termes IGN] données lidar
[Termes IGN] image Ikonos
[Termes IGN] image Quickbird
[Termes IGN] modèle numérique de surface
[Termes IGN] modèle par fonctions rationnelles
[Termes IGN] orientation du capteur
[Termes IGN] point d'appuiRésumé : (Auteur) Elevations for digital surface model (DSM) generation were extracted from different stereo high-resolution (HR) images (QuickBird and Ikonos) using 3D physical and empirical geometric models. The 3D physical model is Toutin's model (TM) developed at the Canada Centre for Remote Sensing, and the empirical model is the rational function model (RFM). First, Vendor-supplied RFMs refined with polynomial functions and TM were compared for the sensor orientations with least-squares adjustments with different number of ground control points (GCPs). TM and RFMs gave similar results with Ikonos as soon as RFM was refined with a shift computed from at least one GCP. On the other hand, TM gave better results than RFMs with QuickBird regardless of the number of GCPs. Due to relief dependency, QuickBird RFM needed to be refined at least with linear functions computed from at least 6-10 GCPs. Some large errors were, however, noted on forward image RFM in column. The stereo-extracted elevations of DSMs were then compared to 0.2-m accurate Lidar elevation data. Because DSM stereo-extracted elevations included the height of land covers (trees, houses), elevation linear errors with 68 percent confidence level (LE68) were computed for the entire area and three land-cover classes (forested, urban/residential, bare surface). TM and RFMs with Ikonos, regardless of the method and GCP number, achieved comparable results for all classes while TM achieved overall better results than RFMs with QuickBird. All results demonstrated the necessity of refining Ikonos RFM with a tri-directional shift and at least one GCP but QuickBird RFM with 1st order linear functions and 6-10 GCPs. Copyright SFPT Numéro de notice : A2006-642 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueNat DOI : sans En ligne : https://www.isprs.org/proceedings/XXXVI/part1/Papers/PS1-06.pdf Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28365
in Revue Française de Photogrammétrie et de Télédétection > n° 184 (Décembre 2006) . - pp 115 - 120[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 018-06041 RAB Revue Centre de documentation En réserve L003 Disponible Automatically conflating road vector data with orthoimagery / C.C. Chen in Geoinformatica, vol 10 n° 4 (December 2006)
![]()
[article]
Titre : Automatically conflating road vector data with orthoimagery Type de document : Article/Communication Auteurs : C.C. Chen, Auteur ; Craig A. Knoblock, Auteur ; C. Shabani, Auteur Année de publication : 2006 Article en page(s) : pp 495 - 530 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] appariement de modèles conceptuels de données
[Termes IGN] automatisation
[Termes IGN] Californie (Etats-Unis)
[Termes IGN] cohérence des données
[Termes IGN] conflation
[Termes IGN] données multisources
[Termes IGN] données vectorielles
[Termes IGN] fusion de données multisource
[Termes IGN] intégration de données
[Termes IGN] Montana (Etats-Unis)
[Termes IGN] orthoimage
[Termes IGN] point d'appui
[Termes IGN] réseau routierRésumé : (Auteur) Recent growth of the geospatial information on the web has made it possible to easily access a wide variety of spatial data. The ability to combine various sets of geospatial data into a single composite dataset has been one of central issues of modern geographic information processing. By conflating diverse spatial datasets, one can support a rich set of queries that could have not been answered given any of these sets in isolation. However, automatically conflating geospatial data from different data sources remains a challenging task. This is because geospatial data obtained from various data sources may have different projections, different accuracy levels and different formats (e.g., raster or vector format), thus resulting in various positional inconsistencies. Most of the existing algorithms only deal with vector to vector data conflation or require human intervention to accomplish vector data to imagery conflation. In this paper, we describe a novel geospatial data fusion approach, named AMS-Conflation, which achieves automatic vector to imagery conflation. We describe an efficient technique to automatically generate control point pairs from the orthoimagery and vector data by exploiting the information from the vector data to perform localized image processing on the orthoimagery. We also evaluate a filtering technique to automatically eliminate inaccurate pairs from the generated control points. We show that these conflation techniques can automatically align the roads in orthoimagery, such that 75% of the conflated roads are within 3.6 meters from the real road axes compared to 35% for the original vector data for partial areas of the county of St. Louis, MO. Copyright Springer Numéro de notice : A2006-549 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1007/s10707-006-0344-6 En ligne : https://doi.org/10.1007/s10707-006-0344-6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28272
in Geoinformatica > vol 10 n° 4 (December 2006) . - pp 495 - 530[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-06041 RAB Revue Centre de documentation En réserve L003 Disponible Census of natural resources with earth observation and GIS : a proto-type from India / R.K. Jaiswail in Geocarto international, vol 21 n° 4 (December 2006 - February 2007)
PermalinkChange detection techniques for canopy height growth measurements using airborne laser scanner data / X. Yu in Photogrammetric Engineering & Remote Sensing, PERS, vol 72 n° 12 (December 2006)
PermalinkLes chercheurs rendent les cartes actives et inversement... : compte rendu de réunion du groupe de travail Cartactive du GDR SIGMA / Sébastien Mustière in Le monde des cartes, n° 190 (décembre 2006 - février 2007)
PermalinkDetermination of exterior orientation using linear features from vector maps / Mika Karjalainen in Photogrammetric record, vol 21 n° 116 (December 2006 - February 2007)
PermalinkExamining the influence of changing laser pulse repetition frequencies on conifer forest canopy returns / Laura Chasmer in Photogrammetric Engineering & Remote Sensing, PERS, vol 72 n° 12 (December 2006)
PermalinkExtracting photogrammetric ground control from lidar DEMs for change detection / T.D. James in Photogrammetric record, vol 21 n° 116 (December 2006 - February 2007)
PermalinkFast cluster polygonization and its applications in data-rich environments / I. Lee in Geoinformatica, vol 10 n° 4 (December 2006)
PermalinkGéoportail : le portail des territoires et des citoyens / Patrick Leboeuf in Le monde des cartes, n° 190 (décembre 2006 - février 2007)
PermalinkLocal accuracy measures for digital terrain models / Karl Kraus in Photogrammetric record, vol 21 n° 116 (December 2006 - February 2007)
PermalinkMeasuring map complexity / David Fairbairn in Cartographic journal (the), vol 43 n° 3 (December 2006)
Permalink