Disambiguating Visual Relations Using Loop Constraints

author: Christopher Zach, Department of Computer Science, ETH Zurich
published: July 19, 2010,   recorded: June 2010,   views: 4792


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images solely based on low level features is not always possible, and a more global reasoning approach about the consistency of the estimated relations is required. We propose to utilize the typically observed redundancy in the hypothesized relations for such reasoning, and focus on the graph structure induced by those relations. Chaining the (reversible) transformations over cycles in this graph allows to build suitable statistics for identifying inconsistent loops in the graph. This data provides indirect evidence for conflicting visual relations. Inferring the set of likely false positive geometric relations from these non-local observations is formulated in a Bayesian framework. We demonstrate the utility of the proposed method in several applications, most prominently the computation of structure and motion from images.

See Also:

Download slides icon Download slides: cvpr2010_zach_dvru_01.v1.pdf (8.8 MB)

Download article icon Download article: cvpr2010_zach_dvru_01.pdf (6.0 MB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Hannes Rauch, November 20, 2010 at 10:20 a.m.:


Bin der Nachbar von deiner Mami.

Wir verstehen leider nur Bahnhof ;-)

Geht des Deutsch auch?


Write your own review or comment:

make sure you have javascript enabled or clear this field: