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: | , , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier B.V.
2014
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/51745/ http://dx.doi.org/10.1016/j.neucom.2013.04.051 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|