{"id":26787513,"url":"https://github.com/amirhk-dev/solving-minimum-cost-lifted-multicut-problems-by-node-agglomeration","last_synced_at":"2025-08-19T00:17:40.716Z","repository":{"id":96374457,"uuid":"502574424","full_name":"Amirhk-dev/Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration","owner":"Amirhk-dev","description":"Proposed Heuristic Solvers for Minimum Cost Lifted Multicut Problem","archived":false,"fork":false,"pushed_at":"2022-06-12T10:22:56.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T12:30:34.773Z","etag":null,"topics":["graph-algorithms","segmentation"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Amirhk-dev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-06-12T09:41:30.000Z","updated_at":"2023-07-19T10:09:00.000Z","dependencies_parsed_at":null,"dependency_job_id":"b5525d3d-d7c3-4464-b734-e308bc9a130a","html_url":"https://github.com/Amirhk-dev/Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Amirhk-dev/Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amirhk-dev%2FSolving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amirhk-dev%2FSolving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amirhk-dev%2FSolving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amirhk-dev%2FSolving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Amirhk-dev","download_url":"https://codeload.github.com/Amirhk-dev/Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Amirhk-dev%2FSolving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271079144,"owners_count":24695583,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-18T02:00:08.743Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["graph-algorithms","segmentation"],"created_at":"2025-03-29T12:25:41.105Z","updated_at":"2025-08-19T00:17:40.694Z","avatar_url":"https://github.com/Amirhk-dev.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# This is a repository related to the \"Solving-Minimum-Cost-Lifted-Multicut-Problems-by-Node-Agglomeration\" paper\n\n[Project Page](https://web.informatik.uni-mannheim.de/akardoos/)\n\n## In this paper two heuristic solvers are proposed for the minimum cost (lifted) multicut problem:\n* Balanced Edge Contraction (BEC): Creates balanced clusters\n* BEC-cut: Creates clusters along the object boundaries\n\n## Setup\n* The code is based on the [graph and graph algorithms library](https://github.com/bjoern-andres/graph)\n\n* To create the instance of the Lifted Multicut Problem (LMP) we use [this folder.](https://www.mpi-inf.mpg.de/fileadmin/inf/d2/levinkov/iccv-2015/code.tar.gz)\n\n* After downloading the folder add the two solvers to the directory:\n\"code\\include\\andres\\graph\\multicut-lifted\\\"\n\n* Compile the library\n\n## References\n````\n@inproceedings{Kardoost2018,\ntitle     = {Solving Minimum Cost Lifted Multicut Problems by Node Agglomeration},\nauthor    = {A Kardoost and M. Keuper},\nyear      = {2018},\nbooktitle = {ACCV 2018, 14th Asian Conference on Computer Vision}\n}\n````\n````\n@article{Keuper2015,\ntitle    = {Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts},\nauthor   = {M. Keuper and E. Levinkov and N. Bonneel and G. Lavou{\\'e} and T. Brox and B. Andres},\njournal  = {ICCV},\nyear     = {2015}\n}\n````\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirhk-dev%2Fsolving-minimum-cost-lifted-multicut-problems-by-node-agglomeration","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Famirhk-dev%2Fsolving-minimum-cost-lifted-multicut-problems-by-node-agglomeration","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirhk-dev%2Fsolving-minimum-cost-lifted-multicut-problems-by-node-agglomeration/lists"}