{"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/efficient-hierarchical-graph-based","title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos","arxiv_id":"1801.08981","date":"2018-01-26","proceeding":"CVPR 2014 6","authors":["Steven Hickson","Stan Birchfield","Irfan Essa","Henrik Christensen"],"abstract":"We present an efficient and scalable algorithm for segmenting 3D RGBD point\nclouds by combining depth, color, and temporal information using a multistage,\nhierarchical graph-based approach. Our algorithm processes a moving window over\nseveral point clouds to group similar regions over a graph, resulting in an\ninitial over-segmentation. These regions are then merged to yield a dendrogram\nusing agglomerative clustering via a minimum spanning tree algorithm. Bipartite\ngraph matching at a given level of the hierarchical tree yields the final\nsegmentation of the point clouds by maintaining region identities over\narbitrarily long periods of time. We show that a multistage segmentation with\ndepth then color yields better results than a linear combination of depth and\ncolor. Due to its incremental processing, our algorithm can process videos of\nany length and in a streaming pipeline. The algorithm's ability to produce\nrobust, efficient segmentation is demonstrated with numerous experimental\nresults on challenging sequences from our own as well as public RGBD data sets.","url_abs":"http://arxiv.org/abs/1801.08981v1","url_pdf":"http://arxiv.org/pdf/1801.08981v1.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":"efficient-hierarchical-graph-based","repo_url":"https://github.com/StevenHickson/4D_Segmentation","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-matching","task_name":"Graph Matching"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"video-segmentation","task_name":"Video Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.08981","atlas_url":"https://app.syntology.ai/?focus=1801.08981","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.08981"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.08981\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.08981"},"call":"get_concepts_for_paper(arxiv_id=\"1801.08981\")"}],"by_repo":[{"repo":"StevenHickson/4D_Segmentation","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":"dab0a494b595b8366ad248359b86113652d6b4924824a60116baab5812f2669e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}