Finding correspondences is a crucial aspect in many fields of computer vision and computer graphics such as structure from motion, camera motion estimation and 3D reconstruction. Current feature point detection and motion tracking algorithms provide accurate correspondences for a sequence of images. However, if the corresponding 3D point of some feature track is occluded, leaves the image or is rejected for some other reason, the feature track is dropped. If the point reappears in some later image, a new track is started without knowing of the existence of the old track, thus losing important information about the scene and the motion of the point. There exists no single algorithm that allows to track feature points in a short range as well...
No feature-based vision system can work unless good features can be identi ed and tracked from frame...
This thesis proposes a robust on-line tracking method by 1) enlarging the convergence range and 2) ...
International audienceWe tackle the problem of finding accurate and robust keypoint correspondences ...
A new algorithm is presented for feature point based motion tracking in long image sequences. Dynami...
This paper presents a unified approach to object recog-nition and object tracking, combining local f...
Dense point matching and tracking in image sequences is an open issue with implications in several d...
This paper proposes a novel and efficient feature-point matching algorithm for finding point corresp...
AbstractÐThis paper studies the motion correspondence problem for which a diversity of qualitative a...
The paper tackles the problem of feature points matching between pair of images of the same scene. T...
A novel visual object tracking scheme is proposed by using joint point feature correspondences and...
The problem of feature correspondences and trajectory finding for a long image sequence has received...
No feature-based vision system can work until good features can be identified and tracked from fram...
This paper discusses an approach to human action recognition via local fea-ture tracking and robust ...
Considering n pairwise feature correspondences we want sets of cor-responding matching features acro...
The paper tackles the problem of feature points matching between pair of images of the same scene. T...
No feature-based vision system can work unless good features can be identi ed and tracked from frame...
This thesis proposes a robust on-line tracking method by 1) enlarging the convergence range and 2) ...
International audienceWe tackle the problem of finding accurate and robust keypoint correspondences ...
A new algorithm is presented for feature point based motion tracking in long image sequences. Dynami...
This paper presents a unified approach to object recog-nition and object tracking, combining local f...
Dense point matching and tracking in image sequences is an open issue with implications in several d...
This paper proposes a novel and efficient feature-point matching algorithm for finding point corresp...
AbstractÐThis paper studies the motion correspondence problem for which a diversity of qualitative a...
The paper tackles the problem of feature points matching between pair of images of the same scene. T...
A novel visual object tracking scheme is proposed by using joint point feature correspondences and...
The problem of feature correspondences and trajectory finding for a long image sequence has received...
No feature-based vision system can work until good features can be identified and tracked from fram...
This paper discusses an approach to human action recognition via local fea-ture tracking and robust ...
Considering n pairwise feature correspondences we want sets of cor-responding matching features acro...
The paper tackles the problem of feature points matching between pair of images of the same scene. T...
No feature-based vision system can work unless good features can be identi ed and tracked from frame...
This thesis proposes a robust on-line tracking method by 1) enlarging the convergence range and 2) ...
International audienceWe tackle the problem of finding accurate and robust keypoint correspondences ...