Shock Graphs and Shape Matching cs冲击图和形状匹配政务司司长.umd.pptVIP

下载本文档

1
0
约2.73千字
约 18页
2017-03-08 发布于上海
举报
版权申诉

Shock Graphs and Shape Matching cs冲击图和形状匹配政务司司长.umd.ppt

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

Shock Graphs and Shape Matching cs冲击图和形状匹配政务司司长.umd

Shock Graphs and Shape Matching Kaleem Siddiqi, Ali Shokoufandeh, Sven Dickinson and Steven Zucker The Skeleton:Blum’s Medial Axis A connected collection of curves. The set of all points within a closed, Jordan curve such that the largest circle contained within the curve touches two fronts. Provided by Matlab’s bwmorph(‘skel’) function. The Skeleton: Example Problems With Skeletons Small changes in curve may lead to big changes in skeleton. What about occlusion? It is like a graph, so why not represent it as one? The Shocks The singularities (corners, bridges, lines and points) that arise during evolution of the grassfire. In terms of the skeleton, these are protrusions, necks, bends and seeds, described as first to fourth order shocks. The union of the shocks is the skeleton. The Shocks: Example The Shock Graph A description of a skeleton as a DAG. Combine adjacent shocks of same order into one node. Label each node with the part, the time (distance from curve), and first order curves with the flow orientation and end-time. Adjacent curves/points are adjacent in the graph, with edges pointing to the earlier node. Nodes closer to the root occur later. The Shock Graph: Example The Shock Graph Grammar A non-context-free grammar to which all shock graphs conform. Assigns some semantics to the different nodes: Birth Protrusion Union Death Shock Trees Canonical mapping from graph to tree. Relies on the grammar to determine how to cut the graph. Shock Trees Formed by duplicating tips of loops. Topological Distance Idea: find the largest common subgraph, in this case, subtree. The sum of the eigenvalues of a tree adjacency matrix are invariant to similarity transforms, meaning any consistent re-ordering of the tree. So, color all vertexes with a vector made up of the eigenvalue sums of its children sorted by value: χ(u) in Rδ(G)-1 Closer vectors indicate closer isometries. Vertex Distance Need to take into account vertex shape/class/creation time. Non-compatible verti