{"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/end-to-end-fine-grained-action-segmentation","title":"End-to-End Fine-Grained Action Segmentation and Recognition Using Conditional Random Field Models and Discriminative Sparse Coding","arxiv_id":"1801.09571","date":"2018-01-29","proceeding":null,"authors":["Effrosyni Mavroudi","Divya Bhaskara","Shahin Sefati","Haider Ali","René Vidal"],"abstract":"Fine-grained action segmentation and recognition is an important yet\nchallenging task. Given a long, untrimmed sequence of kinematic data, the task\nis to classify the action at each time frame and segment the time series into\nthe correct sequence of actions. In this paper, we propose a novel framework\nthat combines a temporal Conditional Random Field (CRF) model with a powerful\nframe-level representation based on discriminative sparse coding. We introduce\nan end-to-end algorithm for jointly learning the weights of the CRF model,\nwhich include action classification and action transition costs, as well as an\novercomplete dictionary of mid-level action primitives. This results in a CRF\nmodel that is driven by sparse coding features obtained using a discriminative\ndictionary that is shared among different actions and adapted to the task of\nstructured output learning. We evaluate our method on three surgical tasks\nusing kinematic data from the JIGSAWS dataset, as well as on a food preparation\ntask using accelerometer data from the 50 Salads dataset. Our results show that\nthe proposed method performs on par or better than state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1801.09571v1","url_pdf":"http://arxiv.org/pdf/1801.09571v1.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":[],"tasks":[{"task_slug":"action-classification","task_name":"Action Classification"},{"task_slug":"action-segmentation","task_name":"Action Segmentation"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[{"method_slug":"crf","method_name":"CRF"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/action-segmentation-on-jigsaws","task":"Action Segmentation","dataset":"JIGSAWS","model":"SDL+SC-CRF","rank_in_archive_order":5,"of":7,"metrics":{"Edit Distance":"86.21"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.09571","atlas_url":"https://app.syntology.ai/?focus=1801.09571","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":"1801.09571"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.09571\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.09571"},"call":"get_concepts_for_paper(arxiv_id=\"1801.09571\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2237ad5d8c9ccfc70f5b3538d9f7ca2aa53231495455297f2e35cf5921024455","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}