| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11002880 | Pattern Recognition Letters | 2018 | 10 Pages |
Abstract
In this work, we propose a new algorithm for the computation of Tchebichef moments by means of a recurrence relation with respect to order and the Gram-Schmidt process, which reduces the numerical instability and the carry error caused by the computation of high-order moments. Results and comparison with other methods are presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
César Camacho-Bello, José S. Rivera-Lopez,