Please use this identifier to cite or link to this item:
|Title:||On The Random Walks Algorithms for Image Processing||Authors:||Chahine, Chaza
Berbari, Racha El
|Affiliations:||Department of Telecommunications and Networking Engineering||Keywords:||Optimization
|Issue Date:||2014||Part of:||META'2014||Start page:||1||End page:||2||Conference:||International Conference on Metaheuristics and Nature Inspired Computing (5th : 27-31 Oct 2014 : Morocco)||Abstract:||
Random walks are time-reversible and finite special Markov chains. They are used to model different phenomena in mathematics and physics widely applied in many fields as economics, ecology, biology, computer science, etc. In this paper, we present a review of the use of random walks algorithm in images processing, called, random walks on graphs . The basic concept of this algorithm remains in considering a given undirected graph G = ( V, E ), the random walk is a stochastic process that starts at a given vertex and move to a randomly selected neighbour, from which a similar process will be executed. The sequence of selected vertices defines a random walk on the graph. Random walks was used widely to solve several image processing problems, we cite here, image enhancement, image segmentation and image registration.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/721||Open URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Telecommunications and Networking Engineering|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.