We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The Shape Interaction Matrix (SIM) is one of the earliest approaches to performing subspace clustering (i.e., separating points drawn from a union of subspaces). In this paper, we revisit the SIM and reveal its connections to several recent subspace clustering methods. Our analysis lets us derive a simple, yet effective algorithm to robustify the SIM and make it applicable to realistic scenarios where the data is corrupted by noise. We justify our method by intuitive examples and the matrix perturbation theory. We then show how this approach can be extended to handle missing data, thus yielding an efficient and general subspace clustering algorithm. We demonstrate the benefits of our approach over state-of-the-art subspace clustering methods on several challenging motion segmentation and face clustering problems, where the data includes corrupted and missing measurements.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1509.02649")
get_code_for_paper("1509.02649")
have("1509.02649")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1509.02649.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1509.02649)
Connect an agent — have() is free.