[Home]
[Back Issues]
[Search]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
The Wavelet Digest - Volume 3, Issue 13 (August 17, 1994)
Today's Editor: Wim Sweldens
wim.sweldens@cs.kuleuven.ac.be
Today's Topics:
1. Preprint: Simulation of Field Theories in Wavelet Representation
2. Contents: JAT Vol. 78, No. 1, July 1994
3. Preprint: Preprints from Air Force Institute of Technology
4. Job: Consulting Opportunity
5. Question: Numerical calculation of Riesz projections
6. Preprint: Nonexistence of a Wavelet Convolution Theorem
7. Question: Looking for nonseparable 2-D Wavelets
8. Preprint: Dissertation and preprint from D. Chen
9. Question: Wavelets and tomographic reconstruction
10. Software: Tsunami Plus Wavelet Software (Version 1.0)
11. Software: The UBC Wavelet Package -- Release 1.2
Submissions:
E-mail to wavelet@math.sc.edu with "submit" as subject.
Subscriptions:
E-mail to wavelet@math.sc.edu with "subscribe" as subject.
To unsubscribe, e-mail with "unsubscribe" followed by your e-mail
address as subject. To change address, unsubscribe and resubscribe.
Preprints, references, and back issues can be obtained from our
information servers:
Ftp: ftp.math.sc.edu (/pub/wavelet)
Gopher: gopher.math.sc.edu
WWW: http://www.math.sc.edu/~wavelet/
Current number of subscribers: 3578
From: Peter Suranyi <suranyi@physunc.phy.uc.edu>
Subject: Preprint: Simulation of Field Theories in Wavelet Representation
Title: Simulation of Field Theories in Wavelet Representation,
Authors: I.G. Halliday and P. Suranyi
Address: Department of Physics, University of Wales, Swansea SA2 8PP,
United Kingdom.
Format: Swansea preprint SWAT/35, Submitted to Nuclear Physics.
Abstract:
The field is expanded in a wavelet series and the wavelet
coefficients are varied in a simulation of the 2D $\phi^4$ field theory.
The drastically reduced autocorrelations result in a substantial
decrease of computing requirements, compared to those in
local Metropolis simulations. A large part of the improvement
is shown to be the result of an additional freedom in the choice of
the allowed range of change at the Metropolis update of wavelet components,
namely the range can be optimized independently for all wavelet sizes.
Available from the bulletin board hep-lat@xxx.lanl.gov through anonymous
ftp or by e-mail with Subject: get 9407010 and no message.
Also available from us in latex format with postcript figures, upon request,
to the following e-mail: suranyi@physunc.phy.uc.edu
From: Marilyn Radcliff <radcliff@math.ohio-state.edu>
Subject: Contents: JAT Vol. 78, No. 1, July 1994
Journal of Approximation Theory, Volume 78, Number 1, July 1994
Marco Baronti and Grzegorz Lewicki. Strongly Unique Minimal Projections on
Hyperplanes, 1-18.
Wenshan Yang and Chong Li. Strong Unicity for Monotone Approximation by
Reciprocals of Polynomials, 19-29.
Rainer Br\"uck and J\"urgen M\"uller. Summability of Hadamard Products of
Taylor Sections with Polynomial Interpolants, 30-40.
Gilbert Helmberg. The Gibbs Phenomenon for Fourier Interpolation, 41-63.
Bernard Beauzamy. On the Leading Coefficients of Real Many-Variable
Polynomials, 64-76.
Charles K. Chui, Dong Hong, and Shun-Tang Wu. On the Degree of Multivariate
Bernstein Polynomial Operators, 77-86.
Alf Jonsson. Markov's Inequality and Zeros of Orthogonal Polynomials on
Fractal Sets, 87-97.
Philip Rabinowitz and P\'eter V\'ertesi. Hermite-Fej\'er-Related Interpo-
lation and Product Integration, 98-111.
Hans Triebel. Relations between Approximation Numbers and Entropy Numbers,
112-116.
Leonid B. Golinskii. Reflection Coefficients for the Generalized Jacobi
Weight Functions, 117-126.
Alicia Cachafeiro and Francisco Marcell\'an. Orthogonal Polynomials of
Sobolev Type on the Unit Circle, 127-146.
Notes
Ding-Xuan Zhou. A note on Derivatives of Bernstein Polynomials, 147-150.
Alf Jonsson. On Markov's and Bernstein's Inequalities in the Unit Ball in
$\BBJ R^k$, 151-154.
Robert Huotari and Salem Sahab. Metric Projection onto a Lattice $L_1$,
155-160.
From: "Bruce W. Suter" <bsuter@afit.af.mil>
Subject: Preprints: Preprints from Air Force Institute of Technology
OBTAINING PREPRINTS from Air Force Institute of Technology (AFIT)
1.0 Obtaining Preprints from AFIT
Preprints are available by anonymous FTP from the AFIT computer
"archive.afit.af.mil". You must have Internet access. Papers are
in the subdirectory "pub/wavelets".
2.0 Instructions Comments
ftp archive.afit.af.mil Numerical address 129.92.1.66
anonymous This is your special id
YOURNAME@YOURSCHOOL Send your real id as your password
cd pub/wavelets Directory with wavelet preprints
binary Ensures Integrity of Downloading File
get {file} Downloads file
quit Closes the connection
3.0 Printing Received Files on UNIX Machines
The instructions below are for UNIX machines. Single documents and
papers with only a few simple diagrams are stored as compressed postscript or
ASCII LaTex files.
Problems?
Make sure your computer disk has enough space to unpack the file
you downloaded.
See your local computer expert.
E-mail a description of your troubles to bsuter@afit.af.mil
[Bruce Suter] or xxia@afit.af.mil [Xiang-Gen Xia].
The files that can be retrived are listed below:
TI: Multirate: A New Computational Paradigm
AU: John R. O'Hair and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted for Publication in June 1994
AB: In this paper, a new multirate paradigm is introduced. Multirate is shown to
be a powerful divide and conquer methodology capable of being applied to the
entire field of Numerical Linear Algebra. Multirate can be successfully
applied to vector-vector, matrix-vector and matrix-matrix operations. These
operations form the foundation of such software suites as LAPACK. Since
LAPACK is dependent upon BLAS, and BLAS is, in turn, depends upon these
three operations, it can be seen that multirate can be applied to problems
encountered throughout the field of Numerical Linear Algebra. As examples
of practical Numerical Linear Algebra problems (which happen to be
encountered in signal processing), the new paradigm for multirate is applied
to two common algorithms: the FFT and the DHT. The application of multirate
to these algorithms lead to the generation of easily implemented parallel
algorithms. In the case of the FFT, multirate provides an alternate means of
generating the Four Step FFT reported by Van Loan for use in MIMD shared
memory architectures. The multirate DHT, on the other hand, provides a new
algorithm that makes use of shortened DHT, DCT-II and DST-II transforms run
in parallel for much faster execution times. Thus, multirate can be applied
to traditionally sequential algorithms to improve their performance.
MA: archive.afit.af.mil
FN: Paradigm.ps.Z
TL: Compressed Postscript
TI: The Zak Transform and Decimated Time-Frequency Distributions
AU: John R. O'Hair and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted for Publication in December 1993
AB: In this paper, the interrelationship between the Zak transform and the
Generalized Discrete Time-Frequency Distribution (GDTFD) is examined.
Starting with the discrete Zak transform, its definition is broadened to
include arbitrary windows creating the Windowed Zak Transform (WZT). The
WZT is then combined with the spectrogram. It is demonstrated that the
spectrogram based upon the WZT, called the Zak-Spectrogram (ZS), is a
generalization of the standard spectrogram. Next, building upon the idea of
the weighted spectrogram, the weighted ZS is used to produce a new class of
GDTFD, called the Decimated GDTFD (D-GDTFD). The Decimated GDTFD is similar
to the GDTFD except it trades bandwidth for computational speed and requires
significantly less storage in order to be implemented. The reduction in
discrete bandwidth is from 2 x pi for the GDTFD to ( 2 x pi )/m for the
D-GDTFD. An important attribute of the D-GDTFD is that it requires
significantly less storage than the GDTFD. The D-GDTFD requires only 1/m^2
of the storage of the GDTFD. An example using the Binomial distribution is
given to illustrate the connection between the D-GDTFD and the GDTFD.
Throughout the paper, examples of multirate systems are given which could be
used to implement the building blocks of the D-GDTFD. This makes the D-GDTFD
practical to implement using slower and less expensive elements.
MA: archive.afit.af.mil
FN: Zak.ps.Z
TL: Compressed Postscript
TI: Multirate Time-Frequency Distributions
AU: John R. O'Hair and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted for Publication in May 1994
AB: Two new fast Generalized Discrete Time-Frequency Distribution (GDTFD)
algorithms are presented. The algorithms make use of multirate as a
computational paradigm to impose the divide and conquer methodology on the
GDTFD. The first new algorithm is based upon the inner product formulation
of the GDTFD which allows it to calculate the frequency content of a signal
for particular instances of time. The second algorithm is based upon the
outer product formulation of the GDTFD and as such is a block method
calculating multiple instants of time simultaneously. The first method is
computationally less expensive when calculating selected columns of a GDTFD
while the second method is computationally less expensive when calculating
every column of a GDTFD. Parallel implementations of the new algorithms
provide over an order of magnitude increase in throughput over the fastest
existing algorithm which was developed by Cunningham and Williams.
MA: archive.afit.af.mil
FN: MRTFD.ps.Z
TL: Compressed Postscript
TI: Kernel Design Techniques for Alias-Free Time-Frequency Distributions
AU: John R. O'Hair and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted for Publication in July 1993
AB: This paper presents three methods to deal with the problem of aliasing in
Discrete Time-Frequency Distributions. The work reported here is based upon
the Alias-Free Generalized Discrete-Time Time-Frequency Distribution
(AF-GDTFD) introduced by J. Jeong and W.J. Williams. As such, these methods
do not require the analytic form of the signal in order to avoid aliasing.
We consider the case for kernels designed and implemented in the ambiguity
plane paying special attention to kernels for which continuous time-lag
forms of the kernel does not exist or is difficult and impractical to
calculate. These new methods allow for the calculation AF-GDTFD in
O(N^2 log N) vice the O(N^3) operations of the previous published method
and for a broader class of kernels. This work provides a consistent
theoretic and practical basis for the calculation of a truly alias-free
Wigner distribution. We demonstrate the use of the new formulations on the
Butterworth, Binomial and Wigner distributions.
MA: archive.afit.af.mil
FN: Kernel.ps.Z
TL: Compressed Postscript
TI: A Family of Two Dimensional Nonseparable Malvar Wavelets
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in Jan. 1994
AB: Malvar wavelets or lapped orthogonal transform (LOT) has been
recognized as a useful tool in eliminating blocking effects in
transform coding. Recently, it has been also extended to more
general forms, which enable one to construct an orthonormal basis
from arbitrary local orthonormal bases on different intervals.
In this paper, we study two dimensional cases and construct
nonseparable Malvar wavelets, which is potentially important in
multidimensional signal analysis. With nonseparable Malvar wavelets,
we then construct nonseparable Lemari\'{e}-Meyer wavelets which are
band-limited. We also present several numerical examples.
FN: nonsep.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: A Systematic Method for the Construction of Time-Varying FIR
Multirate Filter Banks with Perfect Reconstruction
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in Feb. 1994
AB: In this paper, we present a theory to construct time-varying FIR
multirate filter banks with perfect reconstruction (PR) property
by using arbitrary FIR multirate PR filter banks in different time
intervals. We construct proper window functions cooperating with
the even and odd extensions of filters at the boundaries of the
intervals. We present conditions on such window functions for the
perfect reconstruction property of the global filter banks in the
construction, which are independent of local filter banks. From this
theory, one is able to use discrete wavelet transforms with different
bases, discrete cosine transform and any other transforms on different
time intervals in overlapped transforms with PR property. The theory
can be applied to both infinite and finite length signals and moreover
the blocking effects in the transitions between neighboring filter banks
have been taken into account. Numerical examples using discrete cosine
transform and discrete wavelet transform in two different time intervals
of different length are presented to illustrate the theory.
FN: tvfb.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: FIR Paraunitary Filter Banks Given Several Analysis Filters:
Factorizations and Constructions
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in March 1994
AB: FIR paraunitary filter banks have been extensively studied and
well-understood recently. In this paper, we address the following
problem: How to characterize and construct an FIR paranunitary
filter bank when its several analysis filters are given in priori.
To study this problem is not only important in orthogonal M-band
wavelets with certain regularity where we need to construct wavelet
filters when a scaling filter with certain regularity is found in
priori, but also important in the design of multirate filter banks
where we have already had several desired analysis filters. This
paper presents a solution to the above problem and a method to
construct all possible FIR paraunitary filter banks in terms of a
McMillan degree when several analysis filters are given.
FN: gsaf.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: On Necessary and Sufficient Conditions for Perfect Reconstruction
Multidimensional Delay Chain Systems
AU: Xiang-Gen Xia, Bruce W. Suter and Mark E. Oxley
IN: Air Force Institute of Technology
ST: Submitted in March 1994
AB: In this paper, we present necessary and sufficient conditions for
a perfect reconstruction (PR) multidimensional (MD) delay chain
system. With these results, one is able to systematically check if
a D-dimensional delay chain system with a D x D sampling matrix
M and a D x D delay matrix L has PR property in a simpler way than
before, where the matrix modulo operations are avoided. Moreover,
given a D x D sampling matrix M, in many cases one can determine
all possible D x D delay matrices L so that the delay chain systems
with the sampling matrix M have PR property. Several examples are
provided. We also present a method to generate D x D sampling and
delay matrices M and L such that their corresponding MD delay chain
systems are PR.
FN: mdchain.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: Improved Backus-Gilbert Method for Signal Reconstruction with a
Wavelet Model
AU: Xiang-Gen Xia, C.-C. Jay Kuo and Bruce W. Suter
IN: Air Force Institute of Technology
ST: SPIE Proceedings, Orlando, Florida, April 1994
AB: In this article, we first introduce scale-time limited signal
spaces with continuous wavelet transform and present some properties
of these signals. We then generalize the Backus-Gilbert (BG) method
for moment problems so that the BG method is applicable to scale-time
limited signals and meanwhile the property of the scale-time limitedness
is utilized.
FN: bg.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: On the Householder Transform in C^m
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: To appear in Digital Signal Processing
AB: In this paper, we show the necessary part of the Householder
transform in C^m developed by Venkaiah, Krishna and Paulraj.
FN: house.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: A Construction of Two Dimensional Perfect Reconstruction
Spatial-Varying FIR Filter Banks With Overlaps
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in June 1994
AB: Because of the nonstationarity of signals, such as, speech
and images, time-varying filter banks have been recently
discussed for one dimensional signals. To build multidimensional
spatial-varying filter banks, a trivial way is to use tensor
product of time-varying filter banks, i.e., separable spatial-
varying filter banks. However, nonseparable filter banks for
multidimensional signals are desired in many applications, such as,
subband coding. In this paper, we present a systematic method to
construct two dimensional spatial-varying filter banks with perfect
reconstruction property from arbitrary given two dimensional
separable or nonseparable local perfect reconstruction FIR filter
banks on different rectangular regions, where overlaps between
neighboring regions are allowed to eliminate the blocking effects.
In particular, nonseparable discrete wavelet transforms are studied.
A numerical example is given to illustrate the theory.
FN: svfb.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: Malvar Wavelets with Asymmetrically Overlapped Windows
AU: Xiang-Gen Xia, Bruce W. Suter and Mark E. Oxley
IN: Air Force Institute of Technology
ST: Submitted in April 1994
AB: Malvar wavelets (or lapped orthogonal transforms) with symmetric
overlaps have been recently studied extensively. In this paper,
we consider Malvar wavelets with asymmetric overlaps in both
continuous-time and discrete-time cases. We present conditions
on window functions in continuous-time case so that Malvar wavelets
can be constructed from different local bases. However, in
discrete-time case, we show that Malvar wavelets are impossible
unless the overlaps are symmetric. Numerical examples are presented
to illustrate the theory.
FN: asym.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: Multirate Filter Banks with Block Sampling
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in April 1994
AB: In this paper, we study general vector filter banks where the input
signals and transfer functions in conventional multirate filter
banks are replaced by vector signals and transfer matrices,
respectively. We show that multirate filter banks with block
sampling and linear time invariant transfer functions studied by
Khansari and Leon-Garcia are special vector filter banks where the
transfer matrices are pseudo-circulant. We present some fundamental
properties for the basic building blocks, such as, Noble identities,
interchangeability of down/up sampling, polyphase representations
of $M$-channel vector filter banks and multirate filter banks with
block sampling. We then present necessary and sufficient conditions
for the alias free property, FIR systems with FIR inverses,
paraunitariness and lattice structures for paraunitary vector filter
banks. We also present a necessary and sufficient condition for
paraunitary multirate filter banks with block sampling. As an
application of the theory, we present all possible perfect
reconstruction delay chain systems with block sampling. We show
some examples which are not paraunitary for conventional multirate
filter banks but are paraunitary for multirate filter banks with
proper block sampling. In this paper, we also present a connection
between vector filter banks and vector transforms, which have
applications in image coding.
FN: block.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
TI: Construction of Malvar Wavelets on Hexagons
AU: Xiang-Gen Xia and Bruce W. Suter
IN: Air Force Institute of Technology
ST: Submitted in August 1994
AB: In this paper, we construct two dimensional continuous (smooth)
Malvar wavelets defined on a hexagon $A$, which constitute
an orthonormal basis of $L^2(A)$. The method can be generalized
to many hexagons.
FN: hex.ps.Z
MA: archive.afit.af.mil
TL: Compressed Postscript
From: TAWagen@aol.com
Subject: Job: Consulting Opportunity
A Califormia company is looking for short term consulting help in the
area of low bit rate video compression using wavelets. Experience in
hands-on tuning of subband video coders is highly desirable. The company is
developing low bit rate video codecs for PC's. Mail a resume to
tawagen@AOL.com, or to 76557,1424 on Compuserve for more information on this
opportunity. There is also the potential for a permenant position.
From: maesumi@cs4.lamar.edu (Mohsen Maesumi)
Subject: Question: numerical calculation Riesz Projections
I am looking for information about numerical calculation of
"Riesz Projection" using wavelets. Suppose we know the value of
f(t)= sum over all integers of C_n e^(int) at equally spaced points
on [0, 2*pi] we want to calculate g(t)= sum over nonnegative integers of
C_n e^(int). g is called the Riesz Projection of f.
Any pointers will be appreciated.
Mohsen Maesumi
maesumi@math.lamar.edu
From: lindsey@redneck.ent.ohiou.edu (Alan Lindsey ECE Grad)
Subject: Preprint: Nonexistence of a Wavelet Convolution Theorem
For those interested parties, I have recently put forth a small
contribution to the search for a wavelet convolution theorem. The
report is titled:
"The Nonexistence of Wavelet Functions Admitting a Wavelet Convolution
Theorem of the Fourier Type."
It is basically a proof that the convolution theorem we systems guys
would like to see, does not exist. If interested, send mail to:
lindsey@redneck.ent.ohiou.edu
and I will see that you get a copy of the paper in electronic form.
Alan Lindsey, Ohio University, Athens, Ohio.
From: Simant Dube <simant@germain.une.edu.au>
Subject: Question: looking for nonseparable 2-D Wavelets
Coefficients of High-Pass and Low-Pass Filters
Based on Nonseparable 2-D Wavelets
I am interested in applying wavelets for image compression.
I would like to try out nonseparable 2-D wavelets for this
purpose (which are not cartesian product of 1-D wavelets).
I am aware that such wavelets do exist which are genuinely
2 dimensional, but does anybody have actual values of
the coefficients of filters based on such wavelets, and
any pointers to the relevant literature?
Thanks in advance.
Simant Dube
Email: simant@germain.une.edu.au
Dept of Math and Comp Sci UNE Armidale NSW 2351 Australia
From: Debao Chen (chen@math.utexas.edu)
Subject: Preprint: Dissertation and preprint from D. Chen
DISSERTATION: "Cardinal Spline Wavelets"
Brief Abstract: In this dissertation, we study the general
structure of cardinal spline wavelets. Various new cardinal
spline wavelets are given. In particular, we give a
characterization of the biorthogonal cardinal spline wavelet bases.
PREPRINT: "Characterization of biorthogonal cardinal spline wavelet
bases"
This paper resulted from the above dissertation. It is CNA Report 270.
(Here, CNA refer to the Center for Numerical Analysis, the University
of Texas at Austin.)
To get PostScript files of the above dissertation and paper,
you can use anonymous ftp to the UT Math Department computer network,
(math.utexas.edu). When ftp prompts for your
userid, you should type "anonymous". For your password you should
type your email address. Once the connection has been made,
you should type "cd pub/papers/CNA/d.chen". In this directory,
you can also find the PostScript files of the following papers,
which we announced previously.
"Extended families of cardinal spline wavelets". (This paper
has appeared in "Applied and Computational Harmonic Analysis",
vol 1, 194-208 (1994) )
PAPER: "Spline wavelets of small support". (To appear in SIAM
J. Math. Anal.)
With permission from Academic Press, Inc. and SIAM, I have included
these two papers in the above dissertation.
If you have any questions or comments, please let me know.
Debao Chen
Department of Mathematics Oklahoma State University Stillwater, OK 74078
email: chen@math.utexas.edu
From: berg@pool.informatik.rwth-aachen.de (Stephen R. van den Berg)
Subject: Question: wavelets and tomographic reconstruction
Hello waveleteers,
I'm doing some research concerning the use of wavelets in tomography,
especially geared towards ending up with a practical implementation.
I tried collecting some articles about the subject, the results so far
turned out to be extremely meager. Maybe I was looking for the wrong
keywords, maybe there really isn't that much material out there.
If anyone's interested, I can compile the list of articles I have so
far and post it here.
In any case, I'd like to get into contact with people who have done or
are doing similar things (tomography using wavelets). I'd also be
very grateful for any pointers to (yet unpublished?) articles about
the subject, or pointers to sample routines/programs/packages (even
uncommented source is acceptable) that do something similar.
I couldn't help noticing that in the papers I have, everyone discusses using
the continuous wavelet transform for tomographic reconstruction. Anyone
who tried it with a discrete approach?
Sincerely, berg@pool.informatik.rwth-aachen.de
Stephen R. van den Berg (AKA BuGless).
From: Mcody@aol.com
Subject: Software: Tsunami Plus Wavelet Software (Version 1.0)
Mac A. Cody Associates has developed Tsunami Plus 1.0, a li-
brary of Wavelet transform routines and support functions. The
library contains routines to perform one- and two-dimensional
Discrete Wavelet and Wavelet Packet transforms. While most of
the transforms are designed to work with buffered data, "sliding"
transforms are also provided for sampled-data processing. The
routines will work with either single- or double-precision float-
ing point data. In addition, the library contains support rou-
tines for the management and display of transform data and the
design and verification of wavelet filters used by the trans-
forms. The routines of the library are used in demonstration
programs which are provided with the library.
As mentioned above, the one-dimensional wavelet transform rou-
tines are divided into two groups: buffered-data processing and
sampled-data processing. The buffered-data processing routines
can be further divided into those which assume that the buffered
data represents periodic or aperiodic scope (that is, the ends of
the buffer do or do not wrap around, respectively). Advantages
exist for both approaches to transforming the data. The "sliding"
transform is designed to work with open-ended data sets and real-
time applications. The transform coefficients are generated at
each level as new input data becomes available. This allows the
user to study new coefficient values at each level as soon as
they become available.
The Wavelet Packet transform routines are general forms of the
corresponding Wavelet transform routines. They give the user
flexibility in optimizing between scale and time resolution over
the entire frequency range of the data. This flexibility is
gained at the cost of increase processing time.
The two-dimensional Wavelet and Wavelet Packet transforms are
designed for general processing of matrix data, not just image
data. They are optimized to conserve memory usage while still
providing good processing performance. The two-dimensional rou-
tines assume that the data is periodic in scope in both the hor-
izontal and vertical dimensions.
Transform coefficient data and wavelet packet disjoint covers
are managed via structures created dynamically off of the heap.
The routines provide robust heap access. Insufficient heap space
causes the current structure construction to abort gracefully,
returning the acquired memory back to the heap and signaling an
error. Routines to manage the node settings of the disjoint
covers are also provided.
The wavelet transform routines described above are not of much
use if there are no wavelet filters to use with them. To satisfy
this need, a set of routines are provided generate orthogonal
wavelet filter coefficients. The routines implement a new para-
meterization algorithm, developed by E. Kurt TeKolste, which is
similar in concept to the parameterization method of Tewfik. The
TeKolste algorithm can generate the Daubechies wavelets and other
orthogonal wavelets. There is no limitations to the length of
the filters that can be generated beyond that set by the number
of parameterization angles and the floating point precision.
Routines are provided to tests arbitrary sets of wavelet filter
coefficients and TeKolste parameter values for compliance to
orthogonal wavelet definitions. Wavelet filter parameter sets
can be converted between TeKolste format and Pollen (alpha, beta)
format. In addition, an implementation of Ingrid Daubechies'
"cascade" algorithm is provided. This algorithm constructs the
recursively-defined scaling and wavelet functions from the wave-
let filter coefficients.
The graphics routines allow the display of menus to control the
configuration and operation of the transforms and their support
routines. The menu routines favor event driven programming and
use data structures for easy definition, initialization, and con-
trol. Graphics routines are provided to draw characters, rec-
tangles, data blocks, waveforms, and scaleograms on the screen.
In addition, routines for drawing and extracting rows of image
data are provided.
The transform routines and most of the support functions and
demo programs in Tsunami Plus are written entirely in Standard 'C'
and can be easily ported to other platforms. The graphics display
functions make use of 80286 in-line assembly language code for
efficiency. The graphics routines allow the user to quickly de-
velop real-mode DOS applications with the VESA VBE graphics stan-
dard.
Tsunami Plus 1.0 is shipped as C source code modules. The de-
monstration programs are shipped with 80X86 DOS executables as
well as source code. Compilers directly supported are Borland
Turbo C 2.0 Professional and Borland C++ 4.0 (Microsoft C is sup-
ported through macro definitions). Documentation for the library
routines, the demo programs, and tutorial materials are also pro-
vided. The library is delivered on a 1.44 Mb IBM-format, 3.5"
microdiskette.
Tsunami Plus 1.0 comes with a no-nonsense, single-user license.
The library may be used to generate applications that may be
distributed free of royalties.
The formal release date for Tsunami Plus 1.0 is 15 September,
1994. At that time, the library will sell for US$499.00 plus
US$10.00 shipping and handling in the US and Canada (US$20.00
elsewhere). If you would like to reserve a copy prior to the
formal release date, you will receive a discount of US$50.00 on
the price of the package. To reserve your copy of Tsunami Plus,
please send US$449.00 plus shipping and handling as described
above. Note: please remit payment in US funds. Sorry, credit
card orders cannot be accepted at this time.
For additional information or to reserve your copy, contact:
Mac A. Cody Associates
1113 Abrams Rd. #140
Richardson, TX 75081-5512
800.WAVELET
214.437.5761
mcody@aol.com
From: bobl@cs.ubc.ca
Subject: Software: The UBC Wavelet Package -- Release 1.2
Announcing wvlt: The UBC Wavelet Package -- Release 1.2
I am putting in the public domain Release 1.2 of "wvlt", the Imager Wavelet
Library. This is a small library of wavelet-related functions in C that
perform forward and inverse transforms and refinement. Support for 15
popular wavelet bases is included, and it's easy to add more.
The package also includes source for a couple of shell-level programs to do
wavelet stuff on ASCII files and some demo scripts. (The demos require
"gnuplot" and "perl" to be installed on your system.) The code has been
compiled and tested under IBM RS/6000 AIX, Sun SPARC SunOS, and SGI IRIX,
and should port to other systems with few problems.
The package is available as a shell archive ("shar" file) either by ftp
(ftp.cs.ubc.ca:/pub/pickup/wvlt/wvlt_r1_2.shar) or World Wide Web via the
Imager Home Page (http://www.cs.ubc.ca/nest/imager/imager.html). There
is a link to it from the Wavelet Digest pages as well.
Future releases are under development and will include both speedups and
increased functionality. They will be available by the same mechanisms.
I produced this package and hereby release it to the public domain. Neither
I nor the University of British Columbia will be held responsible for its
use, misuse, abuse, or any damages arising from same. Any comments
regarding this package may, nevertheless, be sent to:
- Bob Lewis
bobl@cs.ubc.ca
<webmaster@wavelet.org>