Mixed-resolution patch-matching
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
TreeCANN - k-d tree coherence approximate nearest neighbor algorithm
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Feature match: an efficient low dimensional PatchMatch technique
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Special Section on CAD/Graphics 2013: Image compositing using dominant patch transformations
Computers and Graphics
| Hi-index | 0.00 |
Coherency Sensitive Hashing (CSH) extends Locality Sensitivity Hashing (LSH) and PatchMatch to quickly find matching patches between two images. LSH relies on hashing, which maps similar patches to the same bin, in order to find matching patches. PatchMatch, on the other hand, relies on the observation that images are coherent, to propagate good matches to their neighbors, in the image plane. It uses random patch assignment to seed the initial matching. CSH relies on hashing to seed the initial patch matching and on image coherence to propagate good matches. In addition, hashing lets it propagate information between patches with similar appearance (i.e., map to the same bin). This way, information is propagated much faster because it can use similarity in appearance space or neighborhood in the image plane. As a result, CSH is at least three to four times faster than PatchMatch and more accurate, especially in textured regions, where reconstruction artifacts are most noticeable to the human eye. We verified CSH on a new, large scale, data set of 133 image pairs.