Centre dedocumentation
scientifique

A novel orthoimage mosaic method using a weighted A∗ algorithm : Implementation and evaluation / Maoteng Zheng in ISPRS Journal of photogrammetry and remote sensing, vol 138 (April 2018)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 138 (April 2018) . - pp 30 - 46 Titre : A novel orthoimage mosaic method using a weighted A∗ algorithm : Implementation and evaluation Type de document : Article/Communication Auteurs : Maoteng Zheng, Auteur ; Xiong Xiaodong, Auteur ; Junfeng Zhu, Auteur Année de publication : 2018 Article en page(s) : pp 30 - 46 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Orthophotographie, orthoimage [Termes descripteurs IGN] diagramme de Voronoï [Termes descripteurs IGN] drone [Termes descripteurs IGN] jeu de données localisées [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] noeud [Termes descripteurs IGN] orthophotoplan numérique [Termes descripteurs IGN] pondération Résumé : (Auteur) The implementation and evaluation of a weighted A∗ algorithm for orthoimage mosaic with UAV (Unmanned Aircraft Vehicle) imagery is proposed. The initial seam-line network is firstly generated by standard Voronoi Diagram algorithm; an edge diagram is generated based on DSM (Digital Surface Model) data; the vertices (conjunction nodes of seam-lines) of the initial network are relocated if they are on high objects (buildings, trees and other artificial structures); and the initial seam-lines are refined using the weighted A∗ algorithm based on the edge diagram and the relocated vertices. Our method was tested with three real UAV datasets. Two quantitative terms are introduced to evaluate the results of the proposed method. Preliminary results show that the method is suitable for regular and irregular aligned UAV images for most terrain types (flat or mountainous areas), and is better than the state-of-the-art method in both quality and efficiency based on the test datasets. Numéro de notice : A2018-119 Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2018.02.007 date de publication en ligne : 09/03/2018 En ligne : https://doi.org/10.1016/j.isprsjprs.2018.02.007 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89588 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2018041	RAB	Revue	Centre de documentation	En réserve 3L	Disponible
081-2018043	DEP-EXM	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2018042	DEP-EAF	Revue	Nancy	Dépôt en unité	Exclu du prêt

Multi-view performance capture of surface details / Nadia Robertini in International journal of computer vision, vol 124 n° 1 (August 2017)  

Public [article]  inInternational journal of computer vision > vol 124 n° 1 (August 2017) . - pp 96 – 113 Titre : Multi-view performance capture of surface details Type de document : Article/Communication Auteurs : Nadia Robertini, Auteur ; Dan Casas, Auteur ; Edilson De Aguiar, Auteur ; Christian Theobalt, Auteur Année de publication : 2017 Article en page(s) : pp 96 – 113 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique [Termes descripteurs IGN] courbe de Gauss [Termes descripteurs IGN] échelle d'intensité [Termes descripteurs IGN] image numérique [Termes descripteurs IGN] image vidéo [Termes descripteurs IGN] maille triangulaire [Termes descripteurs IGN] modèle de déformation des images [Termes descripteurs IGN] niveau de détail [Termes descripteurs IGN] noeud [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] reconstruction d'objet Résumé : (auteur) This paper presents a novel approach to recover true fine surface detail of deforming meshes reconstructed from multi-view video. Template-based methods for performance capture usually produce a coarse-to-medium scale detail 4D surface reconstruction which does not contain the real high-frequency geometric detail present in the original video footage. Fine scale deformation is often incorporated in a second pass by using stereo constraints, features, or shading-based refinement. In this paper, we propose an alternative solution to this second stage by formulating dense dynamic surface reconstruction as a global optimization problem of the densely deforming surface. Our main contribution is an implicit representation of a deformable mesh that uses a set of Gaussian functions on the surface to represent the initial coarse mesh, and a set of Gaussians for the images to represent the original captured multi-view images. We effectively find the fine scale deformations for all mesh vertices, which maximize photo-temporal-consistency, by densely optimizing our model-to-image consistency energy on all vertex positions. Our formulation yields a smooth closed form energy with implicit occlusion handling and analytic derivatives. Furthermore, it does not require error-prone correspondence finding or discrete sampling of surface displacement values. We demonstrate our approach on a variety of datasets of human subjects wearing loose clothing and performing different motions. We qualitatively and quantitatively demonstrate that our technique successfully reproduces finer detail than the input baseline geometry. Numéro de notice : A2017-401 Thématique : IMAGERIE Nature : Article En ligne : https://doi.org/10.1007/s11263-016-0979-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85943 [article]

