{"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/yolopv2-better-faster-stronger-for-panoptic","title":"YOLOPv2: Better, Faster, Stronger for Panoptic Driving Perception","arxiv_id":"2208.11434","date":"2022-08-24","proceeding":null,"authors":["Cheng Han","Qichao Zhao","Shuyi Zhang","Yinzi Chen","Zhenlin Zhang","Jinwei Yuan"],"abstract":"Over the last decade, multi-tasking learning approaches have achieved promising results in solving panoptic driving perception problems, providing both high-precision and high-efficiency performance. It has become a popular paradigm when designing networks for real-time practical autonomous driving system, where computation resources are limited. This paper proposed an effective and efficient multi-task learning network to simultaneously perform the task of traffic object detection, drivable road area segmentation and lane detection. Our model achieved the new state-of-the-art (SOTA) performance in terms of accuracy and speed on the challenging BDD100K dataset. Especially, the inference time is reduced by half compared to the previous SOTA model. Code will be released in the near future.","url_abs":"https://arxiv.org/abs/2208.11434v1","url_pdf":"https://arxiv.org/pdf/2208.11434v1.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":"yolopv2-better-faster-stronger-for-panoptic","repo_url":"https://github.com/CAIC-AD/YOLOPv2","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"yolopv2-better-faster-stronger-for-panoptic","repo_url":"https://github.com/PINTO0309/PINTO_model_zoo/tree/main/326_YOLOPv2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"drivable-area-detection","task_name":"Drivable Area Detection"},{"task_slug":"lane-detection","task_name":"Lane Detection"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"traffic-object-detection","task_name":"Traffic Object Detection"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/drivable-area-detection-on-bdd100k-val","task":"Drivable Area Detection","dataset":"BDD100K val","model":"YOLOPv2","rank_in_archive_order":1,"of":10,"metrics":{"Params (M)":"38.9","mIoU":"93.2"},"uses_additional_data":false},{"leaderboard":"/sota/lane-detection-on-bdd100k-val","task":"Lane Detection","dataset":"BDD100K val","model":"YOLOPv2","rank_in_archive_order":8,"of":11,"metrics":{"Accuracy (%)":"87.8","IoU (%)":"27.25","Params (M)":"38.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2208.11434","atlas_url":"https://app.syntology.ai/?focus=2208.11434","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.11434"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2208.11434\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2208.11434"},"call":"get_concepts_for_paper(arxiv_id=\"2208.11434\")"}],"by_repo":[{"repo":"CAIC-AD/YOLOPv2","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PINTO0309/PINTO_model_zoo","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2104.11207"],"harvested_for_calls":[{"arxiv_id":"2104.11207","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.11207"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.11207\")"}]}],"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":"1fe253dae231ca4d116d8753d84b92081c4f9e5223b2d7b7fe31a450b16c6d9a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}