spihtencode3d.1

SPIHT的寫法~~請大家參考看看~~比較一下

.TH SPIHTENCODE3D 1 "QCCPACK" ""
.SH NAME
spihtencode3d, spihtdecode3d \-
encode/decode an image cube using the 3D-SPIHT algorithm
.SH SYNOPSIS
.sp
.B spihtencode3d
.RB "[\|" \-w
.IR  wavelet "\|]"
.RB "[\|" \-b
.IR  boundary "\|]"
.RB "[\|" \-nl
.IR  num_levels "\|]"
.RB "[\|" \-sl
.IR  spatial_num_levels "\|]"
.RB "[\|" \-tl
.IR  temporal_num_levels "\|]"
.RB "[\|" \-dt "\|]"
.RB "[\|" \-pt "\|]"
.RB "[\|" \-at "\|]"
.RB "[\|" \-noac "\|]"
.RB "[\|" \-m
.IR  mask "\|]"
.RB "[\|" \-vo "\|]"
.I rate
.I icbfile
.I bitstream
.LP
.B spihtdecode3d
.RB "[\|" \-w
.IR  wavelet "\|]"
.RB "[\|" \-b
.IR  boundary "\|]"
.RB "[\|" \-m
.IR  mask "\|]"
.RB "[\|" \-r
.IR  rate "\|]"
.I bitstream
.I icbfile
.SH OPTIONS
.TP
.BI \-w " wavelet"
String. 
Name of the wavelet file
.RB ( FBK
or
.B LFT
format); default = "CohenDaubechiesFeauveau.9-7.lft"
.TP
.BI \-b " boundary"
String. Type of boundary extension; default = "symmetric".
.TP 
.BI \-nl " num_levels"
Integer. Number of levels of dyadic decomposition; default value is 5 levels.
.TP 
.BI \-sl " spatial_num_levels"
Integer. Number of levels of spatial decomposition; no default value.
.TP 
.BI \-tl " temporal_num_levels"
Integer. Number of levels of temporal decomposition; no default value.
.TP
.B \-dt
Use a dyadic zerotree structure. This is the default when a
dyadic transform is used.
.TP
.B \-pt
Use a symmetric-packet zerotree structure.
.TP
.B \-at
Use an asymmetric wavelet-packet zerotree structure. This is the default
when a wavelet-packet transform is used.
.TP
.B \-noac
Do not use arithmetic coding during encoding;
i.e., produce "binary-uncoded" output.
Default is to use arithmetic coding.
.TP
.BI \-m " mask"
String. Name of file containing the transparency mask for
shape-adaptive coding. Default is to not use a mask.
.TP
.BI \-r " rate"
Float. Rate at which to stop decoding. Default is to decode until
end of input bitstream is reached.
.TP
.B \-vo
Print only the value of the rate to stdout (terse output);
default is verbose output.
.SH DESCRIPTION
.LP
.B spihtencode3d
codes an image cube,
.IR icbfile ,
using the 3D Set Partitioning In Hierarchical Trees (3D-SPIHT)
algorithm by Kim, Pearlman, and Xiong.
The 3D-SPIHT algorithm involves a 3D DWT followed by 
a progressive "bit-plane" coding of the wavelet coefficients using a
zerotree-like quantization structure.
.LP
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
.BR QccSPIHT3DEncode (3)
for complete details.
Option
.B \-w
specifies the wavelet, 
option
.B \-b
specifies the boundary extension.
The
.B \-m
option gives the image-cube file to be used as a transparency mask
for the SA-DWT.
.I 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
.BR QccAlpha (3)).
If the
.B \-m
option is not given, the usual, full-volume DWT is used.
.LP
The
.BR \-nl ,
.BR \-sl ,
and
.BR \-tl
options determine whether a dyadic or wavelet-packet transform is used.
If
.B \-nl
is specified, a dyadic transform is used. In this case,
.IR num_levels
is the number of decompositions in all three directions.
If either
.B \-sl
or
.BR \-tl ,
or
both, is specified, a wavelet-packet transform is used.
In this case,
.I spatial_num_levels
and
.I temporal_num_levels
give the number of decompositions spatially and temporally, respectively,
of the packet transform. If only one of
.B \-sl
and
.B \-tl
is given, then the same number of decompositions
is used spatially and temporally.
In the case that none of
.BR \-nl ,
.BR \-sl ,
and
.BR \-tl 
is specified, then a dyadic decomposition with the default value of
.I num_levels
is used.
.LP
The
.BR \-dt ,
.BR \-pt ,
and
.BR \-at
options determine whether a dyadic,
symmetric-packet, or asymmetric-packet zerotree structure is used.
If
.BR \-dt
is specified, a dyadic zerotree is used; this is the
default when a dyadic transform is specified.
On the other hand,
.B \-pt
and
.B \-at
are valid options only when a wavelet-packet transform is specified.
If
.B \-pt
is specified, then the "splitting"-based, symmetric-packet zerotree structure
described by Kim
.IR "et al" .
is used.
If
.B \-at
is specified, then the asymmetric-packet structure described by He
.IR "et al" .
and Cho and Pearlman is used.
See
.BR QccSPIHT3DEncode (3)
for greater detail.
.IR spatial_num_levels
and
.IR temporal_num_levels
must be the same when
.BR \-dt
or
.BR \-pt
are used; they may be different when
.BR \-at
is used.
In the absence of
.BR \-dt ,
.BR \-pt ,
or
.BR \-at ,
the default behavior is to use a dyadic zerotree in the case of a dyadic
transform, and an asymmetric-packet zerotree in the case of a
wavelet-packet transform.

