{"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/shape-interaction-matrix-revisited-and","title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data","arxiv_id":"1509.02649","date":"2015-09-09","proceeding":"ICCV 2015 12","authors":["Pan Ji","Mathieu Salzmann","Hongdong Li"],"abstract":"The Shape Interaction Matrix (SIM) is one of the earliest approaches to\nperforming subspace clustering (i.e., separating points drawn from a union of\nsubspaces). In this paper, we revisit the SIM and reveal its connections to\nseveral recent subspace clustering methods. Our analysis lets us derive a\nsimple, yet effective algorithm to robustify the SIM and make it applicable to\nrealistic scenarios where the data is corrupted by noise. We justify our method\nby intuitive examples and the matrix perturbation theory. We then show how this\napproach can be extended to handle missing data, thus yielding an efficient and\ngeneral subspace clustering algorithm. We demonstrate the benefits of our\napproach over state-of-the-art subspace clustering methods on several\nchallenging motion segmentation and face clustering problems, where the data\nincludes corrupted and missing measurements.","url_abs":"http://arxiv.org/abs/1509.02649v2","url_pdf":"http://arxiv.org/pdf/1509.02649v2.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":"shape-interaction-matrix-revisited-and","repo_url":"https://github.com/panji530/Robust-shape-interaction-matrix","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"face-clustering","task_name":"Face Clustering"},{"task_slug":"motion-segmentation","task_name":"Motion Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/motion-segmentation-on-hopkins155","task":"Motion Segmentation","dataset":"Hopkins155","model":"RSIM","rank_in_archive_order":2,"of":4,"metrics":{"Classification Error":"1.01"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1509.02649","atlas_url":"https://app.syntology.ai/?focus=1509.02649","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1509.02649"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1509.02649\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1509.02649"},"call":"get_concepts_for_paper(arxiv_id=\"1509.02649\")"}],"by_repo":[{"repo":"panji530/Robust-shape-interaction-matrix","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":"b0888f97445824e73dc392e9e70e612dfbd4706189c6ff97a1cc867657481aeb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}