Segmentation - University of Maryland Institute for Advanced 分割-先进的马里兰大学研究所.pptVIP

Segmentation - University of Maryland Institute for Advanced 分割-先进的马里兰大学研究所.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Segmentation - University of Maryland Institute for Advanced 分割-先进的马里兰大学研究所

Segmentation Kyongil Yoon Segmentation Obtain a compact representation of what is helpful (in the image) No comprehensive theory of segmentation Human vision: Grouping and Gestalt Proximity, similarity, common fate, common region, parallelism, closure, symmetry, continuity, familiar configuration Segmentation by clustering Partitioning vs. grouping Applications Background subtraction Shot boundary detection Image segmentation by clustering pixels Using simple clustering Agglomerative clustering (clustering by merging) Divisive clustering (clustering by splitting) K-means Using graph-theoretic clustering Affinity measure Normalized cut cut(A,B)/assoc(A,V) + cut(A,B)/assoc(B,V) K-Means Choose k data points to act as cluster centers Until the cluster centers are unchanged Allocate each data point to cluster whose center is nearest Now ensure that every cluster has at least one data point; possible techniques for doing this include supplying empty clusters with a point chosen at random from points far from their cluster center. Replace the cluster centers with the mean of the elements in their clusters. end Graph Eigenvectors Construct an affinity matrix Compute the eigenvalues and eigenvectors of the affinity matrix Until there are sufficient clusters Take the eigenvector corresponding to the largest unprocessed eigenvalue; zero all components corresponding to elements that have already been clustered, and threshold the remaining components to determine which element belongs to this cluster, choosing a threshold by clustering the components, or using a threshold fixed in advance. If all elements have been accounted for, there are sufficient clusters end Segmentation by fitting a model To assert that pixels belong together to conform to some model Large scale explicit model Hough transform Three problems: What is the line? Which points belong to which line? How many lines? Point space - line space x*cos(t) + y*sin(t) + r = 0, (t, r) line space Half-infinite cylinder

您可能关注的文档

文档评论(0)

wuyoujun92 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档