Filters








251 Hits in 2.2 sec

PatchMatch

Connelly Barnes, Eli Shechtman, Adam Finkelstein, Dan B Goldman
2009 ACM Transactions on Graphics  
Abstract This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearestneighbor matches between image patches.  ...  a) original (b) hole+constraints (c) hole filled (d) constraints (e) constrained retarget (f) reshuffle Figure 1: Structural image editing.  ...  Acknowledgements We would like to thank the following Flickr users for Creative Commons imagery: Sevenbrane (Greek temple), Wili (boys), Moi of Ra (flowers), and Celie (pagoda).  ... 
doi:10.1145/1531326.1531330 fatcat:ye7ystpopbf3jnvwnhfubyge7e

PatchMatch

Connelly Barnes, Eli Shechtman, Adam Finkelstein, Dan B Goldman
2009 ACM SIGGRAPH 2009 papers on - SIGGRAPH '09  
Abstract This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearestneighbor matches between image patches.  ...  a) original (b) hole+constraints (c) hole filled (d) constraints (e) constrained retarget (f) reshuffle Figure 1: Structural image editing.  ...  Acknowledgements We would like to thank the following Flickr users for Creative Commons imagery: Sevenbrane (Greek temple), Wili (boys), Moi of Ra (flowers), and Celie (pagoda).  ... 
doi:10.1145/1576246.1531330 fatcat:un5wjguqi5ao7dwcmtkgh5ljxa

The PatchMatch randomized matching algorithm for image manipulation

