检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Tiril P Gurholt Xuecheng Tai
机构地区:[1]Centre for Integrated Petroleum Research (CIPR)/Department of Mathematics, University of Bergen, Allegaten 41, 5007 Bergen, Norway [2]Division of Mathematical Sciences, Nanyang Technological University, SPMS-04-01, 21 Nanyang Link, Singapore 637371
出 处:《Numerical Mathematics(Theory,Methods and Applications)》2009年第4期403-420,共18页高等学校计算数学学报(英文版)
基 金:support from the Centre for Integrated Petroleum Research(CIPR),University of Bergen, Norway,and Singapore MOE Grant T207B2202;NRF2007IDMIDM002-010
摘 要:Segmentation of three-dimensional(3D) complicated structures is of great importance for many real applications.In this work we combine graph cut minimization method with a variant of the level set idea for 3D segmentation based on the Mumford-Shah model.Compared with the traditional approach for solving the Euler-Lagrange equation we do not need to solve any partial differential equations.Instead,the minimum cut on a special designed graph need to be computed.The method is tested on data with complicated structures.It is rather stable with respect to initial value and the algorithm is nearly parameter free.Experiments show that it can solve large problems much faster than traditional approaches.Segmentation of three-dimensional (3D) complicated structures is of great importance for many real applications. In this work we combine graph cut minimization method with a variant of the level set idea for 3D segmentation based on the MumfordShah model. Compared with the traditional approach for solving the Euler-Lagrange equation we do not need to solve any partial differential equations. Instead, the minimum cut on a special designed graph need to be computed. The method is tested on data with complicated structures. It is rather stable with respect to initial value and the algorithm is nearly parameter free. Experiments show that it can solve large problems much faster than traditional approaches.
关 键 词:Piecewise constant level set method energy minimization graph cut SEGMENTATION three-dimensional.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术] TN911.73[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229