A Novel Approach for Color Tongue Image Extraction Based on Random Walk Algorithm

2013 ◽  
Vol 462-463 ◽  
pp. 338-342 ◽  
Author(s):  
Ming Feng Zhu ◽  
Jian Qiang Du

Tongue image extraction is a fundamental step in objective diagnoses and quantitive checking of tongues. The accuracy of tongue image extraction can directly influence the results of the succedent checking in objective diagnoses of tongues. In this paper, we improved random walk image segmentation algorithm and applied it to tongue image extraction. Firstly, we utilized toboggan algorithm which adopted new classification rules to segment initial regions. Secondly, a weighted-graph was built according to initial regions in which only those adjacent regions were connected. Thirdly, random walk algorithm was applied to make the final segmentation in which a new weight function was designed for calculating the weights between the nodes of adjacent regions. Fourthly, mathematical morphology operations, i. e. inflations and erosions, were carried out on the segmentation result of the third step in order to fill small holes on the tongue region. In the experiment, we compared our method with traditional random walk algorithm. As the experiment results show, our method achieved much better segmentation effects.

Author(s):  
Idir Boulfrifi ◽  
Khalid Housni ◽  
Abdelaziz Mouloudi

<p>In this paper, we propose a novel approach for automatic foreground extraction in video frames by analyzing the spatiotemporal aspect. We divide our contribution to tree steps: Automatic seeds detection, formulating the energy function, and using the random walk algorithm to minimize this function. First, we detect seeds by extracting a sparse of good features to track in the current frame and compute the difference between those pixels and its adjacent in the previous frame, the difference of pixels is treated in HSV color space to make the result more accurate, we thresholds this difference, and we classify moving and stationary pixels. Secondly, we formulate our foreground extraction as a graph based problem, then we define an energy function to evaluate spatiotemporal smoothness. Finally, we applied the random walk algorithm with seeds detected in the first step to minimize the energy function problem, the solution leads to evaluate the potential that every pixel in the video sequences is marked in motion or a stationary pixel. We suggest that our unsupervised method has the potential to be used for many kinds of motion detection and real-time video.</p>


2014 ◽  
Vol 38 (8) ◽  
pp. 753-763 ◽  
Author(s):  
D.P. Onoma ◽  
S. Ruan ◽  
S. Thureau ◽  
L. Nkhali ◽  
R. Modzelewski ◽  
...  

2013 ◽  
Vol 06 (06) ◽  
pp. 1350043 ◽  
Author(s):  
LI GUO ◽  
YUNTING ZHANG ◽  
ZEWEI ZHANG ◽  
DONGYUE LI ◽  
YING LI

In this paper, we proposed a semi-automatic technique with a marker indicating the target to locate and segment nodules. For the lung nodule detection, we develop a Gabor texture feature by FCM (Fuzzy C Means) segmentation. Given a marker indicating a rough location of the nodules, a decision process is followed by applying an ellipse fitting algorithm. From the ellipse mask, the foreground and background seeds for the random walk segmentation can be automatically obtained. Finally, the edge of the nodules is obtained by the random walk algorithm. The feasibility and effectiveness of the proposed method are evaluated with the various types of the nodules to identify the edges, so that it can be used to locate the nodule edge and its growth rate.


2010 ◽  
Vol 1 (3) ◽  
pp. 1-19 ◽  
Author(s):  
Noureddine Bouhmala ◽  
Ole-Christoffer Granmo

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.


Sign in / Sign up

Export Citation Format

Share Document