Institute of Information Theory and Automation

Publication details

Numerical problems with the Pascal triangle in moment computation

Journal Article

Kautsky J., Flusser Jan


serial: Journal of Computational and Applied Mathematics vol.306, 1 (2016), p. 53-68

project(s): GA15-16928S, GA ČR

keywords: moment computation, Pascal triangle, appropriate polynomial basis, numerical problems

preview: Download

abstract (eng):

Moments are important characteristics of digital signals and images and are commonly used for their description and classification. When calculating the moments and their derived functions numerically, we face, among other numerical problems studied in the literature, certain instabilities which are connected with the properties of Pascal triangle. The Pascal triangle appears in moment computation in various forms whenever we have to deal with binomial powers. In this paper, we investigate the reasons for these instabilities in three particular cases—central moments, complex moments, and moment blur invariants. While in the first two cases this phenomenon is tolerable, in the third one it causes serious numerical problems. We analyze these problems and show that they can be partially overcome by choosing an appropriate polynomial basis.

RIV: JD

Responsible for information: admin
Last modification: 21.12.2012
Institute of Information Theory and Automation