Centre dedocumentation
scientifique

Heuristic sample learning for complex urban scenes: Application to urban functional-zone mapping with VHR images and POI data / Xiuyuan Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 161 (March 2020)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 161 (March 2020) . - pp 1 - 12 Titre : Heuristic sample learning for complex urban scenes: Application to urban functional-zone mapping with VHR images and POI data Type de document : Article/Communication Auteurs : Xiuyuan Zhang, Auteur ; Shihong Du, Auteur ; Zhijia Zheng, Auteur Année de publication : 2020 Article en page(s) : pp 1 - 12 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes descripteurs IGN] analyse d'image orientée objet [Termes descripteurs IGN] apprentissage dirigé [Termes descripteurs IGN] apprentissage semi-dirigé [Termes descripteurs IGN] cartographie urbaine [Termes descripteurs IGN] Chine [Termes descripteurs IGN] échantillonnage d'image [Termes descripteurs IGN] image à très haute résolution [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] point d'intérêt [Termes descripteurs IGN] scène urbaine Résumé : (Auteur) Urban functional zones are basic units of urban planning and resource allocation, and contribute to a wide range of urban studies and investigations. Existing studies on functional-zone mapping with very-high-resolution (VHR) satellite images focused much on feature representations and classification techniques, but ignored zone sampling which however was fundamental to automatic zone classifications. Functional-zone sampling is much complicated and can hardly be resolved by classical sampling methods, as functional zones are complex urban scenes which consist of heterogeneous land covers and have highly abstract categories. To resolve the issue, this study presents a novel sampling paradigm, i.e., heuristic sample learning (HSL). It first proposes a sparse topic model to select representative functional zones, then uses deep forest to select confusing zones, and finally embraces Chinese restaurant process to label these selected zones. The presented method collects both representative and confusing zone samples and identifies their categories accurately, which makes the functional-zone classification process robust and the classification results accurate. Experiments conducted in Beijing indicate that HSL is effective and efficient for functional-zone sampling and classifications. Compared to traditional manual sampling, HSL reduces the time cost by 55% and improves the classification accuracy by 11.3% on average; furthermore, HSL can reduce the variation in sampling and classification results caused by different proficiency of operators. Accordingly, HSL significantly contributes to functional-zone mapping and plays an important role in urban studies. Numéro de notice : A2020-061 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2020.01.005 date de publication en ligne : 13/01/2020 En ligne : https://doi.org/10.1016/j.isprsjprs.2020.01.005 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94577 [article]

A new cellular automata framework of urban growth modeling by incorporating statistical and heuristic methods / Yongjiu Feng in International journal of geographical information science IJGIS, vol 34 n° 1 (January 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 1 (January 2020) . - pp 74 - 97 Titre : A new cellular automata framework of urban growth modeling by incorporating statistical and heuristic methods Type de document : Article/Communication Auteurs : Yongjiu Feng, Auteur ; Xiaohua Tong, Auteur Année de publication : 2020 Article en page(s) : pp 74 - 97 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] analyse de données [Termes descripteurs IGN] automate cellulaire [Termes descripteurs IGN] croissance urbaine [Termes descripteurs IGN] données spatiotemporelles [Termes descripteurs IGN] dynamique spatiale [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] modèle de Markov [Termes descripteurs IGN] modèle de simulation [Termes descripteurs IGN] Shanghai (Chine) [Termes descripteurs IGN] utilisation du sol Résumé : (auteur) We develop a new geographical cellular automata (CA) modeling framework, named UrbanCA, through reconstructing the essential CA structure and incorporating nonspatial, spatial, and heuristic approaches. The new UrbanCA is featured by 1) the improvement of the CA modeling framework by reformulating relationships among CA components, 2) the development of two scaling parameters to adjust the effects of transition probability and neighborhood, 3) the incorporation of a variety of statistical and heuristic methods to construct transition rules, and 4) the inclusion of urban planning regulations and spatial heterogeneities to project future urban scenarios. To illustrate the effectiveness of UrbanCA, we calibrate a CA model using artificial bee colony (ABC) to simulate the past urban patterns and predict future scenarios in Shanghai of China. The results show that UrbanCA under different scaling parameters is comparable to CA-Markov (as a reference model) concerning the accuracy of the end-state and change simulations, and is better than CA-Markov regarding the driving factor’s ability to explain the modeling outcomes. UrbanCA provides more choices compared to existing CA software packages, and the models are readily calibrated elsewhere to simulate the dynamic urban growth and assess the resulting natural and socioeconomic impacts. Numéro de notice : A2020-008 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1648813 date de publication en ligne : 02/08/2019 En ligne : https://doi.org/10.1080/13658816.2019.1648813 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94388 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2020011	SL	Revue	Centre de documentation	Revues en salle	Disponible

