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

Approximate input sensitive algorithms for point pattern matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(22 citation statements)
references
References 27 publications
0
19
0
Order By: Relevance
“…In this experiment, N is 50, jitter ratio is 8%, (α,β,δ) is (10, 10, π/6). The setting of K (6,12,25,50) While outlier ratio increases, noise points increase and true matching point pairs decrease. Take K equals 12 as an example, while outlier ratio increases from 10% to 50%, ACPPR slowly decreases from 98% to 87%.…”
Section: Methodsmentioning
confidence: 99%
“…In this experiment, N is 50, jitter ratio is 8%, (α,β,δ) is (10, 10, π/6). The setting of K (6,12,25,50) While outlier ratio increases, noise points increase and true matching point pairs decrease. Take K equals 12 as an example, while outlier ratio increases from 10% to 50%, ACPPR slowly decreases from 98% to 87%.…”
Section: Methodsmentioning
confidence: 99%
“…The runtime of this algorithm is found to be O (n(log m) 3/2 ) where 'm' is the number of points in the model matched with the number of points 'n' in the scene. Aiger and Kedem (2010) have proposed an Approximate Input Sensitive (AIS) algorithm for point pattern matching. The runtime of this algorithm is O (n log n + km log n), where 'm' denotes the number of points in the model matched with the number of points 'n' in the scene.…”
Section: Related Workmentioning
confidence: 99%
“…Table 7 Average time taken to match the points in the incoming images with the points in the stored image. Aiger and Kedem (2010) have proposed an Approximate Input Sensitive (AIS) algorithm for point pattern matching. According to this approach, given point sets P and Q in the plane, the problem of point pattern matching is to determine whether P is similar to some portion of Q, where P may undergo transformations from a group G of allowed transformations.…”
Section: Comparison Of Acobsppm Algorithm Vs Approximate Input Sensitmentioning
confidence: 99%
See 1 more Smart Citation
“…Many recent papers focus on rigid transformations and related works can be found in [Van Wamelen et al 2004]. [Aiger and Kedem 2010] proposed a new algorithm applicable to any group of transformations which, however, requires the points forming the chosen basis to be always present in the scene. [Datta et al 2013] recently proposed a robust method using a local geometric invariant, but they mainly deal with affine transformations.…”
Section: Point Pattern Matchingmentioning
confidence: 99%