DocumentCode :
3517370
Title :
A novel fast method for computation of zernike moments based on FPGA
Author :
Tian, Hongli ; Yan, Huiqiang ; Zhao, Hongdong
Author_Institution :
Hebei Univ. of Technol., Tianjin, China
Volume :
4
fYear :
2009
fDate :
8-9 Aug. 2009
Firstpage :
385
Lastpage :
388
Abstract :
This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction fo the cumulative number of the Zernike moments with many PEs (process elements) which are achieved by VHDL(VHSIC hardware description language). The architecture described above was simulated and implemented targeting Xilinx GA(gate array). In the experiments, results show the accuracy of the form for computing discrete Zernike moments and confirm that the proposed method for the fast computation of Zernike moments is much more efficient than existing fast methods in most cases.
Keywords :
Zernike polynomials; computational complexity; field programmable gate arrays; hardware description languages; image recognition; FPGA; VHDL; Zernike 1D radial polynomial; Zernike moment computation; computational complexity; digital imagery recognition system design; hardware description language; Communication system control; Computational complexity; Computer architecture; Digital images; Field programmable gate arrays; Hardware design languages; Image recognition; Image reconstruction; Polynomials; Technology management; 1-D radial polynomials; PE; VHDL; Zernike moments;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on
Conference_Location :
Sanya
Print_ISBN :
978-1-4244-4247-8
Type :
conf
DOI :
10.1109/CCCM.2009.5270418
Filename :
5270418
Link To Document :
بازگشت