Descripteur
Termes IGN > informatique > génie logiciel > programmation informatique > programmation par contraintes
programmation par contraintesSynonyme(s)PpcVoir aussi |
Documents disponibles dans cette catégorie (127)
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
Constrained Palette-Space Exploration / Nicolas Mellado in ACM Transactions on Graphics, TOG, Vol 36 n° 4 (July 2017)
[article]
Titre : Constrained Palette-Space Exploration Type de document : Article/Communication Auteurs : Nicolas Mellado, Auteur ; David Vanderhaeghe, Auteur ; Charlotte Hoarau , Auteur ; Sidonie Christophe , Auteur ; Mathieu Brédif , Auteur ; Loïc Barthe, Auteur Année de publication : 2017 Projets : 1-Pas de projet / Conférence : SIGGRAPH 2017, ACM conference 30/07/2017 03/08/2017 Los Angeles Californie - Etats-Unis Article en page(s) : 14 p. Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] cartologie
[Termes IGN] chromatopsie
[Termes IGN] graphe
[Termes IGN] interpolation
[Termes IGN] palette de couleurs
[Termes IGN] personne malvoyante
[Termes IGN] programmation par contraintes
[Vedettes matières IGN] GéovisualisationRésumé : (Auteur) Color palettes are widely used by artists to define colors of artworks and explore color designs. In general, artists select the colors of a palette by following a set of rules, e.g. contrast or relative luminance. Existing interactive palette exploration tools explore palette spaces following limited constraints defined as geometric configurations in color space e.g. harmony rules on the color wheel. Palette search algorithms sample palettes from color relations learned from an input dataset, however they cannot provide interactive user edits and palette refinement. We introduce in this work a new versatile formulation enabling the creation of constraint-based interactive palette exploration systems. Our technical contribution is a graph-based palette representation, from which we define palette exploration as a minimization problem that can be solved efficiently and provide real-time feedback. Based on our formulation, we introduce two interactive palette exploration strategies: constrained palette exploration, and for the first time, constrained palette interpolation. We demonstrate the performances of our approach on various application cases and evaluate how it helps users finding trade-offs between concurrent constraints. Numéro de notice : A2017-404 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1145/3072959.3073650 Date de publication en ligne : 20/07/2017 En ligne : https://doi.org/10.1145/3072959.3073650 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86220
in ACM Transactions on Graphics, TOG > Vol 36 n° 4 (July 2017) . - 14 p.[article]Documents numériques
peut être téléchargé
A2017-404_Constrained Palette-Space ExplorationAdobe Acrobat PDF Data-driven estimation of building interior plans / Julian F. Rosser in International journal of geographical information science IJGIS, vol 31 n° 7-8 (July - August 2017)
[article]
Titre : Data-driven estimation of building interior plans Type de document : Article/Communication Auteurs : Julian F. Rosser, Auteur ; Gavin Smith, Auteur ; Jeremy G. Morley, Auteur Année de publication : 2017 Article en page(s) : pp 1652 - 1674 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] bâtiment
[Termes IGN] carte d'intérieur
[Termes IGN] modèle de simulation
[Termes IGN] optimisation spatiale
[Termes IGN] plan
[Termes IGN] programmation par contraintesRésumé : (Auteur) This work investigates constructing plans of building interiors using learned building measurements. In particular, we address the problem of accurately estimating dimensions of rooms when measurements of the interior space have not been captured. Our approach focuses on learning the geometry, orientation and occurrence of rooms from a corpus of real-world building plan data to form a predictive model. The trained predictive model may then be queried to generate estimates of room dimensions and orientations. These estimates are then integrated with the overall building footprint and iteratively improved using a two-stage optimisation process to form complete interior plans.
The approach is presented as a semi-automatic method for constructing plans which can cope with a limited set of known information and constructs likely representations of building plans through modelling of soft and hard constraints. We evaluate the method in the context of estimating residential house plans and demonstrate that predictions can effectively be used for constructing plans given limited prior knowledge about the types of rooms and their topology.Numéro de notice : A2017-315 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2017.1313980 En ligne : http://dx.doi.org/10.1080/13658816.2017.1313980 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85369
in International journal of geographical information science IJGIS > vol 31 n° 7-8 (July - August 2017) . - pp 1652 - 1674[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-2017041 RAB Revue Centre de documentation En réserve L003 Disponible 079-2017042 RAB Revue Centre de documentation Revues en salle Disponible DIOGEN, a multi-level oriented model for cartographic generalization / Adrien Maudet in International journal of cartography, vol 3 n° 1 (June 2017)
[article]
Titre : DIOGEN, a multi-level oriented model for cartographic generalization Type de document : Article/Communication Auteurs : Adrien Maudet , Auteur ; Guillaume Touya , Auteur ; Cécile Duchêne , Auteur ; Sébastien Picault, Auteur Année de publication : 2017 Projets : 1-Pas de projet / Article en page(s) : pp 121 - 133 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] AGENT
[Termes IGN] agent (intelligence artificielle)
[Termes IGN] CartACom
[Termes IGN] carte thématique
[Termes IGN] contrainte relationnelle
[Termes IGN] DIOGEN
[Termes IGN] données vectorielles
[Termes IGN] GAEL
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] modèle (conceptuel) de généralisation
[Termes IGN] programmation par contraintes
[Termes IGN] système multi-agents
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Among approaches for automated generalization of vector data, we focus on the multi-agent paradigm: cartographic objects are modeled as agents (autonomous objects) that apply generalization algorithms to themselves to satisfy cartographic constraints. Several agent levels are considered, for example, individual agents, such as a building, and agents representing a group of agents, such as an urban block composed of the surrounding roads and contained buildings. Several multi-agent models were proposed to automate the orchestration of map generalization processes. Existing multi-agent generalization models have different approaches to manage the relations between agent levels. In this paper, we unify existing models, adapting a multi-level simulation model, to simplify interactions between agents in different levels. We propose the DIOGEN model, in which the principle of interactions between agents of different levels is adapted to constraint-driven cartographic generalization. DIOGEN unifies three existing multi-agent generalization models (AGENT, CartACom and GAEL), combine their behaviors and take advantage of their skills. Our proposal is evaluated on different use cases: instances of topographic mapping, and mapping of hiking routes over topographic data as an example of thematic mapping. Numéro de notice : A2017-321 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/23729333.2017.1300997 Date de publication en ligne : 20/04/2017 En ligne : http://dx.doi.org/10.1080/23729333.2017.1300997 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85379
in International journal of cartography > vol 3 n° 1 (June 2017) . - pp 121 - 133[article]Multilayer NMF for blind unmixing of hyperspectral imagery with additional constraints / L. Chen in Photogrammetric Engineering & Remote Sensing, PERS, vol 83 n° 4 (April 2017)
[article]
Titre : Multilayer NMF for blind unmixing of hyperspectral imagery with additional constraints Type de document : Article/Communication Auteurs : L. Chen, Auteur ; Shengbo Chen, Auteur ; Xulin Guo, Auteur Année de publication : 2017 Article en page(s) : pp 307 - 316 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse des mélanges spectraux
[Termes IGN] calcul matriciel
[Termes IGN] contrainte spectrale
[Termes IGN] factorisation de matrice non-négative
[Termes IGN] filtrage du bruit
[Termes IGN] image hyperspectrale
[Termes IGN] processus de hiérarchisation analytique
[Termes IGN] programmation par contraintes
[Termes IGN] réflectanceRésumé : (Auteur) Due to the coincidence of hyperspectral reflectance nonnegativity (and its corresponding abundance) with nonnegative matrix factorization (NMF) methods, NMF has been widely applied to unmix hyperspectral images in recent years. However, many local minima persist because of the nonconvexity of the objective function. Thus, the nonnegativity constraint is not sufficient and additional auxiliary constraints should be applied to objective functions. In this paper, a new approach we call constrained multilayer NMF (CMLNMF), is proposed for hyperspectral data. In this approach, the mixed spectra are regarded as endmember signatures that has been contaminated by multiplicative noise. The purpose of CMLNMF is to eliminate noise by hierarchical processing until the endmember spectra are obtained. Also, the hierarchical processing is self-adaptive to make the algorithm more effective. Furthermore, in each layer two constraints are implemented on the objective function. One is sparseness on the abundance matrix and the other is minimum volume on the spectral matrix. The hierarchical processing separates the abundance matrix into a series of matrices that make the characteristic of sparseness more obvious and meaningful. The proposed algorithm is applied to synthetic data and real hyperspectral data for quantitative evaluation. According to the comparison with other algorithms, CMLNMF has better performance and provides effective solutions for blind unmixing of hyperspectral image data. Numéro de notice : A2017-112 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE/MATHEMATIQUE Nature : Article DOI : 10.14358/PERS.83.4.307 En ligne : https://doi.org/10.14358/PERS.83.4.307 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84590
in Photogrammetric Engineering & Remote Sensing, PERS > vol 83 n° 4 (April 2017) . - pp 307 - 316[article]A spatial anomaly points and regions detection method using multi-constrained graphs and local density / Yan Shi in Transactions in GIS, vol 21 n° 2 (April 2017)
[article]
Titre : A spatial anomaly points and regions detection method using multi-constrained graphs and local density Type de document : Article/Communication Auteurs : Yan Shi, Auteur ; Min Deng, Auteur ; Xuexi Yang, Auteur ; Qiliang Liu, Auteur Année de publication : 2017 Article en page(s) : pp 376 – 405 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] analyse de données
[Termes IGN] analyse spatiale
[Termes IGN] attribut sémantique
[Termes IGN] cartographie statistique
[Termes IGN] détection d'anomalie
[Termes IGN] graphe
[Termes IGN] interpolation spatiale
[Termes IGN] programmation par contraintes
[Termes IGN] triangulation de DelaunayRésumé : (auteur) Spatial anomalies may be single points or small regions whose non-spatial attribute values are significantly inconsistent with those of their spatial neighborhoods. In this article, a Spatial Anomaly Points and Regions Detection method using multi-constrained graphs and local density (SAPRD for short) is proposed. The SAPRD algorithm first models spatial proximity relationships between spatial entities by constructing a Delaunay triangulation, the edges of which provide certain statistical characteristics. By considering the difference in non-spatial attributes of adjacent spatial entities, two levels of non-spatial attribute distance constraints are imposed to improve the proximity graph. This produces a series of sub-graphs, and those with very few entities are identified as candidate spatial anomalies. Moreover, the spatial anomaly degree of each entity is calculated based on the local density. A spatial interpolation surface of the spatial anomaly degree is generated using the inverse distance weight, and this is utilized to reveal potential spatial anomalies and reflect their whole areal distribution. Experiments on both simulated and real-life spatial databases demonstrate the effectiveness and practicability of the SAPRD algorithm. Numéro de notice : A2017-167 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12208 En ligne : http://dx.doi.org/10.1111/tgis.12208 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84701
in Transactions in GIS > vol 21 n° 2 (April 2017) . - pp 376 – 405[article]Constrained clustering by constraint programming / Thi-Bich-Hanh Dao in Artificial intelligence, vol 244 (March 2017)PermalinkMatching plot-level tree maps with 3D remote sensing data for assessing and estimating forest parameters / Cédric Vega (2017)PermalinkMise en place d’un processus de dessin automatisé de plans d’intérieurs à partir de nuages de points acquis par LIDAR / Léa Talec (2017)PermalinkCohérence logique dans les systèmes OLAP spatiaux : un état de l’art / Sandro Bimonte in Revue internationale de géomatique, vol 26 n° 1 (janvier - mars 2016)PermalinkFeature-driven generalization of isobaths on nautical charts: A multi-agent system approach / Eric Guilbert in Transactions in GIS, vol 20 n° 1 (February 2016)PermalinkRoutes visualization: Automated placement of multiple route symbols along a physical network infrastructure / Jules Teulade-Denantes in Journal of Spatial Information Science (JoSIS), n° 11 (September 2015)PermalinkInterferometric phase image estimation via sparse coding in the complex domain / Hao Hongxing in IEEE Transactions on geoscience and remote sensing, vol 53 n° 5 (mai 2015)PermalinkConstrained least squares algorithms for nonlinear unmixing of hyperspectral imagery / Hanye Pu in IEEE Transactions on geoscience and remote sensing, vol 53 n° 3 (March 2015)PermalinkFlexible building primitives for 3D building modeling / B. Xiong in ISPRS Journal of photogrammetry and remote sensing, vol 101 (March 2015)PermalinkRank-based strategies for cleaning inconsistent spatial databases / Nieves R. Brisaboa in International journal of geographical information science IJGIS, vol 29 n° 2 (February 2015)Permalink