2011 03 v.16;No.87 1-5+13
图像阈值分割技术中的部分和算法综述
基金项目(Foundation):
国家自然科学基金资助项目(60572133);;
陕西省教育厅专项科研计划基金资助项目(09JK731,2010JK820);;
西安邮电学院中青年科研基金资助项目(ZL2009-16)
邮箱(Email):
DOI:
10.13682/j.issn.2095-6533.2011.03.036
中文作者单位:
西安邮电学院通信与信息工程学院;西安邮电学院自动化学院;
摘要(Abstract):
分析图像阈值分割技术在理论改进与实际应用过程中所面临的瓶颈问题,寻找解决问题的切入点。从提高算法效率的角度,以熵阈值法和Otsu阈值法为例,通过分类对比并结合理论综述,整理发掘出部分和算法研究对于阈值分割技术的作用和意义。与部分和问题相融合,是阈值分割技术未来的研究方向和重点。
关键词(KeyWords):
图像分割;;部分和问题;;阈值技术
| 2,026 | 143 | 59 |
| 下载次数 | 被引频次 | 阅读次数 |
参考文献
[1]Sahoo P K,Soltani S,Wong A K C.A survey ofthresholding techniques[J].Computer Vision,Graph-ics and I mage Process,1988,41(2):233-260.
[2]Pal N R,Pal S K,A review on i mage segmentationtechniques[J].Pattern Recognition Letters,1993,26(9):1277-1294.
[3]Sezgin M,Sankur B.Survey over i mage thresholdingtechniques and quantitative performance evaluation[J].Journal of Electronic I maging,2004,13(1):146-156.
[4]Pun T.Entropic thresholding,A new approach[J].Computer Graphics and I mage Processing,1981,16(3):210-239.
[5]Kapur J N,Sahoo P K,Wong A K C.Anew methodfor graylevel picture thresholding using the entropy ofthe histogram[J].Computer Vision,Graphics,andI mage Processing,1985,29(3):273-285.
[6]Pal N R,Pal S K.Entropic thresholding[J].SignalProcess,1989,16(2):97-108.
[7]Otsu N.Athreshold selection method from gray-levelhistograms[J].IEEE Transactions on Systems,Manand Cybernetics,1979,9(1):62-65.
[8]吴一全,朱兆达.图像处理中阈值选取方法30年(1962-1992)的进展(一)[J].数据采集与处理,1993,9(3):193-201.
[9]吴一全,朱兆达.图像处理中阈值选取方法30年(1962-1992)的进展(二)[J].数据采集与处理,1993,9(4):268-281.
[10]Kao Ming-Yang(Ed.).Encyclopedia of Algorithms[M].Springer-Verlag,2008.
[11]Chazelle B.Computational geometry:A retrospective[C]//Proceedings of 26th ACM Symposium on theTheory of Computing,1994,75-94.
[12]US National Archives and Records Administration.Astatistical test suite for random and pseudorandomnumber generators for cryptographic applications[R].NIST Special Publication,2008.
[13]Bentley J L.Multidi mensional Divide-and-Conquer[J].Communications of the ACM,1980,23(4):214-229.
[14]Fredman ML.The complexity of maintaining an arrayand computing its partial sums[J].Journal of theACM,1982,29(1):250-260.
[15]Yao A C.On the complexity of maintaining partialsums[J].SIAMJournal on Computing,1985,14(2):277-288.
[16]Fredman M L,Saks M E.The cell probe complexityof dynamic data structures[C]//Proceedings of 21thACMSymposiumon the Theory of Computing,1989,345-354.
[17]Chazelle B,Rosenberg B.The complexity of computingpartial sums off-line[J].International Journal of Compu-tational Geometry and Applications,1991,1(1):33-45.
[18]Hampapuram H,Fredman M L.Opti mal bi weightedbinary trees and the complexity of maintaining partialsums[J].SIAMJournal on Computing,1998,28(1):1-9.
[19]Ben-Amram A M,Galil Z.Ageneralization of a lowerbound technique due to Fredman and Saks[J].Algo-rithmica,2001,30(1):34-66.
[20]Patrascu M,Demaine E D.Tight bounds for the par-tial-sums problem[C]//Proceedings of the 15th An-nual ACM-SIAMSymposiumon Discrete Algorithms,2004:20-29.
[21]Sahoo P,Wilkins C,Yeager J.Threshold selection u-sing Renyi’s entropy[J].Pattern Recognition,1997,30(1):71-84.
[22]Portes de Albuquerque M,Esquef A,Gesualdi MelloaA R,Portes de Albuquerque M.I mage thresholdingusing Tsallis entropy[J].Pattern Recognition Let-ters,2004,25(9):1059-1065.
[23]Abutaleb A S.Automatic thresholding of gray-levelpictures using two-di mensional entropy[J].ComputerVision,Graphics,and I mage Processing,1989,47(1)22-32.
[24]Brink A D.Thresholding of digital i mages using two-di mensional entropies[J].Pattern Recognition,1992,25(8):803-808.
[25]Sahoo P K,Arora G.Athresholding method based ontwo-di mensional Renyi’s entropy[J].Pattern Recog-nition,2004,37(6):1149-1161.
[26]Sahoo P.K,Arora G.I mage thresholding using two-di mensional Tsallis-Havrda-Charvót entropy[J].Pat-tern Recognition,2006,27(6):520-528.
[27]金立左,袁晓辉,赵一凡,夏良正.二维模糊划分最大熵图像分割算法[J].电子与信息学报,2002,24(8):1040-1048.
[28]Gong Jian,Li Liyuan,Chen Weinan.Fast recursivealgorithmfor two-di mensional thresholding[J].Pat-tern Recognition,1998,31(3):295-300.
[29]Wu Xuejing,Zhang Yijun,Xia Liangzheng.Afast re-curring two-di mensional entropic thresholding algo-rithm[J].Pattern Recognition,1999,32(2):2055-2061.
[30]刘健庄,粟文青.灰度图像的二维Otsu自动阈值分割法[J].自动化学报,1993,19(1):101-105.
[31]景晓军,李剑峰,刘郁林.一种基于三维最大类间方差的图像分割算法[J].电子学报,2003,31(9):1281-1285.
[32]Fan Jiulun,Zhang Xuefeng,Zhao Feng.Three-di men-sion maxi mum Between-Cluster variance i mage seg-mentation method based on chaotic opti mization[C]//Lecture Notes in Computer Science 4222,Springer,2006:164-173.
[33]范九伦,赵凤,张雪锋.三维Otsu阈值分割方法的递推算法[J].电子学报,2007,35(7):1398-1402.
[34]Wang Lei,Duan Huichuan,Wang Jinling.Afast al-gorithmfor three-di mensional Otsu’s thresholding-method[C]//IEEE International Symposiumon ITinMedicine and Education,2008:136-140.
[35]Wang Na,Li Xia,Chen Xiaohong.Fast three-di men-sional Otsu thresholding with shuffled frog-leaping al-gorithm[J].Pattern Recognition Letters,2010,31(13):1809-1815.
[36]Xie Xie,Jiu-Lun Fan,Yin Zhu.The Opti mal All-Par-tial-Sums Algorithmin Commutative Semigroups andIts Applications for I mage Thresholding Segmentation[J].Theoretical Computer Science,2011,412(15):1415-1429.
[37]Burgisser P,Clausen M,Shokrollahi MA,Lickteig T.Al-gebraic Complexity Theory[M].Springer-Verlag,1997.
[2]Pal N R,Pal S K,A review on i mage segmentationtechniques[J].Pattern Recognition Letters,1993,26(9):1277-1294.
[3]Sezgin M,Sankur B.Survey over i mage thresholdingtechniques and quantitative performance evaluation[J].Journal of Electronic I maging,2004,13(1):146-156.
[4]Pun T.Entropic thresholding,A new approach[J].Computer Graphics and I mage Processing,1981,16(3):210-239.
[5]Kapur J N,Sahoo P K,Wong A K C.Anew methodfor graylevel picture thresholding using the entropy ofthe histogram[J].Computer Vision,Graphics,andI mage Processing,1985,29(3):273-285.
[6]Pal N R,Pal S K.Entropic thresholding[J].SignalProcess,1989,16(2):97-108.
[7]Otsu N.Athreshold selection method from gray-levelhistograms[J].IEEE Transactions on Systems,Manand Cybernetics,1979,9(1):62-65.
[8]吴一全,朱兆达.图像处理中阈值选取方法30年(1962-1992)的进展(一)[J].数据采集与处理,1993,9(3):193-201.
[9]吴一全,朱兆达.图像处理中阈值选取方法30年(1962-1992)的进展(二)[J].数据采集与处理,1993,9(4):268-281.
[10]Kao Ming-Yang(Ed.).Encyclopedia of Algorithms[M].Springer-Verlag,2008.
[11]Chazelle B.Computational geometry:A retrospective[C]//Proceedings of 26th ACM Symposium on theTheory of Computing,1994,75-94.
[12]US National Archives and Records Administration.Astatistical test suite for random and pseudorandomnumber generators for cryptographic applications[R].NIST Special Publication,2008.
[13]Bentley J L.Multidi mensional Divide-and-Conquer[J].Communications of the ACM,1980,23(4):214-229.
[14]Fredman ML.The complexity of maintaining an arrayand computing its partial sums[J].Journal of theACM,1982,29(1):250-260.
[15]Yao A C.On the complexity of maintaining partialsums[J].SIAMJournal on Computing,1985,14(2):277-288.
[16]Fredman M L,Saks M E.The cell probe complexityof dynamic data structures[C]//Proceedings of 21thACMSymposiumon the Theory of Computing,1989,345-354.
[17]Chazelle B,Rosenberg B.The complexity of computingpartial sums off-line[J].International Journal of Compu-tational Geometry and Applications,1991,1(1):33-45.
[18]Hampapuram H,Fredman M L.Opti mal bi weightedbinary trees and the complexity of maintaining partialsums[J].SIAMJournal on Computing,1998,28(1):1-9.
[19]Ben-Amram A M,Galil Z.Ageneralization of a lowerbound technique due to Fredman and Saks[J].Algo-rithmica,2001,30(1):34-66.
[20]Patrascu M,Demaine E D.Tight bounds for the par-tial-sums problem[C]//Proceedings of the 15th An-nual ACM-SIAMSymposiumon Discrete Algorithms,2004:20-29.
[21]Sahoo P,Wilkins C,Yeager J.Threshold selection u-sing Renyi’s entropy[J].Pattern Recognition,1997,30(1):71-84.
[22]Portes de Albuquerque M,Esquef A,Gesualdi MelloaA R,Portes de Albuquerque M.I mage thresholdingusing Tsallis entropy[J].Pattern Recognition Let-ters,2004,25(9):1059-1065.
[23]Abutaleb A S.Automatic thresholding of gray-levelpictures using two-di mensional entropy[J].ComputerVision,Graphics,and I mage Processing,1989,47(1)22-32.
[24]Brink A D.Thresholding of digital i mages using two-di mensional entropies[J].Pattern Recognition,1992,25(8):803-808.
[25]Sahoo P K,Arora G.Athresholding method based ontwo-di mensional Renyi’s entropy[J].Pattern Recog-nition,2004,37(6):1149-1161.
[26]Sahoo P.K,Arora G.I mage thresholding using two-di mensional Tsallis-Havrda-Charvót entropy[J].Pat-tern Recognition,2006,27(6):520-528.
[27]金立左,袁晓辉,赵一凡,夏良正.二维模糊划分最大熵图像分割算法[J].电子与信息学报,2002,24(8):1040-1048.
[28]Gong Jian,Li Liyuan,Chen Weinan.Fast recursivealgorithmfor two-di mensional thresholding[J].Pat-tern Recognition,1998,31(3):295-300.
[29]Wu Xuejing,Zhang Yijun,Xia Liangzheng.Afast re-curring two-di mensional entropic thresholding algo-rithm[J].Pattern Recognition,1999,32(2):2055-2061.
[30]刘健庄,粟文青.灰度图像的二维Otsu自动阈值分割法[J].自动化学报,1993,19(1):101-105.
[31]景晓军,李剑峰,刘郁林.一种基于三维最大类间方差的图像分割算法[J].电子学报,2003,31(9):1281-1285.
[32]Fan Jiulun,Zhang Xuefeng,Zhao Feng.Three-di men-sion maxi mum Between-Cluster variance i mage seg-mentation method based on chaotic opti mization[C]//Lecture Notes in Computer Science 4222,Springer,2006:164-173.
[33]范九伦,赵凤,张雪锋.三维Otsu阈值分割方法的递推算法[J].电子学报,2007,35(7):1398-1402.
[34]Wang Lei,Duan Huichuan,Wang Jinling.Afast al-gorithmfor three-di mensional Otsu’s thresholding-method[C]//IEEE International Symposiumon ITinMedicine and Education,2008:136-140.
[35]Wang Na,Li Xia,Chen Xiaohong.Fast three-di men-sional Otsu thresholding with shuffled frog-leaping al-gorithm[J].Pattern Recognition Letters,2010,31(13):1809-1815.
[36]Xie Xie,Jiu-Lun Fan,Yin Zhu.The Opti mal All-Par-tial-Sums Algorithmin Commutative Semigroups andIts Applications for I mage Thresholding Segmentation[J].Theoretical Computer Science,2011,412(15):1415-1429.
[37]Burgisser P,Clausen M,Shokrollahi MA,Lickteig T.Al-gebraic Complexity Theory[M].Springer-Verlag,1997.
基本信息:
DOI：10.13682/j.issn.2095-6533.2011.03.036
中图分类号:TP391.41
引用信息:
[1]谢勰,王辉,张雪锋.图像阈值分割技术中的部分和算法综述[J].西安邮电学院学报,2011,16(03):1-5+13.DOI:10.13682/j.issn.2095-6533.2011.03.036.
基金信息:
国家自然科学基金资助项目(60572133);; 陕西省教育厅专项科研计划基金资助项目(09JK731,2010JK820);; 西安邮电学院中青年科研基金资助项目(ZL2009-16)
暂无数据