Connelly Barnes, Dan B. Goldman, Eli Shechtman, Adam Finkelstein
2011 Communications of the ACM  
N ov e M B e R 2 0 1 1 | vo l . 5 4 | N o. 1 1 | c o m m u N i c at i oN s o f t h e acm 103 abstract This paper presents a new randomized algorithm for quickly finding approximate nearest neighbor matches  ...  This one simple algorithm forms the basis for a variety of applications including image retargeting, completion, reshuffling, object detection, digital forgery detection, and video summarization.  ...  "PatchMatch: A Randomized Correspondence Algorithm for Structural Image Editing" and was published in ACM Transactions of Graphics (Proc.  ... 
doi:10.1145/2018396.2018421 fatcat:pcfbva6nbvaxtg4vtz65gpdij4

Efficient PatchMatch-based Synthesis for Cartoon Animation

Chuanyan Hao, Yadang Chen, Enhua Wu, Enhua Wu
2019 IEEE Access  
The key idea is to employ a correspondence match-based random search process to extract the geometry samples and the global motion pattern in an input animation sequence and then to generate a new output  ...  sequence through a coarse-to-fine sample-based synthesis algorithm.  ...  [9] , [10] demonstrated an example-based matching algorithm, called PatchMatch, to obtain dense correspondences between images and have been successfully applied to a broad range of vision problems  ... 
doi:10.1109/access.2019.2903148 fatcat:bq6wtb3l6rbg7na7tqgzruppte

Fast Edge-Preserving PatchMatch for Large Displacement Optical Flow

Linchao Bao, Qingxiong Yang, Hailin Jin
2014 IEEE Transactions on Image Processing  
The speed of optical flow algorithm is crucial for many video editing tasks such as slow motion synthesis, selection propagation, tone adjustment propagation, and so on.  ...  The main novelty is a fast randomized edge-preserving approximate nearest neighbor field algorithm, which propagates self-similarity patterns in addition to offsets.  ...  A. Edge-Preserving PatchMatch The main idea of original PatchMatch [7] is to initialize a random correspondence field and then iteratively propagate good guesses among neighboring pixels.  ... 
doi:10.1109/tip.2014.2359374 pmid:25252282 fatcat:stflrqrzprg47ixgi3vk6vtt2a

Fast Edge-Preserving PatchMatch for Large Displacement Optical Flow

Linchao Bao, Qingxiong Yang, Hailin Jin
2014 2014 IEEE Conference on Computer Vision and Pattern Recognition  
The speed of optical flow algorithm is crucial for many video editing tasks such as slow motion synthesis, selection propagation, tone adjustment propagation, and so on.  ...  The main novelty is a fast randomized edge-preserving approximate nearest neighbor field algorithm, which propagates self-similarity patterns in addition to offsets.  ...  A. Edge-Preserving PatchMatch The main idea of original PatchMatch [7] is to initialize a random correspondence field and then iteratively propagate good guesses among neighboring pixels.  ... 
doi:10.1109/cvpr.2014.452 dblp:conf/cvpr/BaoYJ14 fatcat:fnhvu2lexvhydmdyru7slctkky

On the Convergence of PatchMatch and Its Variants

Thibaud Ehret, Pablo Arias
2018 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition  
For each patch in a query image, the k-NNF determines the positions of the k most similar patches in a database image.  ...  We consider a generic PatchMatch algorithm from which most specific instances found in the literature can be derived as particular cases.  ...  Random search For the specification of a PatchMatch algorithm we need a mechanism for gathering random samples around the current candidates.  ... 
doi:10.1109/cvpr.2018.00123 dblp:conf/cvpr/EhretA18 fatcat:2fwqhbiehzgkvir3sbnmck2ttq

PatchMatch-Based Automatic Lattice Detection for Near-Regular Textures

Siying Liu, Tian-Tsong Ng, Kalyan Sunkavalli, Minh N. Do, Eli Shechtman, Nathan Carr
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Our technique leverages the Patch-Match algorithm for finding k-nearest-neighbor (kNN) correspondences in an image.  ...  In this work, we investigate the problem of automatically inferring the lattice structure of near-regular textures (NRT) in real-world images.  ...  In this work, we propose to use a modified version of the Generalized PatchMatch (GPM) algorithm [3] to find self-similar patches within an input image.  ... 
doi:10.1109/iccv.2015.29 dblp:conf/iccv/LiuNSDSC15 fatcat:dhzbhs3r2jfy3m2za74whyklfq

DeepPruner: Learning Efficient Stereo Matching via Differentiable PatchMatch [article]

Shivam Duggal, Shenlong Wang, Wei-Chiu Ma, Rui Hu, Raquel Urtasun
2019 arXiv   pre-print
Towards this goal, we developed a differentiable PatchMatch module that allows us to discard most disparities without requiring full cost volume evaluation.  ...  Our goal is to significantly speed up the runtime of current state-of-the-art stereo algorithms to enable real-time inference.  ...  It was originally introduced as an efficient way to find dense correspondences across images for structural editing.  ... 
arXiv:1909.05845v1 fatcat:qb5kigyqwfbfznyx57fmmbxogq

An Optimized PatchMatch for Multi-scale and Multi-feature Label Fusion [article]

Rémi Giraud, Vinh-Thong Ta, Nicolas Papadakis, José V. Manjón, D. Louis Collins, Pierrick Coupé, Alzheimer's Disease Neuroimaging Initiative
2019 arXiv   pre-print
In this paper, we introduce a new patch-based label fusion framework to perform segmentation of anatomical structures.  ...  Automatic segmentation methods are important tools for quantitative analysis of Magnetic Resonance Images (MRI).  ...  ADNI data are disseminated by the Laboratory for Neuro Imaging at the University of California, Los Angeles.  ... 
arXiv:1903.07165v1 fatcat:v3v4gqxfvjdlhlprrig6gtffba

An Optimized PatchMatch for multi-scale and multi-feature label fusion

Rémi Giraud, Vinh-Thong Ta, Nicolas Papadakis, José V. Manjón, D. Louis Collins, Pierrick Coupé
2016 NeuroImage  
In this paper, we introduce a new patch-based label fusion framework to perform segmentation of anatomical structures.  ...  Automatic segmentation methods are important tools for quantitative analysis of Magnetic Resonance Images (MRI).  ...  Optimized PatchMatch Algorithm In contrast to [22] where two 2D images are considered, OPAL finds the patch correspondences between a 3D image S and a library of n 3D templates T = {T 1 , . . . , T n  ... 
doi:10.1016/j.neuroimage.2015.07.076 pmid:26244277 fatcat:icnagbhtobfixbjgfgpb4tdjwm

A PatchMatch-based Dense-field Algorithm for Video Copy-Move Detection and Localization [article]

Luca D'Amiano, Davide Cozzolino, Giovanni Poggi, Luisa Verdoliva
2017 arXiv   pre-print
We propose a new algorithm for the reliable detection and localization of video copy-move forgeries.  ...  To limit complexity, a suitable video-oriented version of PatchMatch is used, with a multiresolution search strategy, and a focus on volumes of interest.  ...  The U.S.Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
arXiv:1703.04636v1 fatcat:frm5ytg7qnaylle6qvixjsedpe

Automatic Detection of Internal Copy-Move Forgeries in Images

Thibaud Ehret
2018 Image Processing On Line  
Regions matched by PatchMatch are processed to find the final detections. This allows a precise and accurate detection of copy-move forgeries inside a single suspicious image.  ...  Source Code The reviewed source code and documentation for this algorithm are available from the web page of this article 1 .  ...  images in this manuscript are either taken from the FAU database presented by Christlein et al. in [4] or produced by the author.  ... 
doi:10.5201/ipol.2018.213 fatcat:ystm6xk2nrhfxpzbwpa6ftgnc4

PatchMatch-Based Content Completion of 3D Images PatchMatch-Based Content Completion of 3D Images

Joel Howard, Joel Howard, Bryan Morse, William Barrett, Sean Warnick, Joel Howard
2013 unpublished
Additionally, the PatchMatch algorithm is extended to draw from scaled texture in a directed fashion based on the 3D structure of the scene estimated from the stereo image pairs.  ...  PatchMatch-Based Content Completion of 3D Images This thesis presents a method for completing target regions ("hole filling") in RGB stereo pairs.  ...  The core ideas of the PatchMatch algorithm have since also been used for noise reduction [19] and stereo correspondence [6] .  ... 
fatcat:eyhtyxsxdvdpjndyt5657tpsyy

TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm [chapter]

Igor Olonetsky, Shai Avidan
2012 Lecture Notes in Computer Science  
TreeCANN is a fast algorithm for approximately matching all patches between two images.  ...  As a by-product we give an optimal algorithm for exact matching that is based on the integral image.  ...  The PatchMatch algorithm starts with an initialization stage, that performs a random assignment of every patch in the source image S to a patch in the target image T .  ... 
doi:10.1007/978-3-642-33765-9_43 fatcat:xkaef3qcnndtta6halnmhmqony
« Previous Showing results 1 — 15 out of 251 results