1 / 21

Ch 10 Image Segmentation

Ch 10 Image Segmentation. Ideally, partition an image into regions corresponding to real world objects. Goals of segmentation. Segments formed by K-means. Segmentation attempted via contour/boundary detection. Clustering versus region-growing. Clustering versus region-growing.

zada
Download Presentation

Ch 10 Image Segmentation

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. Ch 10 Image Segmentation Ideally, partition an image into regions corresponding to real world objects. CSE 803 Fall 2008 Stockman

  2. Goals of segmentation CSE 803 Fall 2008 Stockman

  3. Segments formed by K-means CSE 803 Fall 2008 Stockman

  4. Segmentation attempted via contour/boundary detection CSE 803 Fall 2008 Stockman

  5. Clustering versus region-growing CSE 803 Fall 2008 Stockman

  6. Clustering versus region-growing CSE 803 Fall 2008 Stockman

  7. K-means clustering as before: vectors can contain color+texture CSE 803 Fall 2008 Stockman

  8. K-means CSE 803 Fall 2008 Stockman

  9. Histograms can show modes CSE 803 Fall 2008 Stockman

  10. Otsu’s method assumes K=2. It searches for the threshold t that optimizes the intra class variance. CSE 803 Fall 2008 Stockman

  11. Ohlander bifurcated the histogram recursively CSE 803 Fall 2008 Stockman

  12. Recursive histogram-controlled segmentation CSE 803 Fall 2008 Stockman

  13. URL’s of other work • Segmentation lecture http://robots.stanford.edu/cs223b/index.html  • Tutorial on graph cut method and assessment of segmentation http://www.cis.upenn.edu/~jshi/GraphTutorial/ CSE 803 Fall 2008 Stockman

  14. Segmentation via region-growing (aggregation) Pixels, or patches, at the lowest level are combined when similar in a hierarchical fashion CSE 803 Fall 2008 Stockman

  15. Decision: combine neighbors? Neighboring pixel or region CSE 803 Fall 2008 Stockman

  16. Aggregation decision CSE 803 Fall 2008 Stockman

  17. Representation of regions CSE 803 Fall 2008 Stockman

  18. Chain codes for boundaries CSE 803 Fall 2008 Stockman

  19. Quad trees divide into quadrants M=mixed; E=empty; F=full CSE 803 Fall 2008 Stockman

  20. Can segment 3D images also • Oct trees subdivide into 8 octants • Same coding: M, E, F used • Software available for doing 3D image processing and differential equations using octree representation. • Can achieve large compression factor. CSE 803 Fall 2008 Stockman

  21. More URLs of other work • Mean shift description http://cmp.felk.cvut.cz/cmp/courses/ZS1/slidy/meanShiftSeg.pdf CSE 803 Fall 2008 Stockman

More Related