文献类型：会议论文

英文题名：Model and analysis on time complexity for graph-based segmentation

作者：Li, Sun[1]; Liu, Jia[2]; Lv, Caixiai[2]; Li, Zheying[2]

第一作者：Li, Sun

通讯作者：Li, S.

机构：[1] School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China; [2] Beijing Key Lab. of Information Service, School of Information, Beijing Union University, Beijing, China

第一机构：School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China

会议论文集：Proceedings of the 2012 International Conference on Information Technology and Software Engineering - Software Engineering and Digital Media Technology

会议日期：December 8, 2012 - December 10, 2012

会议地点：Beijing, China

语种：英文

外文关键词：Computational complexity - Cost benefit analysis - Digital storage - Graph algorithms - Graphic methods - Image segmentation - Models - Professional aspects - Software engineering

摘要：Time complexity of an algorithm is closely related to its implement method. In order to make the time complexity analysis more universal in engineering, the Operator Cost Model (OCM) was proposed and used for analyzing the Graph-Based Segmentation Algorithm (GBSA) in this paper. The OCM is to be used for time complexity analysis of GBSA by extracting the cost of operating operators with inherent characteristics that are unrelated to the microprocessor system. Meanwhile, the influence of the control factor k to the operator consumption is also analyzed qualitatively. The relationship between k and OCM was discussed, which provides some help for the application of GBSA in practical engineering. ? 2013 Springer-Verlag.