An efficient algorithm for fast computation of pseudo-Zernike moments
Pseudo-Zernike moments have better feature representation capability, and are more robust to image noise than those of the conventional Zernike moments. However, due to the computation complexity of pseudo-Zernike polynomials, pseudo-Zernike moments are yet to be extensively used as feature descript...
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2545/ |