{"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/dotmark-a-benchmark-for-discrete-optimal","title":"DOTmark - A Benchmark for Discrete Optimal Transport","arxiv_id":"1610.03368","date":"2016-10-11","proceeding":null,"authors":["Jörn Schrieber","Dominic Schuhmacher","Carsten Gottschlich"],"abstract":"The Wasserstein metric or earth mover's distance (EMD) is a useful tool in\nstatistics, machine learning and computer science with many applications to\nbiological or medical imaging, among others. Especially in the light of\nincreasingly complex data, the computation of these distances via optimal\ntransport is often the limiting factor. Inspired by this challenge, a variety\nof new approaches to optimal transport has been proposed in recent years and\nalong with these new methods comes the need for a meaningful comparison.\n  In this paper, we introduce a benchmark for discrete optimal transport,\ncalled DOTmark, which is designed to serve as a neutral collection of problems,\nwhere discrete optimal transport methods can be tested, compared to one\nanother, and brought to their limits on large-scale instances. It consists of a\nvariety of grayscale images, in various resolutions and classes, such as\nseveral types of randomly generated images, classical test images and real data\nfrom microscopy.\n  Along with the DOTmark we present a survey and a performance test for a cross\nsection of established methods ranging from more traditional algorithms, such\nas the transportation simplex, to recently developed approaches, such as the\nshielding neighborhood method, and including also a comparison with commercial\nsolvers.","url_abs":"http://arxiv.org/abs/1610.03368v1","url_pdf":"http://arxiv.org/pdf/1610.03368v1.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":"dotmark-a-benchmark-for-discrete-optimal","repo_url":"https://github.com/nbonneel/network_simplex","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[{"slug":"dotmark","name":"DOTmark","full_name":"Discrete Optimal Transport Benchmark"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.03368","atlas_url":"https://app.syntology.ai/?focus=1610.03368","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":"1610.03368"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.03368\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.03368"},"call":"get_concepts_for_paper(arxiv_id=\"1610.03368\")"}],"by_repo":[{"repo":"nbonneel/network_simplex","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":"108b76e1c6c70c58ec4a3df9a9b47e5493e8e70aab7de981c01d9d62416b004c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}