{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/robust-profile-decomposition-for-large","title":"Robust profile decomposition for large extragalactic spectral-line surveys","arxiv_id":"1905.06036","date":"2019-05-15","proceeding":null,"authors":["Se-Heon Oh","Lister Staveley-Smith","Bi-Qing For"],"abstract":"We present a novel algorithm that is based on a Bayesian Markov Chain Monte Carlo (MCMC) technique for performing robust profile analysis of a data cube from either single-dish or interferometric radio telescopes. It fits a set of models comprised of a number of Gaussian components given by the user to individual line-of-sight velocity profiles, then compares them and finds an optimal model based on the Bayesian Inference Criteria computed for each model.The decomposed Gaussian components are then classified into bulk or non-circular motions as well as kinematically cold or warm components. The fitting based on the Bayesian MCMC technique is insensitive to initial estimates of the parameters, and suffers less from finding the global minimum in models given enough sampling points and a wide range of priors for the parameters. It is found to provide reliable profile decomposition and classification of the decomposed components in a fully automated way, together with robust error estimation of the parameters as shown by performance tests using artificial data cubes. We apply the newly developed algorithm to the HI data cubes of sample galaxies from the Local Volume HI galaxy Survey (LVHIS). We also compare the kinematically cold and warm components, and bulk velocity fields with previous analyses made in a classical method.","url_abs":"http://arxiv.org/abs/1905.06036v1","url_pdf":"http://arxiv.org/pdf/1905.06036v1.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":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"robust-profile-decomposition-for-large","repo_url":"https://github.com/seheonoh/baygaud","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}