Fast computation of accurate Zernike moments

Faculty Computer Science Year: 2008
Type of Publication: ZU Hosted Pages: 107-97
Authors:
Khalied Mohamed Hosny
Journal: Journal of Real-Time Image Processing Springer Volume: 3
Keywords : Fast computation , accurate Zernike moments    
Abstract:
Zernike polynomials are continuous orthogonal polynomials defined in polar coordinates over a unit disk. Zernike moment’s computation using conventional methods produced two types of errors namely approximation and geometrical. Approximation
    
     
 
       

Author Related Publications

  • Khalied Mohamed Hosny, "SEMANTIC REPRESENTATION OF MUSIC DATABASE USING NEW ONTOLOGY-BASED SYSTEM", Journal of Theoretical and Applied Information Technology, 2020 More
  • Khalied Mohamed Hosny, "Building a New Semantic Social Network Using Semantic Web-Based Techniques", ِASPG, 2021 More
  • Khalied Mohamed Hosny, "New Graphical Ultimate Processor for Mapping Relational Database to Resource Description Framework", IEEE, 2022 More
  • Khalied Mohamed Hosny, "Accurate Computation of QPCET for Color Images in Different Coordinate Systems", SPIE, 2017 More
  • Khalied Mohamed Hosny, "Invariant image watermarking using accurate Polar Harmonic Transforms", Elsevier, 2017 More

Department Related Publications

  • Walid Ibrahim Ibrahim Khedr, "Enhanced inter-ASN handover authentication scheme for IEEE 802.16m network", Institution of Engineering and Technology United Kingdom, 2015 More
  • Walid Ibrahim Ibrahim Khedr, "Improved Lightweight Authentication Scheme For Ieee 802.11P Vehicle-to-Infrastructure Communications", Old City Publishing, Inc., USA, 2015 More
  • Walid Ibrahim Ibrahim Khedr, "Cryptographic Accumulator-Based Scheme for Critical Data Integrity Verification in Cloud Storage", IEEE, 2019 More
  • Ehab Roshdy Mohamed, "Cryptographic Accumulator-Based Scheme for Critical Data Integrity Verification in Cloud Storage", IEEE, 2019 More
Tweet