{"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/learning-spatially-regularized-correlation","title":"Learning Spatially Regularized Correlation Filters for Visual Tracking","arxiv_id":"1608.05571","date":"2016-08-19","proceeding":"ICCV 2015 12","authors":["Martin Danelljan","Gustav Häger","Fahad Shahbaz Khan","Michael Felsberg"],"abstract":"Robust and accurate visual tracking is one of the most challenging computer\nvision problems. Due to the inherent lack of training data, a robust approach\nfor constructing a target appearance model is crucial. Recently,\ndiscriminatively learned correlation filters (DCF) have been successfully\napplied to address this problem for tracking. These methods utilize a periodic\nassumption of the training samples to efficiently learn a classifier on all\npatches in the target neighborhood. However, the periodic assumption also\nintroduces unwanted boundary effects, which severely degrade the quality of the\ntracking model.\n  We propose Spatially Regularized Discriminative Correlation Filters (SRDCF)\nfor tracking. A spatial regularization component is introduced in the learning\nto penalize correlation filter coefficients depending on their spatial\nlocation. Our SRDCF formulation allows the correlation filters to be learned on\na significantly larger set of negative training samples, without corrupting the\npositive samples. We further propose an optimization strategy, based on the\niterative Gauss-Seidel method, for efficient online learning of our SRDCF.\nExperiments are performed on four benchmark datasets: OTB-2013, ALOV++,\nOTB-2015, and VOT2014. Our approach achieves state-of-the-art results on all\nfour datasets. On OTB-2013 and OTB-2015, we obtain an absolute gain of 8.0% and\n8.2% respectively, in mean overlap precision, compared to the best existing\ntrackers.","url_abs":"http://arxiv.org/abs/1608.05571v1","url_pdf":"http://arxiv.org/pdf/1608.05571v1.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":[],"tasks":[{"task_slug":"video-object-tracking","task_name":"Video Object Tracking"},{"task_slug":"visual-tracking","task_name":"Visual Tracking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/video-object-tracking-on-nv-vot211","task":"Video Object Tracking","dataset":"NT-VOT211","model":"CSRDCF","rank_in_archive_order":30,"of":43,"metrics":{"AUC":"31.59","Precision":"40.31"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.05571","atlas_url":"https://app.syntology.ai/?focus=1608.05571","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":"1608.05571"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.05571\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.05571"},"call":"get_concepts_for_paper(arxiv_id=\"1608.05571\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"22d4b846015f7b95a079266b5a5cd79f9200768ebf22bc89857ed9b4cf7cb9de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}