|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM325352704 |
| 003 |
DE-627 |
| 005 |
20231225192246.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2022 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2021.3079910
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1084.xml
|
| 035 |
|
|
|a (DE-627)NLM325352704
|
| 035 |
|
|
|a (NLM)33983879
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Hou, Ruibing
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Feature Completion for Occluded Person Re-Identification
|
| 264 |
|
1 |
|c 2022
|
| 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 08.08.2022
|
| 500 |
|
|
|a Date Revised 14.09.2022
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a Person re-identification (reID) plays an important role in computer vision. However, existing methods suffer from performance degradation in occluded scenes. In this work, we propose an occlusion-robust block, Region Feature Completion (RFC), for occluded reID. Different from most previous works that discard the occluded regions, RFC block can recover the semantics of occluded regions in feature space. First, a Spatial RFC (SRFC) module is developed. SRFC exploits the long-range spatial contexts from non-occluded regions to predict the features of occluded regions. The unit-wise prediction task leads to an encoder/decoder architecture, where the region-encoder models the correlation between non-occluded and occluded region, and the region-decoder utilizes the spatial correlation to recover occluded region features. Second, we introduce Temporal RFC (TRFC) module which captures the long-term temporal contexts to refine the prediction of SRFC. RFC block is lightweight, end-to-end trainable and can be easily plugged into existing CNNs to form RFCnet. Extensive experiments are conducted on occluded and commonly holistic reID benchmarks. Our method significantly outperforms existing methods on the occlusion datasets, while remains top even superior performance on holistic datasets. The source code is available at https://github.com/blue-blue272/OccludedReID-RFCnet
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Ma, Bingpeng
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Chang, Hong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Gu, Xinqian
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shan, Shiguang
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Chen, Xilin
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 44(2022), 9 vom: 19. Sept., Seite 4894-4912
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:44
|g year:2022
|g number:9
|g day:19
|g month:09
|g pages:4894-4912
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2021.3079910
|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 44
|j 2022
|e 9
|b 19
|c 09
|h 4894-4912
|