This thesis investigates if support vector machine classification is a suitable approach when performing automatic segmentation of knee cartilage using quantitative magnetic resonance imaging data. The data sets used are part of a clinical project that investigates if patients that have suffered recent knee damage will develop cartilage damage. Therefore the thesis also investigates if the segmentation results can be used to predict the clinical outcome of the patients. Two methods that perform the segmentation using support vector machine classification are implemented and evaluated. The evaluation indicates that it is a good approach for the task, but the implemented methods needs to be further improved and tested on more data sets before clinical use. It was not possible to relate the cartilage properties to clinical outcome using the segmentation results. However, the investigation demonstrated good promise of how the segmentation results, if they are improved, can be used in combination with quantitative magnetic resonance imaging data to analyze how the cartilage properties change over time or vary between knees.

Cette thèse s’intéresse à la problématique de la classification dynamique en environnements stationnaires et non stationnaires, tolérante aux variations de quantités des données d’apprentissage et capable d’ajuster ses modèles selon la variabilité des données entrantes. Pour cela, nous proposons une solution faisant cohabiter des classificateurs one-class SVM indépendants ayant chacun leur propre procédure d’apprentissage incrémentale et par conséquent, ne subissant pas d’influences croisées pouvant émaner de la configuration des modèles des autres classificateurs. L’originalité de notre proposition repose sur l’exploitation des anciennes connaissances conservées dans les modèles de SVM (historique propre à chaque SVM représenté par l’ensemble des vecteurs supports trouvés) et leur combinaison avec les connaissances apportées par les nouvelles données au moment de leur arrivée. Le modèle de classification proposé (mOC-iSVM) sera exploité à travers trois variations exploitant chacune différemment l’historique des modèles. Notre contribution s’inscrit dans un état de l’art ne proposant pas à ce jour de solutions permettant de traiter à la fois la dérive de concepts, l’ajout ou la suppression de concepts, la fusion ou division de concepts, tout en offrant un cadre privilégié d’interactions avec l’utilisateur. Dans le cadre du projet ANR DIGIDOC, notre approche a été appliquée sur plusieurs scénarios de classification de flux d’images pouvant survenir dans des cas réels lors de campagnes de numérisation. Ces scénarios ont permis de valider une exploitation interactive de notre solution de classification incrémentale pour classifier des images arrivant en flux afin d’améliorer la qualité des images numérisées. / This research contributes to the field of dynamic learning and classification in case of stationary and non-stationary environments. The goal of this PhD is to define a new classification framework able to deal with very small learning dataset at the beginning of the process and with abilities to adjust itself according to the variability of the incoming data inside a stream. For that purpose, we propose a solution based on a combination of independent one-class SVM classifiers having each one their own incremental learning procedure. Consequently, each classifier is not sensitive to crossed influences which can emanate from the configuration of the models of the other classifiers. The originality of our proposal comes from the use of the former knowledge kept in the SVM models (represented by all the found support vectors) and its combination with the new data coming incrementally from the stream. The proposed classification model (mOC-iSVM) is exploited through three variations in the way of using the existing models at each step of time. Our contribution states in a state of the art where no solution is proposed today to handle at the same time, the concept drift, the addition or the deletion of concepts, the fusion or division of concepts while offering a privileged solution for interaction with the user. Inside the DIGIDOC project, our approach was applied to several scenarios of classification of images streams which can correspond to real cases in digitalization projects. These different scenarios allow validating an interactive exploitation of our solution of incremental classification to classify images coming in a stream in order to improve the quality of the digitized images.

Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-06-23T19:10:20Z No. of bitstreams: 2 Dissertação - André Reis de Geus - 2016.pdf: 8269330 bytes, checksum: 1345e49235c545021c88a7baf696f5c0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2017-07-07T20:25:28Z (GMT) No. of bitstreams: 2 Dissertação - André Reis de Geus - 2016.pdf: 8269330 bytes, checksum: 1345e49235c545021c88a7baf696f5c0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-07-07T20:25:28Z (GMT). No. of bitstreams: 2 Dissertação - André Reis de Geus - 2016.pdf: 8269330 bytes, checksum: 1345e49235c545021c88a7baf696f5c0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-03-10 / Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG / Insects cause significant losses of stored grains in both quantity and quality. In the scenary, it is of paramount importance an early identification of insects in grains to take control measures. Instead of sampling and visual/laboratory analysis of grains, we propose to carry out the insects identification task automatically, using computational methods to perform endoscopic video analysis. The videos are recorded inside of grains warehouses by an endoscopic camera. As the classification process of moving objects in video rely heavily on precise segmentation of moving objets, we propose a new method of background subtraction and compared their results with the main methods of the literature according to a recent review. The main innovation of the background subtractionmethod rely on the binarization process that uses two thresholds: a global and a local threshold. The binarized results are combined by adding details of the object obtained by the local threshold in the result of the global threshold. Experimental results performed through visual analysis of the segmentation results and using a SVM classifier, suggest that the proposed segmentation method produces more accurate results than the state-of-art background subtraction methods. / Insetos causam perdas quantitativas e qualitativas significantesemgrãos armazenados. Neste cenário, é de vital importância uma identificação rápida de insetos em grãos para que sejam tomadas medidas de controle. Ao invés de coletar amostras de grãos para análise visual/laboratorial, é proposta a realização desta tarefa de identificação de formaautomática, usando métodos computacionais para a análise de vídeos endoscópicos. Os vídeos são gravados dentro de armazéns de grãos usando câmera endoscópica. Como o processo de classificação de objetos em movimento em vídeo depende fundamentalmente de uma segmentação de objeto precisa, é proposto um novo método de segmentação por subtração de plano de fundo e comparado seus resultados com os principais métodos da literatura de acordo com um estudo de revisão recente. A principal inovação neste método de subtração de plano de fundo está no processo de binarização que usa dois thresholds: um global e um local. Os resultados binarizados são combinados pela adição de detalhes do objeto obtido pelo threshold local no resultado do threshold global. Resultados experimentais, realizados através de análise visual dos resultados de segmentação e usandoumclassificadorSVMindicamque o método de segmentação proposto produz melhores resultados que métodos do estado da arte atual da literatura de subtração de plano de fundo.

