Fast computation of Jacobi-Fourier moments for invariant image recognition
From MaRDI portal
Publication:1677853
DOI10.1016/J.PATCOG.2014.11.012zbMath1374.68695OpenAlexW1981222582MaRDI QIDQ1677853
Publication date: 13 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.11.012
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)
Related Items (4)
Fast quaternion log-polar radial harmonic Fourier moments for color image zero-watermarking ⋮ 2D and 3D image localization, compression and reconstruction using new hybrid moments ⋮ Fast algorithm of 3D discrete image orthogonal moments computation based on 3D cuboid ⋮ Fast computation of 3D discrete invariant moments based on 3D cuboid for 3D image classification
Cites Work
- Unnamed Item
- Generic orthogonal moments: Jacobi-Fourier moments for invariant image description
- Errata and comments on: ``Generic orthogonal moments: Jacobi-Fourier moments for invariant image description
- Circularly orthogonal moments for geometrically robust image watermarking
- Error analysis in the computation of orthogonal rotation invariant moments
- A novel approach to the fast computation of zernike moments
- On image analysis by the methods of moments
- Fast Generic Polar Harmonic Transforms
This page was built for publication: Fast computation of Jacobi-Fourier moments for invariant image recognition
