Octree approximation an compression methods

Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as well as objects of arbitrary dimensionality). The objects are represented by a region octree implemented using a pointerless representation based on locational codes. Approximation is achieved through the use of a forest. This method labels the internal nodes of the octree as GB or GW, depending on the number of children being of type GB or GW. In addition, all BLACK nodes are labeled GB, while all WHITE nodes are labeled GW. A number of different image approximation methods are discussed that make use of a forest. The advantage of these methods is that they are progressive which means that as more of the object is transmitted, the better is the approximation. This makes these methods attractive for use on the worldwide web. Progressive transmission has the drawback that there is an overhead in requiring extra storage. Aprogressive forest-based approximation and transmission method is presented where the total amount of data that is transmitted is not larger than MIN(B,W), where B and W are the number of BLACK and WHITE blocks, respectively, in the region octree of the set of objects.

[1]  William E. Glenn,et al.  Simple Scalable Video Compression Using 3-D Subband Coding , 1995 .

[2]  Azriel Rosenfeld,et al.  Shape approximation using quadtrees , 1982, Pattern Recognit..

[3]  Gabriel Taubin,et al.  3D Geometry Compression and Progressive Transmission , 1999 .

[4]  S. Sitharama Iyengar,et al.  Space and Time Efficient Virtual Quadtress , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Hanan Samet,et al.  Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Computer Graphics and Image Processing.

[7]  C.-C. Jay Kuo,et al.  Progressive Compression of 3D Graphic , 1997 .

[8]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[9]  Markku Tamminen.  Comment on Quad- and Octtrees , 1984, CACM.

[10]  佐藤 孝紀,et al.  A Hierarchical Data Structure for Picture Processing , 1976 .

[11]  Hanan Samet,et al.  Data structures for quadtree approximation and compression , 1985, CACM.

[12]  KENNETH R. SLOAN,et al.  Progressive Refinement of Raster Images , 1979, IEEE Transactions on Computers.

[13]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[14]  Gregory Michael Hunter,et al.  Efficient computation and data structures for graphics. , 1978 .

[15]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[16]  K. Knowlton,et al.  Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes , 1980, Proceedings of the IEEE.

[17]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[18]  John W. Woods,et al.  Subband finite state scalar quantization , 1996, IEEE Trans. Image Process..

[19]  Majid Rabbani,et al.  An overview of the JPEG 2000 still image compression standard , 2002, Signal Process. Image Commun..