Share Email Print

Proceedings Paper

Fast opening functions and morphological granulometries
Author(s): Luc M. Vincent
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, a comprehensive set of fast algorithms for computing granulometries in binary images is first proposed: linear granulometries (i.e., granulometries based on openings with line segments) constitute the easiest case, and are computed using image `run-length'. The 2D case (granulometries with square or `diamond'-shaped structuring elements, or granulometries with unions of line-segments at different orientations) involves the determination of opening functions or granulometry functions. The grayscale case is then addressed, and a new algorithm for computing grayscale linear granulometries is introduced. This algorithm is orders of magnitude faster than any previously available technique. The techniques introduced in this paper open up a new range of applications for granulometries, examples of which are described in the paper.

Paper Details

Date Published: 30 June 1994
PDF: 15 pages
Proc. SPIE 2300, Image Algebra and Morphological Image Processing V, (30 June 1994); doi: 10.1117/12.179208
Show Author Affiliations
Luc M. Vincent, Xerox Imaging Systems (United States)

Published in SPIE Proceedings Vol. 2300:
Image Algebra and Morphological Image Processing V
Edward R. Dougherty; Paul D. Gader; Michel Schmitt, Editor(s)

© SPIE. Terms of Use
Back to Top