Revision history[back]
click to hide/show revision 1
Revision n. 1

Mar 02 '11 at 08:55

Cerin's gravatar image

Cerin
462314046

Searching an Image Database Using SIFT

Is the SIFT algorithm scalable? Most questions I've seen asked about SIFT seem focussed on a simple comparison between two images. Instead of determining how similar two images are, would it be practical to use SIFT to find the N closest matching images out of a collection of thousands of images?

For example, would it be practical to use SIFT to generate keypoints for a batch of images, store the keypoints in a database, and then find the ones that have the shortest Euclidean distance to the keypoints generated for a "query" image?

When calculating the Euclidean distance, would you ignore the x, y, scale, and orientation parts of the keypoints, and only look at the descriptor?

click to hide/show revision 2
Revision n. 2

Mar 02 '11 at 08:56

Cerin's gravatar image

Cerin
462314046

Searching an Image Database Using SIFT

Is the SIFT algorithm scalable? Most questions I've seen asked about SIFT seem focussed on a simple comparison between two images. Instead of determining how similar two images are, would it be practical to use SIFT to find the N closest matching images out of a collection of thousands of images?

For example, would it be practical to use SIFT to generate keypoints for a batch of images, store the keypoints in a database, and then find the ones that have the shortest Euclidean distance to the keypoints generated for a "query" image?

When calculating the Euclidean distance, would you ignore the x, y, scale, and orientation parts of the keypoints, and only look at the descriptor?

powered by OSQA

User submitted content is under Creative Commons: Attribution - Share Alike; Other things copyright (C) 2010, MetaOptimize LLC.