GeoTxt: A scalable geoparsing system for unstructured text geolocation / Morteza Karimzadeh in Transactions in GIS, vol 23 n° 1 (February 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 1 (February 2019) . - pp 118 - 136 Titre : GeoTxt: A scalable geoparsing system for unstructured text geolocation Type de document : Article/Communication Auteurs : Morteza Karimzadeh, Auteur ; Scott Pezanowski, Auteur ; Alan M. MacEachren, Auteur ; Jan Oliver Wallgrün, Auteur Année de publication : 2019 Article en page(s) : pp 118 - 136 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Informatique [Termes descripteurs IGN] analyse sémantique [Termes descripteurs IGN] analyse syntaxique [Termes descripteurs IGN] appariement de données localisées [Termes descripteurs IGN] corpus [Termes descripteurs IGN] données issues des réseaux sociaux [Termes descripteurs IGN] interface de programmation [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] reconnaissance de noms [Termes descripteurs IGN] répertoire toponymique [Termes descripteurs IGN] réseau sémantique [Termes descripteurs IGN] toponyme [Termes descripteurs IGN] traitement du langage naturel Résumé : (auteur) In this article, we present GeoTxt, a scalable geoparsing system for the recognition and geolocation of place names in unstructured text. GeoTxt offers six named entity recognition (NER) algorithms for place name recognition, and utilizes an enterprise search engine for the indexing, ranking, and retrieval of toponyms, enabling scalable geoparsing for streaming text. GeoTxt offers a flexible application programming interface (API), allowing for customized attribute and/or spatial ranking of retrieved toponyms. We evaluate the system on a corpus of manually geo‐annotated tweets. First, we benchmark the performance of the six NERs that GeoTxt provides access to. Second, we assess GeoTxt toponym resolution accuracy incrementally, demonstrating improvements in toponym resolution achieved (or not achieved) by adding specific heuristics and disambiguation methods. Compared to using the GeoNames web service, GeoTxt's toponym resolution demonstrates a 20% accuracy gain. Our results show that places mentioned in the same tweet do not tend to be geographically proximate. Numéro de notice : A2019-091 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12510 date de publication en ligne : 16/01/2019 En ligne : https://doi.org/10.1111/tgis.12510 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92238 [article]

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390 Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes descripteurs IGN] Arbre-R [Termes descripteurs IGN] chaîne de traitement [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] démonstration de faisabilité [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] objet mobile [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] position [Termes descripteurs IGN] prise en compte du contexte [Termes descripteurs IGN] réseau routier Résumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2018041	SL	Revue	Centre de documentation	Revues en salle	Disponible

A Topology-inferred graph-based heuristic algorithm for map simplification / QiuLei Guo in Transactions in GIS, vol 20 n° 5 (October 2016)  

Public [article]  inTransactions in GIS > vol 20 n° 5 (October 2016) . - pp 775 – 789 Titre : A Topology-inferred graph-based heuristic algorithm for map simplification Type de document : Article/Communication Auteurs : QiuLei Guo, Auteur ; Hassan A. Karimi, Auteur Année de publication : 2016 Article en page(s) : pp 775 – 789 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de généralisation [Termes descripteurs IGN] carte heuristique [Termes descripteurs IGN] graphe [Termes descripteurs IGN] méthode heuristique [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] temps réel [Termes descripteurs IGN] voisinage (topologie) [Vedettes matières IGN] Généralisation Résumé : (auteur) In this article, we present a heuristic map simplification algorithm based on a novel topology-inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is math formula which is efficient enough to be considered for real-time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results; one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly. Numéro de notice : A2016-999 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12188 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83779 [article]

The Visvalingam algorithm: metrics, measures and heuristics / Mahes Visvalingam in Cartographic journal (the), Vol 53 n° 3 (August 2016)  

Permalink

Spatial optimization for regionalization problems with spatial interaction: a heuristic approach / K. Kim in International journal of geographical information science IJGIS, vol 30 n° 3-4 (March - April 2016)  

Permalink

A linear indexing approach to mass movements susceptibility mapping. The case of the Chefchaouen province (Morocco) / Mohamed Mastere in Revue internationale de géomatique, vol 25 n° 2 (juin - août 2015)  

Permalink

TARS: traffic-aware route search / Roy Levin in Geoinformatica, vol 18 n° 3 (July 2014)  

Permalink

Active learning in the spatial domain for remote sensing image classification / André Stumpf in IEEE Transactions on geoscience and remote sensing, vol 52 n° 5 tome 1 (May 2014)  

Permalink

Aggregation of LoD 1 building models as an optimization problem / R. Guercke in ISPRS Journal of photogrammetry and remote sensing, vol 66 n° 2 (March - April 2011)

Permalink

Automatic revision of the control knowledge used by trial and error methods: Application to cartographic generalisation / Patrick Taillandier in Applied soft computing, vol 11 n° 2 (March 2011)  

Permalink

Area aggregation in map generalisation by mixed-integer programming / Jan‐Henrik Haunert in International journal of geographical information science IJGIS, vol 24 n°11-12 (december 2010)  

Permalink

Finding shortest paths on real road networks: the case for A* / W. Zeng in International journal of geographical information science IJGIS, vol 23 n°3-4 (march - april 2009)

Permalink

Révision automatique des connaissances guidant l'exploration informée d'arbres d'états / Patrick Taillandier (2008) 

Permalink