Fast algorithm of 3D discrete image orthogonal moments computation based on 3D cuboid
From MaRDI portal
Publication:2417944
DOI10.1007/s10851-018-0860-7zbMath1443.68202OpenAlexW2901398837WikidataQ128941766 ScholiaQ128941766MaRDI QIDQ2417944
Hassan Qjidaa, Tarik Jahid, Abdeslam Hmimid, Mhamed Sayyouri, Hicham Karmouni
Publication date: 31 May 2019
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-018-0860-7
Related Items
Image watermarking using separable fractional moments of Charlier-Meixner ⋮ A new fast algorithm to compute moment 3D invariants of generalized Laguerre modified by fractional-order for pattern recognition ⋮ 2D and 3D image localization, compression and reconstruction using new hybrid moments ⋮ Fast computation of 3D discrete invariant moments based on 3D cuboid for 3D image classification
Cites Work
- Fast computation of Krawtchouk moments
- Image representation using separable two-dimensional continuous and discrete orthogonal moments
- Fast computation of separable two-dimensional discrete invariant moments for image classification
- Fast computation of Jacobi-Fourier moments for invariant image recognition
- Geometric moments and their invariants
- Efficient and accurate computation of geometric moments on gray-scale images
- A novel approach to the fast computation of zernike moments
- Bivariate Hahn moments for image reconstruction
- Fast Computation of Sliding Discrete Tchebichef Moments and Its Application in Duplicated Regions Detection
- Fractional Krawtchouk Transform With an Application to Image Watermarking
- Blurred Image Recognition by Legendre Moment Invariants
- Fast Computation of Tchebichef Moments for Binary and Grayscale Images
- Unnamed Item
- Unnamed Item
- Unnamed Item