Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7883))

Abstract

We propose a method for accelerating the computation of fuzzy connectedness. The method is based on a precomputation step – the construction of a supervertex graph whose vertices are clusters of image elements. By constructing this supervertex graph in a specific way, we can perform the bulk of the fuzzy connectedness computations on this graph, rather than on the original image, while guaranteeing exact results. Typically, the number of nodes in the supervertex graph is much smaller than the number of elements in the image, and thus less computation is required. In an experiment, we demonstrate the ability of the proposed method to accelerate the computation of fuzzy connectedness considerably.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ciesielski, K.C., Udupa, J.K.: Affinity functions in fuzzy connectedness based image segmentation i: Equivalence of affinities. Computer Vision and Image Understanding 114(1), 146–154 (2010)

    Article  Google Scholar 

  2. Ciesielski, K.C., Udupa, J.K.: Affinity functions in fuzzy connectedness based image segmentation ii: Defining and recognizing truly novel affinities. Computer Vision and Image Understanding 114(1), 155–166 (2010)

    Article  Google Scholar 

  3. Falcão, A.X., Bergo, F.P.G.: Interactive volume segmentation with differential image foresting transforms. IEEE MI 23(9), 1100–1108 (2004)

    Google Scholar 

  4. Nyúl, L.G., Falcão, A.X., Udupa, J.K.: Fuzzy-connected 3D image segmentation at interactive speeds. Graph. Models 64(5), 259–281 (2002)

    Article  MATH  Google Scholar 

  5. Soille, P., Najman, L.: On morphological hierarchical representations for image processing and spatial data clustering. In: Köthe, U., Montanvert, A., Soille, P. (eds.) WADGMM 2010. LNCS, vol. 7346, pp. 43–67. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Udupa, J.K., Samarasekera, S.: Fuzzy connectedness and object definition: Theory, algorithms, and applications in image segmentation. Graphical Models and Image Processing 58(3), 246–261 (1996)

    Article  Google Scholar 

  7. Zhuge, Y., Cao, Y., Miller, R.W.: GPU accelerated fuzzy connected image segmentation by using CUDA. In: Engineering in Medicine and Biology Society, EMBC 2009. Annual International Conference of the IEEE, pp. 6341–6344 (2009)

    Google Scholar 

  8. Zhuge, Y., Udupa, J.K., Saha, P.K.: Vectorial scale-based fuzzy-connected image segmentation. Computer Vision and Image Understanding 101(3), 177–193 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malmberg, F., Strand, R. (2013). Faster Fuzzy Connectedness via Precomputation. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2013. Lecture Notes in Computer Science, vol 7883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38294-9_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38294-9_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38293-2

  • Online ISBN: 978-3-642-38294-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics