2015
DOI: 10.1016/j.patcog.2014.11.004
|View full text |Cite
|
Sign up to set email alerts
|

SPiraL Aggregation Map (SPLAM): A new descriptor for robust template matching with fast algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…The correlation function is, in fact, the coherence function normalized within the range of [-1, 1]. When the time lag τ is 0, the coherence function represents the conventional cross−coherence coefficient [43]. Since the values of the correlation function are dependent on the magnitude of the time series signals, it is difficult to compare the degree of correlation between different sets of signals.…”
Section: Template Matching Algorithm For Distorted Harmonicmentioning
confidence: 99%
“…The correlation function is, in fact, the coherence function normalized within the range of [-1, 1]. When the time lag τ is 0, the coherence function represents the conventional cross−coherence coefficient [43]. Since the values of the correlation function are dependent on the magnitude of the time series signals, it is difficult to compare the degree of correlation between different sets of signals.…”
Section: Template Matching Algorithm For Distorted Harmonicmentioning
confidence: 99%
“…Qi et al [23] proposed a multiscale co-occurrence of the LBP feature for global rotation invariance. Meanwhile, Shih and Yu [24] introduced a spiral projection model that provides the structural and statistical information of an image, which is a scaling invariant feature. Moreover, Ramesh et al [1] conducted a log-polar transform to achieve position or rotation invariant feature extraction.…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, some researchers examined the relationship of puzzle pieces with specific shapes. The robust template-matching algorithm [ 5 ] is suitable for solving the aforementioned problem.…”
Section: Introductionmentioning
confidence: 99%