A Branch-and-Bound Approach to Correspondence and Grouping Problems

Bazin, Jean-Charles; Li, Hongdong; Kweon, In So; Demonceaux, Cedric; Vasseur, Pascal; Ikeuchi, Katsushi

doi:10.1109/TPAMI.2012.264

A change is coming. Click to see a sneak peek of the new Open Research Repository.

A Branch-and-Bound Approach to Correspondence and Grouping Problems

Request a Copy

link to publisher version

Altmetric Citations

Bazin, Jean-Charles; Li, Hongdong; Kweon, In So; Demonceaux, Cedric; Vasseur, Pascal; Ikeuchi, Katsushi

Description

Data correspondence/grouping under an unknown parametric model is a fundamental topic in computer vision. Finding feature correspondences between two images is probably the most popular application of this research field, and is the main motivation of our

Collections	ANU Research Publications
Date published:	2013
Type:	Journal article
URI:	http://hdl.handle.net/1885/74440
Source:	IEEE Transactions on Pattern Analysis and Machine Intelligence
DOI:	10.1109/TPAMI.2012.264

Download

File	Description	Size	Format	Image
01_Bazin_A_Branch-and-Bound_Approach_to_2013.pdf		1.91 MB	Adobe PDF	Request a copy

Show full item record

A Branch-and-Bound Approach to Correspondence and Grouping Problems

Altmetric Citations

Description

Download