Faster computation of non-zero invariants from graph based method

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...

Full description

Bibliographic Details
Main Authors: Abdul Hameed, Vazeerudeen, Shamsuddin, Siti Mariyam
Format: Book Section
Published: Springer-Verlag 2012
Subjects:
_version_ 1796857453587988480
author Abdul Hameed, Vazeerudeen
Shamsuddin, Siti Mariyam
author_facet Abdul Hameed, Vazeerudeen
Shamsuddin, Siti Mariyam
author_sort Abdul Hameed, Vazeerudeen
collection ePrints
description 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.
first_indexed 2024-03-05T18:58:01Z
format Book Section
id utm.eprints-35776
institution Universiti Teknologi Malaysia - ePrints
last_indexed 2024-03-05T18:58:01Z
publishDate 2012
publisher Springer-Verlag
record_format dspace
spelling utm.eprints-357762017-06-13T03:42:06Z http://eprints.utm.my/35776/ Faster computation of non-zero invariants from graph based method Abdul Hameed, Vazeerudeen Shamsuddin, Siti Mariyam QA75 Electronic computers. Computer science 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. Springer-Verlag 2012 Book Section PeerReviewed 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 https://link.springer.com/chapter/10.1007%2F978-3-642-31837-5_40 DOI:10.1007/978-3-642-31837-5_40
spellingShingle QA75 Electronic computers. Computer science
Abdul Hameed, Vazeerudeen
Shamsuddin, Siti Mariyam
Faster computation of non-zero invariants from graph based method
title Faster computation of non-zero invariants from graph based method
title_full Faster computation of non-zero invariants from graph based method
title_fullStr Faster computation of non-zero invariants from graph based method
title_full_unstemmed Faster computation of non-zero invariants from graph based method
title_short Faster computation of non-zero invariants from graph based method
title_sort faster computation of non zero invariants from graph based method
topic QA75 Electronic computers. Computer science
work_keys_str_mv AT abdulhameedvazeerudeen fastercomputationofnonzeroinvariantsfromgraphbasedmethod
AT shamsuddinsitimariyam fastercomputationofnonzeroinvariantsfromgraphbasedmethod