Fast Computation of Chebyshev Moments

Author

Kotoulas, L. ; Andreadis, I.

Author_Institution

Dept. of Electr & Comput. Eng., Democritus Univ. of Thrace, Xanthi

Volume

16

Issue

7

fYear

2006

fDate

7/1/2006 12:00:00 AM

Firstpage

884

Lastpage

888

Abstract

Chebyshev moments were recently proposed to address problems of moments of continuous orthogonal basis. They are moments of a discrete basis and are orthogonal in the domain of the image coordinate space, a feature which presents a number of advantages over moments of continuous orthogonal basis. No effort has been devoted yet to the efficiency of their calculation. In this paper, we present a hardware architecture which enables real-time processing of binary and grayscale images of up to 4 Mpixels. This architecture is realized in a field-programmable gate array of typical clock frequency of 100 MHz

Keywords

Chebyshev approximation; field programmable gate arrays; image processing; 100 MHz; Chebyshev moments; binary image; continuous orthogonal basis; discrete basis; fast computation; field-programmable gate array; grayscale image; image coordinate space; Chebyshev approximation; Clocks; Digital images; Field programmable gate arrays; Filters; Frequency; Gray-scale; Hardware; Image analysis; Polynomials; Chebyshev moments; field-programmable gate arrays (FPGAs); real-time image analysis;

fLanguage

English

Journal_Title

Circuits and Systems for Video Technology, IEEE Transactions on

Publisher

ieee

ISSN

1051-8215

Type

jour

DOI

10.1109/TCSVT.2006.877403

Filename

1661664