{"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":"/dataset/hopkins155","name":"Hopkins155","full_name":null,"description_markdown":"The Hopkins 155 dataset consists of 156 video sequences of two or three motions. Each video sequence motion corresponds to a low-dimensional subspace. There are 39−550 data vectors drawn from two or three motions for each video sequence.\r\n\r\nSource: [Symmetric low-rank representation for subspace clustering](https://arxiv.org/abs/1410.8618)\r\nImage Source: [http://www.vision.jhu.edu/data/hopkins155/](http://www.vision.jhu.edu/data/hopkins155/)","description_withheld":null,"homepage":"http://www.vision.jhu.edu/data/hopkins155/","introduced_date":"2007-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms","first_author":null,"url":"https://doi.org/10.1109/CVPR.2007.382974"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Videos","url":"/datasets/modality/videos"}],"tasks":[{"name":"Motion Segmentation","url":"/task/motion-segmentation","datasets_with_task":"/datasets/task/motion-segmentation"}],"languages":[],"variants":["Hopkins155"],"data_loaders":[],"num_papers_in_archive":92,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/motion-segmentation-on-hopkins155","task":"Motion Segmentation","dataset_variant":"Hopkins155","rows":4,"metrics":["Classification Error"],"first_row_in_archive_order":{"model":"MVC","paper":"/paper/motion-segmentation-by-exploiting","metrics":{"Classification Error":"0.31"},"code_links":[{"title":"alex-xun-xu/MultiViewMoSeg","url":"https://github.com/alex-xun-xu/MultiViewMoSeg"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":4,"of":4,"counts":{"papers_with_a_benchmark_row":4,"with_a_code_link":3,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/motion-segmentation-by-exploiting","slug":"motion-segmentation-by-exploiting","title":"Motion Segmentation by Exploiting Complementary Geometric Models","date":"2018-04-06","arxiv_id":"1804.02142","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-continuous-relaxation-of-beam-search-for","slug":"a-continuous-relaxation-of-beam-search-for","title":"A Continuous Relaxation of Beam Search for End-to-end Training of Neural Sequence Models","date":"2017-08-01","arxiv_id":"1708.00111","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/shape-interaction-matrix-revisited-and","slug":"shape-interaction-matrix-revisited-and","title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data","date":"2015-09-09","arxiv_id":"1509.02649","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sparse-subspace-clustering-algorithm-theory","slug":"sparse-subspace-clustering-algorithm-theory","title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications","date":"2012-03-05","arxiv_id":"1203.1005","rows_on_this_dataset":1,"code_links":4,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/motion-segmentation-by-exploiting","slug":"motion-segmentation-by-exploiting","title":"Motion Segmentation by Exploiting Complementary Geometric Models","date":"2018-04-06","arxiv_id":"1804.02142","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/a-continuous-relaxation-of-beam-search-for","slug":"a-continuous-relaxation-of-beam-search-for","title":"A Continuous Relaxation of Beam Search for End-to-end Training of Neural Sequence Models","date":"2017-08-01","arxiv_id":"1708.00111","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/shape-interaction-matrix-revisited-and","slug":"shape-interaction-matrix-revisited-and","title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data","date":"2015-09-09","arxiv_id":"1509.02649","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/sparse-subspace-clustering-algorithm-theory","slug":"sparse-subspace-clustering-algorithm-theory","title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications","date":"2012-03-05","arxiv_id":"1203.1005","rows_on_this_dataset":1,"code_links":4,"syntology":null}],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"3e203aee95c5d1fe10a2861b01fc65169480581392063a7e76ab682bfc390027","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}