Assignment 3 - Problem 3 - Thresholding ?

Moderator: Computer Vision

Marc Schmitt
Beiträge: 7
Registriert: 29. Apr 2010 12:12

Assignment 3 - Problem 3 - Thresholding ?

Beitrag von Marc Schmitt »

In figure 2 of problem 3 (feature matching) you can see several points which are not connected to another point.

As far as I can tell, there HAS to be a threshold applied onto the distances between the points, otherwise in at least one image, every point should have a connected point.

Do we also have to apply a threshold to our distances to filter out implausible points ?

Beiträge: 644
Registriert: 1. Okt 2007 12:40
Wohnort: Darmstadt

Re: Assignment 3 - Problem 3 - Thresholding ?

Beitrag von Stumpf.Alex »

It is not neccessary that a threshold exists due to non-connected points. The definition of matching gives:
Note that the two feature points in a pair should be nearest neighbours to each other and should also be at the same scale.
Given the nearest neighbour B of a point A, it must not follow that A is also the nearest Neighbour for B. So the matching for point A can fail in this case and there is no link for A.

But the questions is still interesting: Should we apply a threshold to the distance of matched points? In my opinion it would be reasonable.


Zurück zu „Computer Vision“