A New Computation of Shape Moments via Quadtree Decomposition
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 advantages 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.
KeywordsBinary Image Sequential Algorithm Moment Computation Digit Position Double Summation
Unable to display preview. Download preview PDF.
- 6.Hu, M.-K.: Visual Pattern Recognition by Moment Invariants. IRE Trans. Inform. Theory IT-8 (1962) 179–187Google Scholar
- 8.Li, B.-C., Shen, J.: Fast Computation of Moment Invariants. Pattern Recognition 24 (1991) 8071–813Google Scholar
- 10.Pavel, S., Akl, S. G.: On the Power of Arrays with Reconfigurable Optical Bus. Proc. Int. Conf. Parallel and Distributed Processing Techniques and Applications (1996) 1443–1454Google Scholar
- 13.Wu, C.-H., Horng, S.-J., Tsai, H.-R.: Template Matching on Arrays with Reconfigurable Optical Buses. Proc. Int. Symp. Operations Research and its Applications (1998), 127–141Google Scholar