An efficient algorithm for computing moments on a block representation of a grey-scale image
✍ Scribed by Kuo-Liang Chung; Ping-Chin Chen
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 833 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
✦ Synopsis
Computing lower order moments is important in image processing. Suppose the input grey image with size N × N has been compressed into the block representation where the number of blocks is K, commonly K < N 2 due to the compression effect. This correspondence presents an efficient algorithm for computing lower order moments on the block representation directly. Our proposed algorithm takes O(K) time which is proportional to the number of blocks. Experimental results reveal the computational advantage of our proposed algorithm. In addition, the results of this paper can be viewed as a generalization of the previous result by Spiliotis and Mertzios for computing lower order moments from the binary image domain to the grey image domain.