Fast computation of moments on compressed grey images using block representation

Authors:
Kuo-Liang Chung;Wen-Ming Yan;Zhi-Hor Liao
Affiliations:
Department Computer Science and Information Engineering, National Taiwan University of Science and Technology, No. 43, Section 4, Keelung Road, Taipei, Taiwan 10672, R. O. C.;Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Section 4, Roosevelt Road, Taipei, Taiwan 100, R. O. C.;Department Computer Science and Information Engineering, National Taiwan University of Science and Technology, No. 43, Section 4, Keelung Road, Taipei, Taiwan 10672, R. O. C.
Venue:
Real-Time Imaging
Year:
2002

Citing 9
Cited 2

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
Introduction to algorithms

Introduction to algorithms
Computer graphics: principles and practice (2nd ed.)

Computer graphics: principles and practice (2nd ed.)
S+-trees: an efficient structure for the representation of large pictures

CVGIP: Image Understanding
JPEG Still Image Data Compression Standard

JPEG Still Image Data Compression Standard
Image Processing, Analysis, and Machine Vision

Image Processing, Analysis, and Machine Vision
Real-time computation of two-dimensional moments on binary images using image block representation

IEEE Transactions on Image Processing
A moment-based approach for deskewing rotationally symmetric shapes

IEEE Transactions on Image Processing

An efficient algorithm for computing moments on a block representation of a grey-scale image

Pattern Recognition
A fast algorithm for computing moments of gray images based on NAM and extended shading approach

Frontiers of Computer Science in China

Quantified Score

Hi-index	0.00

Visualization

Abstract

In image processing, moments are useful tools for analyzing shapes. Suppose that the input grey image with size N × N has been compressed into the compressed image using the block representation, where the number of blocks used is K. commonly K N2 due to the compression effect. This paper presents an efficient O(N √K)-time algorithm for computing moments on the compressed image directly. Experimental results reveal a significant computational advantage of the proposed algorithm, while preserving a high accuracy of moments and a good compression ratio. The results of this paper extend the previous results in [7] from the binary image domain to the grey image domain.