Multiplex Labeling Graph for Near-Online Tracking in Crowded Scenes
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
In recent years, the demand for intelligent devices related to the Internet of Things (IoT) is rapidly increasing. In the field of computer vision, many algorithms have been preinstalled in IoT devices to achieve higher efficiency, such as face recognition, area detection, target tracking, etc. Tracking is an important but complex task that needs high efficiency solutions in real applications. There is a common assumption that detection can only represent one pedestrian to describe nonoverlapping in physical space. In fact, the pixels of the image do not exactly correspond to the positions in the real world. In order to overcome the limitation of this assumption, we remove this unreasonable assumption and present a novel idea that each detector response can have multiple labels to describe different targets at the same time. Therefore, we propose a graph-based method for near-online tracking in this article. We introduce a detection multiplexing method for tracking in the monocular image and propose a multiplex labeling graph (MLG) model. Each node in MLG has the ability to represent multiple targets. In addition, we improve the shortage of graph-based trackers in using temporal features. We construct long short-term memory networks to model motion and appearance features for MLG optimization. On the public multiobject tracking challenge benchmark, our near-online method gains satisfactory efficiency and achieves state-of-the-art results without additional private detection as well.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mobile Edge Computing: A Survey on Architecture and Computation Offloading
Mach, P., & Becvar, Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2682318 · Cited by 3,258
Evaluating Multiple Object Tracking Performance: The CLEAR MOT Metrics
Bernardin, K., & Stiefelhagen, R. (2008) · EURASIP Journal on Image and Video Processing · doi:10.1155/2008/246309 · Cited by 2,918 · cited 1×
“We take the widely adopted CLEAR MOT metrics [45] for evaluation.”
MethodMOT16: A Benchmark for Multi-Object Tracking
Milan, A., Leal-Taixe, L., Reid, I., Roth, S., & Schindler, K. (2016) · arXiv · doi:10.48550/arxiv.1603.00831 · Cited by 1,309 · cited 3×
“We evaluate our tracker on MOT16 [9] and MOT17, which is the popular benchmarks for MOT.”
BackgroundMethodTracking Without Bells and Whistles
Bergmann, P., Meinhardt, T., & Leal-Taixe, L. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00103 · Cited by 1,110
High-Speed tracking-by-detection without using image information
Bochinski, E., Eiselein, V., & Sikora, T. (2017) · 2017 14th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS) · doi:10.1109/avss.2017.8078516 · Cited by 707 · cited 1×
“Typically, Bochinski et al. [25] described a naive tracking method by calculating the intersection-over-union (IOU) rate between detections in adjacent frames.”
MethodMultiple Hypothesis Tracking Revisited
Kim, C., Li, F., Ciptadi, A., & Rehg, J. M. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.533 · Cited by 666 · cited 1×
“To overcome its low efficiency in searching the solution, Kim et al. [27] presented a gating strategy to con-trol the scale of the solution space by learning CNN features of detections.”
BackgroundChen, L., Ai, H., Zhuang, Z., & Shang, C. (2018) · 2018 IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme.2018.8486597 · Cited by 530
Online Multi-Object Tracking with Dual Matching Attention Networks
Zhu, J., Yang, H., Liu, N., Kim, M., Zhang, W., & Yang, M.-H. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01228-1_23 · Cited by 377
Chu, P., & Ling, H. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00627 · Cited by 246
Cited by
ByteTrack: Multi-object Tracking by Associating Every Detection Box
Zhang, Y., Sun, P., Jiang, Y., Yu, D., Weng, F., Yuan, Z., Luo, P., Liu, W., & Wang, X. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-20047-2_1 · Cited by 2,470
Self-citationTransTrack: Multiple Object Tracking with Transformer
Sun, P., Cao, J., Jiang, Y., Zhang, R., Xie, E., Yuan, Z., Wang, C., & Luo, P. (2020) · arXiv · doi:10.48550/arxiv.2012.15460 · Cited by 345
Deep-Learning-Enhanced Multitarget Detection for End–Edge–Cloud Surveillance in Smart IoT
Zhou, X., Xu, X., Liang, W., Zeng, Z., & Yan, Z. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3077449 · Cited by 332
TransMOT: Spatial-Temporal Graph Transformer for Multiple Object Tracking
Chu, P., Wang, J., You, Q., Ling, H., & Liu, Z. (2023) · 2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) · doi:10.1109/wacv56688.2023.00485 · Cited by 258
Improving Multiple Pedestrian Tracking by Track Management and Occlusion Handling
Stadler, D., & Beyerer, J. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01081 · Cited by 147
“[37] 54.8 62.9 19118 234303 1077 TT17 [38] 54.9 63.1 20236 233295 1088 MPNTrack [6] 58.8 61. itly models the concept of occluding and occluded tracks and can successfully retrieve targets without the need for an extra re-identification model.”
BackgroundInfluential
Metadata
- Authors
- Zhang, Y., Sheng, H., Wu, Y., Wang, S., Ke, W., & Xiong, Z.
- Venue
- IEEE Internet of Things Journal
- Published
- 2020-09
- Volume
- 7
- Issue
- 9
- Pages
- 7892-7902
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W3027919498
- Cited by
- 100
- References
- 9
- FWCI
- 6.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.