{"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/joint-graph-decomposition-and-node-labeling","title":"Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications","arxiv_id":"1611.04399","date":"2016-11-14","proceeding":null,"authors":["Evgeny Levinkov","Jonas Uhrig","Siyu Tang","Mohamed Omran","Eldar Insafutdinov","Alexander Kirillov","Carsten Rother","Thomas Brox","Bernt Schiele","Bjoern Andres"],"abstract":"We state a combinatorial optimization problem whose feasible solutions define\nboth a decomposition and a node labeling of a given graph. This problem offers\na common mathematical abstraction of seemingly unrelated computer vision tasks,\nincluding instance-separating semantic segmentation, articulated human body\npose estimation and multiple object tracking. Conceptually, the problem we\nstate generalizes the unconstrained integer quadratic program and the minimum\ncost lifted multicut problem, both of which are NP-hard. In order to find\nfeasible solutions efficiently, we define two local search algorithms that\nconverge monotonously to a local optimum, offering a feasible solution at any\ntime. To demonstrate their effectiveness in tackling computer vision tasks, we\napply these algorithms to instances of the problem that we construct from\npublished data, using published algorithms. We report state-of-the-art\napplication-specific accuracy for the three above-mentioned applications.","url_abs":"http://arxiv.org/abs/1611.04399v2","url_pdf":"http://arxiv.org/pdf/1611.04399v2.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":"joint-graph-decomposition-and-node-labeling","repo_url":"https://github.com/bjoern-andres/graph","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"multiple-object-tracking","task_name":"Multiple Object Tracking"},{"task_slug":"object-tracking","task_name":"Object Tracking"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.04399","atlas_url":"https://app.syntology.ai/?focus=1611.04399","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":"1611.04399"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.04399\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.04399"},"call":"get_concepts_for_paper(arxiv_id=\"1611.04399\")"}],"by_repo":[{"repo":"bjoern-andres/graph","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":"48146232f970f65bb987525aefca87663d5787faf21f32c55f7af85f759290df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}