Mean Shift with Flatness Constraints

  • Eduard Sojka
  • Milan Šurkala
  • Jan Gaura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7944)


Mean shift still belongs to the intensively developed image-segmentation methods. Appropriately setting so called bandwidth, which is richly discussed in literature, seems to be one of its problems. If the bandwidth is too small, the results suffer from over-segmentation. If it is too big, the edges need not be preserved sufficiently and the details can be lost. In this paper, we address the problem of over-segmentation and preserving the edges in mean shift too. However, we do not aim at proposing a further method for determining the bandwidth. Instead, we modify the mean-shift method itself. We show that the problems with over-segmentation are inherent for mean shift and follow from its theoretical essence. We also show that the mean-shift process can be seen as a process of solving a certain Euler-Lagrange equation and as a process of maximising a certain functional. In contrast with other known functional approaches, however, only the fidelity term is present in it. Other usual terms, e.g., the term requiring a short length of boundaries between the segments or the term requiring the flatness (in intensity) of the corresponding filtered image are not present, which explains the behaviour of mean shift. On the basis of this knowledge, we solve the problems with mean shift by modifying the functional. We show how the new functional can be maximised in practice, and we also show that the usual mean-shift algorithm can be regarded as a special case of the method we propose. The experimental results are also presented.


Mean-shift image segmentation mean-shift image filtering 


  1. 1.
    Carreira-Perpiñán, M.: Fast Nonparametric Clustering with Gaussian Blurring Mean-Shift. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, pp. 153–160. ACM, New York (2006)Google Scholar
  2. 2.
    Cheng, Y.: Mean Shift, Mode Seeking, and Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence 17, 790–799 (1995)CrossRefGoogle Scholar
  3. 3.
    Comaniciu, D., Meer, P.: Mean Shift Analysis and Applications. In: Proceedings of the International Conference on Computer Vision, vol. 2, pp. 1197–1203 (1999)Google Scholar
  4. 4.
    Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach Toward Feature Space Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(5), 603–619 (2002)CrossRefGoogle Scholar
  5. 5.
    Comaniciu, D.: An Algorithm for Data-Driven Bandwidth Selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 281–288 (2003)CrossRefGoogle Scholar
  6. 6.
    Comaniciu, D., Ramesh, V., Meer, P.: The Variable Bandwidth Mean Shift and Data-Driven Scale Selection. In: IEEE International Conference on Computer Vision, vol. 1, pp. 438–445. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  7. 7.
    Comaniciu, D., Ramesh, V., Meer, P.: Kernel-Based Object Tracking. IEEE Trans. Pattern Anal. Mach. Intell. 25, 564–575 (2003)CrossRefGoogle Scholar
  8. 8.
    DeMenthon, D., Megret, R.: Spatio-Temporal Segmentation of Video by Hierarchical Mean Shift Analysis. Tech. Rep. LAMP-TR-090,CAR-TR-978,CS-TR-4388,UMIACS-TR-2002-68, University of Maryland, College Park (2002)Google Scholar
  9. 9.
    Elad, M.: On the Origin of the Bilateral Filter and Ways to Improve It. IEEE Transactions on Image Processing 11(10), 1141–1151 (2002)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Fukunaga, K., Hostetler, L.: The Estimation of the Gradient of a Density Function, with Applications in Pattern Recognition. IEEE Transactions on Information Theory 21(1), 32–40 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Mrázek, P., Weickert, J., Bruhn, A.: On Robust Estimation and Smoothing with Spatial and Tonal Kernels. In: Proceedings of Dagstuhl Seminar: Geometric Properties from Incomplete Data, pp. 1–17 (2004)Google Scholar
  12. 12.
    Rao, S., de Medeiros Martins, A., Príncipe, J.C.: Mean Shift: An Information Theoretic Perspective. Pattern Recogn. Lett. 30(3), 222–230 (2009)CrossRefGoogle Scholar
  13. 13.
    Tomasi, C., Manduchi, R.: Bilateral Filtering for Gray and Color Images. In: Proceedings of the Sixth International Conference on Computer Vision, ICCV 1998, pp. 839–846. IEEE Computer Society, Washington, DC (1998)Google Scholar
  14. 14.
    Vatturi, P., Wong, W.K.: Category Detection Using Hierarchical Mean Shift. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 847–856. ACM, New York (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Eduard Sojka
    • 1
  • Milan Šurkala
    • 1
  • Jan Gaura
    • 1
  1. 1.Faculty of Electrical Engineering and Computer ScienceVŠB - Technical University of OstravaOstrava-PorubaCzech Republic

Personalised recommendations