Share Email Print

Proceedings Paper

Neighborhood graphs and image processing
Author(s): Francois Angot; Regis Clouard; Abderrahim Elmoataz; Marinette Revenu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 26 August 1996
PDF: 12 pages
Proc. SPIE 2785, Vision Systems: New Image Processing Techniques, (26 August 1996); doi: 10.1117/12.248541
Show Author Affiliations
Francois Angot, GREYC-ISMRA (France)
Regis Clouard, GREYC-ISMRA (France)
Abderrahim Elmoataz, GREYC-ISMRA (France)
Marinette Revenu, GREYC-ISMRA (France)

Published in SPIE Proceedings Vol. 2785:
Vision Systems: New Image Processing Techniques
Philippe Refregier, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?