{"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/automatic-trajectory-recognition-in-active","title":"Automatic trajectory recognition in Active Target Time Projection Chambers data by means of hierarchical clustering","arxiv_id":"1807.03513","date":"2018-07-10","proceeding":null,"authors":["Christoph Dalitz","Yassid Ayyad","Jens Wilberg","Lukas Aymans","Daniel Bazin","Wolfgang Mittig"],"abstract":"The automatic reconstruction of three-dimensional particle tracks from Active\nTarget Time Projection Chambers data can be a challenging task, especially in\nthe presence of noise. In this article, we propose a non-parametric algorithm\nthat is based on the idea of clustering point triplets instead of the original\npoints. We define an appropriate distance measure on point triplets and then\napply a single-link hierarchical clustering on the triplets. Compared to\nparametric approaches like RANSAC or the Hough transform, the new algorithm has\nthe advantage of potentially finding trajectories even of shapes that are not\nknown beforehand. This feature is particularly important in low-energy nuclear\nphysics experiments with Active Targets operating inside a magnetic field. The\nalgorithm has been validated using data from experiments performed with the\nActive Target Time Projection Chamber developed at the National Superconducting\nCyclotron Laboratory (NSCL).The results demonstrate the capability of the\nalgorithm to identify and isolate particle tracks that describe non-analytical\ntrajectories. For curved tracks, the vertex detection recall was 86\\% and the\nprecision 94\\%. For straight tracks, the vertex detection recall was 96\\% and\nthe precision 98\\%. In the case of a test set containing only straight linear\ntracks, the algorithm performed better than an iterative Hough transform.","url_abs":"http://arxiv.org/abs/1807.03513v3","url_pdf":"http://arxiv.org/pdf/1807.03513v3.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":"automatic-trajectory-recognition-in-active","repo_url":"https://github.com/Rujuta219/Ru219","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Rujuta219/Ru219","kind":"listed","samples":0,"ran":0,"instrument":0,"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8847869f0b5f5c646591eb28ce43f922e6dd5bcd295990d6e600f4380571f1c5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}