Paper
26 August 1996 Neighborhood graphs and image processing
Francois Angot, Regis Clouard, Abderrahim Elmoataz, Marinette Revenu
Author Affiliations +
Proceedings Volume 2785, Vision Systems: New Image Processing Techniques; (1996) https://doi.org/10.1117/12.248541
Event: Lasers, Optics, and Vision for Productivity in Manufacturing I, 1996, Besancon, France
Abstract
Many image processing and image segmentation problems, in two or three dimensions, can be addressed and solved by methods and tools developed within the graph theory. Two types of graphs are studied: neighborhood graphs (with the duals Voronoi diagram and Delaunay graph) and adjacency graphs. In this paper, we propose an image representation based on graphs: the graph object, together with methods for attributing and weighting the graph, and methods to merge nodes, is defined within an object-oriented library of image processing operators. In order to demonstrate the interest of the approach, several applications dealing with 2D images are briefly described and discussed: we show that this change of representation can greatly simplify the tuning of image processing plans and how to replace complex sequences of image operators by one single basic operation on graphs. As results are promising, our library of graph operators is being extended to 3D images.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Francois Angot, Regis Clouard, Abderrahim Elmoataz, and Marinette Revenu "Neighborhood graphs and image processing", Proc. SPIE 2785, Vision Systems: New Image Processing Techniques, (26 August 1996); https://doi.org/10.1117/12.248541
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing

3D image processing

Tumors

Biomedical optics

Mathematical morphology

Matrices

Back to Top