Skip to main content

Part of the book series: Computational Imaging and Vision ((CIVI,volume 18))

Abstract

This paper discusses region-based representations useful to create connected operators. The filtering approach involves three steps: first, a region tree representation of the input image is constructed. Second, the simplification is obtained by pruning the tree and third, and output image is constructed from the pruned tree. The paper focuses in particular on several pruning strategies that can be used on tree representation.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. L. Garrido, P. Salembier, and D. Garcia. Extensive operators in partition lattices for image sequence analysis. Signal Processing, 66(2):157–180, April 1998.

    Article  Google Scholar 

  2. F. Meyer. The levelings. In Fourth Int. Symposium on Mathematical Morphology, pages 199–206, Amsterdam, The Netherlands, June 1998. Kluwer.

    Google Scholar 

  3. O. Morris, M. Lee, and A. Constantinides. Graph theory for image analysis: an approach based on the shortest spanning tree. IEE Proceedings, F, 133(2):146–152, April 1986.

    Google Scholar 

  4. P. Salembier, and L. Garrido. Binary partition tree as an efficient representation for image processing, segmentation and information retrieval. IEEE Trans. on Image Processing, April, 2000.

    Google Scholar 

  5. P. Salembier, A. Oliveras, and L. Garrido. Anti-extensive connected operators for image and sequence processing. IEEE Trans. on Image Processing, 7(4):555–570, April 1998.

    Article  Google Scholar 

  6. J. Serra and P. Salembier. Connected operators and pyramids. In SPIE Image Algebra. and Mathematical Morphology, Vol. 2030, pp. 65–76, San Diego (CA), USA, July 1993.

    MathSciNet  Google Scholar 

  7. L. Vincent. Morphological gray scale reconstruction in image analysis: Applications and efficient algorithms. IEEE Trans. on Image Processing, 2(2):176–201, April 1993.

    Article  MATH  Google Scholar 

  8. L. Vincent. Grayscale area openings and closings, their efficient implementation and applications, First Workshop on Mathematical Morphology and its Applications to Signal. Processing, pp. 22–27, Barcelona, Spain, May 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic/Plenum Publishers

About this chapter

Cite this chapter

Salembier, P., Garrido, L. (2002). Connected Operators Based on Region-Tree Pruning. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-306-47025-X_19

Download citation

  • DOI: https://doi.org/10.1007/0-306-47025-X_19

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7862-4

  • Online ISBN: 978-0-306-47025-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics