biskencode3d [-w wavelet] [-b boundary] [-nl num_levels] [-sl spatial_num_levels] [-tl temporal_num_levels] [-m mask] [-vo] rate icbfile bitstream
biskdecode3d [-w wavelet] [-b boundary] [-m mask] [-r rate] bitstream icbfile
biskencode3d codes an image cube, icbfile, using the 3D-BISK algorithm by Rucker and Fowler. The 3D-BISK algorithm involves a 3D DWT followed by a progressive "bitplane" coding of the wavelet coefficients using a cube-splitting quantization structure based on k-d trees.
The transform is either the usual discrete wavelet transform (DWT) or a shape-adaptive DWT (SA-DWT) and can be either a dyadic or wavelet-packet decomposition; see QccWAVbisk3DEncode(3) for complete details. Option -w specifies the wavelet, option -b specifies the boundary extension. The -m option gives the image-cube file to be used as a transparency mask for the SA-DWT. mask must be a grayscale image cube in which black in this image cube indicates transparency, white indicates full opacity, and gray tones are degrees of translucence (see QccAlpha(3) ). If the -m option is not given, the usual, full-volume DWT is used.
The -nl, -sl, and -tl options determine whether a dyadic or wavelet-packet transform is used. If -nl is specified, a dyadic transform is used. In this case, num_levels is the number of decompositions in all three directions. If either -sl or -tl, or both, is specified, a wavelet-packet transform is used. In this case, spatial_num_levels and temporal_num_levels give the number of decompositions spatially and temporally, respectively, of the packet transform. If only one of -sl and -tl is given, then the same number of decompositions is used spatially and temporally. In the case that none of -nl, -sl, and -tl is specified, then a dyadic decomposition with the default value of num_levels is used.
The desired bitrate of the output bitstream is specified by rate, which is expressed in bits per voxel of the original image. biskencode3d normally prints to stdout a small amount of information concerning this target bitrate and the actual bitrate achieved. Usually these rates are identical, but may differ slightly. If the -vo (value-only) option is given, all printed output is suppressed except for the actual bitrate.
biskdecode3d performs the corresponding decoding using the 3D-BISK algorithm, decoding the bitstream made by biskencode3d and producing a reconstructed image cube, icbfile. For sane results, wavelet and boundary should be the same as they were for biskencode3d, and mask should be the same if an SA-DWT was used as the transform. If a decoding rate is specified with the -r option, then biskdecode3d stops decoding when rate bits per voxel from the input bitstream have been decoded. Otherwise, decoding stops when the end of the input bitstream is reached.
biskencode3d and biskdecode3d call QccWAVbisk3DEncode(3) and QccWAVbisk3DDecode(3) , respectively, to perform 3D-BISK encoding and decoding. Refer to the man pages for these functions for more information on the details of the QccPack implementation of the 3D-BISK algorithm.
J. T. Rucker and J. E. Fowler, "Coding of Ocean-Temperature Volumes Using Binary Set Splitting with k-d Trees," in Proceedings of the International Geoscience and Remote Sensing Symposium, Anchorage, AK, September 2004, to appear.
J. E. Fowler, "Shape-Adaptive Coding Using Binary Set Splitting with k-d Trees," in Proceedings of the International Conference on Image Processing, Singapore, October 2004, to appear.
X. Tang, W. A. Pearlman, and J. W. Modestino, "Hyperspectral Image Compression Using Three-Dimensional Wavelet Coding," in Image and Video Communications and Processing, Santa Clara, CA, January 2003, Proc. SPIE 5022, pp. 1037-1047.
J. L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, September 1975.