Decomposition of 3D Binary Objects into Rectangular Blocks

In this paper we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks. Theoretically optimal brute-force algorithm is known to be NP-hard and practically infeasible. We introduce its polynomial sub-optimal approximation, which transforms the decomposition problem onto a graph-theoretical problem. We show by extensive experiments that the proposed method outperforms the the octree decomposition in terms of the number of blocks on statistically significant level. We also discuss potential applications of the method in image processing.

[1]  J. Flusser,et al.  2D and 3D Image Analysis by Moments , 2016 .

[2]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[3]  IV CyrilHöschl,et al.  Decomposition of binary images - A survey and comparison , 2012, Pattern Recognit..

[4]  Paul J. Zsombor-Murray,et al.  Fast algorithm for the computation of moment invariants , 1987, Pattern Recognit..

[5]  David Eppstein,et al.  Graph-Theoretic Solutions to Computational Geometry Problems , 2009, WG.

[6]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[7]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[8]  Bingcheng Li.  A new computation of geometric moments , 1993, Pattern Recognit..

[9]  Ali Shokoufandeh,et al.  Retrieving articulated 3-D models using medial surfaces , 2008, Machine Vision and Applications.

[10]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[11]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[12]  Yazid M. Sharaiha,et al.  Binary digital image processing - a discrete approach , 1999 .

[13]  Jan Flusser,et al.  Refined moment calculation using image block representation , 2000, IEEE Trans. Image Process..

[14]  Mohamed Najim,et al.  An efficient algorithm for computation of shape moments from run-length codes or chain codes , 1992, Pattern Recognit..

[15]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[16]  Anne Kaldewaij,et al.  Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three , 1991, Inf. Process. Lett..

[17]  Basil G. Mertzios,et al.  Real-time computation of two-dimensional moments on binary images using image block representation , 1998, IEEE Trans. Image Process..

[18]  Juan Humberto Sossa Azuela,et al.  Computing geometric moments using morphological erosions , 2001, Pattern Recognit..

[19]  Jan Flusser,et al.  Refined Morphological Methods of Moment Computation , 2010, 2010 20th International Conference on Pattern Recognition.

[20]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[21]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[22]  Shi-Jinn Horng,et al.  A new computation of shape moments via quadtree decomposition , 2000, Pattern Recognit..