This thesis deals with a document classification, especially with a text classification method. Main goal of this thesis is to analyze two arbitrary document classification algorithms to describe them and to create an implementation of those algorithms. Chosen algorithms are Bayes classifier and classifier based on support vector machines (SVM) which were analyzed and implemented in the practical part of this thesis. One of the main goals of this thesis is to create and choose optimal text features, which are describing the input text best and thus lead to the best classification results. At the end of this thesis there is a bunch of tests showing comparison of efficiency of the chosen classifiers under various conditions.

Recently computational topology had an important development in data analysis giving birth to the field of Topological Data Analysis. Persistent homology appears as a fundamental tool based on the topology of data that can be represented as points in metric space. In this work, we apply techniques of Topological Data Analysis, more precisely, we use persistent homology to calculate topological features more persistent in data. In this sense, the persistence diagrams are processed as feature vectors for applying Machine Learning algorithms. In order to classification, we used the following classifiers: Partial Least Squares-Discriminant Analysis, Support Vector Machine, and Naive Bayes. For regression, we used Support Vector Regression and KNeighbors. Finally, we will give a certain statistical approach to analyze the accuracy of each classifier and regressor. / Recentemente a topologia computacional teve um importante desenvolvimento na análise de dados dando origem ao campo da Análise Topológica de Dados. A homologia persistente aparece como uma ferramenta fundamental baseada na topologia de dados que possam ser representados como pontos num espaço métrico. Neste trabalho, aplicamos técnicas da Análise Topológica de Dados, mais precisamente, usamos homologia persistente para calcular características topológicas mais persistentes em dados. Nesse sentido, os diagramas de persistencia são processados como vetores de características para posteriormente aplicar algoritmos de Aprendizado de Máquina. Para classificação, foram utilizados os seguintes classificadores: Análise de Discriminantes de Minimos Quadrados Parciais, Máquina de Vetores de Suporte, e Naive Bayes. Para a regressão, usamos a Regressão de Vetores de Suporte e KNeighbors. Finalmente, daremos uma certa abordagem estatística para analisar a precisão de cada classificador e regressor.