Full metadata record
DC FieldValueLanguage
dc.contributorDepartment of Computingen_US
dc.contributor.advisorXu, Linchuan (COMP)en_US
dc.creatorYan, Zipei-
dc.identifier.urihttps://theses.lib.polyu.edu.hk/handle/200/12643-
dc.languageEnglishen_US
dc.publisherHong Kong Polytechnic Universityen_US
dc.rightsAll rights reserveden_US
dc.titleAuxiliary supervision for regularizing deep learning based image classificationen_US
dcterms.abstractImage classification is a fundamental task in visual recognition. Deep learning-based methods, i.e., Deep Neural Networks (DNNs), are state-of-the-art approach that achieves remarkable performance. Besides, DNNs pre-trained on image classification tasks with large-scale datasets show excellent transferability for solving downstream tasks, such as semantic segmentation, object detection, etc. Therefore, image classification becomes one of the fundamental but critical tasks in visual recognition. However, DNNs easily overfit and are hard to optimize, as they have billions or millions of parameters. To tackle this challenge, regularization techniques such as data augmentations and auxiliary learning are introduced to auxiliary supervise DNNs to achieve better generalization and robustness.en_US
dcterms.abstractIn this thesis, we first review existing regularization techniques in terms of data augmentation and auxiliary learning. Then we conduct two research works for regularizing DNNs on the classification task. More specifically, in the first work, we study the problem of computational color naming (CCN). We explore utilizing domain knowledge of the RGB Color Model as auxiliary supervision to regularize the model. Based on this, we expand CCN’s application to data augmentation by designing a new data augmentation method named Partial Color Jittering(PCJ). PCJ performs the color jittering on a subset of pixels of the same image color, which significantly increases images’ diversity, thereby consistently improving image classification performance. In the second work, we study the problem in vision loss estimation. We first explore that vanilla models easily overfit and fall into trivial solutions in vision loss estimation. To tackle this challenge, we propose a novel method for vision loss estimation. In detail, we formulate VF estimation as an ordinal classification problem, following the ordinal properties of the studied data. Besides, we introduce an auxiliary task to assist the generalization of the model, where the auxiliary task explicitly regularizes the model. Finally, we conclude this thesis, discuss the open challenges and address future directions.en_US
dcterms.extentxii, 82 pages : color illustrationsen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.issued2023en_US
dcterms.educationalLevelM.Phil.en_US
dcterms.educationalLevelAll Masteren_US
dcterms.LCSHImage processing -- Digital techniquesen_US
dcterms.LCSHMachine learningen_US
dcterms.LCSHComputer visionen_US
dcterms.LCSHImage analysisen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.accessRightsopen accessen_US

Files in This Item:
File Description SizeFormat 
7107.pdfFor All Users9.16 MBAdobe PDFView/Open


Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show simple item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/12643