New computational methods for full and subset Zernike moments.
From MaRDI portal
Publication:1429846
DOI10.1016/j.ins.2003.08.006zbMath1076.68108MaRDI 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
Zernike moments; Fast computation; \(q\)-recurrence; Coefficient; Factorial terms; Kintner; Prata; Radial polynomials; Subset of Zernike moments
68U10: Computing methodologies for image processing
68T10: Pattern recognition, speech recognition
68T45: Machine vision and scene understanding
Related Items
A new class of Zernike moments for computer vision applications, Computation strategies of orthogonal image moments: a comparative study, A systematic method for efficient computation of full and subsets Zernike moments, Pattern classification by using improved wavelet compressed Zernike moments, New computational methods for full and subset Zernike moments., Accurate calculation of Zernike moments, Efficient computation of radial moment functions using symmetrical property, A novel approach to the fast computation of zernike moments
Cites Work