Skip to main content

Fast Planarity Estimation and Region Growing on GPU

  • Conference paper
Applications of Discrete Geometry and Mathematical Morphology (WADGMM 2010)

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

  • 727 Accesses

Abstract

We present a fast approximate planarity calculation implemented on a Graphic Processing Unit (GPU). The approximate planarity of an image patch is calculated by combining the output of a number of planarity filters. We also demonstrate the use of the local planarity as a criterium for region growing. This region growing is then further optimized using a parallel implementation. The sparse nature of these filters and the inherent parallelism of the filter bank allow a fast implementation on a parallel processor architecture such as the Compute Unified Device Architecture (CUDA) from nVIDIA.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. Apostoloff, N., Zelinsky, A.: Robust based lane tracking using multiple cues and particle filtering. In: IEEE Intelligent Vehicles Symposium, pp. 558ā€“563 (2003)

    Google ScholarĀ 

  2. Brimkov, V., Coeurjolly, D., Klette, R.: Digital planarity-a review. Discrete Appl. Math.Ā 155(4), 468ā€“495 (2007)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  3. Intel corporation. Threading building blocks, http://www.threadingbuildingblocks.org

  4. Khronos group. Opencl, http://www.khronos.org/opencl

  5. Kong, H., Audibert, J.-Y., Ponce, J.: General road detection from a single image. IEEE Transactions on Image ProcessingĀ 19(8), 2211ā€“2220 (2010)

    ArticleĀ  MathSciNetĀ  Google ScholarĀ 

  6. nVidia Corporation. Compute unified device architecture, http://www.nvidia.com/cuda

  7. Pratt, W.K.: Digital Image Processing, 4th edn. John Wiley & Sons, Inc. (2007)

    Google ScholarĀ 

  8. Rasmussen, C.: Texture-based vanishing point voting for road shape estimation. In: British Machine Vision Conference, pp. 470ā€“477 (2004)

    Google ScholarĀ 

  9. Rasmussen, C.: Shape-guided superpixel grouping for trail detection and tracking. In: IEEE International Conference on Intelligent Robots and Systems, pp. 4092ā€“4097 (2008)

    Google ScholarĀ 

  10. Veelaert, P.: Linear-time algorithms for region growing with applications to image and curve segmentation. In: Melter, R.A., Latecki, L.J., Wu, A.Y. (eds.) Proceedings of the SPIE Conference on Vision Geometry VI, vol.Ā 3168, pp. 76ā€“87. SPIE (1997)

    Google ScholarĀ 

  11. Veelaert, P.: Geometric constructions in the digital plane. Journal of Mathematical Imaging and VisionĀ 11, 99ā€“118 (1999)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  12. Veelaert, P.: Image segmentation with flatness filtering. In: Wiederhold, P., Barneva, R. (eds.) Progress in Combinatorial Image Analysis, vol.Ā 5852, pp. 221ā€“233. Research Publishing (2009)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heyvaert, M., Veelaert, P. (2012). Fast Planarity Estimation and Region Growing on GPU. In: Kƶthe, U., Montanvert, A., Soille, P. (eds) Applications of Discrete Geometry and Mathematical Morphology. WADGMM 2010. Lecture Notes in Computer Science, vol 7346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32313-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32313-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32312-6

  • Online ISBN: 978-3-642-32313-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics