This paper describes an efficient computation of these extinction values based on the incremental determination of attributes from the component tree ...

Jan 1, 2011 · This paper proposes three new extinction values – two based on the topology of the component tree: (i) number of descendants and (ii) sub-tree ...

This paper describes an efficient computation of these extinction values based on the incremental determination of attributes from the component tree ...

This paper describes an efficient computation of these extinction values based on the incremental determination of attributes from the component tree ...

This paper describes an efficient computation of these extinction values based on the incremental determination of attributes from the component tree ...

Efficient computation of new extinction values from extended component tree · A. G. Silva, R. Lotufo · Published in Pattern Recognition Letters 2011 · Computer ...

This paper proposes four new extinction values -- two based on the topology of the component tree: (i) number of descendants and (ii) sub-tree height; and two ...

This paper describes efficient computation of these extinction values based on the incremental determination of attributes from the component tree construction ...

This paper describes efficient computation of these extinction values based on the incremental determination of attributes from the component tree construction ...

Alexandre Gonçalves Silva , Roberto de Alencar Lotufo: Efficient computation of new extinction values from extended component tree. Pattern Recognit. Lett.