Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Shi-Malik Algorithm

  • Given a set S of points, the algorithm partitions the points into two sets S1 and S2
  • Let v be the eigenvector v corresponding to the second-smallest eigenvalue of the Laplacian matrix L of S
    \[L=I-D^{-1/2} SD^{-1/2}\]
    where D is the diagonal matrix 
  • Let m be the median of the components in v
  • Place all points whose component in v is greater than m in S1, and the rest in S2

Speaker notes:

Content Tools


There are currently no sources for this slide.