Lecture 15 - Stanford Vision Lab
Lecture 15 - Stanford Vision Lab
Lecture 15 - Stanford Vision Lab
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Support vector machines<br />
• Find hyperplane that maximizes the margin between the positive and<br />
negative examples<br />
Support vectors: x i<br />
w<br />
b 1<br />
| x<br />
w<br />
b |<br />
Distance between point i<br />
and hyperplane: || w ||<br />
Margin = 2 / ||w||<br />
Solution:<br />
y x i i i i<br />
Support vectors<br />
Credit slide: S. Lazebnik<br />
Margin<br />
w<br />
w x b y x x b<br />
Classification function (decision boundary):<br />
i<br />
i<br />
i<br />
i<br />
Fei-Fei Li<br />
<strong>Lecture</strong> <strong>15</strong> -<br />
35<br />
14‐Nov‐11