Sciweavers

ICIP
1998
IEEE
15 years 1 months ago
A Fast and Robust Point Tracking Algorithm
We present an algorithm that efficiently tracks a predefined set of landmark points in a time sequence of images. The algorithm iteratively optimizes the correspondences between t...
Cor J. Veenman, Emile A. Hendriks, Marcel J. T. Re...
ICCV
2009
IEEE
15 years 4 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl