1 / 35

Segmentation using eigenvectors

Segmentation using eigenvectors. Papers: “Normalized Cuts and Image Segmentation”. Jianbo Shi and Jitendra Malik , IEEE, 2000 “Segmentation using eigenvectors: a unifying view”. Yair Weiss, ICCV 1999. Graph-based Image Segmentation. Image (I). Intensity Color Edges Texture.

moke
Download Presentation

Segmentation using eigenvectors

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Segmentation using eigenvectors Papers: “Normalized Cuts and Image Segmentation”. Jianbo Shi and JitendraMalik, IEEE, 2000 “Segmentation using eigenvectors: a unifying view”. Yair Weiss, ICCV 1999.

  2. Graph-based Image Segmentation Image (I) Intensity Color Edges Texture Graph Affinities (W) Slide from Timothee Cour (http://www.seas.upenn.edu/~timothee)

  3. Graph-based Image Segmentation Image (I) Intensity Color Edges Texture Graph Affinities (W) Slide from Timothee Cour (http://www.seas.upenn.edu/~timothee)

  4. Graph-based Image Segmentation Image (I) Eigenvector X(W) Intensity Color Edges Texture Graph Affinities (W) Slide from Timothee Cour (http://www.seas.upenn.edu/~timothee)

  5. Graph-based Image Segmentation Image (I) Eigenvector X(W) Discretization Intensity Color Edges Texture Graph Affinities (W) Slide from Timothee Cour (http://www.seas.upenn.edu/~timothee)

  6. Graph-based Image Segmentation G = {V,E} V: graph nodes E: edges connection nodes Pixels Pixel similarity Slides from Jianbo Shi

  7. Graph terminology • Similarity matrix: Slides from Jianbo Shi

  8. Affinity matrix N pixels Similarity of image pixels to selected pixel Brighter means more similar M pixels Warning the size of W is quadratic with the number of parameters! Reshape N*M pixels N*M pixels

  9. Graph terminology • Degree of node: … … Slides from Jianbo Shi

  10. Graph terminology • Volume of set: Slides from Jianbo Shi

  11. Graph terminology • Cuts in a graph: Slides from Jianbo Shi

  12. segments pixels Representation Partition matrix X: Pair-wise similarity matrix W: Degree matrix D: Laplacian matrix L:

  13. Pixel similarity functions Intensity Distance Texture

  14. Pixel similarity functions Intensity here c(x) is a vector of filter outputs. A natural thing to do is to square the outputs of a range of different filters at different scales and orientations, smooth the result, and rack these into a vector. Distance Texture

  15. Definitions • Methods that use the spectrum of the affinity matrix to cluster are known as spectral clustering. • Normalized cuts, Average cuts, Average association make use of the eigenvectors of the affinity matrix. • Why these methods work?

  16. Spectral Clustering Data Similarities * Slides from Dan Klein, Sep Kamvar, Chris Manning, Natural Language Group Stanford University

  17. Eigenvectors and blocks • Block matrices have block eigenvectors: • Near-block matrices have near-block eigenvectors: 3= 0 1= 2 2= 2 4= 0 eigensolver 3= -0.02 1= 2.02 2= 2.02 4= -0.02 eigensolver * Slides from Dan Klein, Sep Kamvar, Chris Manning, Natural Language Group Stanford University

  18. Spectral Space • Can put items into blocks by eigenvectors: • Clusters clear regardless of row ordering: e1 e2 e1 e2 e1 e2 e1 e2 * Slides from Dan Klein, Sep Kamvar, Chris Manning, Natural Language Group Stanford University

  19. How do we extract a good cluster? • Simplest idea: we want a vector x giving the association between each element and a cluster • We want elements within this cluster to, on the whole, have strong affinity with one another • We could maximize • But need the constraint • This is an eigenvalue problem - choose the eigenvector of W with largest eigenvalue.

  20. Cuts with lesser weight than the ideal cut Ideal Cut Minimum cut • Criterion for partition: A Problem! Weight of cut is directly proportional to the number of edges in the cut. B First proposed by Wu and Leahy

  21. Normalized Cut Normalized cut or balanced cut: Finds better cut

  22. Normalized Cut • Volume of set (or association): A B

  23. Normalized Cut • Volume of set (or association): • Define normalized cut: “a fraction of the total edge connections to all the nodes in the graph”: A B A B • Define normalized association: “how tightly on average nodes within the cluster are connected to each other” A B

  24. Observations(I) • Maximizing Nassoc is the same as minimizing Ncut, since they are related: • How to minimize Ncut? • Transform Ncut equation to a matricial form. • After simplifying: NP-Hard! y’s values are quantized Subject to: Rayleigh quotient

  25. min Observations(II) • Instead, relax into the continuous domain by solving generalized eigenvalue system: • Which gives: • Note that so, the first eigenvector is y0=1 with eigenvalue 0. • The second smallest eigenvector is the real valued solution to this problem!!

  26. Algorithm • Define a similarity function between 2 nodes. i.e.: • Compute affinity matrix (W) and degree matrix (D). • Solve • Use the eigenvector with the second smallest eigenvalue to bipartition the graph. • Decide if re-partition current partitions. Note: since precision requirements are low, W is very sparse and only few eigenvectors are required, the eigenvectors can be extracted very fast using Lanczos algorithm.

  27. Discretization • Sometimes there is not a clear threshold to binarize since eigenvectors take on continuous values. • How to choose the splitting point? • Pick a constant value (0, or 0.5). • Pick the median value as splitting point. • Look for the splitting point that has the minimum Ncut value: • Choose n possible splitting points. • Compute Ncut value. • Pick minimum.

  28. Use k-eigenvectors • Recursive 2-way Ncut is slow. • We can use more eigenvectors to re-partition the graph, however: • Not all eigenvectors are useful for partition (degree of smoothness). • Procedure: compute k-means with a high k. Then follow one of these procedures: • Merge segments that minimize k-way Ncut criterion. • Use the k segments and find the partitions there using exhaustive search. • Compute Q (next slides). e1 e2 e1 e2

  29. Toy examples Images from Matthew Brand (TR-2002-42)

  30. Example (I) Eigenvectors Segments

  31. Example (II) Original Segments * Slide from Khurram Hassan-Shafique CAP5415 Computer Vision 2003

  32. Other applications Data M Q • Costeira and Kanade (1995). • Used to segment points in motion. • Compute M=(XY). • The affinity matrix W is compute as W=MTM. This trick computes the affinity of every pair of points as a inner product. • Compute Q=VTV • Values close to 1 belong to the same cluster.

  33. Other applications • Face clustering in meetings. • Grab faces from video in real time (use a face detector + face tracker). • Compare all faces using a distance metric (i.e. projection error into representative basis). • Use normalized cuts to find best clustering.

  34. Conclusions • Good news: • Simple and powerful methods to segment images. • Flexible and easy to apply to other clustering problems. • Bad news: • High memory requirements (use sparse matrices). • Very dependant on the scale factor for a specific problem.

  35. Thank you!

More Related