{"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/robust-kronecker-decomposable-component","title":"Robust Kronecker-Decomposable Component Analysis for Low-Rank Modeling","arxiv_id":"1703.07886","date":"2017-03-22","proceeding":"ICCV 2017 10","authors":["Mehdi Bahri","Yannis Panagakis","Stefanos Zafeiriou"],"abstract":"Dictionary learning and component analysis are part of one of the most\nwell-studied and active research fields, at the intersection of signal and\nimage processing, computer vision, and statistical machine learning. In\ndictionary learning, the current methods of choice are arguably K-SVD and its\nvariants, which learn a dictionary (i.e., a decomposition) for sparse coding\nvia Singular Value Decomposition. In robust component analysis, leading methods\nderive from Principal Component Pursuit (PCP), which recovers a low-rank matrix\nfrom sparse corruptions of unknown magnitude and support. However, K-SVD is\nsensitive to the presence of noise and outliers in the training set.\nAdditionally, PCP does not provide a dictionary that respects the structure of\nthe data (e.g., images), and requires expensive SVD computations when solved by\nconvex relaxation. In this paper, we introduce a new robust decomposition of\nimages by combining ideas from sparse dictionary learning and PCP. We propose a\nnovel Kronecker-decomposable component analysis which is robust to gross\ncorruption, can be used for low-rank modeling, and leverages separability to\nsolve significantly smaller problems. We design an efficient learning algorithm\nby drawing links with a restricted form of tensor factorization. The\neffectiveness of the proposed approach is demonstrated on real-world\napplications, namely background subtraction and image denoising, by performing\na thorough comparison with the current state of the art.","url_abs":"http://arxiv.org/abs/1703.07886v2","url_pdf":"http://arxiv.org/pdf/1703.07886v2.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":"robust-kronecker-decomposable-component","repo_url":"https://github.com/mbahri/KDRSDL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"image-denoising","task_name":"Image Denoising"}],"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":"mbahri/KDRSDL","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":"134ea8ce4f0ccbc9397cac5e2f8ddc3134373341ef7d0f3b3e1dffde8c1d034b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}