{"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/fast-low-rank-column-wise-compressive-sensing","title":"Fast Low Rank column-wise Compressive Sensing for Accelerated Dynamic MRI","arxiv_id":"2206.13618","date":"2022-06-27","proceeding":null,"authors":["Silpa Babu","Sajan Goud Lingala","Namrata Vaswani"],"abstract":"This work develops a fast, memory-efficient, and general algorithm for accelerated/undersampled dynamic MRI by assuming an approximate LR model on the matrix formed by the vectorized images of the sequence. By general, we mean that our algorithm can be used for multiple accelerated dynamic MRI applications and multiple sampling rates (acceleration rates) and patterns with a single choice of parameters (no parameter tuning). We show that our proposed algorithms, alternating Gradient Descent (GD) and minimization for MRI (altGDmin-MRI and altGDmin-MRI2), outperform many existing approaches while also being faster than all of them, on average. This claim is based on comparisons on 8 different retrospectively undersampled single- or multi-coil dynamic MRI applications, undersampled using either 1D Cartesian or 2D pseudo-radial undersampling at multiple sampling rates. All comparisons used the same set of algorithm parameters. Our second contribution is a mini-batch and a fully online extension that can process new measurements and return reconstructions either as soon as measurements of a new image frame arrive, or after a short delay.","url_abs":"https://arxiv.org/abs/2206.13618v3","url_pdf":"https://arxiv.org/pdf/2206.13618v3.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":"fast-low-rank-column-wise-compressive-sensing","repo_url":"https://github.com/silpa1/comparison_of_algorithms","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"compressive-sensing","task_name":"Compressive Sensing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"silpa1/comparison_of_algorithms","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":"0db41ca927ecc76177781c057a8cd462c1f04dbe55d8c7f2e0fd43d9c574f75b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}