semi-supervised framework for clustering and semantic segmentation
abstract
during the past couple of decades, machine learning and deep learning methods have
achieved remarkable results in many real-world applications. however, it is difficult
to develop and train these artificial intelligence algorithms without a labeled dataset.
under this circumstance, it is desirable to leverage a large number of unlabeled data
into the training process with fewer or even without labels. to this end, a non-supervised learning strategy (e.g., unsupervised, semi-supervised, weakly-supervised,
or self-supervised) has recently been studied in different domains.
in chapter 3, a novel semi-supervised framework is proposed to solve a clustering problem fundamentally by involving only few numbers of labeled data. in this
proposed framework, a non-iterative autoencoder is proposed for learning a representation of each data in an unsupervised way. the experimental results theoretically
demonstrate the effectiveness of this proposed framework, where the obtained clustering accuracy for thirteen tabular and image datasets are impressive. it has also
shown that the proposed autoencoder is able to capture important features of each
data.
in chapter 4, the above framework is extended to a weakly-supervised semantic segmentation task for demonstrating its practical ability. before applying the
modified proposed framework to this task, computer vision methods are presented
as preliminary work to generate the initial labeled data and clustering space. we
achieve the current state-of-the-art performance on pascal voc 2012 dataset.
this thesis shows that the proposed framework is capable not only for the traditional machine learning problem but also for the widely used real-world applications.