|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM32797804X |
| 003 |
DE-627 |
| 005 |
20231225202001.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2021 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2021.3094744
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1093.xml
|
| 035 |
|
|
|a (DE-627)NLM32797804X
|
| 035 |
|
|
|a (NLM)34252026
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Wu, Xiaoping
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a BiSPL
|b Bidirectional Self-Paced Learning for Recognition From Web Data
|
| 264 |
|
1 |
|c 2021
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 20.07.2021
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Deep learning (DL) is inherently subject to the requirement of a large amount of well-labeled data, which is expensive and time-consuming to obtain manually. In order to broaden the reach of DL, leveraging free web data becomes an attractive strategy to alleviate the issue of data scarcity. However, directly utilizing collected web data to train a deep model is ineffective because of the mixed noisy data. To address such problems, we develop a novel bidirectional self-paced learning (BiSPL) framework which reduces the effect of noise by learning from web data in a meaningful order. Technically, the BiSPL framework consists of two essential steps. Relying on distances defined between web samples and labeled source samples, first, the web samples with short distances are sampled and combined to form a new training set. Second, based on the new training set, both easy and hard samples are initially employed to train deep models for higher stability, and hard samples are gradually dropped to reduce the noise as the training progresses. By iteratively alternating such steps, deep models converge to a better solution. We mainly focus on the fine-grained visual classification (FGVC) tasks because their corresponding datasets are generally small and therefore face a more significant data scarcity problem. Experiments conducted on six public FGVC tasks demonstrate that our proposed method outperforms the state-of-the-art approaches. Especially, BiSPL suffices to achieve the highest stable performance when the scale of the well-labeled training set decreases dramatically
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Chang, Jianlong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lai, Yu-Kun
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yang, Jufeng
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Tian, Qi
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 30(2021) vom: 01., Seite 6512-6527
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2021
|g day:01
|g pages:6512-6527
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2021.3094744
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 30
|j 2021
|b 01
|h 6512-6527
|