{"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/erfnet-efficient-residual-factorized-convnet","title":"ERFNet: Efficient Residual Factorized ConvNet for Real-time Semantic Segmentation","arxiv_id":null,"date":"2017-10-09","proceeding":"Transactions on Intelligent Transportation Systems (T-ITS) 2017 10","authors":["E. Romera","J. M. Alvarez","L. M. Bergasa and R. Arroyo"],"abstract":"Semantic segmentation is a challenging task that addresses most of the perception needs of Intelligent Vehicles (IV) in an unified way. Deep Neural Networks excel at this task, as they can be trained end-to-end to accurately classify multiple object categories in an image at pixel level. However, a good trade-off between high quality and computational resources is yet not present in state-of-the-art semantic segmentation approaches, limiting their application in real vehicles. In this paper, we propose a deep architecture that is able to run in real-time while providing accurate semantic segmentation. The core of our architecture is a novel layer that uses residual connections and factorized convolutions in order to remain efficient while retaining remarkable accuracy. Our approach is able to run at over 83 FPS in a single Titan X, and 7 FPS in a Jetson TX1 (embedded GPU). A comprehensive set of experiments on the publicly available Cityscapes dataset demonstrates that our system achieves an accuracy that is similar to the state of the art, while being orders of magnitude faster to compute than other architectures that achieve top precision. The resulting trade-off makes our model an ideal approach for scene understanding in IV applications. The code is publicly available at: https://github.com/Eromera/erfnet","url_abs":"https://ieeexplore.ieee.org/abstract/document/8063438","url_pdf":"http://www.robesafe.uah.es/personal/eduardo.romera/pdfs/Romera17tits.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":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/Eromera/erfnet","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"torch","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/2023-MindSpore-1/ms-code-213/tree/main/erfnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/Eromera/erfnet_pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/Mind23-2/MindCode-38","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/Mind23-2/MindCode-40","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/MindSpore-MS-Code2/code0/tree/main/erfnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/MindSpore-paper-code-3/code7/tree/main/erfnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/MindSpore-paper-code-3/code8/tree/main/erfnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/Yuelong-Yu/ERFNet-Caffe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/code-implementation1/Code3/tree/main/erfnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/mszpc/ERFNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/osmr/imgclsmob","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mxnet","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"erfnet-efficient-residual-factorized-convnet","repo_url":"https://github.com/zh320/realtime-semantic-segmentation-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"real-time-semantic-segmentation","task_name":"Real-Time Semantic Segmentation"},{"task_slug":"scene-understanding","task_name":"Scene Understanding"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"thermal-image-segmentation","task_name":"Thermal Image Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"ERFNet (PyTorch)","rank_in_archive_order":83,"of":105,"metrics":{"Mean IoU (class)":"69.8%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes-val","task":"Semantic Segmentation","dataset":"Cityscapes val","model":"ERFNet (PyTorch)","rank_in_archive_order":84,"of":99,"metrics":{"mIoU":"72.1%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-dada-seg","task":"Semantic Segmentation","dataset":"DADA-seg","model":"ERFNet","rank_in_archive_order":28,"of":28,"metrics":{"mIoU":"9.0"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-densepass","task":"Semantic Segmentation","dataset":"DensePASS","model":"ERFNet","rank_in_archive_order":36,"of":36,"metrics":{"mIoU":"16.65%"},"uses_additional_data":false},{"leaderboard":"/sota/thermal-image-segmentation-on-mfn-dataset","task":"Thermal Image Segmentation","dataset":"MFN Dataset","model":"ERFNet","rank_in_archive_order":55,"of":55,"metrics":{"mIOU":"36.1"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Eromera/erfnet","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-1/ms-code-213","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Eromera/erfnet_pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mind23-2/MindCode-38","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mind23-2/MindCode-40","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-MS-Code2/code0","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Yuelong-Yu/ERFNet-Caffe","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"code-implementation1/Code3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mszpc/ERFNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"osmr/imgclsmob","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2004.08955"],"harvested_for_calls":[{"arxiv_id":"2004.08955","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.08955"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.08955\")"}]},{"repo":"zh320/realtime-semantic-segmentation-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1811.08201","1811.11431","2104.06403","2104.13188"],"harvested_for_calls":[{"arxiv_id":"1811.08201","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.08201"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.08201\")"},{"arxiv_id":"1811.11431","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1811.11431"},"call":"get_harvested_code_for_paper(arxiv_id=\"1811.11431\")"},{"arxiv_id":"2104.06403","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.06403"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.06403\")"},{"arxiv_id":"2104.13188","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.13188"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.13188\")"}]}],"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":"32f86b4395faeddb20ceb60e9784ccd68d80cc5e935ea1d0d02cb1c41b8193d9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}