{"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/real-time-salient-closed-boundary-tracking","title":"Real-Time Salient Closed Boundary Tracking via Line Segments Perceptual Grouping","arxiv_id":"1705.00360","date":"2017-04-30","proceeding":null,"authors":["Xuebin Qin","Shida He","Camilo Perez Quintero","Abhineet Singh","Masood Dehghan","Martin Jagersand"],"abstract":"This paper presents a novel real-time method for tracking salient closed\nboundaries from video image sequences. This method operates on a set of\nstraight line segments that are produced by line detection. The tracking scheme\nis coherently integrated into a perceptual grouping framework in which the\nvisual tracking problem is tackled by identifying a subset of these line\nsegments and connecting them sequentially to form a closed boundary with the\nlargest saliency and a certain similarity to the previous one. Specifically, we\ndefine a new tracking criterion which combines a grouping cost and an area\nsimilarity constraint. The proposed criterion makes the resulting boundary\ntracking more robust to local minima. To achieve real-time tracking\nperformance, we use Delaunay Triangulation to build a graph model with the\ndetected line segments and then reduce the tracking problem to finding the\noptimal cycle in this graph. This is solved by our newly proposed closed\nboundary candidates searching algorithm called \"Bidirectional Shortest Path\n(BDSP)\". The efficiency and robustness of the proposed method are tested on\nreal video sequences as well as during a robot arm pouring experiment.","url_abs":"http://arxiv.org/abs/1705.00360v2","url_pdf":"http://arxiv.org/pdf/1705.00360v2.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":"real-time-salient-closed-boundary-tracking","repo_url":"https://github.com/NathanUA/SalientClosedBoundaryTracking","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"real-time-salient-closed-boundary-tracking","repo_url":"https://github.com/NathanUA/SalientClosedBoundaryTrackingDataset","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"line-detection","task_name":"Line Detection"},{"task_slug":"visual-tracking","task_name":"Visual Tracking"}],"methods":[],"datasets_introduced":[{"slug":"salient-closed-boundary-tracking","name":"Salient Closed Boundary Tracking","full_name":null}],"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":"NathanUA/SalientClosedBoundaryTracking","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"NathanUA/SalientClosedBoundaryTrackingDataset","kind":"official","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":"c6e75d1781b4480d0431dfa9abf14ce8f65b58c77cc1159433ef22f4bdc43125","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}