{"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/the-rgb-d-triathlon-towards-agile-visual","title":"The RGB-D Triathlon: Towards Agile Visual Toolboxes for Robots","arxiv_id":"1904.00912","date":"2019-04-01","proceeding":null,"authors":["Fabio Cermelli","Massimiliano Mancini","Elisa Ricci","Barbara Caputo"],"abstract":"Deep networks have brought significant advances in robot perception, enabling\nto improve the capabilities of robots in several visual tasks, ranging from\nobject detection and recognition to pose estimation, semantic scene\nsegmentation and many others. Still, most approaches typically address visual\ntasks in isolation, resulting in overspecialized models which achieve strong\nperformances in specific applications but work poorly in other (often related)\ntasks. This is clearly sub-optimal for a robot which is often required to\nperform simultaneously multiple visual recognition tasks in order to properly\nact and interact with the environment. This problem is exacerbated by the\nlimited computational and memory resources typically available onboard to a\nrobotic platform. The problem of learning flexible models which can handle\nmultiple tasks in a lightweight manner has recently gained attention in the\ncomputer vision community and benchmarks supporting this research have been\nproposed. In this work we study this problem in the robot vision context,\nproposing a new benchmark, the RGB-D Triathlon, and evaluating state of the art\nalgorithms in this novel challenging scenario. We also define a new evaluation\nprotocol, better suited to the robot vision setting. Results shed light on the\nstrengths and weaknesses of existing approaches and on open issues, suggesting\ndirections for future research.","url_abs":"http://arxiv.org/abs/1904.00912v2","url_pdf":"http://arxiv.org/pdf/1904.00912v2.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":"the-rgb-d-triathlon-towards-agile-visual","repo_url":"https://github.com/fcdl94/RobotChallenge","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"},{"task_slug":"scene-segmentation","task_name":"Scene Segmentation"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"fcdl94/RobotChallenge","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"bd2bf8faf18c6eb26b51b909bb8e715e1b4e110e36253f22013e1d9aa92d8283","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}