检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学机电工程学院智能控制与图像工程研究所,陕西西安710071
出 处:《系统工程与电子技术》2009年第12期2998-3001,共4页Systems Engineering and Electronics
基 金:国家自然科学基金(60572152)资助课题
摘 要:基于图切割的图像分割是近几年发展的一项新技术,但随着图像大小及空间维数的增加,图切割的运算量成为负担。针对运动分割提出了一种快速图切割方法,利用运动分割的特点将差分图像中不变的背景映射为一点或几点,然后参与网络图的构造和图切割的求解,以减少图切割运算量。通过实验将这种快速方法应用于2D图切割和3D图切割,对图像序列的运动目标分别进行了自动分割。实验结果表明,这种快速图切割方法不仅大大地降低了存储消耗,提高了运算速度,而且也获得了良好的分割结果。结果证明这种方法在运动目标的分割中是行之有效的。Image segmentation based on graph cuts is a newly developing technology in recent years. But the memory overhead and time complexity of leading algorithms result in an excessive computational burden along with the increase in the size of images and spatial dimension. A fast method of motion segmentation based on graph cuts is proposed. To speed up the computation of graph cuts, the background pixels of the difference image are mapped into one or several points to participate in the creating and solving of network graphs. Through the experiments of 2D and 3D graph cuts, the fast method is applied to segment motion objects automatically in 2D image sequence and 3D spatio-temporal volume. The results of experiments show that this method reduces both the running time and the memory consumption of graph cuts while producing nearly the same segmentation result as the general graph cuts. It is showed that the method is fast and effective in motion segmentation.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.69