Descripteur
Termes IGN > mathématiques > analyse numérique > optimisation (mathématiques)
optimisation (mathématiques)Synonyme(s)algorithme d'optimisation minimisationVoir aussi |
Documents disponibles dans cette catégorie (469)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Optimal resolution for linking remotely sensed and forest inventory data in Europe / Adam Moreno in Remote sensing of environment, vol 183 (15 September 2016)
[article]
Titre : Optimal resolution for linking remotely sensed and forest inventory data in Europe Type de document : Article/Communication Auteurs : Adam Moreno, Auteur ; Mathias Neumann, Auteur ; Hubert Hasenauer, Auteur Année de publication : 2016 Article en page(s) : pp 109 - 119 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] agrégation spatiale
[Termes IGN] Autriche
[Termes IGN] Belgique
[Termes IGN] Corine Land Cover
[Termes IGN] Finlande
[Termes IGN] inventaire forestier étranger (données)
[Termes IGN] optimisation (mathématiques)
[Termes IGN] Union Européenne
[Vedettes matières IGN] Inventaire forestierRésumé : (auteur) Forests provide critical ecosystem services that ensure the sustainability of the environment and society. To manage forests on large scales, spatially explicit gridded data that describes the characteristics of these forests over the entire study area are required. There have been multiple efforts to create such data on regional and global scales. This type of gridded spatially explicit data on forest characteristics are typically done by integrating terrestrial forest inventory (NFI) and satellite-based remotely sensed data. Many studies that incorporate remotely sensed data and forest inventory data often directly compare pixels to inventory plots. The standard resolution of 0.0083° is typically used to integrate these two types of data sets. There is an assumption that, when producing gridded data sets incorporating forest inventory data, the finer the resolution the better the information. This assumption may seem intuitive, however at this resolution, in Europe, each 0.0083° cell has on average 1 NFI plot, which results in a sample with 0 degrees of freedom that represents 0.02% of the cell area. In this study, we challenge this assumption and we quantify the optimal resolution with which to compare and combine remotely sensed and NFI data from the largest collated and harmonized NFI data set in Europe including 196,434 plots. We determined that aggregating data with an original resolution of 0.0083° to between 0.0664° and 0.266° (or × 8 to × 32) produces the best agreement between these two forest inventory and remotely sensed data sets, and the lowest standard error in NFI data, and maintains the majority of the local-level spatial heterogeneity. Numéro de notice : A2016-707 Affiliation des auteurs : non IGN Thématique : FORET Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.rse.2016.05.021 En ligne : http://dx.doi.org/10.1016/j.rse.2016.05.021 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=82079
in Remote sensing of environment > vol 183 (15 September 2016) . - pp 109 - 119[article]A simulated annealing algorithm for zoning in planning using parallel computing / Inès Santé in Computers, Environment and Urban Systems, vol 59 (September 2016)
[article]
Titre : A simulated annealing algorithm for zoning in planning using parallel computing Type de document : Article/Communication Auteurs : Inès Santé, Auteur ; Francisco F. Rivera, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 95 - 106 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] algorithme du recuit simulé
[Termes IGN] Galice (Espagne)
[Termes IGN] optimisation (mathématiques)
[Termes IGN] parcelle cadastrale
[Termes IGN] partition d'image
[Termes IGN] polygone
[Termes IGN] processeur multicoeur
[Termes IGN] utilisation du solRésumé : (auteur) There is an increasing demand for tools that support land use planning processes, particularly the design of zoning maps, which is one of the most complex tasks in the field. In this task, different land use categories need to be allocated according to multiple criteria. The problem can be formalized in terms of a multiobjective problem. This paper generalizes and complements a previous work on this topic. It presents an algorithm based on a simulated annealing heuristic that optimizes the delimitation of land use categories on a cadastral parcel map according to suitability and compactness criteria. The relative importance of both criteria can be adapted to any particular case. Despite its high computational cost, the use of plot polygons was decided because it is realistic in terms of technical application and land use laws. Due to the computational costs of our proposal, parallel implementations are required, and several approaches for shared memory systems such as multicores are analysed in this paper. Results on a real case study conducted in the Spanish municipality of Guitiriz show that the parallel algorithm based on simulated annealing is a feasible method to design alternative zoning maps. Comparisons with results from experts are reported, and they show a high similarity. Results from our strategy outperform those by experts in terms of suitability and compactness. The parallel version of the code produces good results in terms of speed-up, which is crucial for taking advantage of the architecture of current multicore processors. Numéro de notice : A2016-407 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.compenvurbsys.2016.05.005 Date de publication en ligne : 10/06/2016 En ligne : http://dx.doi.org/10.1016/j.compenvurbsys.2016.05.005 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81240
in Computers, Environment and Urban Systems > vol 59 (September 2016) . - pp 95 - 106[article]Building displacement based on the topological structure / Yageng Sun in Cartographic journal (the), Vol 53 n° 3 (August 2016)
[article]
Titre : Building displacement based on the topological structure Type de document : Article/Communication Auteurs : Yageng Sun, Auteur ; Qingsheng Guo, Auteur ; Yuangang Liu, Auteur ; et al., Auteur Année de publication : 2016 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme snake
[Termes IGN] déplacement d'objet géographique
[Termes IGN] généralisation automatique de données
[Termes IGN] optimisation (mathématiques)
[Termes IGN] partitionnement
[Termes IGN] pondération
[Termes IGN] relation spatiale
[Termes IGN] triangulation de Delaunay
[Vedettes matières IGN] GénéralisationRésumé : (auteur) Map data at smaller scales than their source can result in spatial conflict, whereby map symbols become too close, or overlaid. Server map generalisation operators may be applied to solve this problem, including displacement. In this paper, we show how an optimisation algorithm, the snake algorithm, was used to displace multiple objects in order to resolve spatial conflicts and maintain important spatial relationships between objects during displacement. Two principles based on the snake algorithm are proposed in this paper. First, the truss structure mirroring spatial proximity relationships between buildings and between building and road is formed based on the weighted proximity graph derived from constrained Delaunay triangulations (CDT) in each map partition. In the weighted proximity graph, each connecting line is determined as a snake and as an element unit to assemble the global stiffness matrix in snake algorithm. Second, a buffer method that calculates force between a building and a road (or other linear features) or between pair of buildings is adopted in the snake algorithm. This avoids the imbalance phenomenon caused by different force calculation methods during the displacement. The feasibility of the approach is demonstrated in obtaining real geographic data. Finally, the results are cartographically usable and in particular, the spatial relationships between objects are preserved. Numéro de notice : A2016-680 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1179/1743277414Y.0000000089 En ligne : http://dx.doi.org/10.1179/1743277414Y.0000000089 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81937
in Cartographic journal (the) > Vol 53 n° 3 (August 2016)[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 030-2016031 RAB Revue Centre de documentation En réserve L003 Disponible A local structure and direction-aware optimization approach for three-dimensional tree modeling / Zhen Wang in IEEE Transactions on geoscience and remote sensing, vol 54 n° 8 (August 2016)
[article]
Titre : A local structure and direction-aware optimization approach for three-dimensional tree modeling Type de document : Article/Communication Auteurs : Zhen Wang, Auteur ; Liqiang Zhang, Auteur ; Tian Fang, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 4749 - 4757 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] arbre (flore)
[Termes IGN] données lidar
[Termes IGN] données localisées 3D
[Termes IGN] optimisation (mathématiques)
[Termes IGN] reconstruction 3D
[Termes IGN] semis de points
[Termes IGN] squelettisationRésumé : (Auteur) Modeling 3-D trees from terrestrial laser scanning (TLS) point clouds remains a challenging task for several well-known reasons, including their complex structure and severe occlusions. In order to accurately reconstruct 3-D tree models from TLS point clouds that typically suffer from significant occlusions, in this paper, a novel local structure and direction-aware approach is presented to successfully complete missing structures of trees. In this method, we first extract the coarse tree skeleton from the input point cloud, and thus, the branch dominant direction and the point density of each branch are obtained. By a skeleton-based Laplacian algorithm, the point cloud is further shrunk into a skeleton point cloud to highlight the branch dominant direction of each branch. For obtaining even more accurate point densities, a dictionary-based algorithm is utilized to learn and reconstruct the local structure. Finally, the branch dominant direction and point density are integrated into an iterative optimization process to recover the missing data. Extensive experimental results have shown that the proposed method is very robust to incomplete data sets, and it is capable of accurately reconstructing 3-D trees, which are partially, or even to a large extent, missing from the input point cloud. Numéro de notice : A2016-890 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2016.2551286 En ligne : http://dx.doi.org/10.1109/TGRS.2016.2551286 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83070
in IEEE Transactions on geoscience and remote sensing > vol 54 n° 8 (August 2016) . - pp 4749 - 4757[article]Recursive orthogonal projection-based simplex growing algorithm / Hsiao-Chi Li in IEEE Transactions on geoscience and remote sensing, vol 54 n° 7 (July 2016)
[article]
Titre : Recursive orthogonal projection-based simplex growing algorithm Type de document : Article/Communication Auteurs : Hsiao-Chi Li, Auteur ; Chein-I Chang, Auteur Année de publication : 2016 Article en page(s) : pp 3780 - 3793 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications de télédétection
[Termes IGN] algorithme du simplexe
[Termes IGN] filtre de Kalman
[Termes IGN] géophysique
[Termes IGN] image hyperspectrale
[Termes IGN] projection orthogonaleRésumé : (Auteur) The simplex growing algorithm (SGA) has been widely used for finding endmembers. It can be considered as a sequential version of the well-known endmember finding algorithm, N-finder algorithm (N-FINDR), which finds endmembers one at a time by growing simplexes. However, one of the major hurdles for N-FINDR and SGA is the calculation of simplex volume (SV) which poses a great challenge in designing any algorithm using SV as a criterion for finding endmembers. This paper develops an orthogonal projection (OP)-based SGA (OP-SGA) which essentially resolves this computational issue. It converts the issue of calculating SV to calculating the OP on previously found simplexes without computing matrix determinants. Most importantly, a recursive Kalman filter-like OP-SGA, to be called recursive OP-SGA (ROP-SGA), can be also derived to ease computation. By virtue of ROP-SGA, several advantages and benefits in computational savings and hardware implementation can be gained for which N-FINDR and SGA do not have. Numéro de notice : A2016-871 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2016.2527737 En ligne : http://dx.doi.org/10.1109/TGRS.2016.2527737 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=83028
in IEEE Transactions on geoscience and remote sensing > vol 54 n° 7 (July 2016) . - pp 3780 - 3793[article]Task selection in spatial crowdsourcing from worker’s perspective / Dingxiong Deng in Geoinformatica, vol 20 n° 3 (July - September 2016)PermalinkSpectral band selection for urban material classification using hyperspectral libraries / Arnaud Le Bris in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol III-7 (July 2016)PermalinkFusion of hyperspectral and VHR multispectral image classifications in urban α–areas / Alexandre Hervieu in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol III-3 (July 2016)PermalinkIntegrating risk preferences in forest harvest scheduling / Kyle J. Eyvindson in Annals of Forest Science, vol 73 n° 2 (June 2016)PermalinkOptimization of observation plan based on the stochastic characteristics of the geodetic network / Wojciech Pachelski in Reports on geodesy and geoinformatics, vol 101 (June 2016)PermalinkReconstruction of the vertical electron density profile based on vertical TEC using the simulated annealing algorithm / Chunhua Jiang in Advances in space research, vol 57 n° 10 (May 2016)PermalinkSimulating urban growth processes by integrating cellular automata model and artificial optimization in Binhai New Area of Tianjin, China / Fengmei Yao in Geocarto international, vol 31 n° 5 - 6 (May - June 2016)PermalinkOptimisation d'un service d'autopartage de véhicules électriques / Amine Ait-Ouahmed in Revue internationale de géomatique, vol 26 n° 2 (avril - juin 2016)PermalinkA synchronization algorithm for spaceborne/stationary BiSAR imaging based on contrast optimization with direct signal from radar satellite / M. Zhang in IEEE Transactions on geoscience and remote sensing, vol 54 n° 4 (April 2016)PermalinkEffect of tree location on mitigating parking lot insolation / Ivana Bajsanski in Computers, Environment and Urban Systems, vol 56 (March 2016)Permalink