Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Scale-invariant feature transform
open-in-new
<p>The scale-invariant feature transform (SIFT) is a <a href="/facts/Computer_vision/Tl2Yyk66">computer vision</a> algorithm to detect, describe, and match local <i><a href="/facts/Feature_(computer_vision)/GdfWRp5U">features</a></i> in images, invented by <a href="/facts/David_G._Lowe/KNXDJhbv">David Lowe</a> in 1999. Applications include <a href="/facts/Outline_of_object_recognition/cdLpak1I">object recognition</a>, <a href="/facts/Robotic_mapping/W9jnGGKe">robotic mapping</a> and navigation, <a href="/facts/Image_stitching/zq16A2y1">image stitching</a>, <a href="/facts/3D_modeling/6V3Ry9AJ">3D modeling</a>, <a href="/facts/Gesture_recognition/jly3YdnY">gesture recognition</a>, <a href="/facts/Video_tracking/nVh8FB3E">video tracking</a>, individual identification of wildlife and <a href="/facts/Match_moving/BXCmYkd3">match moving</a>. </p><p>SIFT keypoints of objects are first extracted from a set of reference images and stored in a database. An object is recognized in a new image by individually comparing each feature from the new image to this database and finding candidate matching features based on <a href="/facts/Euclidean_distance/9qDoQKQe">Euclidean distance</a> of their feature vectors. From the full set of matches, subsets of keypoints that agree on the object and its location, scale, and orientation in the new image are identified to filter out good matches. The determination of consistent clusters is performed rapidly by using an efficient <a href="/facts/Hash_table/Ht4ptDPF">hash table</a> implementation of the generalised <a href="/facts/Hough_transform/cYmx4Duw">Hough transform</a>. Each cluster of 3 or more features that agree on an object and its <a href="/facts/Pose_(computer_vision)/APuxJEKM">pose</a> is then subject to further detailed model verification and subsequently outliers are discarded. Finally the probability that a particular set of features indicates the presence of an object is computed, given the accuracy of fit and number of probable false matches. Object matches that pass all these tests can be identified as correct with high confidence. </p><p>Although the SIFT algorithm was previously protected by a patent, its patent expired in 2020. </p>