A New Computation of Shape Moments via Quadtree Decomposition

Authors:
Chin-Hsiung Wu;Shi-Jinn Horng;Pei-Zong Lee;Shung-Shing Lee;Shih-Ying Lin
Affiliations:
-;-;-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 6
Cited 0

Optimal quadtree construction algorithms

Computer Vision, Graphics, and Image Processing
Fast algorithm for the computation of moment invariants

Pattern Recognition
Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
The power of reconfiguration

Journal of Parallel and Distributed Computing
Fast computation of moment invariants

Pattern Recognition
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of this paper is in designing an optimal and/or optimal speed-up algorithm for computing shape moments. We introduce a new technique for computing shape moments. The new technique is based on the quadtree representation of images. We decompose the image into squares, since the moment computation of squares is easier than that of the whole image. The proposed sequential algorithm reduces the computational complexity significantly. By integrating the adv an tages of both optical transmission and electronic computation, the proposed parallel algorithm can be run in O(1) time. In the sense of the product of time and the number of processors used, the proposed parallel algorithm is time and cost optimal and achieves optimal speed-up.