2009
DOI: 10.1016/j.ipl.2009.04.021
|View full text |Cite
|
Sign up to set email alerts
|

Geometric pattern matching for point sets in the plane under similarity transformations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(15 citation statements)
references
References 18 publications
0
15
0
Order By: Relevance
“…Based on our theoretical work [2], on GPU capabilities, and on some caveats we present practical real time algorithms and implementations of shape resemblance. The algorithms work for any three parameter transformation.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Based on our theoretical work [2], on GPU capabilities, and on some caveats we present practical real time algorithms and implementations of shape resemblance. The algorithms work for any three parameter transformation.…”
Section: Discussionmentioning
confidence: 99%
“…We reduce the LCP problem to depth in arrangement as follows: All the transformations that bring a point p ∈ P up to L ∞ distance δ from q ∈ Q correspond to a region in transformation space [2]. This region is an intersection of four constraints defined by the side of the square of size 2δ around q (see Fig.…”
Section: The Largest Common Point Set Problem (Lcp) and Its Reductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Chew et al (1997) have proposed the best known algorithm for rigid transformations for point pattern matching which requires O (m 3 n 2 log mn) time, where 'm' denotes the number of points in the model matched with the number of points 'n' in the scene. Aiger and Kedem (2007) have proposed a Geometric pattern matching for point sets in a plane. The runtime of this algorithm is O (n 2 log 4 mn), where m and n are the number of points in P and Q, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…However, it can not satisfy the requirements of high speed and high precision packaging due to the inherent contradictions of the algorithm between the speed and accuracy [26]. The feature-based template matching method utilizes certain image features, thus reducing the amount of calculation, so it shows great potential in the applications of microelectronic bonding [27]. However, under extreme working conditions of packaging, an effective image preprocessing method to obtain robustness image features quickly and accurately and the micro vision alignment approach are still not presented systematically, which is the motivation of this study.…”
Section: Introductionmentioning
confidence: 99%