Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

PatchMatch

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Our goal is to significantly speed up the runtime of current state-of-the-art stereo algorithms to enable real-time inference… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2018
2018
Estimating the disparity and normal direction of one pixel simultaneously, instead of only disparity, also known as 3D label… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We propose a multi-view depthmap estimation approach aimed at adaptively ascertaining the pixel level data associations between a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
Highly Cited
2014
Highly Cited
2014
In this work we propose a new algorithm for copy-move forgery detection and localization, based on the fast computation of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Most stereo correspondence algorithms match support windows at integer-valued disparities and assume a constant disparity value… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
PatchMatch (PM) is a simple, yet very powerful and successful method for optimizing continuous labelling problems. The algorithm… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Common local stereo methods match support windows at integer-valued disparities. The implicit assumption that pixels within the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearest… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearest… Expand
Is this relevant?