.LP
The desired bitrate of the output
.I bitstream
is specified by
.IR rate ,
which is expressed in bits per voxel of the original image.
.B spihtencode3d
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 
.B \-vo
(value-only) option is given, all printed output is suppressed except for
the actual bitrate.
.LP
The 3D-SPIHT algorithm normally
uses arithmetic coding of symbols as a final output step
to improve coding efficiency.  Alternatively, arithmetic coding can be
suppressed, producing what is called "binary-uncoded"
output.
.B spihtencode3d
supports both arithmetic-coded and binary-uncoded output modes. If option
.B \-noac
is specified, no arithmetic coding is used (i.e., binary-uncoded output).
Otherwise, the output is arithmetic-coded.
.LP
.B spihtdecode3d
performs the corresponding decoding using the 3D-SPIHT algorithm, decoding
the
.I bitstream
made by
.B spihtencode3d
and producing
a reconstructed image cube,
.IR icbfile .
For sane results, 
.IR wavelet 
and
.IR boundary 
should be the same as they were for
.BR spihtencode3d ,
and
.I mask
should be the same if an SA-DWT was used as the transform.
.B spihtdecode3d
automatically determines whether arithmetic decoding is needed or not.
If a decoding rate is specified with the
.B \-r
option, then
.B spihtdecode3d
stops decoding when
.I rate
bits per voxel from the input bitstream
have been decoded. Otherwise, decoding stops when the
end of the input bitstream is reached.
.LP
.BR spihtencode3d
and
.BR spihtdecode3d
call
.BR QccSPIHT3DEncode (3)
and
.BR QccSPIHT3DDecode (3),
respectively, to perform 3D-SPIHT encoding and decoding.
Refer to the man pages for these functions for more information
on the details of the QccPack implementation of the 3D-SPIHT algorithm.
.SH "SEE ALSO"
.BR QccSPIHT3DEncode (3),
.BR QccSPIHT3DDecode (3),
.BR QccWAVSubbandPyramid3D (3),
.BR QccPackWAV (3),
.BR QccPackIMG (3),
.BR QccPack (3)

B.-J. Kim, Z. Xiong, and W. A. Pearlman,
"Low Bit-Rate Scalable Video Coding with 3-D Set Partitioning
in Hierarchical Trees (3-D SPIHT),"
.IR "IEEE Transactions on Circuits and Systems for Video Technology" ,
vol. 10, no. 8, pp. 1374-1387, December 2000.
.LP
B.-J. Kim and W. A. Pearlman,
"An Embedded Wavelet Video Coder Using Three-Dimensional
Set Partitioning in Hierarchical Trees (SPIHT)," in
.IR "Proceedings of the Data Compression Conference" ,
J. A. Storer and M. Cohn, Eds., Snowbird, UT, March 1997, pp. 251-257.
.LP
A. Said and W. A. Pearlman,
"A New, Fast, and Efficient Image Codec Based
on Set Partitioning in Hierarchical Trees,"
.IR "IEEE Transactions on Circuits and Systems for Video Technology" ,
vol. 6, no. 3, pp. 243-250, June 1996.
.LP
C. He, J. Dong, Y. F. Zheng, and Z. Gao,
"Optimal 3-D Coefficient Tree Structure for 3-D Wavelet Video Coding,"
.IR "IEEE Transactions on Circuits and Systems for Video Technology" ,
vol. 13, no. 10, pp. 961-972, October 2003.
.LP
S. Cho and W. P. Pearlman,
"Error Resilient Video Coding With Improved 3-D SPIHT and Error Concealment,"
in
.IR "Image and Video Communications and Processing" ,
B. Vasudev, T. R. Hsing, and A. G. Tescher, Eds.,
Santa Clara, CA, January 2003, Proc. SPIE 5022, pp. 125-136
.LP
G. Minami, Z. Xiong, A. Wang, and S. Mehrota,
"3-D Wavelet Coding of Video With Arbitrary Regions of Support,"
.IR "IEEE Transactions on Circuits and Systems for Video Technology" ,
vol. 11, no. 9, pp. 1063-1068, September 2001.
.LP
S. Li and W. Li, "Shape-Adaptive Discrete Wavelet Transforms for
Arbitrarily Shaped Visual Object Coding,"
.IR "IEEE Transactions on Circuits and Systems for Video Coding" ,
vol. 10, pp. 725-743, August 2000.

.SH AUTHOR
Copyright (C) 1997-2006  James E. Fowler

.SH LICENSE
The 3D Set Partitioning In Hierarchical Trees (3D-SPIHT) algorithm is
protected by US patents 5,764,807 and 6,674,911, and other patents pending.
An implementation of the 3D-SPIHT algorithm is included herein (utility
programs spihtencode3d and spihtdecode3d, and spiht3d.c in the QccPack
library) with the permission of PrimaComp, Inc., exclusive holder of
patent rights. PrimaComp has graciously granted a license with certain
restrictions governing the terms and conditions for use, copying,
distribution, and modification of the 3D-SPIHT algorithm implementation
contained herein. Specifically, only use in academic and non-commercial
research is permitted, while all commercial use is prohibited.  Refer to
the file LICENSE-3D-SPIHT for more details.