全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于熵的两区域图像分割

DOI: 10.11834/jig.20110510

Keywords: 图像分割熵,迭代图切

Full-Text   Cite this paper   Add to My Lib

Abstract:

图像分割在多媒体,图像处理,计算机视觉领域扮演着重要角色。提出了基于图像分割熵的二区域图像分割方法。首先,根据熵的特性:单个随机变量所对应的熵越大,所包含的信息量越大,图像是单一区域时,所含的信息量(熵)较小,引入图像分割熵(ISE)测度,用于度量两区域图像分割准确程度,将两区域图像分割问题转化成ISE最小值问题。然后,采用迭代图切(graphcut)算法给出ISE最小值问题的近似解,实现二区域图像分割。实验结果表明,基于图像分割熵的二区域图像分割方法是可行有效的。

References

[1]  Zhang Zhengjun;Zhu Yaoqin,Estimating the image segmentation number via the entropy gap statistic,Washington,DC,USA; IEEE Computer Society,2009.
[2]  Collignon A;Maes M;Delaere D,Automated multi-modality image registration based on information theory,Dordrecht:kluwer Academic Publishers,1995.
[3]  Viola P;Wells W M,Alignment by maximization of mutual information,Washington,DC,USA:IEEE Computer Society,1995.
[4]  Plulm J P W;Maintz J B A;Viergever M A,Mutual-information-based registration of medical images:a survey,IEEE Trans Med lmag? ,2003, 22(08).
[5]  N R Pal;S K Pal,Entropy thresholding,Signal Processing? ,1989, 16(02).
[6]  Kapur J N;Sahoo P K;Wong A K C,A new method for gray level picture thresholding using the entropy histogram,Computer Vision Graphics and Image,1985(03).
[7]  Zhu SC. ;Mumford D. ;Wu YN.,Filters, random fields and maximum entropy (FRAME): Towards a unified theory for texture modeling,International Journal of Computer Vision?,1998, 27(2).
[8]  Greig D M;Porteous B T;Sehenlt A H,Exact maximum a posterious estimation for binary images,Journal of the Royal Statistical Society,Series B:Statistical Methodology,1985(02).
[9]  Unal G;Yezzi A;Krim H,Information-theoretic active polygons for unsupervised texture segmentation,International Journal of Computer Vision,2005(03).
[10]  Kim J;Fisher J W;Yezzi A,A nonparametric statistical method for image segmentation using information theory and curve envolution,IEEE Transactions on Image Processing,2005(10).
[11]  Deng Y;Manjunath B S,Unsupervised segmentation of color-texture regions in images and video,IEEE Transactions on Pattern Analysis and Machine Intelligence? ,2001, 23(08).
[12]  Kolmogorov V;Zabih R,What energy functions can be minimized via graph cuts,IEEE Transactions on Pattern Analysis and Machine Intelligence,2004(02).
[13]  Boykov Y;Jolly M P,An Experimental Comparison of Min-Cut/Max-Cut Algorithms for Energy Minimization in Computer Vision,IEEE Transactions on Pattern Analysis and Machine Intelligence? ,2004,.
[14]  BOYKOV Y;VEKSLER O;ZABIH R,Fast approximate energy minimization via graph cuts,其它? ,2005,.
[15]  Rother, C ;Kolmogorov, V ;Blake, A,"GrabCut" - Interactive foreground extraction using iterated graph cuts,ACM Transactions on Graphics?,2004, 23(3).
[16]  Boykov Y;Kolmogorov V,Interactive graph cuts for optimal boundary & region segmenttation of objects in N-D Images,Washington DC USA:IEEE Computer Society,2001.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133