期刊
IEEE TRANSACTIONS ON IMAGE PROCESSING
卷 22, 期 7, 页码 2764-2774出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2013.2257813
关键词
Patch-based processing; traveling salesman; pixel permutation; denoising; inpainting
资金
- Japan Technion Society Research Fund
- Robert H. Hillman Foundation for Global Security
- Technion
- Northeastern University
- European Research Council under the ERC [320649]
We propose an image processing scheme based on reordering of its patches. For a given corrupted image, we extract all patches with overlaps, refer to these as coordinates in high-dimensional space, and order them such that they are chained in the shortest possible path, essentially solving the traveling salesman problem. The obtained ordering applied to the corrupted image implies a permutation of the image pixels to what should be a regular signal. This enables us to obtain good recovery of the clean image by applying relatively simple one-dimensional smoothing operations (such as filtering or interpolation) to the reordered set of pixels. We explore the use of the proposed approach to image denoising and inpainting, and show promising results in both cases.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据