THE PATH ASSIGNED MEAN SHIFT ALGORITHM: A NEW FAST MEAN SHIFT IMPLEMENTATION FOR COLOUR IMAGE SEGMENTATION

被引:11
作者
Pooransingh, Akash
Radix, Cathy-Ann
Kokaram, Anil
机构
来源
2008 15TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-5 | 2008年
关键词
Mean Shift; Fast Mean Shift; Colour Image Segmentation; Path Assigned Mean Shift;
D O I
10.1109/ICIP.2008.4711825
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a novel method for colour image segmentation derived from the mean shift theorem. When applied to colour image segmentation tasks, the path assigned mean shift algorithm performed 1.5 to 5 times faster than existing fast mean shift methods such as the Hierarchical 'Neighbourhood Consistency' FMS Method proposed by Zhang [1] with comparable results. The complexity of the new PAMS algorithm can be represented as O(phi(2)) where phi represents the total number of unassigned points per iteration of the algorithm.
引用
收藏
页码:597 / 600
页数:4
相关论文
共 11 条
[1]   MEAN SHIFT, MODE SEEKING, AND CLUSTERING [J].
CHENG, YZ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (08) :790-799
[2]  
Collins RT, 2003, PROC CVPR IEEE, P234
[3]   Mean shift: A robust approach toward feature space analysis [J].
Comaniciu, D ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (05) :603-619
[4]  
Comaniciu D., 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision, P1197, DOI 10.1109/ICCV.1999.790416
[5]  
Comaniciu D, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P438, DOI 10.1109/ICCV.2001.937550
[6]  
COMANICIU D, 2000, CVPR, V2, P142
[7]  
DEMENTHON D, 2002, P STAT METH VID PROC
[8]  
Georgescu B, 2003, NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, P456
[9]  
Yang CJ, 2003, NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, P464
[10]  
ZHANG K, 2005, COMPUTER VISION PATT, V2, P1001