{"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/efficient-dense-modules-of-asymmetric","title":"Efficient Dense Modules of Asymmetric Convolution for Real-Time Semantic Segmentation","arxiv_id":"1809.06323","date":"2018-09-17","proceeding":null,"authors":["Shao-Yuan Lo","Hsueh-Ming Hang","Sheng-Wei Chan","Jing-Jhih Lin"],"abstract":"Real-time semantic segmentation plays an important role in practical applications such as self-driving and robots. Most semantic segmentation research focuses on improving estimation accuracy with little consideration on efficiency. Several previous studies that emphasize high-speed inference often fail to produce high-accuracy segmentation results. In this paper, we propose a novel convolutional network named Efficient Dense modules with Asymmetric convolution (EDANet), which employs an asymmetric convolution structure and incorporates dilated convolution and dense connectivity to achieve high efficiency at low computational cost and model size. EDANet is 2.7 times faster than the existing fast segmentation network, ICNet, while it achieves a similar mIoU score without any additional context module, post-processing scheme, and pretrained model. We evaluate EDANet on Cityscapes and CamVid datasets, and compare it with the other state-of-art systems. Our network can run with the high-resolution inputs at the speed of 108 FPS on one GTX 1080Ti.","url_abs":"https://arxiv.org/abs/1809.06323v3","url_pdf":"https://arxiv.org/pdf/1809.06323v3.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":"efficient-dense-modules-of-asymmetric","repo_url":"https://github.com/shaoyuanlo/EDANet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"efficient-dense-modules-of-asymmetric","repo_url":"https://github.com/osmr/imgclsmob","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mxnet","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"efficient-dense-modules-of-asymmetric","repo_url":"https://github.com/zh320/realtime-semantic-segmentation-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"efficient-dense-modules-of-asymmetric","repo_url":"https://github.com/wpf535236337/pytorch_EDANet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"real-time-semantic-segmentation","task_name":"Real-Time Semantic Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dilated-convolution","method_name":"Dilated Convolution"},{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/real-time-semantic-segmentation-on-camvid","task":"Real-Time Semantic Segmentation","dataset":"CamVid","model":"EDANet","rank_in_archive_order":24,"of":29,"metrics":{"mIoU":"66.4"},"uses_additional_data":false},{"leaderboard":"/sota/real-time-semantic-segmentation-on-cityscapes","task":"Real-Time Semantic Segmentation","dataset":"Cityscapes test","model":"EDANet","rank_in_archive_order":35,"of":39,"metrics":{"Frame (fps)":"108.7 (1080Ti)","Time (ms)":"9.2","mIoU":"67.3"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-camvid","task":"Semantic Segmentation","dataset":"CamVid","model":"EDANet","rank_in_archive_order":13,"of":21,"metrics":{"Global Accuracy":"90.8","Mean IoU":"66.4"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"EDANet","rank_in_archive_order":89,"of":105,"metrics":{"Mean IoU (class)":"67.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.06323","atlas_url":"https://app.syntology.ai/?focus=1809.06323","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":"1809.06323"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.06323\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.06323"},"call":"get_concepts_for_paper(arxiv_id=\"1809.06323\")"}],"by_repo":[{"repo":"shaoyuanlo/EDANet","kind":"official","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\")"}]},{"repo":"wpf535236337/pytorch_EDANet","kind":"listed","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":"384db009829bb85c11010523b62beb4da7e1d9ac11a0aa9623db10cb41910ee7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}