首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 高效构建和扩展属性组树分析的新的消光值

高效构建和扩展属性组树分析的新的消光值

资 源 简 介

Efficient Computation of New Extinction Values From Extended Component Tree Screenshots A gray-level image can be interpreted as a topographical surface, and represented by a component tree, based on the inclusion relation of connected components obtained by threshold decomposition. Relations between plateaus, valleys or mountains of this relief are useful in computer vision systems. An important definition to characterize the topographical surface is the dynamics, introduced by Grimaud (1992), associated to each regional minimum. This concept has been extended, by Vachier and Meyer (1995), by the definition of extinction values associated to each extremum of the image. This paper proposes four new extinction values -- two based on the topology of the component tree: (i) number of descendants and (ii) sub-tree height; and two geometric: (iii)

文 件 列 表

extinction-values
extinctions.cpp
Makefile
README.txt
gettime.cpp
lista.cpp
lista.h
maxtree.cpp
maxtree.h
mm.cpp
mm.h
images
main.cpp
VIP VIP
0.308634s