2019
DOI: 10.1109/taes.2018.2849921
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Terrain Matching With 3-D Zernike Moments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 28 publications
0
9
0
1
Order By: Relevance
“…These 3DZMs were later described as shape descriptors for shape retrieval ( Novotni and Klein, 2004 ). Canterakis’ algorithm has been applied to terrain matching ( Wang et al, 2018a , b ) and protein–protein interface prediction ( Daberdaku and Ferrari, 2018 ). However, Canterakis’ algorithm could only be used to compute ZM up to the order of 25, due to computational demand and instability.…”
Section: Methods and Resultsmentioning
confidence: 99%
“…These 3DZMs were later described as shape descriptors for shape retrieval ( Novotni and Klein, 2004 ). Canterakis’ algorithm has been applied to terrain matching ( Wang et al, 2018a , b ) and protein–protein interface prediction ( Daberdaku and Ferrari, 2018 ). However, Canterakis’ algorithm could only be used to compute ZM up to the order of 25, due to computational demand and instability.…”
Section: Methods and Resultsmentioning
confidence: 99%
“…These 3DZMs were later described as shape descriptors for shape retrieval (Novotni & Klein, 2004). Canterakis' algorithm has been applied to terrain matching (Wang et al, 2018(Wang et al, , 2019 and protein-protein interface prediction (Daberdaku & Ferrari, 2018). However, Canterakis' algorithm could only be used to compute ZM up to the order of 25, due to computational demand and instability.…”
Section: D Zernike Transformationmentioning
confidence: 99%
“…Terrain contour-matching [8] tries to find a position that best matches the DTM according to some specific rules, and is regarded as a typical batch method. Batch-matching algorithms based on some invariant features can be performed efficiently with stability and reliability, such as Hu moments [9] and Zernike moments [10]. The uncertainty of the position estimate is unavailable, and the performance cannot be judged accordingly.…”
Section: Introductionmentioning
confidence: 99%