Dense sift vs sift?

Question

What is the difference between the dense sift implementation compare to sift? What are the advantages/disadvantages of one to another? I'm talking in particular about the VLFeat implementations.

Answer 1

The obvious difference is that with dense SIFT you get a SIFT descriptor at every location, while with normal sift you get a SIFT descriptions at the locations determined by Lowe's algorithm.

There are many applications where you require non-dense SIFT, one great example is Lowe's original work.

There are plenty of applications where good results have been obtained by computing a descriptor everywhere (densely) one such example is this . A descriptor similar to dense SIFT is called HOG or DHOG, they are technically not the same thing but conceptually both based on histograms of gradients and are very similar.

Answer 2

On http://www.vlfeat.org/overview/dsift.html you can find in detail how the image features are extracted for both SIFT and dense SIFT implementation as well as a comparison of their execution time. The main advantage of the VLFeat dense SIFT descriptor is the speed.

In MediaMixer Deliverable D1.1.2 a concept detection technique where both SIFT and dense SIFT descriptors are used is presented, and the experimental results have shown that this combination provides more accurate classification. For further information you can join the MediaMixer community portal on http://community.mediamixer.eu/ .

Answer 3

通常，对于通用对象类别识别，使用密集特征提取而不是基于关键点的特征提取获得更好的结果。

Answer 4

Dense SIFT collects more features at each location and scale in an image, increasing recognition accuracy accordingly. However, computational complexity will always be an issue for it (in relation to normal SIFT).

If you're using SIFT for classification, I recommend using normal SIFT with multiple kernel functions (for clustering) as oppose to using Dense SIFT with a single linear kernel function. You'll get the obvious speed/accuracy trade off, though.

I recommend checking out this paper which explains the implementation differences in Big-Oh.

Answer 5

You can read more about DenseSIFT in VLFeat implementation details.

DenseSIFT is more fast (x30-x60 speedup).

http://www.vlfeat.org/overview/dsift.html http://www.robots.ox.ac.uk/~vedaldi/assets/pubs/vedaldi10vlfeat-tutorial.pdf