Papers › Compressed Image Generation with Denoising Diffusion Codebook Models
Compressed Image Generation with Denoising Diffusion Codebook Models
Guy Ohayon, Hila Manor, Tomer Michaeli, Michael Elad
We present a novel generative approach based on Denoising Diffusion Models (DDMs), which produces high-quality image samples along with their losslessly compressed bit-stream representations. This is obtained by replacing the standard Gaussian noise sampling in the reverse diffusion with a selection of noise samples from pre-defined codebooks of fixed iid Gaussian vectors. Surprisingly, we find that our method, termed Denoising Diffusion Codebook Model (DDCM), retains sample quality and diversity of standard DDMs, even for extremely small codebooks. We leverage DDCM and pick the noises from the codebooks that best match a given image, converting our generative model into a highly effective lossy image codec achieving state-of-the-art perceptual image compression results. More generally, by setting other noise selections rules, we extend our compression method to any conditional image generation task (e.g., image restoration), where the generated images are produced jointly with their condensed bit-stream representations. Our work is accompanied by a mathematical interpretation of the proposed compressed conditional generation schemes, establishing a connection with score-based approximations of posterior samplers for the tasks considered.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2502.01189")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2502.01189", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2502.01189")
Code
Syntology 20 code samples harvested from 1 repository linked to this paper: 13 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 10 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 9 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.
By repository: community (archive-listed): 20 samples from 1 repository, 13 ran (3 with no instrument failure; 10 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 13 samples that ran have no recorded date.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
20 samples harvested: 13 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 10 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 14 of the 20 samples are pointer only, meaning Syntology does not serve that copy's text. For 14 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from DDCM-2025/ddcm-compressed-image-generation. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
00c67a2ab9d4b104 · report
fixture: signature file_path:str/0/str · returned dict · level recorded, date not recorded 944d16b22c6e6e77 · report
fixture: signature netD:callable/0/?, real_data:Tensor/3/float, fake_data:Tensor/3/float, device:device/0/?, type:str/0/str, constant:float/0/float, lambda_gp:float/0/float · returned tuple · level recorded 2026-09-25 5550ef781c1cfd75 · report
fixture: signature datadir:str/0/str, batch_size:int/0/int, resize_to:int/0/int · returned DataLoader · level recorded 2026-09-24 e41367ad14ff58fd · report
fixture: signature named_model_params:list/1/tuple · returned list · level recorded 2026-09-24 e20dd5102da3b050 · report
fixture: signature param_groups_and_shapes:list/1/tuple · returned list · level recorded 2026-09-24 2423fa5313aa3525 · report
fixture: signature name:str/0/str · returned function · level recorded 2026-09-22 905f4b0d3baca742 · report
fixture: signature name:str/0/str · returned function · level recorded 2026-09-24 7f47ba486efd2c7e · report
fixture: signature name:str/0/str · returned function · level recorded 2026-09-24 d9bb4d03137bc7e9 · report
fixture: signature name:str/0/str · returned function · level recorded, date not recorded e214ee19e7a9d92b · report
fixture: signature name:str/0/str · returned function · level recorded 2026-09-22 census: 10 implementations from 14 papers, 5 distinct outputs across 2 buckets, one shared input per bucket compressed_blind_face_restoration.py ran fingerprinted MIT (permissive) ·
051480f785c72147 · report
fixture: signature img:ndarray/3/int, size:int/0/int · returned ndarray · level recorded 2026-09-24 64fff1e30802b815 · report
fixture: signature param_group:list/1/tuple, master_param:Tensor/1/float · returned tuple · level recorded 2026-09-24 129b804760b3115f · report
fixture: signature module:callable/0/? · returned SimpleModule · level recorded 2026-09-22 ecd0fc28815b65ae · report
fe4eb545bbb728e0 · report
5ee15cbb75da09af · report
7a9479e9edb0166b · report
e92451e6fb900818 · report
bbb1be64bf961d18 · report
b910fefa7866252e · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections