{"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/coarse-to-fine-lifted-map-inference-in","title":"Coarse-to-Fine Lifted MAP Inference in Computer Vision","arxiv_id":"1707.07165","date":"2017-07-22","proceeding":null,"authors":["Haroun Habeeb","Ankit Anand","Mausam","Parag Singla"],"abstract":"There is a vast body of theoretical research on lifted inference in\nprobabilistic graphical models (PGMs). However, few demonstrations exist where\nlifting is applied in conjunction with top of the line applied algorithms. We\npursue the applicability of lifted inference for computer vision (CV), with the\ninsight that a globally optimal (MAP) labeling will likely have the same label\nfor two symmetric pixels. The success of our approach lies in efficiently\nhandling a distinct unary potential on every node (pixel), typical of CV\napplications. This allows us to lift the large class of algorithms that model a\nCV problem via PGM inference. We propose a generic template for coarse-to-fine\n(C2F) inference in CV, which progressively refines an initial coarsely lifted\nPGM for varying quality-time trade-offs. We demonstrate the performance of C2F\ninference by developing lifted versions of two near state-of-the-art CV\nalgorithms for stereo vision and interactive image segmentation. We find that,\nagainst flat algorithms, the lifted versions have a much superior anytime\nperformance, without any loss in final solution quality.","url_abs":"http://arxiv.org/abs/1707.07165v1","url_pdf":"http://arxiv.org/pdf/1707.07165v1.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":"coarse-to-fine-lifted-map-inference-in","repo_url":"https://github.com/dair-iitd/c2fi4cv","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"pgm","method_name":"PGM"}],"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":"dair-iitd/c2fi4cv","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":"3ff8db2e575eac0d5bf892fcbb7cb0fe62fd464c559bbdf2e7a115b226fd694a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}