scholarly journals Unsupervised Learning for Real-World Super-Resolution

Author(s):  
Andreas Lugmayr ◽  
Martin Danelljan ◽  
Radu Timofte
Author(s):  
Ahmed Cheikh Sidiya ◽  
Xin Li

Face image synthesis has advanced rapidly in recent years. However, similar success has not been witnessed in related areas such as face single image super-resolution (SISR). The performance of SISR on real-world low-quality face images remains unsatisfactory. In this paper, we demonstrate how to advance the state-of-the-art in face SISR by leveraging style-based generator in unsupervised settings. For real-world low-resolution (LR) face images, we propose a novel unsupervised learning approach by combining style-based generator with relativistic discriminator. With a carefully designed training strategy, we demonstrate our converges faster and better suppresses artifacts than Bulat’s approach. When trained on an ensemble of high-quality datasets (CelebA, AFLW, LS3D-W, and VGGFace2), we report significant visual quality improvements over other competing methods especially for real-world low-quality face images such as those in Widerface. Additionally, we have verified that both our unsupervised approaches are capable of improving the matching performance of widely used face recognition systems such as OpenFace.


IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 35834-35845
Author(s):  
Limin Xia ◽  
Jiahui Zhu ◽  
Zhimin Yu

Author(s):  
Mohammad Saeed Rad ◽  
Thomas Yu ◽  
Claudiu Musat ◽  
Hazim Kemal Ekenel ◽  
Behzad Bozorgtabar ◽  
...  

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 121167-121183
Author(s):  
Chulhee Lee ◽  
J. Yoon ◽  
J. Kim ◽  
S. Park

Author(s):  
Kalpesh Prajapati ◽  
Vishal Chudasama ◽  
Heena Patel ◽  
Kishor Upla ◽  
Kiran Raja ◽  
...  

Author(s):  
Jan Žižka ◽  
František Dařena

The automated categorization of unstructured textual documents according to their semantic contents plays important role particularly linked with the ever growing volume of such data originating from the Internet. Having a sufficient number of labeled examples, a suitable supervised machine learning-based classifier can be trained. When no labeling is available, an unsupervised learning method can be applied, however, the missing label information often leads to worse classification results. This chapter demonstrates a method based on semi-supervised learning when a smallish set of manually labeled examples improves the categorization process in comparison with clustering, and the results are comparable with the supervised learning output. For the illustration, a real-world dataset coming from the Internet is used as the input of the supervised, unsupervised, and semi-supervised learning. The results are shown for different number of the starting labeled samples used as “seeds” to automatically label the remaining volume of unlabeled items.


Author(s):  
Deepali Virmani ◽  
Nikita Jain ◽  
Ketan Parikh ◽  
Shefali Upadhyaya ◽  
Abhishek Srivastav

This article describes how data is relevant and if it can be organized, linked with other data and grouped into a cluster. Clustering is the process of organizing a given set of objects into a set of disjoint groups called clusters. There are a number of clustering algorithms like k-means, k-medoids, normalized k-means, etc. So, the focus remains on efficiency and accuracy of algorithms. The focus is also on the time it takes for clustering and reducing overlapping between clusters. K-means is one of the simplest unsupervised learning algorithms that solves the well-known clustering problem. The k-means algorithm partitions data into K clusters and the centroids are randomly chosen resulting numeric values prohibits it from being used to cluster real world data containing categorical values. Poor selection of initial centroids can result in poor clustering. This article deals with a proposed algorithm which is a variant of k-means with some modifications resulting in better clustering, reduced overlapping and lesser time required for clustering by selecting initial centres in k-means and normalizing the data.


Sign in / Sign up

Export Citation Format

Share Document