Abstract
Krawtchouk polynomials [1] can be used to form the basis of a set of discrete orthogonal moments. In this paper, Krawtchouk moments are used to analytically reconstruct binary images. Their performance is compared to that of Zernike, Legendre (continuous) [2, 3, 4, 5] and Chebyshev (discrete) [6, 7, 8] moments.
| Original language | English |
|---|---|
| Pages | 908-912 |
| Number of pages | 5 |
| Publication status | Published - 2002 |
| Externally published | Yes |
| Event | IEEE International Joint Conference on Neural Networks 2002 - Honolulu, United States of America Duration: 12 May 2002 → 17 May 2002 https://ieeexplore.ieee.org/xpl/conhome/7877/proceeding (Proceedings) |
Conference
| Conference | IEEE International Joint Conference on Neural Networks 2002 |
|---|---|
| Abbreviated title | IJCNN 2002 |
| Country/Territory | United States of America |
| City | Honolulu |
| Period | 12/05/02 → 17/05/02 |
| Internet address |
|