.png){kind=icon}
返回
Incremental component tree contour computation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2024.11.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A component tree is a graph representation that encodes the connected components of the upper or lower level sets of a grayscale image. Consequently, the nodes of a component tree represent binary images of the encoded connected components. There exist various algorithms that efficiently extract information and attributes of nodes of a component tree by incrementally exploiting the subset relation encoding in the tree. However, to the best of our knowledge, there is no such incremental approach to extract the contours of the nodes. In this paper, we propose an efficient incremental method to compute the contours of the nodes of a component tree by counting the edges (sides) of contour pixels. In addition, we discuss our method's time complexity. We also experimentally show that our proposed method is faster than the standard approach based on node reconstruction.
Keyword:
Component tree
Contour
Incremental attribute
Mathematical morphology
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏DOES TIMING OF LASIX ADMINISTRATION AFFECT PATIENT ABILITY TO TOLERATE DIURETIC RENOGRAPHY?LASIX给药时间是否影响患者耐受利尿剂肾图的能力？
PREAI
分享收藏分享收藏
查看更多内容