全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

基于RB-K平均带宽设定的AdaptiveMeanshift

DOI: 10.11834/jig.20060484

Keywords: Mean,shift,K平均,图像分割,图像滤波

Full-Text   Cite this paper   Add to My Lib

Abstract:

Meanshift是一个用在图像滤波、图像分割中的迭代过程。对于迭代过程,带宽的设定很重要。固定带宽的Meanshift方法对于输入数据适应能力差,而现有可变带宽估计方法有的对于固定带宽的方法改进并不明显,有的时间复杂度较高,因此对现有带宽估计方法做了改进,提出了一种新的带宽估计方法,即采用K平均聚类算法进行带宽估计,并通过实验证实了该方法的有效性。

References

[1]  Keinosuke Fukunaga,Larry D Hosteler.The estimation of the gradient of a density function with applications in pattern recognition[J].IEEE Transactions on information theory,1975,21 (1):32 ~ 40.
[2]  Bogdan Georgescu,Ilan Shimshoni,Peter Meer.Mean shift based clustering in high dimensions a texture classification example[A].In:Proceedings of Ninth IEEE International Conference on Computer Vision[C],Nice,France,2003,1:13 ~ 16.
[3]  Beckmann N,Kriegel H-P,Schneider R,et al.The R*-tree:an efficient and robust access method for points and rectangles[A].In:Proceedings of ACM SIGMOD Int\' l.Conference on Management of Data[C],Atlantic City,New Jersey,US,1990:322 ~331.
[4]  Zhao Ying,George Karypis.Criterion Functions for Document Clustering Experiments and Analysis[R].Minneapolis,Minnesota,USA:Department of Computer Science & Eng University of Minnesota,2001:1 ~ 40.
[5]  Michael Steinbach,George Karypis,Vipin Kumar.A Comparison of Document Clustering Techniques[R].Minneapolis,Minnesota,USA:Department of Computer Science & Eng University of Minneasota,2000:8 ~ 20.
[6]  Cheng Yi-zong.Mean shift,mode seeking,and clustering[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1998,17(8):790~799.
[7]  Dorin Comaniciu,Peter Meer.Mean shift analysis and applications[A].In:Proceedings of IEEE International Conference Computer Vision[C],Kerkyra,Greece,1999:1197 ~ 1203.
[8]  Dorin Comaniciu,Visvanathan Ramesh,Peter Meer.The variable bandwidth mean shift and data-driven scale selection[A].In:Proceedings of International Conference on Computer Vision (ICCV\'01)[C],Vancouver,BC,Canada,2001,1:438 ~ 445.
[9]  Guttman A.R-Trees:A dynamic index structure for spatial searching[A].In:Proceedings of ACM SIGMOD[C],Boston,USA,1984:47 ~57.
[10]  Stefan Berchtold,Daniel A Keim,Hans-Peter Kriegel.The X-tree:an index structrue for high-dimensional data[A].In:Proceedings of the 22nd VLDB Conference[C],Mumbai,India,1996:28 ~ 39.
[11]  Zhao Ying,George Karypis.Evaluation of hierarchical clustering algorithms for document dataSet[A].In:Proceedings of the Eleventh International Conference on Information and Knowledge Management[C],McLean,Virginia,USA:ACM Press,2002:515 ~ 524.
[12]  Cheng H D,Jiang X H,Sun Y,et al.Color image segmentation:advances and prospects[J].Pattern Recognition,2001,34 (12):2259 ~ 2281.
[13]  Chirs M.Christoudias,Bogdan Georgecu.EDISON[CP/OL],http://www.caip.rutgers.edu/riul/research/code/EDISON/,2005-11-20.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133