Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In recent years, several studies have been published about the smart definition of training set using active learning algorithms. However, none of these works consider the contradiction between the active learning methods, which rank the pixels according to their uncertainty, and the confidence of the user in labeling, which is related both to the homogeneity of the pixel context and to the knowledge of the user of the scene. In this paper, we propose a two-steps procedure based on a filtering scheme to learn the confidence of the user in labeling. This way, candidate training pixels are ranked according both to their uncertainty and to the chances of being labeled correctly by the user. In this way, we avoid the queries where the user would not be able to provide a class for the pixel. We consider the capacity of a model in learning the user's confidence and report experiments on a QuickBird image: the filtering scheme proposed maximizes the number of useful queries with respect to traditional active learning.
Tanja Christina Käser Jacober, Paola Mejia Domenzain, Seyed Parsa Neshaei
Jan Steggemann, Konstantin Androsov, Anna Mascellani, Joanna Malgorzata Wanczyk, Paul Théodore Gabriel Pablo De Bryas Dexmiers d'Archiac