Fast and scalable computations of 2D image moments

Authors:
Chin-Hsiung Wu;Shi-Jinn Horng;Ching-Feng Wen;Yuh-Rau Wang
Affiliations:
Department of Information Technology and Communication, Shih Chien University, Kaohsiung Campus, 200, University Road, Neimen Shiang, Kaohsiung, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan;General Education Center, Kaohsiung Medical University, Kaohsiung, Taiwan, ROC;Department of Computer Science and Information Engineering, St. John's University, Taipei, Taiwan, ROC
Venue:
Image and Vision Computing
Year:
2008

Citing 15
Cited 0

Efficient parallel algorithms for the computation of two-dimensional image moments

Pattern Recognition
Hypercube algorithms: with applications to image processing and pattern recognition

Hypercube algorithms: with applications to image processing and pattern recognition
Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
The power of reconfiguration

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications

Information Sciences: an International Journal - special issue on parallel and distributed processing
Parallel Prefix Computation

Journal of the ACM (JACM)
Computing Moments by Prefix Sums

Journal of VLSI Signal Processing Systems
New bounds for parallel prefix circuits

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Efficient hardware architectures for computation of image moments

Real-Time Imaging
Run-length chain coding and scalable computation of a shape's moments using reconfigurable optical buses

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Efficient computation of local geometric moments

IEEE Transactions on Image Processing
High-order moment computation of gray-level images

IEEE Transactions on Image Processing
Fast and scalable selection algorithms with applications to median filtering

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Image moments are used in image analysis for object modelling and matching. The moment computation of a two-dimensional (2D) image involves a significant amount of multiplication and addition in a direct method. In this paper, we use the suffix sum functions to compute the gray-level image moments instead of using a direct method. This new method can reduce drastically the number of multiplications required. We first derive the mathematical relationships between moment computations and suffix sums. Based on the derived mathematical relationships, four new parallel algorithms for computing image moments are derived on various computational models. By integrating the advantages of both optical transmission and electronic computation, the 2D image moments can be computed in constant time on a 2D array with reconfigurable optical buses. The performance comparison shows that the proposed method is fast and efficient. In addition, three scalable and cost optimal algorithms are derived on the AROB, the hypercube computer and the EREW PRAM model.