Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor Ekhlas Khalaf Gbash | Suha Mohammed Saleh

Main Article Content

Baghdad Science Journal


There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task.
In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that it operates on a big number of key-points, the only drawback it has is that it is rather time consuming.
In the suggested approach, the system deploys SIFT to perform its basic tasks of matching and description is focused on minimizing the number of key-points which is performed via applying Fast Approximate Nearest Neighbor algorithm, which will reduce the redundancy of matching leading to speeding up the process.
The proposed application has been evaluated in terms of two criteria which are time and accuracy, and has accomplished a percentage of accuracy of up to 100%, in addition to speeding up the processes of matching and description.


Download data is not yet available.

Article Details

How to Cite
Journal BS. Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor. BSJ [Internet]. 3Sep.2017 [cited 7Aug.2020];14(3):0651. Available from:

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>