{"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/fine-grained-video-categorization-with","title":"Fine-grained Video Categorization with Redundancy Reduction Attention","arxiv_id":"1810.11189","date":"2018-10-26","proceeding":"ECCV 2018 9","authors":["Chen Zhu","Xiao Tan","Feng Zhou","Xiao Liu","Kaiyu Yue","Errui Ding","Yi Ma"],"abstract":"For fine-grained categorization tasks, videos could serve as a better source\nthan static images as videos have a higher chance of containing discriminative\npatterns. Nevertheless, a video sequence could also contain a lot of redundant\nand irrelevant frames. How to locate critical information of interest is a\nchallenging task. In this paper, we propose a new network structure, known as\nRedundancy Reduction Attention (RRA), which learns to focus on multiple\ndiscriminative patterns by sup- pressing redundant feature channels.\nSpecifically, it firstly summarizes the video by weight-summing all feature\nvectors in the feature maps of selected frames with a spatio-temporal soft\nattention, and then predicts which channels to suppress or to enhance according\nto this summary with a learned non-linear transform. Suppression is achieved by\nmodulating the feature maps and threshing out weak activations. The updated\nfeature maps are then used in the next iteration. Finally, the video is\nclassified based on multiple summaries. The proposed method achieves out-\nstanding performances in multiple video classification datasets. Further- more,\nwe have collected two large-scale video datasets, YouTube-Birds and\nYouTube-Cars, for future researches on fine-grained video categorization. The\ndatasets are available at http://www.cs.umd.edu/~chenzhu/fgvc.","url_abs":"http://arxiv.org/abs/1810.11189v1","url_pdf":"http://arxiv.org/pdf/1810.11189v1.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":"action-recognition-in-videos","task_name":"Action Recognition"},{"task_slug":"video-classification","task_name":"Video Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/action-recognition-in-videos-on-activitynet","task":"Action Recognition","dataset":"ActivityNet","model":"RRA","rank_in_archive_order":12,"of":16,"metrics":{"mAP":"83.4"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.11189","atlas_url":"https://app.syntology.ai/?focus=1810.11189","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":"1810.11189"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.11189\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.11189"},"call":"get_concepts_for_paper(arxiv_id=\"1810.11189\")"}],"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":"c8f077bf0502483030b20bf40788d914e135d41ce9b3cb13a51e40905fa2d4c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}