Algorithm for faster computation of non-zero graph based invariants

Vazeerudeen Abdul Hameed

doi:10.1016/j.neucom.2013.04.051

Algorithm for faster computation of non-zero graph based invariants

2014-08-01

0

PRE

AI

V

Vazeerudeen Abdul Hameed

S

Siti Mariyam Shamsuddin *

DOI：10.1016/j.neucom.2013.04.051

Original

Original request for help

Save

Abstract

En 中文

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 zero moment invariant functions. Hence, we propose an algorithm to determine and eliminate the zero moment invariant generating graphs and thereby generate non-zero moment invariant functions with reduced computational complexity. The correctness of the algorithm has been verified and discussed with suitable induction proofs and sample graphs. Asymptotic analysis has been presented to clearly illustrate the reduction in computational complexity achieved by the proposed algorithm. 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. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Computational complexity

Geometric moments

Image transforms

Orthogonal moments

Moment invariants

Algorithm for faster computation of non-zero graph based invariants

Abstract

Journal

Organization