Research Article
SIFT Saliency Analysis for Matching Repetitive Structures
Algorithm 2
The experimental procedure of the quality computation.
Input. All the matching pairs of each scene for the LOOCV test. | Set a strict threshold for each method as stated in Section 3.1 to find the robust seeds of each matching pair; | Determine the minimum number of the seeds among all the methods; | If there is a method finding more seeds than the minimum number, go to; else, go to ; | Sort the seeds based on their similarity values which are computed according to the Equation (5) and (7) | in an ascending order; | Select the determined number of the seeds from the top-ranked sequence determined in step ; | Compute the , and of the seeds for each method according to (11) (13); | If the quality computation in step for all the matching pairs is finished, go to ; else go to ; | Compute the average quality of the seeds for each scene. | Output. The average quality results for the seeds of each scene. |
|