{"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/learning-content-weighted-deep-image","title":"Learning Content-Weighted Deep Image Compression","arxiv_id":"1904.00664","date":"2019-04-01","proceeding":null,"authors":["Mu Li","WangMeng Zuo","Shuhang Gu","Jane You","David Zhang"],"abstract":"Learning-based lossy image compression usually involves the joint\noptimization of rate-distortion performance. Most existing methods adopt\nspatially invariant bit length allocation and incorporate discrete entropy\napproximation to constrain compression rate. Nonetheless, the information\ncontent is spatially variant, where the regions with complex and salient\nstructures generally are more essential to image compression. Taking the\nspatial variation of image content into account, this paper presents a\ncontent-weighted encoder-decoder model, which involves an importance map subnet\nto produce the importance mask for locally adaptive bit rate allocation.\nConsequently, the summation of importance mask can thus be utilized as an\nalternative of entropy estimation for compression rate control. Furthermore,\nthe quantized representations of the learned code and importance map are still\nspatially dependent, which can be losslessly compressed using arithmetic\ncoding. To compress the codes effectively and efficiently, we propose a trimmed\nconvolutional network to predict the conditional probability of quantized\ncodes. Experiments show that the proposed method can produce visually much\nbetter results, and performs favorably in comparison with deep and traditional\nlossy image compression approaches.","url_abs":"http://arxiv.org/abs/1904.00664v1","url_pdf":"http://arxiv.org/pdf/1904.00664v1.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":"learning-content-weighted-deep-image","repo_url":"https://github.com/limuhit/CWIC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"caffe2","reach":{"status":"ok"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"image-compression","task_name":"Image Compression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.00664","atlas_url":"https://app.syntology.ai/?focus=1904.00664","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":"1904.00664"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.00664\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.00664"},"call":"get_concepts_for_paper(arxiv_id=\"1904.00664\")"}],"by_repo":[{"repo":"limuhit/CWIC","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0624a87b28486ebc510992433ceaf6627a055a0cf5d3758b9b6ddb7297a2dd42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}