Learning Pixel Trajectories with Multiscale Contrastive Random Walks
A range of video modeling tasks, from optical flow to multiple object tracking, share the same fundamental challenge: establishing space-time correspondence. Yet, approaches that dominate each space differ. We take a step towards bridging this gap by extending the recent contrastive random walk formulation to much denser, pixel-level space-time graphs. The main contribution is introducing hierarchy into the search problem by computing the transition matrix between two frames in a coarse-to-fine manner, forming a multiscale contrastive random walk when extended in time. This establishes a unified technique for self-supervised learning of optical flow, keypoint tracking, and video object segmentation. Experiments demonstrate that, for each of these tasks, the unified model achieves performance competitive with strong self-supervised approaches specific to that task. Project webpage: https://jasonbian97.github.io/flowwalk
Code (0)
등록된 구현이 없습니다.
Tasks
Multiple Object TrackingObjectObject TrackingOptical Flow EstimationSelf-Supervised LearningSemantic SegmentationVideo Object SegmentationVideo Semantic SegmentationSimilar Papers 제목 키워드 기반
Contrastive Representation Learning of Longitudinal Disease Trajectories on Temporal Graphs
Understanding disease trajectories from longitudinal clinical data remains challenging due to complex temporal dynamics and heterogeneous patient cohorts. Here, we present a contrastive representation learning framework …
Representation LearningContrastive LearningLearning physical properties of anomalous random walks using graph neural networks
Single particle tracking allows probing how biomolecules interact physically with their natural environments. A fundamental challenge when analysing recorded single particle trajectories is the inverse problem of inferri…
An Iterative Boundary Random Walks Algorithm for Interactive Image Segmentation
The interactive image segmentation algorithm can provide an intelligent ways to understand the intention of user input. Many interactive methods have the problem of that ask for large number of user input. To efficient p…
Image SegmentationSegmentationSelf-LearningSemantic SegmentationTowards Fundamental Limits of Multi-armed Bandits with Random Walk Feedback
In this paper, we consider a new Multi-Armed Bandit (MAB) problem where arms are nodes in an unknown and possibly changing graph, and the agent (i) initiates random walks over the graph by pulling arms, (ii) observes the…
Multi-Armed BanditsRecommendation SystemsDecoupled Contrastive Multi-View Clustering with High-Order Random Walks
In recent, some robust contrastive multi-view clustering (MvC) methods have been proposed, which construct data pairs from neighborhoods to alleviate the false negative issue, i.e., some intra-cluster samples are wrongly…
ClusteringContrastive Learning