|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM286809265 |
003 |
DE-627 |
005 |
20231225052606.0 |
007 |
cr uuu---uuuuu |
008 |
231225s2020 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TPAMI.2018.2858826
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0956.xml
|
035 |
|
|
|a (DE-627)NLM286809265
|
035 |
|
|
|a (NLM)30040631
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Lin, Tsung-Yi
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Focal Loss for Dense Object Detection
|
264 |
|
1 |
|c 2020
|
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 09.04.2022
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a The highest accuracy object detectors to date are based on a two-stage approach popularized by R-CNN, where a classifier is applied to a sparse set of candidate object locations. In contrast, one-stage detectors that are applied over a regular, dense sampling of possible object locations have the potential to be faster and simpler, but have trailed the accuracy of two-stage detectors thus far. In this paper, we investigate why this is the case. We discover that the extreme foreground-background class imbalance encountered during training of dense detectors is the central cause. We propose to address this class imbalance by reshaping the standard cross entropy loss such that it down-weights the loss assigned to well-classified examples. Our novel Focal Loss focuses training on a sparse set of hard examples and prevents the vast number of easy negatives from overwhelming the detector during training. To evaluate the effectiveness of our loss, we design and train a simple dense detector we call RetinaNet. Our results show that when trained with the focal loss, RetinaNet is able to match the speed of previous one-stage detectors while surpassing the accuracy of all existing state-of-the-art two-stage detectors. Code is at: https://github.com/facebookresearch/Detectron
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Goyal, Priya
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Girshick, Ross
|e verfasserin
|4 aut
|
700 |
1 |
|
|a He, Kaiming
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Dollar, Piotr
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 42(2020), 2 vom: 24. Feb., Seite 318-327
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
773 |
1 |
8 |
|g volume:42
|g year:2020
|g number:2
|g day:24
|g month:02
|g pages:318-327
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2018.2858826
|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 42
|j 2020
|e 2
|b 24
|c 02
|h 318-327
|