Constructing stochastic pyramids by MIDES: maximal independent directed edge set

  • Authors:
  • Yll Haxhimusa;Roland Glantz;Walter G. Kropatsch

  • Affiliations:
  • Pattern Recognition and Image Processing Group, Institute for Computer Aided Automation, Vienna University of Technology, Vienna, Austria;Dipartimento di Informatica, Università di Ca' Foscari di Venezia, Via Torino, Mestre, Italy;Pattern Recognition and Image Processing Group, Institute for Computer Aided Automation, Vienna University of Technology, Vienna, Austria

  • Venue:
  • GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than 2.0. Thus, the new method yields a higher reduction factor than the stochastic decimation algorithm (MIS) and maximal independent edge set (MIES), in all tests. This means the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. The lower bound of the reduction factor becomes crucial with large images.