.png){kind=icon}
返回
A new strategy for skeleton pruning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2015.04.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new pruning algorithm is introduced to simplify the structure of the skeleton of 2D objects, without affecting significantly the representative power of the skeleton. The concatenations of skeleton branches originating from the end points of the skeleton are examined while building a hierarchical skeleton structure. Skeleton branches that can be interpreted as peripheral branches at any hierarchical level are concatenated with the adjacent skeleton branches that were interpreted as peripheral branches at the immediately previous level. A concatenation extends in the hierarchy for a number of levels related to the number of branch points connecting the successive branches along the concatenation itself. The most internal branch point up to which a concatenation can be pruned without affecting the representative power of the skeleton is determined by using significance measures able to evaluate the loss in object recovery produced by pruning that part of the concatenation. Pruning is performed by removing all the so identified longest prunable concatenations, provided that topology is maintained (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
2D Skeleton
Skeleton branches
Hierarchical structure
Pruning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容