{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/dual-diffusion-implicit-bridges-for-image-to","title":"Dual Diffusion Implicit Bridges for Image-to-Image Translation","arxiv_id":"2203.08382","date":"2022-03-16","proceeding":null,"authors":["Xuan Su","Jiaming Song","Chenlin Meng","Stefano Ermon"],"abstract":"Common image-to-image translation methods rely on joint training over data from both source and target domains. The training process requires concurrent access to both datasets, which hinders data separation and privacy protection; and existing models cannot be easily adapted for translation of new domain pairs. We present Dual Diffusion Implicit Bridges (DDIBs), an image translation method based on diffusion models, that circumvents training on domain pairs. Image translation with DDIBs relies on two diffusion models trained independently on each domain, and is a two-step process: DDIBs first obtain latent encodings for source images with the source diffusion model, and then decode such encodings using the target model to construct target images. Both steps are defined via ordinary differential equations (ODEs), thus the process is cycle consistent only up to discretization errors of the ODE solvers. Theoretically, we interpret DDIBs as concatenation of source to latent, and latent to target Schrodinger Bridges, a form of entropy-regularized optimal transport, to explain the efficacy of the method. Experimentally, we apply DDIBs on synthetic and high-resolution image datasets, to demonstrate their utility in a wide variety of translation tasks and their inherent optimal transport properties.","url_abs":"https://arxiv.org/abs/2203.08382v4","url_pdf":"https://arxiv.org/pdf/2203.08382v4.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":"dual-diffusion-implicit-bridges-for-image-to","repo_url":"https://github.com/suxuann/ddib","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-to-image-translation","task_name":"Image-to-Image Translation"},{"task_slug":"translation","task_name":"Translation"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2203.08382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08382"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/suxuann/ddib","reach":null}],"summary":{"ran":1,"ran_honours":1,"unverified":2},"by_repo_kind":{"official":{"samples":4,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"1dba99f1bde1883b","entry":"GaussianDiffusion","repo":"suxuann/ddib","repo_kind":"official","path":"guided_diffusion/respace.py","file_url":"https://github.com/suxuann/ddib/blob/HEAD/guided_diffusion/respace.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1dba99f1bde1883b"}},{"code_sha256_prefix":"809d6a4eb92a37c4","entry":"betas_for_alpha_bar","repo":"suxuann/ddib","repo_kind":"official","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/suxuann/ddib/blob/HEAD/guided_diffusion/gaussian_diffusion.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"809d6a4eb92a37c4"}},{"code_sha256_prefix":"8909f9c9217a637e","entry":"SpacedDiffusion","repo":"suxuann/ddib","repo_kind":"official","path":"guided_diffusion/respace.py","file_url":"https://github.com/suxuann/ddib/blob/HEAD/guided_diffusion/respace.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8909f9c9217a637e"}},{"code_sha256_prefix":"3dfd61c7077a1607","entry":"get_named_beta_schedule","repo":"suxuann/ddib","repo_kind":"official","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/suxuann/ddib/blob/HEAD/guided_diffusion/gaussian_diffusion.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3dfd61c7077a1607"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}