{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/eigentrajectory-low-rank-descriptors-for","title":"EigenTrajectory: Low-Rank Descriptors for Multi-Modal Trajectory Forecasting","arxiv_id":"2307.09306","date":"2023-07-18","proceeding":"ICCV 2023 1","authors":["Inhwan Bae","Jean Oh","Hae-Gon Jeon"],"abstract":"Capturing high-dimensional social interactions and feasible futures is essential for predicting trajectories. To address this complex nature, several attempts have been devoted to reducing the dimensionality of the output variables via parametric curve fitting such as the B\\'ezier curve and B-spline function. However, these functions, which originate in computer graphics fields, are not suitable to account for socially acceptable human dynamics. In this paper, we present EigenTrajectory ($\\mathbb{ET}$), a trajectory prediction approach that uses a novel trajectory descriptor to form a compact space, known here as $\\mathbb{ET}$ space, in place of Euclidean space, for representing pedestrian movements. We first reduce the complexity of the trajectory descriptor via a low-rank approximation. We transform the pedestrians' history paths into our $\\mathbb{ET}$ space represented by spatio-temporal principle components, and feed them into off-the-shelf trajectory forecasting models. The inputs and outputs of the models as well as social interactions are all gathered and aggregated in the corresponding $\\mathbb{ET}$ space. Lastly, we propose a trajectory anchor-based refinement method to cover all possible futures in the proposed $\\mathbb{ET}$ space. Extensive experiments demonstrate that our EigenTrajectory predictor can significantly improve both the prediction accuracy and reliability of existing trajectory forecasting models on public benchmarks, indicating that the proposed descriptor is suited to represent pedestrian behaviors. Code is publicly available at https://github.com/inhwanbae/EigenTrajectory .","url_abs":"https://arxiv.org/abs/2307.09306v1","url_pdf":"https://arxiv.org/pdf/2307.09306v1.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":"eigentrajectory-low-rank-descriptors-for","repo_url":"https://github.com/inhwanbae/eigentrajectory","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"eigentrajectory-low-rank-descriptors-for","repo_url":"https://github.com/pranav-chib/trajimpute","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"human-dynamics","task_name":"Human Dynamics"},{"task_slug":"trajectory-forecasting","task_name":"Trajectory Forecasting"},{"task_slug":"trajectory-prediction","task_name":"Trajectory Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2307.09306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09306"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/pranav-chib/trajimpute","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/inhwanbae/eigentrajectory","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/inhwanbae/EigenTrajectory","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5,"ran_draft_wrong":1,"ran_honours":1,"unverified":2},"by_repo_kind":{"official":{"samples":9,"ran":7,"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,"samples":[{"code_sha256_prefix":"ffc38fcf2686c808","entry":"curve_fitting","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"CurveModel/curve_fitting.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/CurveModel/curve_fitting.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ffc38fcf2686c808"}},{"code_sha256_prefix":"1b373d997a81df48","entry":"generate_ar_mask","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"baseline/agentformer/model.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/baseline/agentformer/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1b373d997a81df48"}},{"code_sha256_prefix":"828ed392be109d01","entry":"generate_identity_matrix","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"baseline/gpgraphsgcn/model_groupwrapper.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/baseline/gpgraphsgcn/model_groupwrapper.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"828ed392be109d01"}},{"code_sha256_prefix":"66d9c97d20cb3bfd","entry":"generate_mask","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"baseline/agentformer/model.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/baseline/agentformer/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"66d9c97d20cb3bfd"}},{"code_sha256_prefix":"e710d9e59161e4ba","entry":"irwin_hall_pdf","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"CurveModel/curve_basis.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/CurveModel/curve_basis.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e710d9e59161e4ba"}},{"code_sha256_prefix":"fba974066d320431","entry":"torch_binom","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"CurveModel/curve_basis.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/CurveModel/curve_basis.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fba974066d320431"}},{"code_sha256_prefix":"298994d0e5c87a7f","entry":"torch_pactorial","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"CurveModel/curve_basis.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/CurveModel/curve_basis.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"298994d0e5c87a7f"}},{"code_sha256_prefix":"18eeb7c1c4d68a72","entry":"generate_adjacency_matrix","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"baseline/gpgraphsgcn/model_groupwrapper.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/baseline/gpgraphsgcn/model_groupwrapper.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"18eeb7c1c4d68a72"}},{"code_sha256_prefix":"3b78c4b8056c3cf9","entry":"get_GPGraph_SGCN_model","repo":"inhwanbae/EigenTrajectory","repo_kind":"official","path":"baseline/gpgraphsgcn/model.py","file_url":"https://github.com/inhwanbae/EigenTrajectory/blob/HEAD/baseline/gpgraphsgcn/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3b78c4b8056c3cf9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}