schedule
DESCRIPTION
Schedule. F5: Texture and segmentation F6: Energy and graph based segmentation F7: Active contours, snakes and level sets F8: Fitting, Hough transform F9: Recognition and classification …. A Vision Application. Binary Image Segmentation. How ?. Cost function. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/1.jpg)
Schedule
• F5: Texture and segmentation
• F6: Energy and graph based segmentation
• F7: Active contours, snakes and level sets
• F8: Fitting, Hough transform
• F9: Recognition and classification
• …
![Page 2: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/2.jpg)
A Vision ApplicationBinary Image Segmentation
How ?
Cost function Models our knowledge about natural images
Optimize cost function to obtain the segmentation
![Page 3: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/3.jpg)
Why do these tokens belong together?
![Page 4: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/4.jpg)
![Page 5: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/5.jpg)
![Page 6: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/6.jpg)
![Page 7: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/7.jpg)
![Page 8: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/8.jpg)
![Page 9: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/9.jpg)
![Page 10: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/10.jpg)
TRAFFIC RESEARCH
• Increase traffic safety• Increase traffic flow• Together with Traffic
Dept in Lund.• Automatic detection
and analysis of objects and events in traffic environment
![Page 11: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/11.jpg)
K-means clustering using intensity alone and color alone
Image Clusters on intensity Clusters on color
![Page 12: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/12.jpg)
K-means using color alone, 11 segments
Image Clusters on color
![Page 13: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/13.jpg)
K-means usingcolor alone,11 segments.
![Page 14: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/14.jpg)
K-means using colour andposition, 20 segments
![Page 15: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/15.jpg)
![Page 16: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/16.jpg)
Graph theoretic clustering
• Represent tokens using a weighted graph.– affinity matrix
• Cut up this graph to get subgraphs with strong interior links
![Page 17: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/17.jpg)
![Page 18: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/18.jpg)
![Page 19: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/19.jpg)
Example eigenvector
points
matrix
eigenvector
![Page 20: Schedule](https://reader033.vdocuments.site/reader033/viewer/2022051417/56814d0a550346895dba41d3/html5/thumbnails/20.jpg)
More than two segments
• Two options– Recursively split each side to get a tree,
continuing till the eigenvalues are too small– Use the other eigenvectors