{"url":"/sota/object-tracking-on-fe108","task":{"name":"Object Tracking","url":"/task/object-tracking","note":null},"dataset":{"name":"FE108","url":"/dataset/fe108"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Object tracking** is the task of taking an initial set of object detections, creating a unique ID for each of the initial detections, and then tracking each of the objects as they move around frames in a video, maintaining the ID assignment. State-of-the-art methods involve fusing data from RGB and event-based cameras to produce more reliable object tracking. CNN-based models using only RGB images as input are also effective. The most popular benchmark is OTB. There are several evaluation metrics specific to object tracking, including HOTA, MOTA, IDF1, and Track-mAP. \r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Towards-Realtime-MOT\r\n](https://github.com/Zhongdao/Towards-Realtime-MOT) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Success Rate","Averaged Precision"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Success Rate":"higher","Averaged Precision":"higher"}},"counts":{"rows":8,"rows_with_code":7,"rows_with_paper_page":7,"rows_dated":7,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"HR-MonTrack-Base","metrics":{"Averaged Precision":"96.2","Success Rate":"68.5"},"uses_additional_data":false,"paper_date":"2023-07-09","paper":"/paper/cross-modal-orthogonal-high-rank-augmentation","paper_url":"https://arxiv.org/abs/2307.04129v2","paper_title":"Cross-modal Orthogonal High-rank Augmentation for RGB-Event Transformer-trackers","code":"https://github.com/zhu-zhiyu/nvs_solver","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"HR-MonTrack-Tiny","metrics":{"Averaged Precision":"95.3","Success Rate":"66.3"},"uses_additional_data":false,"paper_date":"2023-07-09","paper":"/paper/cross-modal-orthogonal-high-rank-augmentation","paper_url":"https://arxiv.org/abs/2307.04129v2","paper_title":"Cross-modal Orthogonal High-rank Augmentation for RGB-Event Transformer-trackers","code":"https://github.com/zhu-zhiyu/nvs_solver","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"Multi-modal","metrics":{"Averaged Precision":"92.4","Success Rate":"63.4"},"uses_additional_data":false,"paper_date":"2021-09-19","paper":"/paper/object-tracking-by-jointly-exploiting-frame","paper_url":"https://arxiv.org/abs/2109.09052v1","paper_title":"Object Tracking by Jointly Exploiting Frame and Event Domain","code":"https://github.com/Jee-King/ICCV2021_Event_Frame_Tracking","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"PrDiMP","metrics":{"Averaged Precision":"87.7","Success Rate":"59.0"},"uses_additional_data":false,"paper_date":"2020-03-27","paper":"/paper/probabilistic-regression-for-visual-tracking","paper_url":"https://arxiv.org/abs/2003.12565v1","paper_title":"Probabilistic Regression for Visual Tracking","code":"https://github.com/open-mmlab/mmtracking","n_code_links":2,"syntology":null},{"rank_in_archive_order":5,"model":"DiMP","metrics":{"Averaged Precision":"85.1","Success Rate":"57.1"},"uses_additional_data":false,"paper_date":"2019-04-15","paper":"/paper/190407220","paper_url":"https://arxiv.org/abs/1904.07220v2","paper_title":"Learning Discriminative Model Prediction for Tracking","code":"https://github.com/visionml/pytracking","n_code_links":2,"syntology":null},{"rank_in_archive_order":6,"model":"MonTrack","metrics":{"Averaged Precision":"85.9","Success Rate":"54.9"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"ATOM","metrics":{"Averaged Precision":"71.3","Success Rate":"46.5"},"uses_additional_data":false,"paper_date":"2018-11-19","paper":"/paper/atom-accurate-tracking-by-overlap","paper_url":"http://arxiv.org/abs/1811.07628v2","paper_title":"ATOM: Accurate Tracking by Overlap Maximization","code":"https://github.com/visionml/pytracking","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":6,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"KYS","metrics":{"Averaged Precision":"41.0","Success Rate":"26.6"},"uses_additional_data":false,"paper_date":"2020-03-24","paper":"/paper/know-your-surroundings-exploiting-scene","paper_url":"https://arxiv.org/abs/2003.11014v2","paper_title":"Know Your Surroundings: Exploiting Scene Information for Object Tracking","code":"https://github.com/visionml/pytracking","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":4,"rows_with_any_sample_ran":2,"distinct_papers_with_graph_line":3,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":6,"n_unverified":7,"n_samples":13,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":6,"n_unverified":8,"n_samples":14,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}