12 Robust fitting (RANSAC and others).pdf

  1. 1、本文档共43页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
12 Robust fitting (RANSAC and others)

Model Fitting Computer Vision CS 143, Brown James Hays 10/03/11 Slides from Silvio Savarese, Svetlana Lazebnik, and Derek Hoiem Fitting: find the parameters of a model that best fit the data Alignment: find the parameters of the transformation that best align matched points Example: Computing vanishing points Slide from Silvio Savarese H Example: Estimating an homographic transformation Slide from Silvio Savarese Example: Estimating “fundamental matrix” that corresponds two views Slide from Silvio Savarese A Example: fitting an 2D shape template Slide from Silvio Savarese Example: fitting a 3D object model Slide from Silvio Savarese Critical issues: noisy data Slide from Silvio Savarese A Critical issues: intra-class variability “All models are wrong, but some are useful.” Box and Draper 1979 Slide from Silvio Savarese H Critical issues: outliers Slide from Silvio Savarese Critical issues: missing data (occlusions) Slide from Silvio Savarese Fitting and Alignment ? Design challenges – Design a suitable goodness of fit measure ? Similarity should reflect application goals ? Encode robustness to outliers and noise – Design an optimization method ? Avoid local optima ? Find best parameters quickly Slide from Derek Hoiem Fitting and Alignment: Methods ? Global optimization / Search for parameters – Least squares fit – Robust least squares – Iterative closest point (ICP) ? Hypothesize and test – Generalized Hough transform – RANSAC Slide from Derek Hoiem Simple example: Fitting a line Slide from Derek Hoiem Least squares line fitting ?Data: (x1, y1), …, (xn, yn) ?Line equation: yi = m xi + b ?Find (m, b) to minimize 022 yAApA TT dB dE )()()(2 1 1 1 2 2 11 1 2 ApApyApyy yAp TTT nn n i ii y y b m x x y b m xE ??? n i ii bxmyE 1 2)( (xi, yi) y=mx+b yAAApyAApA TTTT 1 Matlab: p = A \ y; Modified from S. Lazebnik Least squares: Robustness to noise Least squares fit to the red points:

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档