Finding Trajectories of Feature Points in a Monocular Image Sequence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature Point Correspondence in the Presence of Occlusion
IEEE Transactions on Pattern Analysis and Machine Intelligence
Establishing motion correspondence
CVGIP: Image Understanding
Three-dimensional motion computation and object segmentation in a long sequence of stereo frames
International Journal of Computer Vision
A review of statistical data association for motion correspondence
International Journal of Computer Vision
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Patterns of Activity Using Real-Time Tracking
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detecting Independent Motion: The Statistics of Temporal Continuity
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detecting Salient Motion by Accumulating Directionally-Consistent Flow
IEEE Transactions on Pattern Analysis and Machine Intelligence
Resolving Motion Correspondence for Densely Moving Points
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimating Motion and Structure from Correspondences of Line Segments between Two Perspective Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Local search heuristics for the multidimensional assignment problem
Journal of Heuristics
Hi-index | 0.00 |
This paper addresses the motion correspondence problem: the problem of finding corresponding point measurements in an image sequence solely based on positional information. The motion correspondence problem is most difficult when the target points are densely moving. It becomes even harder when the point detection scheme is imperfect or when points are temporarily occluded. Available motion constraints should be exploited in order to rule out physically impossible assignments of measurements to point tracks. The performance can be further increased by deferring the correspondence decisions, that is, by examining whether the consequences of candidate correspondences lead to alternate and better solutions. In this paper, we concentrate on the latter by introducing a scheme that extends the temporal scope over which the correspondences are optimized. The consequent problem we are faced with is a multi-dimensional assignment problem, which is known to be NP-hard. To restrict the consequent increase in computation time, the candidate solutions are suitably ordered and then additional combined motion constraints are imposed. Experiments show the appropriateness of the proposed extension, both with respect to performance as well as computational aspects.