Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,289,910 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Algorithm
Correspondence problem
Nearest neighbor search
Broader (1)
Computer vision
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Coarse-to-Fine PatchMatch for Dense Correspondence
Yunsong Li
,
Yinlin Hu
,
Rui Song
,
P. Rao
,
Yangli Wang
IEEE transactions on circuits and systems for…
2018
Corpus ID: 52291817
Although the matching technique has been studied in various areas of computer vision for decades, efficient dense correspondence…
Expand
2018
2018
ESPReSSo: Efficient Slanted PatchMatch for Real-Time Spacetime Stereo
Harris Nover
,
Supreeth Achar
,
Dan B. Goldman
International Conference on 3D Vision
2018
Corpus ID: 206432515
We present ESPReSSo, the first real-time implementation of spacetime stereo, offering improved quality vs. existing real-time…
Expand
2017
2017
Fast Estimation of Large Displacement Optical Flow Using Dominant Motion Patterns & Sub-Volume PatchMatch Filtering
M. Helala
,
F. Qureshi
Canadian Conference on Computer and Robot Vision
2017
Corpus ID: 46847918
This paper presents a new method for efficiently computing large-displacement optical flow. The method uses dominant motion…
Expand
2016
2016
Sample-Based Design of Functionally Graded Material Structures
Xingchen Liu
,
V. Shapiro
Design Automation Conference
2016
Corpus ID: 27138450
Spatial variation of material structures is a principal mechanism for creating and controlling spatially varying material…
Expand
2014
2014
Joint bilateral filtering based non-local means image denoising
O. U. Nirmal Jith
,
R. Venkatesh Babu
International Conference on Signal Processing and…
2014
Corpus ID: 18705570
This paper proposes a denoising algorithm which performs non-local means bilateral filtering. As existing literature suggests…
Expand
2014
2014
Explore the Power of External Data in Denoising Task
Yipin Zhou
2014
Corpus ID: 18696149
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…
Expand
2014
2014
Constrained PatchMatch for Image Completion
Guillaume Chican
,
M. Tamaazousti
International Symposium on Visual Computing
2014
Corpus ID: 44832412
We propose a quick and automatic patch-based image completion method, which uses the PatchMatch framework. We show that…
Expand
2013
2013
PatchMatch belief propagation for correspondence field estimation and its applications
F. Besse
2013
Corpus ID: 1267165
Correspondence fields estimation is an important process that lies at the core of many different applications. Is it often seen…
Expand
2013
2013
OD-Match: PatchMatch based Optic Disk detection
S. Ramakanth
,
R. Venkatesh Babu
National Conference on Computer Vision, Pattern…
2013
Corpus ID: 18330741
Approximate Nearest-Neighbour Field has been an area of interest in recent research for a wide variety of topics in graphics and…
Expand
2012
2012
Feature match: an efficient low dimensional PatchMatch technique
S. Ramakanth
,
R. Venkatesh Babu
Indian Conference on Computer Vision, Graphics…
2012
Corpus ID: 4199943
Computing the dense Approximate Nearest-Neighbour Field (ANNF) between a pair of images has become a major problem which is being…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE