Algorithm for faster computation of non-zero graph based invariants
This paper presents a detailed study of the graph based algorithm used to generate geometric moment invariant functions. The graph based algorithm has been found to suffer from high computational complexity. One major cause of this problem is that the algorithm generates too many graphs that produce...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 出版: |
Elsevier B.V.
2014
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/51745/ http://dx.doi.org/10.1016/j.neucom.2013.04.051 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|