A survey of orthogonal moments for image representation: Theory, implementation, and evaluation
Image representation is an important topic in computer vision and pattern recognition. It
plays a fundamental role in a range of applications toward understanding visual contents …
plays a fundamental role in a range of applications toward understanding visual contents …
Geometrically invariant image watermarking based on fast radial harmonic Fourier moments
W Chun-peng, W **ng-yuan, X Zhi-qiu - Signal Processing: Image …, 2016 - Elsevier
In order to reduce the time complexity and improve the reconstruction performance of
traditional method for Radial Harmonic Fourier Moments (RHFMs), we introduce a fast and …
traditional method for Radial Harmonic Fourier Moments (RHFMs), we introduce a fast and …
Orthogonal moments based on exponent functions: Exponent-Fourier moments
H Hu, Y Zhang, C Shao, Q Ju - Pattern Recognition, 2014 - Elsevier
In this paper, we propose a new set of orthogonal moments based on Exponent functions,
named Exponent-Fourier moments (EFMs), which are suitable for image analysis and …
named Exponent-Fourier moments (EFMs), which are suitable for image analysis and …
A robust zero-watermarkinging algorithm based on PHTs-DCT for medical images in the encrypted domain
D Yi, J Li, Y Fang, W Cui, X **ao, UA Bhatti… - Innovation in Medicine …, 2021 - Springer
In the process of network transmission, medical images are maliciously attacked to cause
the loss of diagnostic data or the leakage of patient privacy. To solve this problem, this paper …
the loss of diagnostic data or the leakage of patient privacy. To solve this problem, this paper …
Fast hypercomplex continuous orthogonal moments
Q Zhang, F Huang - Expert Systems with Applications, 2024 - Elsevier
Image moments have attracted extensive attention from researchers because of their good
global feature description ability and geometric invariance. In recent years, with the wide …
global feature description ability and geometric invariance. In recent years, with the wide …
A kernel-based method for fast and accurate computation of PHT in polar coordinates
A novel kernel-based method is proposed for fast, highly accurate and numerically stable
computations of polar harmonic transforms (PHT) in polar coordinates. Euler formula is used …
computations of polar harmonic transforms (PHT) in polar coordinates. Euler formula is used …
Fast computation of Jacobi-Fourier moments for invariant image recognition
Abstract The Jacobi-Fourier moments (JFMs) provide a wide class of orthogonal rotation
invariant moments (ORIMs) which are useful for many image processing, pattern recognition …
invariant moments (ORIMs) which are useful for many image processing, pattern recognition …
Orthogonal transforms for learning invariant representations in equivariant neural networks
The convolutional layers of the standard convolutional neural networks (CNNs) are
equivariant to translation. Recently, a new class of CNNs is introduced which is equivariant …
equivariant to translation. Recently, a new class of CNNs is introduced which is equivariant …
Face recognition using complex wavelet moments
The wavelet moments are very useful image descriptors which contain both global and local
characteristics of an image. Its usefulness is further characterized by rotation invariant …
characteristics of an image. Its usefulness is further characterized by rotation invariant …
Highly accurate and numerically stable higher order QPCET moments for color image representation
A novel method is proposed for highly accurate, fast and numerically stable computation of
the higher order Quaternion Polar Complex Exponential Transform (QPCET) moments for …
the higher order Quaternion Polar Complex Exponential Transform (QPCET) moments for …