The Adaptive Mean Shift (AMS) algorithm is a popular and simple non-parametric clustering approach based on Kernel Density Estimation. In this paper the AMS is reformulated in a Bayesian framework, which permits a natural generalization in several directions and is shown to improve performance. The Bayesian framework considers the AMS to be a method of obtaining a posterior mode. This allows the algorithm to be generalized with three components which are not considered in the conventional approach: node weights, a prior for a particular location, and a posterior distribution for the bandwidth. Practical methods of building the three different components are considered.
FukunagaK. and HostetlerL., The estimation of the gradient of a density function, with applications in pattern recognition, IEEE Trans Inf Theory21(1) (1975), 32–40.
ComaniciuD. and MeerP., Mean shift: A robust approach toward feature space analysis, IEEE Trans Pattern Anal and Mach Intell24(5) (2002), 603–619.
4.
MahmoodQ., ChodorowskiA., MehnertA. and PerssonM., A novel bayesian approach to adaptive mean shift segmentation of brain images, In Computer-Based Medical Systems (CBMS), 2012 25th International Symposium on (2012), pp. 1–6.
5.
MahmoodQ., ChodorowskiA., EhteshamiB.B. and PersonM., A fully automatic unsupervised segmentation framework for the brain tissues in MR images, 2014.
6.
JonesM.C., MarronJ.S. and SheatherS.J., A brief survey of bandwidth selection for density estimation, Journal of the American Statistical Association90 (1995).
7.
ShimshoniI., GeorgescuB. and MeerP., Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing). The MIT Press, (2006). The Chapter 9: Adaptive Mean Shift Based Clustering in High Dimensions.
8.
ShenC., BrooksM.J. and VanA., Den, Hengel, Fast global kernel density mode seeking: Applications to localization and tracking, IEEE Trans Image Process16(5) (2007), 1457–1469.
9.
SilvermanB.W., Density Estimation for Statistics and Data Analysis. Chapman & Hall/CRC, 1986.
10.
ComaniciuD., RameshV. and MeerP., The variable bandwidth mean shift and data-driven scale selection, In Proceedings of 8th International Conference on Computer Visionvolume 1, 2001, pp. 438–445.
11.
GeorgescuB., ShimshoniI. and MeerP., Mean shift based clustering in high dimensions: a texture classification example, In Proceedings of 9th IEEE International Conference on Computer Vision, volume 1, 2003, pp. 456–463.
12.
RenY.-Z., DomeniconiC., ZhangG. and YuG.-X., A Weighted Adaptive Mean Shift Clustering Algorithm. In SDM, 2014, pp. 794–802.
13.
YoonJ. and WilsonS.P., Improved Mean Shift AlgorithmWith Heterogeneous Node Weights, In International Conference on Pattern Recognition (ICPR)2010.
14.
ScottD.W., Multivariate Density Estimation: Theory, Practice, and Visualization, Wiley-Interscience, 1992.
15.
BradskiG.R., Computer vision face tracking for use in a perceptual user interface, In Proceedings of IEEE Workshop on Applications of Computer Vision, 1998, pp. 214–219.
DempsterA.P., LairdN.M. and RubinD.B., Maximum like-lihood from incomplete data via the em algorithm, Journal of the Royal Statistical Society, Series B39(1) (1977), 1–38.
18.
AndrieuC., de FreitasN., DoucetA. and JordanM., An introduction to mcmc for machine learning, Machine Learning50(1-2) (2003), 5–43.
19.
CasellaG. and RobertC.P., Rao-Blackwellisation of sampling schemes, Biometrika83(1) (1996), 81–94.
20.
LiuJ.S., Monte Carlo Strategies in Scientific Computing. Springer, first edition2008.
21.
AmigóE., GonzaloJ., ArtilesJ. and VerdejoF., A coparismon of extrinsic clustering evaluation metrics based on formal constraints, Inf Retr12(4) (2009), 461–486.
22.
LiuY., LiZ., XiongH., GaoX. and WuJ., Understanding of Internal Clustering Validation Measures, In Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM ’10, Washington, DC , USA, 2010, pp. 911–916.IEEE Computer Society.
23.
GeorghiadesA.S., BelhumeurP.N. and KriegmanD.J., From Few to many: Illumination cone models for face recognition under variable lighting and pose, IEEE Trans Pattern Anal and Mach Intell23 (2001), 643–660.
24.
BreitenbachM. and GrudicG.Z., Clustering through Ranking on Manifolds, In Proceedings of the 22nd international conference on Machine learning (ICML), 2005, pp. 73–80. ACM Press.
25.
CoffeyC., PozdnoukhovA. and CalabreseF., Time of arrival predictability horizons for public bus routes, In Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science, CTS ’11, New York , NY, USA, 2011, pp. 1–5. ACM.
