Advertisement

A Segmentation Algorithm for Noisy Images

  • Soufiane Rital
  • Hocine Cherifi
  • Serge Miguet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3691)

Abstract

This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a partition of a weighted image neighborhood hypergraph. To overcome the computational difficulty of directly solving this problem, a multilevel hypergraph partitioning has been used. To evaluate the algorithm, we have studied how noise affects the performance of the algorithm. The α-stable noise is considered and its effects on the algorithm are studied.

Keywords

graph hypergraph neighborhood hypergraph multilevel hypergraph partitioning image segmentation and noise removal 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intellignece 22 (2000)Google Scholar
  2. 2.
    Martinez, A.M., Mittrapiyanuruk, P., Kak, A.C.: On combining graph-partitioning with non-parametric clustering for image segmentation. Computer Vision and Image Understanding 95, 72–85 (2004)CrossRefGoogle Scholar
  3. 3.
    Wang, S., Siskind, J.M.: Image segmentation with ratio cut - supplemental material. IEEE Trans. Pattern Anal. Mach. Intell. 25 (2003)Google Scholar
  4. 4.
    Catalyurek, U., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10, 673–693 (1999)CrossRefGoogle Scholar
  5. 5.
    Ihler, E., Wagner, D., Wagner, F.: Modeling hypergraphs by graphs with the same mincut properties. Inf. Process. Lett. 45, 171–175 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Sanchis, L.A.: Multiple-way network partitioning. IEEE Transactions on Computers 38(1), 62–81 (1989)Google Scholar
  7. 7.
    Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in vlsi domain. IEEE Trans. Very Large Scale Integr. Syst. 7, 69–79 (1999)CrossRefGoogle Scholar
  8. 8.
    Karypis, G., Kumar, V.: hmetis 1.5: A hypergraph partitioning package. Technical report, University of Minnesota (1998), Available on, http://www.cs.umn.edu/hmetis
  9. 9.
    Trifunovic, A., Knottenbelt, W.J.: Parkway 2.0: A parallel multilevel hypergraph partitioning tool. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 789–800. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Soufiane Rital
    • 1
  • Hocine Cherifi
    • 2
  • Serge Miguet
    • 1
  1. 1.LIRIS CNRSLyon II UniversityLyonFrance
  2. 2.LIRSIAUniversity of BourgogneDijonFrance

Personalised recommendations