{"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/aim-2022-challenge-on-super-resolution-of","title":"AIM 2022 Challenge on Super-Resolution of Compressed Image and Video: Dataset, Methods and Results","arxiv_id":"2208.11184","date":"2022-08-23","proceeding":null,"authors":["Ren Yang","Radu Timofte","Qi Zhang","Lin Zhang","Fanglong Liu","Dongliang He","Fu Li","He Zheng","Weihang Yuan","Pavel Ostyakov","Dmitry Vyal","Magauiya Zhussip","Xueyi Zou","Youliang Yan","Lei LI","Jingzhu Tang","Ming Chen","Shijie Zhao","Yu Zhu","Xiaoran Qin","Chenghua Li","Cong Leng","Jian Cheng","Claudio Rota","Marco Buzzelli","Simone Bianco","Raimondo Schettini","Dafeng Zhang","Feiyu Huang","Shizhuo Liu","Xiaobing Wang","Zhezhu Jin","Bingchen Li","Xin Li","Mingxi Li","Ding Liu","Wenbin Zou","Peijie Dong","Tian Ye","Yunchen Zhang","Ming Tan","Xin Niu","Mustafa Ayazoglu","Marcos Conde","Ui-Jin Choi","Zhuang Jia","Tianyu Xu","Yijian Zhang","Mao Ye","Dengyan Luo","Xiaofeng Pan","Liuhan Peng"],"abstract":"This paper reviews the Challenge on Super-Resolution of Compressed Image and Video at AIM 2022. This challenge includes two tracks. Track 1 aims at the super-resolution of compressed image, and Track~2 targets the super-resolution of compressed video. In Track 1, we use the popular dataset DIV2K as the training, validation and test sets. In Track 2, we propose the LDV 3.0 dataset, which contains 365 videos, including the LDV 2.0 dataset (335 videos) and 30 additional videos. In this challenge, there are 12 teams and 2 teams that submitted the final results to Track 1 and Track 2, respectively. The proposed methods and solutions gauge the state-of-the-art of super-resolution on compressed image and video. The proposed LDV 3.0 dataset is available at https://github.com/RenYang-home/LDV_dataset. The homepage of this challenge is at https://github.com/RenYang-home/AIM22_CompressSR.","url_abs":"https://arxiv.org/abs/2208.11184v2","url_pdf":"https://arxiv.org/pdf/2208.11184v2.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":"aim-2022-challenge-on-super-resolution-of","repo_url":"https://github.com/mv-lab/swin2sr","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"aim-2022-challenge-on-super-resolution-of","repo_url":"https://github.com/renyang-home/ldv_dataset","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"aim-2022-challenge-on-super-resolution-of","repo_url":"https://github.com/renyang-home/aim22_compresssr","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"methods":[{"method_slug":"test","method_name":"Test"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2208.11184","atlas_url":"https://app.syntology.ai/?focus=2208.11184","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":"2208.11184"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2208.11184\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2208.11184"},"call":"get_concepts_for_paper(arxiv_id=\"2208.11184\")"}],"by_repo":[{"repo":"mv-lab/swin2sr","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2108.10257"],"harvested_for_calls":[{"arxiv_id":"2108.10257","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.10257"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.10257\")"}]},{"repo":"renyang-home/ldv_dataset","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"renyang-home/aim22_compresssr","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"40a0609ff38f94e42c9f6d046ccdb792f93d75a49a192c4340e7e4f3ba1e502e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}