Integral Trees: Subtree Depth and Diameter

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.

[1]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[2]  A. Joshi,et al.  The traveling salesman problem: A hierarchical model , 2000, Memory & cognition.

[3]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[4]  Z. Pizlo.  Perception viewed as an inverse problem , 2001, Vision Research.

[5]  Takeo Yamada,et al.  A branch-and-bound algorithm for the mini-max spanning forest problem , 1997 .

[6]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[7]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[8]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[9]  O. Reiser,et al.  Principles Of Gestalt Psychology , 1936 .

[10]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[11]  Edward Courtney,et al.  2 = 4 M , 1993 .

[12]  W. Kropatsch.  Building irregular pyramids by dual-graph contraction , 1995 .

[13]  Walter G. Kropatsch,et al.  Equivalent contraction kernels to build dual irregular pyramids , 1996, TFCV.

[14]  A. Rosenfeld,et al.  An exponential pyramid model of the time-course of size processing , 1995, Vision Research.

[15]  Azriel Rosenfeld,et al.  A critical view of pyramid segmentation algorithms , 1990, Pattern Recognit. Lett..

[16]  Robert L. Ogniewicz,et al.  Discrete Voronoi skeletons , 1992 .

[17]  Zygmunt Pizlo,et al.  Graph pyramids as models of human problem solving , 2004, IS&T/SPIE Electronic Imaging.

[18]  Charles A. Bouman,et al.  Multiple Resolution Segmentation of Textured Images , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  A. Rosenfeld,et al.  Curve Detection in a Noisy Image , 1997, Vision Research.

[20]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  Luc Cournoyer,et al.  The NRCC three-dimensional image data files , 1988 .

[22]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[23]  Zygmunt Pizlo,et al.  Pyramid algorithms as models of human cognition , 2003, IS&T/SPIE Electronic Imaging.

[24]  Gabriella Sanniti di Baja.  Well-Shaped, Stable, and Reversible Skeletons from the (3, 4)-Distance Transform , 1994, J. Vis. Commun. Image Represent..

[25]  Olaf Kübler,et al.  Hierarchic Voronoi skeletons , 1995, Pattern Recognit..

[26]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.