Chavan Suvarna S., Chaudhari B.P.
Abstract: Now days, image processing field with its patches becomes highly popular. This reviewed system is based on image processing scheme with reordering of its patches.In this extract all patches with overlaps of an corrupted image, then reefers this patches as co-ordinates in high dimensional space and then order this patches so that they can form sequence in shortest possible path, for solving travelling salesman problem. The obtained sequence then applied to the corrupted image to carry out permutation of the image pixels to obtain what should be a regular signal. By using relatively simple one-dimensional smoothing operations such as filtering or interpolation to the reordered set of pixels, by this we can obtain good recovery of clean image from corrupted one. Explore the use of this approach to image denoising and inpaintaing, and show promising result in both cases.
Keywords: Pixel permutation, Patch-based processing, Travelling salesman problem, Denoising, Inpainting