Skip to search formSkip to main contentSkip to account menu

PatchMatch

The core PatchMatch algorithm quickly finds correspondences between small square regions (or patches) of an image. The algorithm can be used in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Although the matching technique has been studied in various areas of computer vision for decades, efficient dense correspondence… 
2018
2018
We present ESPReSSo, the first real-time implementation of spacetime stereo, offering improved quality vs. existing real-time… 
2017
2017
This paper presents a new method for efficiently computing large-displacement optical flow. The method uses dominant motion… 
2016
2016
Spatial variation of material structures is a principal mechanism for creating and controlling spatially varying material… 
2014
2014
This paper proposes a denoising algorithm which performs non-local means bilateral filtering. As existing literature suggests… 
2014
2014
The goal of this paper is to explore the power of external data in the image denoising task, that is, to show that with taking… 
2014
2014
We propose a quick and automatic patch-based image completion method, which uses the PatchMatch framework. We show that… 
2013
2013
Correspondence fields estimation is an important process that lies at the core of many different applications. Is it often seen… 
2013
2013
Approximate Nearest-Neighbour Field has been an area of interest in recent research for a wide variety of topics in graphics and… 
2012
2012
Computing the dense Approximate Nearest-Neighbour Field (ANNF) between a pair of images has become a major problem which is being…