Keypoint Matching Technique and Its Applications
Keypoint Matching Technique and Its Applications
Keypoint Matching Technique and Its Applications
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Page Scoring<br />
• (Def) successful match<br />
– salient points clustering: k-means<br />
– clusters (groups) G i <strong>and</strong> G j correspond<br />
• the most number of matched pairs inside<br />
• those matched pairs are called successful matches a successful<br />
match<br />
• SOCRE 1: Similarity Degree (S)<br />
S<br />
=<br />
the # of successful matches<br />
the # of salient point pairs<br />
∈[0,1]<br />
G i<br />
G j<br />
• SOCRE 2: Successful Match Density (D)<br />
the # of successful matches<br />
D =<br />
∈[0,1]<br />
the # of salient points in the official page<br />
– the significance degree of the matched<br />
portions to the official page<br />
56
Change language