Share Email Print
cover

Proceedings Paper

General pyramid segmentation algorithm
Author(s): Walter G. Kropatsch; Ben S. Yacoub
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Dual graph contraction reduces the number of vertices and of edges of a pair of dual image graphs while at the same time, the topological relations among the `surviving' components are preserved. Repeated application produces a stack of successively smaller graphs: a pair of dual irregular pyramids. The process is controlled by selected decimation parameters which consist of a subset of surviving vertices and associated contraction kernels. Equivalent contraction kernels combine two or more contraction kernels into one single contraction kernel which generates the same result in one single dual contraction. This is the basis to the proof that any segmentation can be represented in one single level of such a pyramid. Experimental results demonstrate the applicability on synthetic and real images respectively.

Paper Details

Date Published: 30 September 1996
PDF: 10 pages
Proc. SPIE 2826, Vision Geometry V, (30 September 1996); doi: 10.1117/12.251796
Show Author Affiliations
Walter G. Kropatsch, Technical Univ. of Vienna (Austria)
Ben S. Yacoub, Technical Univ. of Vienna (Austria)


Published in SPIE Proceedings Vol. 2826:
Vision Geometry V
Robert A. Melter; Angela Y. Wu; Longin Jan Latecki, Editor(s)

© SPIE. Terms of Use
Back to Top