{"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/regularized-discrete-optimal-transport","title":"Regularized Discrete Optimal Transport","arxiv_id":"1307.5551","date":"2013-07-21","proceeding":null,"authors":["Sira Ferradans","Nicolas Papadakis","Gabriel Peyré","Jean-François Aujol"],"abstract":"This article introduces a generalization of the discrete optimal transport,\nwith applications to color image manipulations. This new formulation includes a\nrelaxation of the mass conservation constraint and a regularization term. These\ntwo features are crucial for image processing tasks, which necessitate to take\ninto account families of multimodal histograms, with large mass variation\nacross modes.\n  The corresponding relaxed and regularized transportation problem is the\nsolution of a convex optimization problem. Depending on the regularization\nused, this minimization can be solved using standard linear programming methods\nor first order proximal splitting schemes.\n  The resulting transportation plan can be used as a color transfer map, which\nis robust to mass variation across images color palettes. Furthermore, the\nregularization of the transport plan helps to remove colorization artifacts due\nto noise amplification.\n  We also extend this framework to the computation of barycenters of\ndistributions. The barycenter is the solution of an optimization problem, which\nis separately convex with respect to the barycenter and the transportation\nplans, but not jointly convex. A block coordinate descent scheme converges to a\nstationary point of the energy. We show that the resulting algorithm can be\nused for color normalization across several images. The relaxed and regularized\nbarycenter defines a common color palette for those images. Applying color\ntransfer toward this average palette performs a color normalization of the\ninput images.","url_abs":"http://arxiv.org/abs/1307.5551v1","url_pdf":"http://arxiv.org/pdf/1307.5551v1.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":"regularized-discrete-optimal-transport","repo_url":"https://github.com/gpeyre/2013-SIIMS-regularized-ot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"color-normalization","task_name":"Color Normalization"},{"task_slug":"colorization","task_name":"Colorization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1307.5551","atlas_url":"https://app.syntology.ai/?focus=1307.5551","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":"1307.5551"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1307.5551\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1307.5551"},"call":"get_concepts_for_paper(arxiv_id=\"1307.5551\")"}],"by_repo":[{"repo":"gpeyre/2013-SIIMS-regularized-ot","kind":"listed","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":"b882c2e113ea8525b1e947534b900950061d26768c73e4034552e50c4e8b85cb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}