{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/discriminative-correlation-filter-with","title":"Discriminative Correlation Filter with Channel and Spatial Reliability","arxiv_id":"1611.08461","date":"2016-11-25","proceeding":"CVPR 2017 7","authors":["Alan Lukežič","Tomáš Vojíř","Luka Čehovin","Jiří Matas","Matej Kristan"],"abstract":"Short-term tracking is an open and challenging problem for which\ndiscriminative correlation filters (DCF) have shown excellent performance. We\nintroduce the channel and spatial reliability concepts to DCF tracking and\nprovide a novel learning algorithm for its efficient and seamless integration\nin the filter update and the tracking process. The spatial reliability map\nadjusts the filter support to the part of the object suitable for tracking.\nThis both allows to enlarge the search region and improves tracking of\nnon-rectangular objects. Reliability scores reflect channel-wise quality of the\nlearned filters and are used as feature weighting coefficients in localization.\nExperimentally, with only two simple standard features, HoGs and Colornames,\nthe novel CSR-DCF method -- DCF with Channel and Spatial Reliability --\nachieves state-of-the-art results on VOT 2016, VOT 2015 and OTB100. The CSR-DCF\nruns in real-time on a CPU.","url_abs":"http://arxiv.org/abs/1611.08461v3","url_pdf":"http://arxiv.org/pdf/1611.08461v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"discriminative-correlation-filter-with","repo_url":"https://github.com/alanlukezic/csr-dcf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"discriminative-correlation-filter-with","repo_url":"https://github.com/Eladamar/Dual-Tracker","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"discriminative-correlation-filter-with","repo_url":"https://github.com/Eladamar/tracking","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"discriminative-correlation-filter-with","repo_url":"https://github.com/fengyang95/pyCFTrackers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"visual-object-tracking","task_name":"Visual Object Tracking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/visual-object-tracking-on-vot201718","task":"Visual Object Tracking","dataset":"VOT2017/18","model":"CSRDCF","rank_in_archive_order":14,"of":15,"metrics":{"Expected Average Overlap (EAO)":"0.263"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.08461","atlas_url":"https://app.syntology.ai/?focus=1611.08461","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1611.08461"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.08461\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.08461"},"call":"get_concepts_for_paper(arxiv_id=\"1611.08461\")"}],"by_repo":[{"repo":"alanlukezic/csr-dcf","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Eladamar/Dual-Tracker","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Eladamar/tracking","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fengyang95/pyCFTrackers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1512.01355"],"harvested_for_calls":[{"arxiv_id":"1512.01355","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.01355"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.01355\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b137ef832b6231a32da670e0a79b0e09333124bf4d20700ea583f82d1cd63ea1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}