{"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/alternating-minimization-algorithm-with","title":"Alternating Minimization Algorithm with Automatic Relevance Determination for Transmission Tomography under Poisson Noise","arxiv_id":"1412.8464","date":"2014-12-29","proceeding":null,"authors":["Yan Kaganovsky","Shaobo Han","Soysal Degirmenci","David G. Politte","David J. Brady","Joseph A. O'Sullivan","Lawrence Carin"],"abstract":"We propose a globally convergent alternating minimization (AM) algorithm for\nimage reconstruction in transmission tomography, which extends automatic\nrelevance determination (ARD) to Poisson noise models with Beer's law. The\nalgorithm promotes solutions that are sparse in the pixel/voxel-differences\ndomain by introducing additional latent variables, one for each pixel/voxel,\nand then learning these variables from the data using a hierarchical Bayesian\nmodel. Importantly, the proposed AM algorithm is free of any tuning parameters\nwith image quality comparable to standard penalized likelihood methods. Our\nalgorithm exploits optimization transfer principles which reduce the problem\ninto parallel 1D optimization tasks (one for each pixel/voxel), making the\nalgorithm feasible for large-scale problems. This approach considerably reduces\nthe computational bottleneck of ARD associated with the posterior variances.\nPositivity constraints inherent in transmission tomography problems are also\nenforced. We demonstrate the performance of the proposed algorithm for x-ray\ncomputed tomography using synthetic and real-world datasets. The algorithm is\nshown to have much better performance than prior ARD algorithms based on\napproximate Gaussian noise models, even for high photon flux.","url_abs":"http://arxiv.org/abs/1412.8464v2","url_pdf":"http://arxiv.org/pdf/1412.8464v2.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":"alternating-minimization-algorithm-with","repo_url":"https://github.com/yankagan/VARD-for-CT","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"image-reconstruction","task_name":"Image Reconstruction"}],"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":"yankagan/VARD-for-CT","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":"995bc175545e15c3af6f518e8fc0c12047f2b8573efbc07a36451930733ab489","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}