Fast Algorithm for 2-D Geometric Moment in Sliding-window Applications
HU Xiu-lin · 2008
The traditional algorithms for geometric moment focus on the single rectangle windows.It has very low efficiency in the sliding-window applications.This issue prompts a new fast algorithm for 2-D geometric moment.It could efficiently reuse the overlapping pixels between conjoint sliding-windows,and achieves much higher computation efficiency.The average number of the multiplications and additions is O(1),regardless of the sliding-windows size.Compared to the operation complexity of the traditional algorithm,known as O(N×L) in 2-D case,the new algorithm derived by this paper can improve its speed by the factor of nearly N×L.A number of computer experiments are performed to validate this conclusion.This operation speed of this new algorithm can satisfy the requirements of most real time applications.