Share Email Print
cover

Proceedings Paper

Quadtree decomposition of binary structuring elements
Author(s): Kenji Shoji
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 order to efficiently perform morphological binary operations by relatively large structuring elements, we propose to decompose each structuring element into squares with 2 X 2 pixels by the quadtree approach. There are two types of decomposition--the dilation decomposition and the union decomposition. The first type decomposition is very efficient, but it is not necessarily always possible. The decomposition of second type is available for any structuring element, but the time cost of computation is proportional to the area of the structuring element. The quadtree decomposition proposed here is the combination of these two types of decomposition, and exists for any structuring element. When the Minkowski addition A (direct sum) B or the Minkowski subtraction A - B is computed, the number of times of the union/intersection of translations of the binary image is about the number of leaves of the quadtree representation of the structuring element B, which is roughly proportional to the square root of the area of B. In this paper, an algorithm for quadtree decomposition is described, and experimental results of this decomposition for some structuring elements are shown.

Paper Details

Date Published: 1 April 1991
PDF: 10 pages
Proc. SPIE 1451, Nonlinear Image Processing II, (1 April 1991); doi: 10.1117/12.44322
Show Author Affiliations
Kenji Shoji, Utsunomiya Univ. (Japan)


Published in SPIE Proceedings Vol. 1451:
Nonlinear Image Processing II
Edward R. Dougherty; Gonzalo R. Arce; Charles G. Boncelet, Editor(s)

© SPIE. Terms of Use
Back to Top