Fast Exact Nearest Neighbour Matching in High Dimensions Using 𝑑-D Sort

Figure 3

The time required to append 100 SIFT descriptors to a 𝑑-D sort structure plot against the number of descriptors already in the structure. The time taken to construct the database anew is included for reference.