Kuan-Hsien Wu, Wan-Lun Tsai, Tse-Yu Pan, Min-Chun Hu
{"title":"Improving Performance of DeepCC Tracker by Background Comparison and Trajectory Refinement","authors":"Kuan-Hsien Wu, Wan-Lun Tsai, Tse-Yu Pan, Min-Chun Hu","doi":"10.1109/Ubi-Media.2019.00042","DOIUrl":null,"url":null,"abstract":"DukeMTMCT is the largest and most completely labeled dataset in Multi-Target Multi-Camera Tracking (MTMCT). We investigate a state-of-the-art work on DukeMTMCT named DeepCC, and dig out two main problems. The first problem is that the openpose is prone to false detection, which seriously affects performance. The second problem is that two different persons may be assigned with the same ID. According to the corresponding problems, we not only propose a method to measure the similarity between detected bounding box and its original background avoiding false detection caused by OpenPose, but also design a strategy to correct the tracking trajectories which are affected by the unreliability of the correlation matrix clustering method proposed by DeepCC. Our method outperforms the state-of-the-art on DukeMTMCT.","PeriodicalId":259542,"journal":{"name":"2019 Twelfth International Conference on Ubi-Media Computing (Ubi-Media)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Twelfth International Conference on Ubi-Media Computing (Ubi-Media)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Ubi-Media.2019.00042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
DukeMTMCT is the largest and most completely labeled dataset in Multi-Target Multi-Camera Tracking (MTMCT). We investigate a state-of-the-art work on DukeMTMCT named DeepCC, and dig out two main problems. The first problem is that the openpose is prone to false detection, which seriously affects performance. The second problem is that two different persons may be assigned with the same ID. According to the corresponding problems, we not only propose a method to measure the similarity between detected bounding box and its original background avoiding false detection caused by OpenPose, but also design a strategy to correct the tracking trajectories which are affected by the unreliability of the correlation matrix clustering method proposed by DeepCC. Our method outperforms the state-of-the-art on DukeMTMCT.