Maximum consensus with mixed integer linear programming
Files
Date
2016
Authors
Kee, Yang Heng
Editors
Advisors
Chin, Tat-Jun
Suter, David
Suter, David
Journal Title
Journal ISSN
Volume Title
Type:
Theses
Citation
Statement of Responsibility
Conference Name
Abstract
Maximum consensus is fundamentally important in computer vision as a criterion for robust estimation, where the goal is to estimate the parameters of a model of best fit. It is computationally demanding to solve such problems exactly. Instead, conventional methods employ randomised sample-and-test techniques to approximate a solution, which fail to guarantee the optimality of the result. This thesis makes several contributions towards solving the maximum consensus problem exactly in the context of Mixed Integer Linear Programming. In particular, two preprocessing techniques aimed at improving the speed and efficiency of exact methods are proposed.
School/Discipline
School of Computer Science
Dissertation Note
Thesis (M.Phil.) -- University of Adelaide, School of Computer Science, 2016.
Provenance
This electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exceptions. If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legals