Classified and clustered data constellation: An efficient approach of 3D urban data management / Suhaibah Azri in ISPRS Journal of photogrammetry and remote sensing, vol 113 (March 2016)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 113 (March 2016) . - pp 30 - 42 Titre : Classified and clustered data constellation: An efficient approach of 3D urban data management Type de document : Article/Communication Auteurs : Suhaibah Azri, Auteur ; Uznir Ujang, Auteur ; Francesc Antón Castro, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 30 - 42 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] base de données [Termes descripteurs IGN] classification dirigée [Termes descripteurs IGN] données massives [Termes descripteurs IGN] exploration de données [Termes descripteurs IGN] gestion urbaine [Termes descripteurs IGN] milieu urbain [Termes descripteurs IGN] noeud [Termes descripteurs IGN] recherche d'information géographique Résumé : (auteur) The growth of urban areas has resulted in massive urban datasets and difficulties handling and managing issues related to urban areas. Huge and massive datasets can degrade data retrieval and information analysis performance. In addition, the urban environment is very difficult to manage because it involves various types of data, such as multiple types of zoning themes in the case of urban mixed-use development. Thus, a special technique for efficient handling and management of urban data is necessary. This paper proposes a structure called Classified and Clustered Data Constellation (CCDC) for urban data management. CCDC operates on the basis of two filters: classification and clustering. To boost up the performance of information retrieval, CCDC offers a minimal percentage of overlap among nodes and coverage area to avoid repetitive data entry and multipath query. The results of tests conducted on several urban mixed-use development datasets using CCDC verify that it efficiently retrieves their semantic and spatial information. Further, comparisons conducted between CCDC and existing clustering and data constellation techniques, from the aspect of preservation of minimal overlap and coverage, confirm that the proposed structure is capable of preserving the minimum overlap and coverage area among nodes. Our overall results indicate that CCDC is efficient in handling and managing urban data, especially urban mixed-use development applications. Numéro de notice : A2016-531 Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1016/j.isprsjprs.2015.12.008 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81614 [article]

A wildlife movement approach to optimally locate wildlife crossing structures / Rebecca W. Loraamm in International journal of geographical information science IJGIS, vol 30 n° 1-2 (January - February 2016)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 30 n° 1-2 (January - February 2016) . - pp 74 - 88 Titre : A wildlife movement approach to optimally locate wildlife crossing structures Type de document : Article/Communication Auteurs : Rebecca W. Loraamm, Auteur ; Joni A. Downs, Auteur Année de publication : 2016 Article en page(s) : pp 74 - 88 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] croisement spatial [Termes descripteurs IGN] faune [Termes descripteurs IGN] migration animale [Termes descripteurs IGN] noeud [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] route [Termes descripteurs IGN] Time-geography Résumé : (auteur) Transportation networks negatively impact wildlife populations by limiting the physical movement of the individual animal. In extreme cases road presence can lead to collisions between vehicles and animals, resulting in direct mortality if an animal attempts to cross the road. Crossing structures are one commonly used method for reducing wildlife–vehicle collisions. However, limited funding often reduces the amount of structures that may be constructed in practice. Therefore, areas that have the highest probability for animal interactions with roads should be targeted for locating new structures to provide the best possible outcome. This research uses a probabilistic time-geographic strategy coupled with a site selection phase handled by a classical optimization model to site wildlife crossing structures. To achieve optimal site selection, crossing locations are first identified where wildlife frequently cross roads, and then a maximum covering location problem is applied to these areas as demand nodes. The objective is to cover the largest area having the highest probability of interaction given a finite number of crossing structures available to be located. Coverage is defined in terms of fencing distance associated with a particular structure. The approach was demonstrated using Florida panther telemetry data identifying potential crossing structures across two counties in south Florida. The maximal covering location problem (MCLP) was solved for four coverage distances using radio telemetry tracking data, which captured frequent contact with roads. The results identify that the most effective coverage distance is 2000 m, which incrementally covers more total animal–road interaction probability than that of lower fencing distances in the case of the Florida panther. The results illustrate how this new time-geographic approach, combined with location modeling, measures animal–road interactions probabilistically for finding the optimum placement of wildlife crossing structures. Numéro de notice : A2016-011 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1083995 En ligne : http://dx.doi.org/10.1080/13658816.2015.1083995 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79332 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2016011	RAB	Revue	Centre de documentation	En réserve 3L	Disponible

