Skip to main content

Hypergraph-Based Image Representation

  • Conference paper

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

Abstract

An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems of operational research and combinatorial optimization. Hypergraphs are now used in many domains such as chemistry, engineering and image processing. We present an overview of a hypergraph-based picture representation giving much application in picture manipulation, analysis and restoration: the Image Adaptive Neighborhood Hypergraph (IANH). With the IANH it is possible to build powerful noise detection an elimination algorithm, but also to make some edges detection or some image segmentation. IANH has various applications and this paper presents a survey of them.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bretto, A., Azema, J., Cherifi, H., Laget, B.: Combinatoric and image processing. Computer Vision, Graphic and Image Processing (Graphical Model and Image Processing) 59(5), 128–132 (1997)

    Google Scholar 

  2. Bretto, A.: Introduction to Hypergraph Theory and its Applications to Image Processing. Mongraphy in: Advances in Imaging and Electron Physics, March 2004, vol. 131. Academic Press/Elsevier (2004)

    Google Scholar 

  3. Bretto, A., Gillibert, L.: Hypergraph Lossless Image Compression, preprint (submited to ITCC)

    Google Scholar 

  4. Chastel, S., Colantoni, P., Bretto, A.: Displaying Image Neighborhood Hypergraph. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, p. 124. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Bretto, A., Laget, B.: Helly property associated with the discrete planes. Southwest journal of pure and applied mathematics 1, 56–63 (1998)

    MATH  MathSciNet  Google Scholar 

  6. Rital, S., Bretto, A., Cherifi, H., Aboutajdine, D.: Application of Adaptive Hypergraph Model to Impulsive Noise Detection. In: Skarbek, W. (ed.) CAIP 2001. LNCS, vol. 2124, pp. 34–42. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Berge, C.: Graphe. Dunod (1983)

    Google Scholar 

  8. Berge, C.: Hypergraphs. North-Holland Mathematical Library (1989)

    Google Scholar 

  9. Chen, T., Wu, H.R.: Adaptive Impulse Detection Using Center Weighted Median Filters. IEEE Signal Processing Letters 8, 1–3 (2001)

    Article  Google Scholar 

  10. Chen, T., Wu, H.R.: Application of Partition-Based Median Type Filters for Suppressing Noise in Images. IEEE Transactions on Image Processing (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bretto, A., Gillibert, L. (2005). Hypergraph-Based Image Representation. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31988-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25270-2

  • Online ISBN: 978-3-540-31988-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics