TY - GEN
T1 - Globfit: Consistently fitting primitives by discovering global relations
AU - Li, Yangyan
AU - Wu, Xiaokun
AU - Chrysathou, Yiorgos
AU - Sharf, Andrei Sharf
AU - Cohen-Or, Daniel
AU - Mitra, Niloy J.
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2011/7/26
Y1 - 2011/7/26
N2 - Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
AB - Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
UR - http://hdl.handle.net/10754/575901
UR - http://portal.acm.org/citation.cfm?doid=1964921.1964947
UR - http://www.scopus.com/inward/record.url?scp=80051863907&partnerID=8YFLogxK
U2 - 10.1145/1964921.1964947
DO - 10.1145/1964921.1964947
M3 - Conference contribution
SN - 9781450309431
BT - ACM SIGGRAPH 2011 papers on - SIGGRAPH '11
PB - Association for Computing Machinery (ACM)
ER -