{"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/esnet-an-efficient-symmetric-network-for-real","title":"ESNet: An Efficient Symmetric Network for Real-time Semantic Segmentation","arxiv_id":"1906.09826","date":"2019-06-24","proceeding":null,"authors":["Yu Wang","Quan Zhou","Xiaofu Wu"],"abstract":"The recent years have witnessed great advances for semantic segmentation using deep convolutional neural networks (DCNNs). However, a large number of convolutional layers and feature channels lead to semantic segmentation as a computationally heavy task, which is disadvantage to the scenario with limited resources. In this paper, we design an efficient symmetric network, called (ESNet), to address this problem. The whole network has nearly symmetric architecture, which is mainly composed of a series of factorized convolution unit (FCU) and its parallel counterparts (PFCU). On one hand, the FCU adopts a widely-used 1D factorized convolution in residual layers. On the other hand, the parallel version employs a transform-split-transform-merge strategy in the designment of residual module, where the split branch adopts dilated convolutions with different rate to enlarge receptive field. Our model has nearly 1.6M parameters, and is able to be performed over 62 FPS on a single GTX 1080Ti GPU. The experiments demonstrate that our approach achieves state-of-the-art results in terms of speed and accuracy trade-off for real-time semantic segmentation on CityScapes dataset.","url_abs":"https://arxiv.org/abs/1906.09826v1","url_pdf":"https://arxiv.org/pdf/1906.09826v1.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":"esnet-an-efficient-symmetric-network-for-real","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":"esnet-an-efficient-symmetric-network-for-real","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}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"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":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/real-time-semantic-segmentation-on-cityscapes","task":"Real-Time Semantic Segmentation","dataset":"Cityscapes test","model":"ESNet","rank_in_archive_order":29,"of":39,"metrics":{"Frame (fps)":"63","Time (ms)":"16","mIoU":"70.7%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"ESNet","rank_in_archive_order":78,"of":105,"metrics":{"Mean IoU (class)":"70.7%"},"uses_additional_data":false}],"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":"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":"0038d5a9a7656d0628fb64e30b5e106b9e0f0e1d5b0a95a10a5fd7ff1e90fa09","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}