Sciweavers

2 search results - page 1 / 1
» Computing nearest-neighbor fields via Propagation-Assisted K...
Sort
View
CVPR
2012
IEEE
11 years 7 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
ECCV
2008
Springer
14 years 6 months ago
SIFT Flow: Dense Correspondence across Different Scenes
While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition tha...
Ce Liu, Jenny Yuen, Antonio B. Torralba, Josef Siv...