{"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/nmf-with-sparse-regularizations-in","title":"NMF with Sparse Regularizations in Transformed Domains","arxiv_id":"1407.7691","date":"2014-07-29","proceeding":null,"authors":["Jérémy Rapin","Jérôme Bobin","Anthony Larue","Jean-Luc Starck"],"abstract":"Non-negative blind source separation (non-negative BSS), which is also\nreferred to as non-negative matrix factorization (NMF), is a very active field\nin domains as different as astrophysics, audio processing or biomedical signal\nprocessing. In this context, the efficient retrieval of the sources requires\nthe use of signal priors such as sparsity. If NMF has now been well studied\nwith sparse constraints in the direct domain, only very few algorithms can\nencompass non-negativity together with sparsity in a transformed domain since\nsimultaneously dealing with two priors in two different domains is challenging.\nIn this article, we show how a sparse NMF algorithm coined non-negative\ngeneralized morphological component analysis (nGMCA) can be extended to impose\nnon-negativity in the direct domain along with sparsity in a transformed\ndomain, with both analysis and synthesis formulations. To our knowledge, this\nwork presents the first comparison of analysis and synthesis priors ---as well\nas their reweighted versions--- in the context of blind source separation.\nComparisons with state-of-the-art NMF algorithms on realistic data show the\nefficiency as well as the robustness of the proposed algorithms.","url_abs":"http://arxiv.org/abs/1407.7691v1","url_pdf":"http://arxiv.org/pdf/1407.7691v1.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":"nmf-with-sparse-regularizations-in","repo_url":"https://github.com/jbobin/pyGMCALab","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"blind-source-separation","task_name":"blind source separation"}],"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":"jbobin/pyGMCALab","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":"fe51d479b75a831725b492d2644d56fa9aafbb9621d572bd74889a866ed160da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}