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 (347)
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
A spatial approach to forest-management optimization: linking GIS and multiple objective genetic algorithms / E.I. Ducheyne in International journal of geographical information science IJGIS, vol 20 n° 8 (september 2006)
[article]
Titre : A spatial approach to forest-management optimization: linking GIS and multiple objective genetic algorithms Type de document : Article/Communication Auteurs : E.I. Ducheyne, Auteur ; R.R. DE Wulf, Auteur ; Bernard De Baets, Auteur Année de publication : 2006 Article en page(s) : pp 917 - 928 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] algorithme génétique
[Termes IGN] forêt
[Termes IGN] forêt tempérée
[Termes IGN] optimisation (mathématiques)
[Termes IGN] outil d'aide à la décision
[Termes IGN] sylvicultureRésumé : (Auteur) Forest-management decision-support systems are largely monolithic structures. Spatial details are left out during the optimization process and are elaborated during the operational planning. This might produce misleading results and plans that are impossible to implement. In this paper, a forest-management spatial decision-support systems is presented, in which spatial formulation needed for wildlife models is included during the optimization process. To this end, a multiple-objective genetic algorithm is combined with a geographical information system. An online spatial evaluation of the objective functions is made possible. This is illustrated by a pilot study in Kirkhill forest, Aberdeen. Copyright Taylor & Francis Numéro de notice : A2006-351 Affiliation des auteurs : non IGN Thématique : FORET/GEOMATIQUE Nature : Article DOI : 10.1080/13658810600711287 En ligne : https://doi.org/10.1080/13658810600711287 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28075
in International journal of geographical information science IJGIS > vol 20 n° 8 (september 2006) . - pp 917 - 928[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-06081 RAB Revue Centre de documentation En réserve L003 Disponible 079-06082 RAB Revue Centre de documentation En réserve L003 Disponible Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees / Renato Martins Assuncao in International journal of geographical information science IJGIS, vol 20 n° 7 (august 2006)
[article]
Titre : Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees Type de document : Article/Communication Auteurs : Renato Martins Assuncao, Auteur ; M.C. Neves, Auteur ; G. Camara, Auteur ; et al., Auteur Année de publication : 2006 Article en page(s) : pp 797 - 811 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] algorithme STA
[Termes IGN] arbre (mathématique)
[Termes IGN] données socio-économiques
[Termes IGN] graphe
[Termes IGN] objet géographique
[Termes IGN] optimisation (mathématiques)
[Termes IGN] régionalisation (segmentation)Résumé : (Auteur) Regionalization is a classification procedure applied to spatial objects with an areal representation, which groups them into homogeneous contiguous regions. This paper presents an efficient method for regionalization. The first step creates a connectivity graph that captures the neighbourhood relationship between the spatial objects. The cost of each edge in the graph is inversely proportional to the similarity between the regions it joins. We summarize the neighbourhood structure by a minimum spanning tree (MST), which is a connected tree with no circuits. We partition the MST by successive removal of edges that link dissimilar regions. The result is the division of the spatial objects into connected regions that have maximum internal homogeneity. Since the MST partitioning problem is NP-hard, we propose a heuristic to speed up the tree partitioning significantly. Our results show that our proposed method combines performance and quality, and it is a good alternative to other regionalization methods found in the literature. Copyright Taylor & Francis. Numéro de notice : A2006-295 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810600665111 En ligne : https://doi.org/10.1080/13658810600665111 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28022
in International journal of geographical information science IJGIS > vol 20 n° 7 (august 2006) . - pp 797 - 811[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-06071 RAB Revue Centre de documentation En réserve L003 Disponible 079-06072 RAB Revue Centre de documentation En réserve L003 Disponible Scale sets image analysis / Laurent Guigues in International journal of computer vision, vol 68 n°3 (July 2006)
[article]
Titre : Scale sets image analysis Type de document : Article/Communication Auteurs : Laurent Guigues , Auteur ; Jean-Pierre Cocquerez, Auteur ; Hervé Le Men , Auteur Année de publication : 2006 Article en page(s) : pp 289 - 317 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] géométrie de l'image
[Termes IGN] méthode de réduction d'énergie
[Termes IGN] partitionnement
[Termes IGN] programmation dynamique
[Termes IGN] représentation multiple
[Termes IGN] segmentation d'imageRésumé : (auteur) This paper introduces a multi-scale theory of piecewise image modelling, called the scale-sets theory, and which can be regarded as a region-oriented scale-space theory. The first part of the paper studies the general structure of a geometrically unbiased region-oriented multi-scale image description and introduces the scale-sets representation, a representation which allows to handle such a description exactly. The second part of the paper deals with the way scale-sets image analyses can be built according to an energy minimization principle. We consider a rather general formulation of the partitioning problem which involves minimizing a two-term-based energy, of the form λC + D, where D is a goodness-of-fit term and C is a regularization term. We describe the way such energies arise from basic principles of approximate modelling and we relate them to operational rate/distorsion problems involved in lossy compression problems. We then show that an important subset of these energies constitutes a class of multi-scale energies in that the minimal cut of a hierarchy gets coarser and coarser as parameter λ increases. This allows us to devise a fast dynamic-programming procedure to find the complete scale-sets representation of this family of minimal cuts. Considering then the construction of the hierarchy from which the minimal cuts are extracted, we end up with an exact and parameter-free algorithm to build scale-sets image descriptions whose sections constitute a monotone sequence of upward global minima of a multi-scale energy, which is called the “scale climbing” algorithm. This algorithm can be viewed as a continuation method along the scale dimension or as a minimum pursuit along the operational rate/distorsion curve. Furthermore, the solution verifies a linear scale invariance property which allows to completely postpone the tuning of the scale parameter to a subsequent stage. For computational reasons, the scale climbing algorithm is approximated by a pair-wise region merging scheme: however the principal properties of the solutions are kept. Some results obtained with Mumford-Shah’s piece-wise constant model and a variant are provided and different applications of the proposed multi-scale analyses are finally sketched. Numéro de notice : A2006-660 Affiliation des auteurs : MATIS+Ext (1993-2011) Thématique : IMAGERIE Nature : Article DOI : 10.1007/s11263-005-6299-0 Date de publication en ligne : 01/04/2006 En ligne : http://doi.org/10.1007/s11263-005-6299-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86514
in International journal of computer vision > vol 68 n°3 (July 2006) . - pp 289 - 317[article]Calibration of spaceborne laser Altimeters: an algorithm and the site selection problem / S. Filin in IEEE Transactions on geoscience and remote sensing, vol 44 n° 6 (June 2006)
[article]
Titre : Calibration of spaceborne laser Altimeters: an algorithm and the site selection problem Type de document : Article/Communication Auteurs : S. Filin, Auteur Année de publication : 2006 Article en page(s) : pp 1484 - 1492 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Acquisition d'image(s) et de donnée(s)
[Termes IGN] altimètre laser
[Termes IGN] estimation statistique
[Termes IGN] étalonnage d'instrument
[Termes IGN] évaluation des données
[Termes IGN] optimisation (mathématiques)Résumé : (Auteur) Meeting the accuracy demand of products derived from spaceborne laser altimetry requires post-launch calibration/validation procedures. Over general surfaces, such as the ones land or ice offer, calibration methods that suite undulating topography should be applied. Whereas the estimation of calibration parameters usually refers to the derivation of an error model, the problem here extends beyond that. Not knowing in advance the offsets between the recorded and actual footprint locations implies that the offsets and the calibration parameters should be estimated jointly. In addition, concerns arise regarding the reliability and quality of the estimates, namely avoiding convergence to a false solution and avoiding estimates that are highly correlated and with a low level of accuracy. The correlation and the accuracy can indeed be estimated in retrospect, but the preference is to learn in advance what factors affect them and under what circumstances they can be optimized. This paper analyzes the calibration problem along the lines of correctness and reliable estimation and shows that the error recovery model provides ample information that can lead to a solution that is both efficient and an integral part of a calibration model. Analysis of the model shows that over natural topography relatively short sites are sufficient for achieving a reliable calibration. The paper then shows that by applying optimisation criteria on the estimation, rules for predicting the quality of the solution can be derived as well as general measures for evaluating sites considered for calibration. Copyright IEEE Numéro de notice : A2006-259 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2005.863295 En ligne : https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1634712 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27986
in IEEE Transactions on geoscience and remote sensing > vol 44 n° 6 (June 2006) . - pp 1484 - 1492[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 065-06061 RAB Revue Centre de documentation En réserve L003 Disponible An evolutionary algorithm for multicriteria path optimization problems / P. Mooney in International journal of geographical information science IJGIS, vol 20 n° 4 (april 2006)
[article]
Titre : An evolutionary algorithm for multicriteria path optimization problems Type de document : Article/Communication Auteurs : P. Mooney, Auteur ; A. Winstanley, Auteur Année de publication : 2006 Article en page(s) : pp 401 - 423 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] algorithme évolutionniste
[Termes IGN] analyse multicritère
[Termes IGN] approximation
[Termes IGN] implémentation (informatique)
[Termes IGN] optimisation (mathématiques)
[Termes IGN] pondération
[Termes IGN] système d'information géographiqueRésumé : (Auteur) For many years researchers and decision makers (DMs) faced with multicriteria shortest path problems (MSPPs) have resorted to reductions to the classical shortest path problem (SPP) by means of weighted linear combinations of the criteria. Algorithmic and approximation schemes are available to solve MSPPs but these approaches often display complexities prohibitive to their implementation on real-world applications. This paper describes the development of an Evolutionary Algorithm (EA) approach to MSPPs on networks with multiple independent criteria. The EA approach is shown to sufficiently explore the underlying network space, generate large candidate path sets, and evolve high quality approximations to the optimal MSPP solution(s). Opportunities for early termination of the EA in time-critical applications are also offered. Among the issues for further work is the integration of the EA as a tool within a GIS for path optimization. Numéro de notice : A2006-180 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810600607766 En ligne : https://doi.org/10.1080/13658810600607766 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27907
in International journal of geographical information science IJGIS > vol 20 n° 4 (april 2006) . - pp 401 - 423[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-06041 RAB Revue Centre de documentation En réserve L003 Disponible 079-06042 RAB Revue Centre de documentation En réserve L003 Disponible Interprétation de scènes urbaines à partir d'images satellitaires THR : reconstruction de facettes 3D et optimisation globale 3D / Nesrine Chehata in Bulletin d'information scientifique et technique de l'IGN, n° 75 (mars 2006)PermalinkPermalinkCumul de mesures de télémétrie laser sur satellites / Arnaud Pollet (2006)PermalinkHow to merge optimization and agent-based techniques in a single generalization model? / Julien Gaffuri (2006)PermalinkA multiresolution and optimization-based image matching approach: An application to surface reconstruction from SPOT5-HRS stereo imagery / Marc Pierrot-Deseilligny (2006)PermalinkOn the optimization and selection of wavelet texture for feature extraction from high-resolution satellite imagery with application towards urban-tree delineation / Y.O. Ouma in International Journal of Remote Sensing IJRS, vol 27 n°1-2 (January 2006)PermalinkSampling scheme optimization from hyperspectral data / Pravesh Debba (2006)PermalinkPermalinkThéorie des graphes et applications, avec exercices et problèmes / Jean-Claude Fournier (2006)PermalinkModèle paramétrique pour la reconstruction automatique en 3D de zones urbaines denses à partir d'images satellitaires haute résolution / Florent Lafarge in Revue Française de Photogrammétrie et de Télédétection, n° 180 (Décembre 2005)Permalink