{"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/liteseg-a-novel-lightweight-convnet-for","title":"LiteSeg: A Novel Lightweight ConvNet for Semantic Segmentation","arxiv_id":"1912.06683","date":"2019-12-13","proceeding":null,"authors":["Taha Emara","Hossam E. Abd El Munim","Hazem M. Abbas"],"abstract":"Semantic image segmentation plays a pivotal role in many vision applications including autonomous driving and medical image analysis. Most of the former approaches move towards enhancing the performance in terms of accuracy with a little awareness of computational efficiency. In this paper, we introduce LiteSeg, a lightweight architecture for semantic image segmentation. In this work, we explore a new deeper version of Atrous Spatial Pyramid Pooling module (ASPP) and apply short and long residual connections, and depthwise separable convolution, resulting in a faster and efficient model. LiteSeg architecture is introduced and tested with multiple backbone networks as Darknet19, MobileNet, and ShuffleNet to provide multiple trade-offs between accuracy and computational cost. The proposed model LiteSeg, with MobileNetV2 as a backbone network, achieves an accuracy of 67.81% mean intersection over union at 161 frames per second with $640 \\times 360$ resolution on the Cityscapes dataset.","url_abs":"https://arxiv.org/abs/1912.06683v1","url_pdf":"https://arxiv.org/pdf/1912.06683v1.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":"liteseg-a-novel-lightweight-convnet-for","repo_url":"https://github.com/tahaemara/LiteSeg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"liteseg-a-novel-lightweight-convnet-for","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":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"medical-image-analysis","task_name":"Medical Image Analysis"},{"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":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"channel-shuffle","method_name":"Channel Shuffle"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"daspp","method_name":"DASPP"},{"method_slug":"darknet-19","method_name":"Darknet-19"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"depthwise-convolution","method_name":"Depthwise Convolution"},{"method_slug":"depthwise-separable-convolution","method_name":"Depthwise Separable Convolution"},{"method_slug":"dilated-convolution","method_name":"Dilated Convolution"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"grouped-convolution","method_name":"Grouped Convolution"},{"method_slug":"groupwise-point-convolution","method_name":"Groupwise Point Convolution"},{"method_slug":"inverted-residual-block","method_name":"Inverted Residual Block"},{"method_slug":"liteseg","method_name":"LiteSeg"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"nesterov-accelerated-gradient","method_name":"Nesterov Accelerated Gradient"},{"method_slug":"pointwise-convolution","method_name":"Pointwise Convolution"},{"method_slug":"polynomial-rate-decay","method_name":"Polynomial Rate Decay"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"shufflenet","method_name":"ShuffleNet"},{"method_slug":"shufflenet-block","method_name":"ShuffleNet Block"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"spatial-pyramid-pooling","method_name":"Spatial Pyramid Pooling"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"daspp","name":"DASPP","full_name":"Deeper Atrous Spatial Pyramid Pooling"},{"slug":"liteseg","name":"LiteSeg","full_name":"LiteSeg"}],"results":[{"leaderboard":"/sota/real-time-semantic-segmentation-on-cityscapes-1","task":"Real-Time Semantic Segmentation","dataset":"Cityscapes val","model":"LiteSeg-MobileNet","rank_in_archive_order":24,"of":24,"metrics":{"mIoU":"67.8%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"LightSeg-DarkNet19","rank_in_archive_order":77,"of":105,"metrics":{"Category mIoU":"88.29","Mean IoU (class)":"70.75%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"LightSeg-MobileNet","rank_in_archive_order":85,"of":105,"metrics":{"Category mIoU":"86.79","Mean IoU (class)":"67.81%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"LiteSeg-MobileNet","rank_in_archive_order":86,"of":105,"metrics":{"Mean IoU (class)":"67.81%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"LightSeg-ShuffleNet","rank_in_archive_order":96,"of":105,"metrics":{"Category mIoU":"85.39","Mean IoU (class)":"65.17%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes","task":"Semantic Segmentation","dataset":"Cityscapes test","model":"LiteSeg-ShuffleNet","rank_in_archive_order":97,"of":105,"metrics":{"Mean IoU (class)":"65.17%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1912.06683","atlas_url":"https://app.syntology.ai/?focus=1912.06683","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":"1912.06683"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1912.06683\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1912.06683"},"call":"get_concepts_for_paper(arxiv_id=\"1912.06683\")"}],"by_repo":[{"repo":"tahaemara/LiteSeg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"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":"18f131c030d2c85361f5684d98eb268c82c196511c6c6104ffa365b5131009cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}