A polynomial-time bound for matching and registration with outliers - researchr publication

researchr

You are not signed in
Sign in
Sign up

Carl Olsson, Olof Enqvist, Fredrik Kahl. A polynomial-time bound for matching and registration with outliers. In 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA. IEEE Computer Society, 2008. [doi]

Abstract is missing.

runs on WebDSL