.png){kind=icon}
返回
Parallel and efficient approximate nearest patch matching for image editing applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2018.03.064.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel GPU-based patch matching method which efficiently finds approximate nearest neighbor correspondences for patches between images. Our approach improves traditional patch matching algorithms in two aspects. First, we propose to improve the convergence of matching with two new types of forward enrichment operations, enabling the fast propagation of a richer set of potentially good candidates on different images. Second, we reduce the search space of patch direction by estimating a coherent feature direction field for each image and computing the similarity between patches with a direction-aware alignment scheme. Furthermore, we develop a number of GPU-based image editing and processing applications by incorporating our new patch matching algorithm, including object matching, nonlocal means denoising, image completion, texture synthesis, and image retargeting. Experimental results and comparisons are shown to demonstrate the effectiveness of the proposed approach. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
k nearest neighbors
Patch-based synthesis
Image completion
Image retargeting
GPU
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Adoption of cleaner technologies and reduction in fire events in the hotspots lead to global decline in carbon monoxide.png)
Chemosphere
OAAI
ChemosphereIF0
OAAI分享收藏Mixed-use Development: Ambiguous concept, simplistic analysis and wishful thinking?混合使用开发: 模糊的概念，简单化的分析和一厢情愿的想法？
PREAI
分享收藏分享收藏
查看更多内容