New computational methods for full and subset Zernike moments.

DOI10.1016/J.INS.2003.08.006zbMath1076.68108OpenAlexW2067788074MaRDI QIDQ1429846

Chong-Yaw Wee, Fumiaki Takeda, Raveendran Paramesran

Publication date: 27 May 2004

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.08.006

zbMATH Keywords

Zernike momentsFast computation\(q\)-recurrenceCoefficientFactorial termsKintnerPrataRadial polynomialsSubset of Zernike moments

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Related Items (8)

A new class of Zernike moments for computer vision applications ⋮ Accurate calculation of Zernike moments ⋮ New computational methods for full and subset Zernike moments. ⋮ Computation strategies of orthogonal image moments: a comparative study ⋮ A systematic method for efficient computation of full and subsets Zernike moments ⋮ Efficient computation of radial moment functions using symmetrical property ⋮ A novel approach to the fast computation of zernike moments ⋮ Pattern classification by using improved wavelet compressed Zernike moments

Cites Work

• A comparative analysis of algorithms for fast computation of Zernike moments
• New computational methods for full and subset Zernike moments.
• On image analysis by the methods of moments
• Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode

This page was built for publication: New computational methods for full and subset Zernike moments.