Efficient algorithm for fast computation of Zernike moments

被引：27

作者：

Belkasim, SO

Ahmadi, M

Shridhar, M

机构：

[1] Department of Electrical Engineering, University of Windsor, Windsor, Ont.

来源：

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 1996年 / 333B卷 / 04期

关键词：

D O I：

10.1016/0016-0032(96)00017-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Zernike moments have been used as shape descriptors in several object recognition applications. The classical method of computing Zernike moments is dependent on the regular moments which makes them computationally expensive and inefficient. In this paper, we present an efficient and fast algorithm for the direct computation of Zernike moments. This algorithm is based on using some properties of Zernike polynomials. Copyright (C) 1996 Published by Elsevier Science Ltd

引用

页码：577 / 581

页数：5

共 20 条

[1] RECOGNITIVE ASPECTS OF MOMENT INVARIANTS [J].