{"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/interaction-relational-network-for-mutual","title":"Interaction Relational Network for Mutual Action Recognition","arxiv_id":"1910.04963","date":"2019-10-11","proceeding":null,"authors":["Mauricio Perez","Jun Liu","Alex C. Kot"],"abstract":"Person-person mutual action recognition (also referred to as interaction recognition) is an important research branch of human activity analysis. Current solutions in the field -- mainly dominated by CNNs, GCNs and LSTMs -- often consist of complicated architectures and mechanisms to embed the relationships between the two persons on the architecture itself, to ensure the interaction patterns can be properly learned. Our main contribution with this work is by proposing a simpler yet very powerful architecture, named Interaction Relational Network, which utilizes minimal prior knowledge about the structure of the human body. We drive the network to identify by itself how to relate the body parts from the individuals interacting. In order to better represent the interaction, we define two different relationships, leading to specialized architectures and models for each. These multiple relationship models will then be fused into a single and special architecture, in order to leverage both streams of information for further enhancing the relational reasoning capability. Furthermore we define important structured pair-wise operations to extract meaningful extra information from each pair of joints -- distance and motion. Ultimately, with the coupling of an LSTM, our IRN is capable of paramount sequential relational reasoning. These important extensions we made to our network can also be valuable to other problems that require sophisticated relational reasoning. Our solution is able to achieve state-of-the-art performance on the traditional interaction recognition datasets SBU and UT, and also on the mutual actions from the large-scale dataset NTU RGB+D. Furthermore, it obtains competitive performance in the NTU RGB+D 120 dataset interactions subset.","url_abs":"https://arxiv.org/abs/1910.04963v2","url_pdf":"https://arxiv.org/pdf/1910.04963v2.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":"interaction-relational-network-for-mutual","repo_url":"https://github.com/mauriciolp/inter-rel-net","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"action-recognition-in-videos","task_name":"Action Recognition"},{"task_slug":"human-interaction-recognition","task_name":"Human Interaction Recognition"},{"task_slug":"relational-reasoning","task_name":"Relational Reasoning"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/human-interaction-recognition-on-ntu-rgb-d","task":"Human Interaction Recognition","dataset":"NTU RGB+D","model":"LSTM-IRN'fc1inter+intra","rank_in_archive_order":5,"of":5,"metrics":{"Accuracy (Cross-Subject)":"90.5","Accuracy (Cross-View)":"93.5"},"uses_additional_data":false},{"leaderboard":"/sota/human-interaction-recognition-on-ntu-rgb-d-1","task":"Human Interaction Recognition","dataset":"NTU RGB+D 120","model":"LSTM-IRN","rank_in_archive_order":6,"of":6,"metrics":{"Accuracy (Cross-Setup)":"79.6","Accuracy (Cross-Subject)":"77.7"},"uses_additional_data":false},{"leaderboard":"/sota/human-interaction-recognition-on-sbu-1","task":"Human Interaction Recognition","dataset":"SBU","model":"LSTM-IRN'fc1inter+intra","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"98.2"},"uses_additional_data":false},{"leaderboard":"/sota/human-interaction-recognition-on-ut-1","task":"Human Interaction Recognition","dataset":"UT-Interaction","model":"LSTM-IRN'fc1inter+intra","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy (Set 1)":"98.3","Accuracy (Set 2)":"96.7"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1910.04963","atlas_url":"https://app.syntology.ai/?focus=1910.04963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04963"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.04963"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.04963"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.04963\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1910.04963"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1910.04963\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1910.04963"},"call":"get_concepts_for_paper(arxiv_id=\"1910.04963\")"}],"by_repo":[{"repo":"mauriciolp/inter-rel-net","kind":"official","samples":2,"ran":2,"instrument":1,"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1910.04963.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1910.04963.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mauriciolp/inter-rel-net","reach":null}],"summary":{"ran_draft_wrong":1,"ran_honours":1},"n_samples":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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'","n_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)"},"by_repo_kind":{"official":{"samples":2,"ran":2,"n_ran_checked":1,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"samples":[{"code_sha256":"d2e9220a44032c76","code_sha256_prefix":"d2e9220a44032c76","entry":"get_relevant_kwargs","repo":"mauriciolp/inter-rel-net","repo_kind":"official","path":"src/models/rn.py","file_url":"https://github.com/mauriciolp/inter-rel-net/blob/HEAD/src/models/rn.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"kwargs:dict/0/?, func:callable/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d2e9220a44032c76"}},{"code_sha256":"29eba85d6d5181d1","code_sha256_prefix":"29eba85d6d5181d1","entry":"parse_fit_history","repo":"mauriciolp/inter-rel-net","repo_kind":"official","path":"src/run_protocol.py","file_url":"https://github.com/mauriciolp/inter-rel-net/blob/HEAD/src/run_protocol.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"signature":"fit_history:FitHistory/0/?","fixture_out_type":"DataFrame","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"29eba85d6d5181d1"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6e6786beb1aaac142fb7d72bb652b51ebc2f5f9d3d7db563ee80ab29ce381a30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}