Stable computation of higher order Charlier moments for signal and image reconstruction
DOI10.1016/j.ins.2020.02.019OpenAlexW3006002926MaRDI QIDQ2663463
Mhamed Sayyouri, A. Daoui, Hassan Qjidaa, M. Yamni, O. El ogri, Hicham Karmouni
Publication date: 19 April 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.02.019
numerical stabilitysignal reconstruction2D/3D image reconstructiondiscrete orthogonal Charlier momentsdiscrete orthogonal Charlier polynomials
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (10)
Cites Work
- Unnamed Item
- Fast computation of Krawtchouk moments
- On discrete orthogonal polynomials of several variables
- Generalized dual Hahn moment invariants
- Image analysis by discrete orthogonal Racah moments
- Retrieving articulated 3-D models using medial surfaces
- Fast computation of separable two-dimensional discrete invariant moments for image classification
- Translation and scale invariants of Krawtchouk moments
- Fast recursive computation of Krawtchouk polynomials
- Efficient computations for generalized Zernike moments and image recovery
- Image analysis by fractional-order orthogonal moments
- Fast and stable algorithms for high-order pseudo Zernike moments and image reconstruction
- Edge detection based on Krawtchouk polynomials
- Hypergeometric Orthogonal Polynomials and Their q-Analogues
- Fast Computation of Tchebichef Moments for Binary and Grayscale Images
This page was built for publication: Stable computation of higher order Charlier moments for signal and image reconstruction