Integral trees: subtree depth and diameter

Authors:
Walter G. Kropatsch;Yll Haxhimusa;Zygmunt Pizlo
Affiliations:
Institute of Computer Aided Automation, Vienna University of Technology, Vienna, Austria;Institute of Computer Aided Automation, Vienna University of Technology, Vienna, Austria;Department of Psychological Sciences, Purdue University, West Lafayette, IN
Venue:
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Year:
2004

Citing 3
Cited 2

Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
A critical view of pyramid segmentation algorithms

Pattern Recognition Letters
Robust Real-Time Face Detection

International Journal of Computer Vision

Approximative graph pyramid solution of the E-TSP

Image and Vision Computing
The eccentricity transform (of a digital shape)

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important properties of these regions and the associated trees. We compute the depth of a rooted tree, its diameter and the center which becomes the root in the top-down decomposition of a region. The integral tree is an intermediate representation labeling each vertex of the tree with the integral feature(s) of the subtree. Parallel algorithms efficiently compute the integral trees for subtree depth and diameter enabling local decisions with global validity in subsequent top-down processes.