A network of globally coupled chaotic maps for adaptive multi-resolution image segmentation

Author(s):  
Liang Zhao ◽  
R.A. Furukawa ◽  
A.C.P.L.F. de Carvalho
2014 ◽  
Author(s):  
Hui Li ◽  
Yunwei Tang ◽  
Qingjie Liu ◽  
Haifeng Ding ◽  
Yu Chen ◽  
...  

2014 ◽  
Vol 548-549 ◽  
pp. 1179-1184 ◽  
Author(s):  
Wen Ting Yu ◽  
Jing Ling Wang ◽  
Long Ye

Image segmentation with low computational burden has been highly regarded as important goal for researchers. One of the popular image segmentation methods is normalized cut algorithm. But it is unfavorable for high resolution image segmentation because the amount of segmentation computation is very huge [1]. To solve this problem, we propose a novel approach for high resolution image segmentation based on the Normalized Cuts. The proposed method preprocesses an image by using the normalized cut algorithm to form segmented regions, and then use k-Means clustering on the regions. The experimental results verify that the proposed algorithm behaves an improved performance comparing to the normalized cut algorithm.


2003 ◽  
Vol 13 (02) ◽  
pp. 129-137 ◽  
Author(s):  
Liang Zhao ◽  
Rogerio A. Furukawa ◽  
Andre C. P. L. F. Carvalho

In this paper, a network of coupled chaotic maps for multi-scale image segmentation is proposed. Time evolutions of chaotic maps that correspond to a pixel cluster are synchronized with one another, while this synchronized evolution is desynchronized with respect to time evolution of chaotic maps corresponding to other pixel clusters in the same image. The number of pixel clusters is previously unknown and the adaptive pixel moving technique introduced in the model makes it robust enough to classify ambiguous pixels.


2009 ◽  
Vol 28 (9) ◽  
pp. 2309-2311 ◽  
Author(s):  
Zhen-liang WANG ◽  
Ji-cheng WANG

Sign in / Sign up

Export Citation Format

Share Document