Deformable template models: a review
Signal Processing - Special issue on deformable models and techniques for image and signal processing
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Example-Based Super-Resolution
IEEE Computer Graphics and Applications
FG '96 Proceedings of the 2nd International Conference on Automatic Face and Gesture Recognition (FG '96)
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A Non-Local Algorithm for Image Denoising
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Performance Evaluation of Local Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Detecting Irregularities in Images and in Video
International Journal of Computer Vision
SIFT Flow: Dense Correspondence across Different Scenes
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
What Is a Good Image Segment? A Unified Approach to Segment Extraction
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part IV
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
PatchMatch: a randomized correspondence algorithm for structural image editing
ACM SIGGRAPH 2009 papers
Discovering texture regularity as a higher-order correspondence problem
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Region filling and object removal by exemplar-based image inpainting
IEEE Transactions on Image Processing
Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering
IEEE Transactions on Image Processing
Efficient Nonlocal Means for Denoising of Textural Patterns
IEEE Transactions on Image Processing
Non-rigid dense correspondence with applications for image enhancement
ACM SIGGRAPH 2011 papers
The PatchMatch randomized matching algorithm for image manipulation
Communications of the ACM
Video deblurring for hand-held cameras using patch-based synthesis
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Image melding: combining inconsistent images using patch-based synthesis
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Novel-View Synthesis of Outdoor Sport Events Using an Adaptive View-Dependent Geometry
Computer Graphics Forum
Transfusive image manipulation
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
The magic lens: refractive steganography
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Robust patch-based hdr reconstruction of dynamic scenes
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Finding correspondence from multiple images via sparse and low-rank decomposition
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
PATCHMATCHGRAPH: building a graph of dense patch correspondences for label transfer
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Repairing sparse low-rank texture
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
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
Interactive image completion with perspective constraint
Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry
Transfer of albedo and local depth variation to photo-textures
Proceedings of the 9th European Conference on Visual Media Production
Detection and segmentation of approximate repetitive patterns in relief images
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Stylizing animation by example
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Inverse image editing: recovering a semantic editing history from a before-and-after image pair
ACM Transactions on Graphics (TOG)
PatchNet: a patch-based image representation for interactive library-driven image editing
ACM Transactions on Graphics (TOG)
Data-driven hallucination of different times of day from a single outdoor photo
ACM Transactions on Graphics (TOG)
Data-driven interactive 3D medical image segmentation based on structured patch model
IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
Special Section on CAD/Graphics 2013: Image compositing using dominant patch transformations
Computers and Graphics
| Hi-index | 0.02 |
PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatch in three ways: (1) to find k nearest neighbors, as opposed to just one, (2) to search across scales and rotations, in addition to just translations, and (3) to match using arbitrary descriptors and distances, not just sum-of-squared-differences on patch colors. In addition, we offer new search and parallelization strategies that further accelerate the method, and we show performance improvements over standard kd-tree techniques across a variety of inputs. In contrast to many previous matching algorithms, which for efficiency reasons have restricted matching to sparse interest points, or spatially proximate matches, our algorithm can efficiently find global, dense matches, even while matching across all scales and rotations. This is especially useful for computer vision applications, where our algorithm can be used as an efficient general-purpose component. We explore a variety of vision applications: denoising, finding forgeries by detecting cloned regions, symmetry detection, and object detection.