.png){kind=icon}
返回
Sequential image segmentation based on minimum spanning tree representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2016.06.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Image segmentation is a very important stage in various image processing applications. Segmentation of pixels of an image and clustering of data are closely related to each other. For many graph-based data-clustering methods and many graph-based image-segmentation methods, minimum spanning tree (MST)-based approaches play a crucial role because of their ease of operation and low computational complexity. In this paper, we improve a successful data-clustering algorithm that uses Prim's sequential representation of MST, for the purpose of image segmentation. The algorithm runs by scanning the complete MST structure of the entire image, such that it finds, and then cuts, inconsistent edges among a constantly changing juxtaposed edge string whose elements are obtained from the MST at a specific length. In our method, the length of the string not only determines the edges to compare, but also helps to remove the small, undesired cluster particles. We also develop a new predicate for the cutting criterion. The criterion takes into account several local and global features that differ from image to image. We test our algorithm on a database that consists of real images. The results show that the proposed method can compete with the most popular image segmentation algorithms in terms of low execution time. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Segmentation
Clustering
Graph
Minimum spanning tree
Prim
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
A graph-theoretical clustering method based on two rounds of minimum spanning trees.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容