无监督边缘图评分:一种统计复杂性方法
Unsupervised edge map scoring: a statistical complexity approach
摘要:
我们提出了一个新的统计复杂性度量(SCM),以限定边缘地图没有地面真理(GT)的知识。该度量是两个指数的乘积,一个是通过将边缘图投影到边缘图案族中而获得的\emph{Equilibrium}指数$\mathcal{E}$,另一个是定义为Kolmogorov Smirnov(KS)统计量的函数的\emph{Entropy}指数$\mathcal{H}$。这种新的措施可以用于性能表征,其中包括:(i)~的算法的具体评估(技术内过程),以确定其最佳参数,和(ii)~的比较不同的算法(技术间过程),以分类它们根据其质量。在南佛罗里达州和伯克利数据库的图像的结果表明,我们的方法显着改善了普拉特的品质因数(PFoM),这是客观的基于参考的边缘图评价标准,因为它考虑到更多的功能,在其评估。
英文摘要:
We propose a new Statistical Complexity Measure (SCM) to qualify edge maps without Ground Truth (GT) knowledge. The measure is the product of two indices, an \emph{Equilibrium} index $\mathcal{E}$ obtained by projecting the edge map into a family of edge patterns, and an \emph{Entropy} index $\mathcal{H}$, defined as a function of the Kolmogorov Smirnov (KS) statistic. This new measure can be used for performance characterization which includes: (i)~the specific evaluation of an algorithm (intra-technique process) in order to identify its best parameters, and (ii)~the comparison of different algorithms (inter-technique process) in order to classify them according to their quality. Results made over images of the South Florida and Berkeley databases show that our approach significantly improves over Pratt's Figure of Merit (PFoM) which is the objective reference-based edge map evaluation standard, as it takes into account more features in its evaluation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。