Détail de l'auteur
Auteur J. Lee |
Documents disponibles écrits par cet auteur (5)
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externes
Tightly-coupled spatial database features in the odysseus/OpenGIS DBMS for high-performance / K. Whang in Geoinformatica, vol 14 n° 4 (October 2010)
[article]
Titre : Tightly-coupled spatial database features in the odysseus/OpenGIS DBMS for high-performance Type de document : Article/Communication Auteurs : K. Whang, Auteur ; M. Kim, Auteur ; J. Lee, Auteur ; et al., Auteur Année de publication : 2010 Article en page(s) : pp 425 - 446 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 orientée objet
[Termes IGN] implémentation (informatique)
[Termes IGN] interface logicielle
[Termes IGN] logiciel libre
[Termes IGN] système d'information géographiqueRésumé : (Auteur) Conventional object-relational database management system (ORDBMS) vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a highlevel (typically, SQL-level) interface. We call this mechanism loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high performance is required. We have earlier proposed the tight-coupling architecture (Whang et al. 2002, 2005) to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine in the extensible type layer. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval features and spatial database features into the Odysseus ORDBMS that has been under development at KAIST/AITrc for 19 years. In this paper, we introduce the tightly-coupled spatial database features of Odysseus/OpenGIS. By taking advantage of tight-coupling, Odysseus/OpenGIS provides excellent performance in processing spatial queries as well as flexible concurrency control and recovery on spatial data. We show the performance through extensive experiments. Finally, we present sample applications of a geographical information system (GIS) implemented using Odysseus/OpenGIS. Numéro de notice : A2010-303 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-009-0086-3 Date de publication en ligne : 07/05/2009 En ligne : https://doi.org/10.1007/s10707-009-0086-3 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30497
in Geoinformatica > vol 14 n° 4 (October 2010) . - pp 425 - 446[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-2010041 RAB Revue Centre de documentation En réserve L003 Disponible Classification comparisons between dual-pol, compact polarimetric and quad-pol SAR imagery / T. Ainsworth in ISPRS Journal of photogrammetry and remote sensing, vol 64 n° 5 (September - October 2009)
[article]
Titre : Classification comparisons between dual-pol, compact polarimetric and quad-pol SAR imagery Type de document : Article/Communication Auteurs : T. Ainsworth, Auteur ; J. Kelly, Auteur ; J. Lee, Auteur Année de publication : 2009 Article en page(s) : pp 464 - 471 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image radar et applications
[Termes IGN] analyse comparative
[Termes IGN] classification dirigée
[Termes IGN] image radar moirée
[Termes IGN] modèle de rétrodiffusion
[Termes IGN] polarimétrie radar
[Termes IGN] polarisation
[Termes IGN] polarisation croisée
[Termes IGN] précision de la classificationRésumé : (Auteur) We present a study of the polarimetric information content of dual-pol imaging modes and dual-pol imaging extended by polarimetric scattering models. We compare Wishart classifications both among the partial polarimetric datasets and against the full quad-pol dataset. Our emphasis is the inter-comparisons between the classification results based on dual-pol modes, compact polarimetric modes and scattering model extensions of the compact polarimetric modes. We primarily consider novel dual-pol modes, e.g. transmitting a circular polarization and receiving horizontal and vertical polarizations, and the pseudo-quad-pol data derived from polarimetric scattering models based on dual-pol data. We show that the overall classification accuracy of the pseudo-quad-pol data is essential the same as the classification accuracy obtained directly employing the underlying dual-pol imagery.We present a study of the polarimetric information content of dual-pol imaging modes and dual-pol imaging extended by polarimetric scattering models. We compare Wishart classifications both among the partial polarimetric datasets and against the full quad-pol dataset. Our emphasis is the inter-comparisons between the classification results based on dual-pol modes, compact polarimetric modes and scattering model extensions of the compact polarimetric modes. We primarily consider novel dual-pol modes, e.g. transmitting a circular polarization and receiving horizontal and vertical polarizations, and the pseudo-quad-pol data derived from polarimetric scattering models based on dual-pol data. We show that the overall classification accuracy of the pseudo-quad-pol data is essential the same as the classification accuracy obtained directly employing the underlying dual-pol imagery. Copyright ISPRS Numéro de notice : A2009-399 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2008.12.008 En ligne : https://doi.org/10.1016/j.isprsjprs.2008.12.008 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30030
in ISPRS Journal of photogrammetry and remote sensing > vol 64 n° 5 (September - October 2009) . - pp 464 - 471[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 081-09051 SL Revue Centre de documentation Revues en salle Disponible A combinatorial data model for representing topological relations among 3D geographical features in micro-spatial environments / J. Lee in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)
[article]
Titre : A combinatorial data model for representing topological relations among 3D geographical features in micro-spatial environments Type de document : Article/Communication Auteurs : J. Lee, Auteur ; Mei-Po Kwan, Auteur Année de publication : 2005 Article en page(s) : pp 1039 - 1056 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse spatiale
[Termes IGN] approche hiérarchique
[Termes IGN] bati
[Termes IGN] homologie
[Termes IGN] modèle topologique de données
[Termes IGN] objet géographique 3D
[Termes IGN] relation topologique
[Termes IGN] requête spatiale
[Termes IGN] SIG 3D
[Termes IGN] théorie des graphes
[Termes IGN] visualisation 3DRésumé : (Auteur) This research is motivated by the need for 3D GIS data models that allow for 3D spatial query, analysis and visualization of the subunits and internal network structure of 'micro-spatial environments' (the 3D spatial structure within buildings). It explores a new way of representing the topological relationships among 3D geographical features such as buildings and their internal partitions or subunits. The 3D topological data model is called the combinatorial data model (CDM). It is a logical data model that simplifies and abstracts the complex topological relationships among 3D features through a hierarchical network structure called the node-relation structure (NRS). This logical network structure is abstracted by using the property of Poincaré duality. It is modelled and presented in the paper using graph-theoretic formalisms. The model was implemented with real data for evaluating its effectiveness for performing 3D spatial queries and visualization. Numéro de notice : A2005-498 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810500399043 En ligne : https://doi.org/10.1080/13658810500399043 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27634
in International journal of geographical information science IJGIS > vol 19 n° 10 (november 2005) . - pp 1039 - 1056[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-05091 RAB Revue Centre de documentation En réserve L003 Disponible 079-05092 RAB Revue Centre de documentation En réserve L003 Disponible A spatial access-oriented implementation of a 3-D GIS topological data model for urban entities / J. Lee in Geoinformatica, vol 8 n° 3 (septembre - novembre 2004)
[article]
Titre : A spatial access-oriented implementation of a 3-D GIS topological data model for urban entities Type de document : Article/Communication Auteurs : J. Lee, Auteur Année de publication : 2004 Article en page(s) : pp 237 - 264 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] accessibilité
[Termes IGN] analyse combinatoire (maths)
[Termes IGN] analyse spatiale
[Termes IGN] Colombus (Ohio)
[Termes IGN] diagramme de Voronoï
[Termes IGN] graphe
[Termes IGN] implémentation (informatique)
[Termes IGN] interaction spatiale
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] objet géographique urbain
[Termes IGN] Ohio (Etats-Unis)
[Termes IGN] relation topologique
[Termes IGN] requête spatiale
[Termes IGN] SIG 3DRésumé : (Auteur) 3-D analysis in GIS is still one of the most challenging topics for research. With the goal being to model possible movement within the built environment, this paper, therefore, proposes a new approach to handling connectivity relationships among 3-D objects in urban environments in order to implement spatial access analyses in 3-D Npace. To achieve this goal, this paper introduces a 3-D network data model called the geometric network model (GNM), which has been developed by transforming the combinatorial data model (CDM), representing a connectivity relationship among 3-D objects using a dual graph. For the transformation, this paper presents (1) an O(n2) algorithm for computing a straight medial axis transformation (MAT), (2) the processes for transforming phenomena from 3-D CDM to 3-D GNM, and (3) spatial access algorithms for the 3-D geometric network based upon the Dijkstra algorithm. Using the reconstructed geometric network generated from the transformations, spatial queries based upon the complex connectivity relationships between 3-D urban entities are implemented using Dijkstra algorithm. Finally, the paper presents the results of an experimental implementation of a 3-D network data model (GNM) using GIS data of an area in downtown Columbus, Ohio. Numéro de notice : A2004-325 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1023/B:GEIN.0000034820.93914.d0 En ligne : https://doi.org/10.1023/B:GEIN.0000034820.93914.d0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26852
in Geoinformatica > vol 8 n° 3 (septembre - novembre 2004) . - pp 237 - 264[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-04031 RAB Revue Centre de documentation En réserve L003 Disponible Extensions to least-cost path algorithms for roadway planning / C. Yu in International journal of geographical information science IJGIS, vol 17 n° 4 (june 2003)
[article]
Titre : Extensions to least-cost path algorithms for roadway planning Type de document : Article/Communication Auteurs : C. Yu, Auteur ; M.J. Munro-Stasiuk, Auteur ; J. Lee, Auteur Année de publication : 2003 Article en page(s) : pp 361 - 376 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] calcul d'itinéraire
[Termes IGN] chemin le moins coûteux, algorithme du
[Termes IGN] données matricielles
[Termes IGN] Java (langage de programmation)
[Termes IGN] modèle numérique de surface
[Termes IGN] réseau routier
[Termes IGN] système d'information géographique
[Termes IGN] tracé routier
[Termes IGN] transport routierRésumé : (Auteur) Finding a leastcostpath in a raster data format is a useful function in geographical information systems. However, existing algorithms are often inadequate for practical roadway planning. This paper improves conventional algorithms by including the considerations of spatial distances, anisotropic costs and the presence of bridges and tunnels in the paths. This new algorithm is implemented in JAVA to run with actual remote sensing and DEM data. The experimental results show that this approach produces realistic leastcost paths for practical roadway planning. Numéro de notice : A2003-107 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/1365881031000072645 En ligne : https://doi.org/10.1080/1365881031000072645 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22403
in International journal of geographical information science IJGIS > vol 17 n° 4 (june 2003) . - pp 361 - 376[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-03041 RAB Revue Centre de documentation En réserve L003 Disponible 079-03042 RAB Revue Centre de documentation En réserve L003 Disponible