Abdul Hameed, Vazeerudeen and Shamsuddin, Siti Mariyam (2012) Faster computation of non-zero invariants from graph based method. In: Communications in Computer and Information Science. Springer-Verlag, Berlin, pp. 272-279. ISBN 978-364231836-8
Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F978-3-...
Abstract
This paper presents a study of geometric moment invariants generated from graph based algorithms. One of the main problems addressed was that the algorithms produced too many graphs that resulted in zero moment invariants. Hence, we propose an algorithm to determine zero moment invariant generating graphs. Induction proof of the steps involved in the algorithm has also been presented with suitable example graphs. It has been found and illustrated with examples that the computational time for identifying non-zero invariants could be largely reduced with the help of our proposed algorithm.
Item Type: | Book Section |
---|---|
Additional Information: | Indexed by Scopus |
Uncontrolled Keywords: | computational complexity, geometric moments, image transforms, moment invariants, orthogonal moments |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Computer Science and Information System |
ID Code: | 35776 |
Deposited By: | INVALID USER |
Deposited On: | 11 Nov 2013 09:52 |
Last Modified: | 13 Jun 2017 03:42 |
Repository Staff Only: item control page