Fast merging algorithm for image segmentation based on date structure
For the complexity of the algorithm for the merger of the regional boundary. A new algorithm — the Full X Edge List Segmentation Algorithm(FELSA) is presented. Firstly, A new list — edge list in date structure of segmentation region is introduced to improve the boundaries of multi-partition approach, and the updates value of merger list in FLSA algorithm is redefined. Thus, segmentation algorithm may select the best boundary for the merger according to the edge list. Furthermore, the adjacent part of the region is defined by edge list, so that a new edge can be retrieved more efficiently. The results show that this improved algorithm become more efficient and effective to the merger of image segmentation.
Segmentation merging Edge List FELSA Date Structure
Zhao Shan Wang Shui
School of computer science and technology, Henan Polytechnic University, Jiao zuo, China
国际会议
2010 Third International Symposium on Knowledge Acquisition and Modeling(第三届知识获取与建模国际研讨会 KAN 2010)
武汉
英文
221-224
2010-10-20（万方平台首次上网日期，不代表论文的发表时间）