{"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-based-optimization-of-the-under","title":"Learning-based Optimization of the Under-sampling Pattern in MRI","arxiv_id":"1901.01960","date":"2019-01-07","proceeding":null,"authors":["Cagla Deniz Bahadir","Adrian V. Dalca","Mert R. Sabuncu"],"abstract":"Acquisition of Magnetic Resonance Imaging (MRI) scans can be accelerated by\nunder-sampling in k-space (i.e., the Fourier domain). In this paper, we\nconsider the problem of optimizing the sub-sampling pattern in a data-driven\nfashion. Since the reconstruction model's performance depends on the\nsub-sampling pattern, we combine the two problems. For a given sparsity\nconstraint, our method optimizes the sub-sampling pattern and reconstruction\nmodel, using an end-to-end learning strategy. Our algorithm learns from\nfull-resolution data that are under-sampled retrospectively, yielding a\nsub-sampling pattern and reconstruction model that are customized to the type\nof images represented in the training data. The proposed method, which we call\nLOUPE (Learning-based Optimization of the Under-sampling PattErn), was\nimplemented by modifying a U-Net, a widely-used convolutional neural network\narchitecture, that we append with the forward model that encodes the\nunder-sampling process. Our experiments with T1-weighted structural brain MRI\nscans show that the optimized sub-sampling pattern can yield significantly more\naccurate reconstructions compared to standard random uniform, variable density\nor equispaced under-sampling schemes. The code is made available at:\nhttps://github.com/cagladbahadir/LOUPE .","url_abs":"http://arxiv.org/abs/1901.01960v2","url_pdf":"http://arxiv.org/pdf/1901.01960v2.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-based-optimization-of-the-under","repo_url":"https://github.com/cagladbahadir/LOUPE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"u-net","method_name":"U-Net"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.01960","atlas_url":"https://app.syntology.ai/?focus=1901.01960","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":"1901.01960"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.01960\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.01960"},"call":"get_concepts_for_paper(arxiv_id=\"1901.01960\")"}],"by_repo":[{"repo":"cagladbahadir/LOUPE","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":"2096d3bbcf2c37e8a2fe5ad04b5fbd99389c9e664f4f80d3ceb649867c571c8a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}