|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM26969546X |
| 003 |
DE-627 |
| 005 |
20231224225044.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2018 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2017.2676778
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0899.xml
|
| 035 |
|
|
|a (DE-627)NLM26969546X
|
| 035 |
|
|
|a (NLM)28278456
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Vergel, Michael Villamizar
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Boosted Random Ferns for Object Detection
|
| 264 |
|
1 |
|c 2018
|
| 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 Completed 30.01.2019
|
| 500 |
|
|
|a Date Revised 30.01.2019
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a In this paper we introduce the Boosted Random Ferns (BRFs) to rapidly build discriminative classifiers for learning and detecting object categories. At the core of our approach we use standard random ferns, but we introduce four main innovations that let us bring ferns from an instance to a category level, and still retain efficiency. First, we define binary features on the histogram of oriented gradients-domain (as opposed to intensity-), allowing for a better representation of intra-class variability. Second, both the positions where ferns are evaluated within the sliding window, and the location of the binary features for each fern are not chosen completely at random, but instead we use a boosting strategy to pick the most discriminative combination of them. This is further enhanced by our third contribution, that is to adapt the boosting strategy to enable sharing of binary features among different ferns, yielding high recognition rates at a low computational cost. And finally, we show that training can be performed online, for sequentially arriving images. Overall, the resulting classifier can be very efficiently trained, densely evaluated for all image locations in about 0.1 seconds, and provides detection rates similar to competing approaches that require expensive and significantly slower processing times. We demonstrate the effectiveness of our approach by thorough experimentation in publicly available datasets in which we compare against state-of-the-art, and for tasks of both 2D detection and 3D multi-view estimation
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Andrade-Cetto, Juan
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Sanfeliu, Alberto
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Moreno-Noguer, Francesc
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 40(2018), 2 vom: 15. Feb., Seite 272-288
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:40
|g year:2018
|g number:2
|g day:15
|g month:02
|g pages:272-288
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2017.2676778
|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 40
|j 2018
|e 2
|b 15
|c 02
|h 272-288
|