Downloads: 109
Review Papers | Computer Science & Engineering | India | Volume 3 Issue 12, December 2014
Review Paper on: Image Processing Using Smooth Ordering of its Patches
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
Edition: Volume 3 Issue 12, December 2014,
Pages: 1824 - 1829
Similar Articles with Keyword 'Travelling salesman problem'
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Experimental Result Paper, Computer Science & Engineering, India, Volume 11 Issue 11, November 2022
Pages: 667 - 674Exploring a Minimum Cost Solution for Traveling Salesman Problem using Parallel Simulated Annealing
Geerisha Jain | Dr. Anto S | Dewang Mehta
Downloads: 104
Research Paper, Computer Science & Engineering, India, Volume 4 Issue 5, May 2015
Pages: 1362 - 1367A Novel Method to Solve Travelling Salesman Problem Using Sequential Constructive Crossover Using Map/Reduce Framework
Anitha Rao | Sandeep Kumar Hegde