A hybrid link-node approach for finding shortest paths in road networks with turn restrictions / Qingquan Li in Transactions in GIS, vol 19 n° 6 (December 2015)  

Public [article]  inTransactions in GIS > vol 19 n° 6 (December 2015) . - pp 915 - 929 Titre : A hybrid link-node approach for finding shortest paths in road networks with turn restrictions Type de document : Article/Communication Auteurs : Qingquan Li, Auteur ; Bi Yu Chen, Auteur ; Yafei Wang, Auteur ; William H. K. Lam, Auteur Année de publication : 2015 Article en page(s) : pp 915 - 929 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] analyse comparative [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] navigation automobile [Termes descripteurs IGN] noeud [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] restriction d'accès [Termes descripteurs IGN] traitement de données localisées Résumé : (auteur) Turn restrictions, such as ‘no left turn’ or ‘no U-turn’, are commonly encountered in real road networks. These turn restrictions must be explicitly considered in the shortest path problem and ignoring them may lead to infeasible paths. In the present study, a hybrid link-node Dijkstra's (HLND) algorithm is proposed to exactly solve the shortest path problem in road networks with turn restrictions. A new hybrid link–node labelling approach is devised by using a link–based labelling strategy at restricted nodes with turn restrictions, and a node-based labelling strategy at unrestricted nodes without turn restrictions. Computational results for several real road networks show that the proposed HLND algorithm obtains the same optimal results as the link-based Dijkstra's algorithm, while having a similar computational performance to the classical node-based Dijkstra's algorithm. Numéro de notice : A2016-438 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12133 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81349 [article]

Querying visible points in large obstructed space / Jianqiu Xu in Geoinformatica [en ligne], vol 19 n° 3 (July - September 2015)  

Permalink

A structural-lexical measure of semantic similarity for geo-knowledge graphs / Andrea Ballatore in ISPRS International journal of geo-information, vol 4 n°2 (June 2015)  

Permalink

A dilution-matching-encoding compaction of trajectories over road networks / Ranit Gotsman in Geoinformatica [en ligne], vol 19 n° 2 (April - June 2015)  

Permalink

Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation / P. Raposo in Cartography and Geographic Information Science, vol 40 n° 5 (November 2013)  

Permalink

Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion / H. Antikainen in Transactions in GIS, vol 17 n° 1 (February 2013)  

Permalink

Visualisation 3D de terrain texturé : préservation au niveau du pixel des qualités géométriques et colorimétriques, une méthode temps réel, innovante et simple / T.V. Lê in Revue internationale de géomatique, vol 22 n° 3 (septembre - novembre 2012)

Permalink

A kernel density estimation method for networks, its computational method and a GIS-based tool / A Okabe in International journal of geographical information science IJGIS, vol 23 n° 1-2 (january 2009)

Permalink

Variable-resolution compression of vector data / B. Yang in Geoinformatica, vol 12 n° 3 (September - November 2008)

Permalink

Sensitivity analysis of spatially aggregated responses: a gradient-based method / F. Pantus in International journal of geographical information science IJGIS, vol 22 n° 4-5 (april 2008)

Permalink

NET-DBSCAN: clustering the nodes of a dynamic linear network / Emmanuel Stefanakis in International journal of geographical information science IJGIS, vol 21 n° 3-4 (march - april 2007)

Permalink