{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/deterministic-consensus-maximization-with","title":"Deterministic consensus maximization with biconvex programming","arxiv_id":"1807.09436","date":"2018-07-25","proceeding":"ECCV 2018 9","authors":["Zhipeng Cai","Tat-Jun Chin","Huu Le","David Suter"],"abstract":"Consensus maximization is one of the most widely used robust fitting\nparadigms in computer vision, and the development of algorithms for consensus\nmaximization is an active research topic. In this paper, we propose an\nefficient deterministic optimization algorithm for consensus maximization.\nGiven an initial solution, our method conducts a deterministic search that\nforcibly increases the consensus of the initial solution. We show how each\niteration of the update can be formulated as an instance of biconvex\nprogramming, which we solve efficiently using a novel biconvex optimization\nalgorithm. In contrast to our algorithm, previous consensus improvement\ntechniques rely on random sampling or relaxations of the objective function,\nwhich reduce their ability to significantly improve the initial consensus. In\nfact, on challenging instances, the previous techniques may even return a worse\noff solution. Comprehensive experiments show that our algorithm can\nconsistently and greatly improve the quality of the initial solution, without\nsubstantial cost.","url_abs":"http://arxiv.org/abs/1807.09436v3","url_pdf":"http://arxiv.org/pdf/1807.09436v3.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":"deterministic-consensus-maximization-with","repo_url":"https://github.com/ZhipengCai/Demo---Deterministic-consensus-maximization-with-biconvex-programming","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1807.09436","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}