Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Computing visual correspondence with occlusions using graph cuts
A Cooperative Algorithm for Stereo Matching and Occlusion Detection
Image segmentation by nested cuts
Robust Interpolation of Correspondences for Large Displacement Optical Flow
Multiple-organ segmentation by graph cuts with supervoxel nodes
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
Branching Path Following for Graph Matching
sift flow : dense correspondence across different scenes .
DAISY Filter Flow: A Generalized Discrete Approach to Dense Correspondences
Occlusion detection in video sequences
Topology Cuts: A Novel Min-Cut/Max-Flow Algorithm for Topology Preserving Segmentation in N-D Images
Shape and the Stereo Correspondence Problem
Learning Dense Facial Correspondences in Unconstrained Images
Robust 3D Shape Correspondence in the Spectral Domain
Deep Optical Flow Estimation Via Multi-Scale Correspondence Structure Learning
Occlusion Detection and Handling: A Review
Occlusions and binocular stereo
In search of inliers: 3d correspondence by local and global voting
A tensor-based algorithm for high-order graph matching
PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation
Star Shape Prior for Graph-Cut Image Segmentation
Occlusions and binocular stereo
MetaCost: a general method for making classifiers cost-sensitive
Predict Forex Trend via Convolutional Neural Networks
Improved inception-residual convolutional neural network for object recognition
Reading Comprehension with Deep Learning