Abstract
Graph-based structures are commonplace in image processing. Our contribution in this article consists in giving hints representing a new modeling of digital images: image neighborhood hypergraphs. We give some results on the hyperedges coloring of them. We also describe techniques we used to display image neighborhood hypergraphs line-graphs. These techniques form the basis of a tool that allows the exploration of these structures. In addition, this tool can be used to visualize, explore and describe features of image regions of interest such as object edges or noise.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Bollobás Modern Graph Theory, Springer-Verlag, (1998).
C. Berge, “Introduction à la théorie des hypergraphes”, Les Presses de l’Université de Montréal, (1973)
C. Berge, “Graphs”. North Holland, (1987).
C. Berge, “Hypergraphs”. North Holland, (1989).
I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo, The maximum clique problem, http://www.dsi.unive.it/ pelillo/papers/tr99-1.ps.gz, (1999).
A. Bretto, J. Azema, H. Cherifi, and B. Laget, Combinatorics and image processing in “Computer Vision Graphic in Image Processing”, 59, (5), September, (1997) 265–277.
A. Bretto, and H. Cherifi, A noise cancellation algorithm based on hypergraph modeling in “IEEE Workshop on Digital Signal Processing” (1996) 1–4.
A. Bretto, and H. Cherifi, Noise detection and cleaning by hypergraph model in “IEEE Computer Sciences” International Symposium on Information Technology: Coding and computing, IEEE Computer Sciences, (2000) 416–419.
A. Bretto and S. Chastel, A note on valued polyominoes hypergraph image modeling, International Journal of Computational and Numerical Analysis and Applications, to appear.
S. Chastel, A. Bretto, and H. Cherifi, Image neighborhood hypergraph model and edge detection in “JCIS Proceedings” 3, Association for Intelligence Machinery, (1998), 272–275.
J. P. Cocquerez and S. Philipp, Analyse d’images: filtrage et segmentation, Enseignement de la physique, Masson, (1995).
T.K. Dey, H. Edelsbrunner, S. Guha “Computational topology”, Technical report, (1998).
R. Diestel, “Graph Theory”, Graduate Text in Mathematics, Springer-Verlag, (1997).
M. Gondran, and M. Minoux, “Graphs and Algorithms” Wiley, Chichester, (1984).
I. Hoyler, The NP-completeness of edge coloring, SIAM J. Comput., 10: 718–720, (1981)
J. Jing-Ying, Multilevel Median Filter Based on Fuzzy Decision in “IEEE Trans. Image Processing”, 4: 680–682, (1995)
D. Leven and Z. Galil, NP-completeness of finding the chromatic index of regular graphs, J. Algorithms, 4: 35–44 (1983)
V.A. Kovalevsky, Finite topology as applied to image processing in “Computer Vision, Graphics, and Image Processing” 46 (1989) 141–161.
A. Montanvert, and J.M. Chassery, “Géometrie discrète en analyse d’images” Traité des Nouvelles Technologies. Série Images. Hermès, Paris (1991).
J.-P. Réveillès, Géométrie discrète, calculs en nombre entiers et algorithmique, Thèse de doctorat, Université L. Pasteur, Strasbourg, (1991).
F.P. Preparata, and M.I. Shamos, “Computational Geometry: An Introduction”, Springer, New York, (1985).
S. Rital, A. Bretto, H. Cherifi, and D. Aboutajdine, Modélisation d’images par hypergraphe. Application au débruitage, ISIVC Proceedings (ed. IAPR), Rabat (2000), 25–34.
A. Rosenfeld, “Digital Image Processing”, Academic Press, San Diego, (1982)
J.C. Russ, “The image processing handbook” CRC press, IEEE press, Springer, Berlin (1999)
K. Voss, Discrete Images, Object and Functions in ℤ n, Springer-Verlag (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chastel, S., Colantoni, P., Bretto, A. (2002). Displaying Image Neighborhood Hypergraphs Line-Graphs. In: Braquelaire, A., Lachaud, JO., Vialard, A. (eds) Discrete Geometry for Computer Imagery. DGCI 2002. Lecture Notes in Computer Science, vol 2301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45986-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-45986-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43380-4
Online ISBN: 978-3-540-45986-6
eBook Packages: Springer Book Archive