2018
DOI: 10.1016/j.amc.2018.07.029
|View full text |Cite
|
Sign up to set email alerts
|

Efficient computations for generalized Zernike moments and image recovery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…3 was originally given in terms of Jacobi polynomials as described in ( Szegõ, 1939 ), but different calculation methods of 3D Zernike radial polynomial have been proposed ( Deng and Gwo, 2020 ). In our work, the R nℓ is computed recursively, similar to the Kintner’s P -method in the case of 2D Zernike polynomials ( Kintner, 1976 ; Deng and Gwo, 2018b ), and is presented in Eq. 10.…”
Section: Methods and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…3 was originally given in terms of Jacobi polynomials as described in ( Szegõ, 1939 ), but different calculation methods of 3D Zernike radial polynomial have been proposed ( Deng and Gwo, 2020 ). In our work, the R nℓ is computed recursively, similar to the Kintner’s P -method in the case of 2D Zernike polynomials ( Kintner, 1976 ; Deng and Gwo, 2018b ), and is presented in Eq. 10.…”
Section: Methods and Resultsmentioning
confidence: 99%
“…When M is large enough, the function f M can be used to approximate the original image f ( Deng and Gwo, 2018b ). For a binary shape with the background represented by 0, the error rate ℰ r between the original image f and the reconstructed f M can be calculated by…”
Section: Methods and Resultsmentioning
confidence: 99%
“…This 3D recursive formula can be regarded as similar to the Kintner's p-method used in the case of 2D Zernike polynomials [22,30]. For the completeness, we provide a proof.…”
Section: D Zernike and 3d Zernike Momentsmentioning
confidence: 95%
“…For a non-negative integer 𝑛 (called order) and an integer 𝑚 (called repetition) for which |𝑚| ≤ 𝑛 and 𝑛 ≡ 𝑚 (mod 2), the 2D Zernike polynomials 𝑉 𝑛𝑚 (𝑧) is the product of 2D Zernike radial polynomial 𝑅 𝑛𝑚 2𝐷 (𝑟) defined over I and the complex exponential function e 𝑖𝑚𝜃 = cos 𝑚𝜃 + 𝑖 sin 𝑚𝜃 defined over the unit circle 𝑆 1 , where 𝑧 = 𝑟𝑒 𝑖𝜃 ∈ 𝐷 stands for a complex number, 𝑟 is its distance to the origin (0, 0) and 𝜃 is the angle from the x-axis. The computations of 2D Zernike polynomials, Zernike moments and their variants were comprehensively studied in [17,[27][28][29][30].…”
Section: D Zernike and 3d Zernike Momentsmentioning
confidence: 99%
“…In addition, it optimizes the radial polynomial of Zernike moments to reduce computation. Deng and Gwo [27] proposed a generalized Zernike moments method to calculate high-order generalized Zernike moment; the corresponding improvement is made to get the solution that the algorithm was slow in determining the edge point.…”
Section: Introductionmentioning
confidence: 99%