{"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/hardnet-a-low-memory-traffic-network","title":"HarDNet: A Low Memory Traffic Network","arxiv_id":"1909.00948","date":"2019-09-03","proceeding":"ICCV 2019 10","authors":["Ping Chao","Chao-Yang Kao","Yu-Shan Ruan","Chien-Hsiang Huang","Youn-Long Lin"],"abstract":"State-of-the-art neural network architectures such as ResNet, MobileNet, and DenseNet have achieved outstanding accuracy over low MACs and small model size counterparts. However, these metrics might not be accurate for predicting the inference time. We suggest that memory traffic for accessing intermediate feature maps can be a factor dominating the inference latency, especially in such tasks as real-time object detection and semantic segmentation of high-resolution video. We propose a Harmonic Densely Connected Network to achieve high efficiency in terms of both low MACs and memory traffic. The new network achieves 35%, 36%, 30%, 32%, and 45% inference time reduction compared with FC-DenseNet-103, DenseNet-264, ResNet-50, ResNet-152, and SSD-VGG, respectively. We use tools including Nvidia profiler and ARM Scale-Sim to measure the memory traffic and verify that the inference latency is indeed proportional to the memory traffic consumption and the proposed network consumes low memory traffic. We conclude that one should take memory traffic into consideration when designing neural network architectures for high-resolution applications at the edge.","url_abs":"https://arxiv.org/abs/1909.00948v1","url_pdf":"https://arxiv.org/pdf/1909.00948v1.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":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PingoLH/Pytorch-HarDNet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/GibranBenitez/IPN-hand","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/Mind23-2/MindCode-51","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PingoLH/CenterNet-HarDNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PingoLH/FCHarDNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/coreqode/HardNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/james128333/HarDNet-MSEG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/lanPN85/HarDNet-MSEG","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","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":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/sahadevpoudel/hardnet-mseg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/sithu31296/semantic-segmentation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/talshaharabany/DeepACM2D","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/yktangac/CenterHarDNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/2023-MindSpore-1/ms-code-214/tree/main/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/2023-MindSpore-4/Code-5/tree/main/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/CV51GO/HarDNet_Megengine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/MindSpore-paper-code-3/code10/tree/main/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/MindSpore-paper-code-3/code4/tree/main/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PaddlePaddle/PaddleClas","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PaddlePaddle/PaddleDetection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/PaddlePaddle/PaddleSeg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/cfreshgirl/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/mindspore-ai/models/blob/master/research/cv/hardnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hardnet-a-low-memory-traffic-network","repo_url":"https://github.com/ozora-ogino/efficient_backbones","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"real-time-object-detection","task_name":"Real-Time Object Detection"},{"task_slug":"real-time-semantic-segmentation","task_name":"Real-Time Semantic Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"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":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-block","method_name":"Dense Block"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/real-time-semantic-segmentation-on-cityscapes","task":"Real-Time Semantic Segmentation","dataset":"Cityscapes test","model":"U-HarDNet-70","rank_in_archive_order":10,"of":39,"metrics":{"Frame (fps)":"53\n(1080Ti)","Time (ms)":"18.8\n(1080Ti)","mIoU":"75.9%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.00948","atlas_url":"https://app.syntology.ai/?focus=1909.00948","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":"1909.00948"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.00948\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.00948"},"call":"get_concepts_for_paper(arxiv_id=\"1909.00948\")"}],"by_repo":[{"repo":"PingoLH/Pytorch-HarDNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"GibranBenitez/IPN-hand","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mind23-2/MindCode-51","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PingoLH/CenterNet-HarDNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1904.07850"],"harvested_for_calls":[{"arxiv_id":"1904.07850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1904.07850"},"call":"get_harvested_code_for_paper(arxiv_id=\"1904.07850\")"}]},{"repo":"PingoLH/FCHarDNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"coreqode/HardNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"james128333/HarDNet-MSEG","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lanPN85/HarDNet-MSEG","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":"sahadevpoudel/hardnet-mseg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sithu31296/semantic-segmentation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2105.15203","2108.07058","2201.03545"],"harvested_for_calls":[{"arxiv_id":"2105.15203","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.15203"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.15203\")"},{"arxiv_id":"2108.07058","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.07058"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.07058\")"},{"arxiv_id":"2201.03545","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.03545"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.03545\")"}]},{"repo":"talshaharabany/DeepACM2D","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yktangac/CenterHarDNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-1/ms-code-214","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-4/Code-5","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CV51GO/HarDNet_Megengine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code4","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleClas","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleDetection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.16250"],"harvested_for_calls":[{"arxiv_id":"2203.16250","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.16250"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.16250\")"}]},{"repo":"PaddlePaddle/PaddleSeg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.09406"],"harvested_for_calls":[{"arxiv_id":"2109.09406","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.09406"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.09406\")"}]},{"repo":"cfreshgirl/hardnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mindspore-ai/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2208.08084"],"harvested_for_calls":[{"arxiv_id":"2208.08084","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.08084"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.08084\")"}]},{"repo":"ozora-ogino/efficient_backbones","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1911.11907"],"harvested_for_calls":[{"arxiv_id":"1911.11907","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.11907"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.11907\")"}]}],"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":"68c5f59cb06692de39f9e0e8b35d8ce88133004a63fc1b305b86751bb95dd3cb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}