[Home]
[Back Issues]
[Search]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
The Wavelet Digest - Volume 2, Issue 8 (May 28, 1993)
Today's Editor: Wim Sweldens
sweldens@math.sc.edu
Today's Topics:
1. CFP: Electronic Transactions on Numerical Analysis
2. Preprint available: Biorthogonal Wavelets and Multigrid
3. Question: Wavelets in spherical coordinates
4. Question: PDE's and wavelets
5. Question regarding a proof in Daubechies' book
6. Preprint available: Dip Bounds for the 2D Wavelet Transform
7. Survey of wavelet routines in MATLAB
8. Preprint available: Wavelets for the fast solution of ODE's
9. Wavelet transform course announcement
Submissions for Wavelet Digest:
E-mail to wavelet@math.sc.edu with "submit" as subject.
Subscriptions for Wavelet Digest:
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.
Archive site:
Anonymous ftp to maxwell.math.sc.edu (129.252.12.3),
directory /pub/wavelet/archive.
Gopher server: bigcheese.math.sc.edu.
Current number of subscribers: 2645
Notes from the editor:
1. We have been informed that some of the e-mail sent to the Wavelet Digest
was lost. If you have submitted something which did not appear,
please resend your message. We apologize for this inconvenience.
2. We are still working on the compilation of the "Wavelet Book Digest",
a summary of books on wavelets. Therefore we would like to ask you
again to send us:
- announcements of books which have not appeared earlier in the digest,
- reviews on wavelet books (or references to reviews),
- your impressions if you use or used any of these books in a course.
Thank you very much for your collaboration.
From: L. Reichel, Kent State University
Subject: CFP: Electronic Transactions on Numerical Analysis
Call for Papers
Electronic Transactions on Numerical Analysis
Scope:
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal
for the publication of significant new and important developments in numerical
analysis and scientific computing. Papers of the highest quality that deal with
the analysis of algorithms for the solution of continuous models and numerical
linear algebra are appropriate for ETNA, as are papers of similar quality that
discuss implementation and performance of such algorithms. New algorithms for
current or new computer architectures are appropriate provided that they are
numerically sound. However, the focus of the publication should be on the
algorithm rather than on the architecture. The journal is published by the Kent
State University Library in conjunction with the Institute of Computational
Mathematics at Kent State University. Mathematical Reviews will receive all
papers accepted for publication in the journal and review them as appropriate.
ETNA is registered with the Library of Congress and has ISSN 1068-9613.
Dissemination:
On a quarterly basis, accepted manuscripts will be posted in a directory which
is publicly accessible through Internet. The titles and abstract of these
manuscripts will be e-mailed to registered departments and individuals and
posted on public bulletin boards such as NA-digest. An individual who wishes
to obtain a copy of a current or back manuscript can get a copy through
anonymous FTP or by using a netlib-type mailer. We also plan to install
Gopher. All manuscripts will be available in Post Script format. The first
issue of ETNA will appear September 1, 1993. Funds made available by the
Kent State University Library and the Kent State University make free
subscription possible for at least three years. After this time period we
may have to charge an annual fee from institutional subscribers. Since the
operating costs for the journal are low, we envision that this fee will not
be above $100 for institutional subscribers. Everybody at the subscribing
institution will have access to ETNA by FTP, a netlib-type mailer or Gopher.
In addition, articles in ETNA can be obtained through interlibrary loan from
Kent State University Library.
To register to receive ETNA's quarterly titles and abstract lists, please send
an e-mail message to etna@mcs.kent.edu. The subject of the message should be:
ETNA registration. Titles and abstracts of papers published in ETNA will be
e-mailed quarterly to the return addresses of all such requests. Inquiries for
further information should also be e-mailed to etna@mcs.kent.edu.
Submission, Acceptance and Refereeing:
Authors will normally submit papers for publication via e-mail, and they will
be required to submit their manuscript in LaTeX or TeX using macros we provide.
Requests for macros can be sent by e-mail to etna@mcs.kent.edu. All papers will
be refereed. As soon as a paper has been accepted for publication in ETNA, it
will be entered into the ETNA data base. There are no annual page limitations,
and, therefore, we are in a position to publish accepted manuscripts faster
than many other journal. Manuscripts can be submitted NOW by sending them to
the address etna@mcs.kent.edu.
Current Editorial Board:
L. Reichel Kent State University
editor-in-chief reichel@mcs.kent.edu
R.S. Varga Kent State University
editor-in-chief varga@mcs.kent.edu
A. Ruttan Kent State University
managing editor ruttan@mcs.kent.edu
G.S. Ammar Northern Illinois University
J.W. Demmel University of California, Berkeley
J.J. Dongarra University of Tennessee
I.S. Duff Rutherford Appleton Laboratory
M. Eiermann University of Karlsruhe
J.A. George University of Waterloo
G.H. Golub Stanford University
W.B. Gragg Naval Postgraduate School
M.H. Gutknecht Swiss Federal Institute of Technology
V. Mehrmann Technical University of Chemnitz-Zwickau
D.C. Sorensen Rice University
G.W. Stewart University of Maryland
O.B. Widlund New York University
From: Angela Kunoth, Freie Universitat Berlin.
Subject: Preprint: Biorthogonal Wavelets and Multigrid
The following preprint is available:
Biorthogonal Wavelets and Multigrid
Stephan Dahlke and Angela Kunoth
Abstract:
We will be concerned with the solution of an elliptic boundary value
problem in one dimension with polynomial coefficients. In a Galerkin
approach, we employ biorthogonal wavelets adapted to a differential
operator with constant coefficients, and use the refinement equations
to set up the system of linear equations with exact entries (up to
round-off). For the solution of the linear equation, we construct
a biorthogonal two-grid method with intergrid operators stemming
from wavelet-type operators adapted to the problem.
Institut fuer Geometrie und Praktische Mathematik, RWTH Aachen,
Bericht Nr.84, April 1993.
To appear in: Proceedings of the 9th GAMM-Seminar "Adaptive Methods:
Algorithms, Theory and Applications", W.Hackbusch, G.Wittum (eds.),
NNFM series, Vieweg.
There is as well an extended version "A Biorthogonal Wavelet Approach
for Solving Boundary Value Problems",
Institut fuer Geometrie und Praktische Mathematik, RWTH Aachen,
Bericht Nr.85, April 1993.
Send your request to : kunoth@inf.fu-berlin.de
or dahlke@igpm.rwth-aachen.de
From: mrsun@neuronet.pitt.edu (Mingui Sun)
Subject: Question: wavelets in spherical coordinates.
I am considering to compute the wavelet transform of
the electrical potentials on the surface of the head
which is modeled as a sphere. Are there any orthogonal or
non-orthogonal wavelet transforms defined in the polar (2-D) or
spherical (3-D) coordinates? Let me know please. Thanks.
Mingui Sun
mrsun@neuronet.pitt.edu
From: Yuhong Yi, Climate System Research Program, Texas A&M University
Subject: Question: PDE's and wavelets
Hi, all netter,
I would like to get some information and references on solving the partial
differential equations(PDE) by using of wavelet transform.
Any help would be appreciated.
Thanks.
Yuhong Yi
Climate System Research Program
Texas A&M University
College Station, Tx 77843-3150
Tel: 409-845-0177 Fax: 409-862-4132
Email: yi@csrp.tamu.edu or y0y7320@summa.tamu.edu
From: Samir Chettri, Faculty of Technology, Kanazawa University, Japan
Subject: Question regarding a proof in Daubechies' book
Hello wavelet-folks:
Proposal: Why don't we change the wavelet digest name to WAVELETTERS.
Now that we have gotten the jokes out of the way, on to more serious
matters. I'm reading Daubechies book 10 LECTURES ON WAVELETS.
On page 153-154 is a proof of
~
int[ dx x^^l f(x) ] = 0 for l = 0,1, ...., m
(i.e., regularity of wavelets).
I've followed the proof except for one part of equation 5.5.4 (page 154)
The second term of 5.5.4 is written as
/
' | l ~ l
C | dy (1 + |y| ) | f (2 y) |
|
/
|y|>delta
The first and second term of 5.5.4 (only the second term is written above)
is obtained from the second term of 5.5.2. I understand how the first
term of 5.5.4 was obtained. However it is not clear to me how the
second term (as written above) was obtained.
Could someone kindly help me.
Sincerely,
Samir Chettri
chettri@wave.ec.t.kanazawa-u.ac.jp
Note from the editor:
Thank you very much for your suggestion. Actually, the name "Waveletter"
has been suggested to us by several people already and personally I feel
it is a much better name then "Wavelet Digest". We are currently considering
to restructure the setup of the digest and this will most likely be one of
the changes.
From: Jack K. Cohen, University of Colorado
Subject: Preprint available: Dip Bounds for the 2D Wavelet Transform
Quantitative Dip Bounds for the Two-Dimensional Discrete Wavelet Transform
Jack K. Cohen and Tong Chen
Abstract:
An analysis of the discrete wavelet transform of dipping segments
with a signal of given frequency band leads to a \Em{quantitative}
explanation of the known division of the two-dimensional wavelet
transform into horizontal, vertical and diagonal emphasis panels.
The results must be understood in a ``fuzzy'' sense: since wavelet
mirror filters overlap, the results stated can be slightly violated
with violation tending to increase with shortness of the wavelet
chosen.
The specific angles that delimit the three wavelet panels can be
stated in terms of the Nyquist frequency $F_t$ in the first dimension
and the Nyquist frequency $F_x$ in the second dimension. The angle
$\theta_{HV}=\arctan(F_t/F_x)$ approximately separates the dips
$\theta<\theta_{HV}$ that appear in the horizontal panel from those
greater dips that appear in the vertical panel. Similarly, the
angles $\arctan(F_t/2F_x)$, $\arctan(2F_t/F_x)$ approximately bound
the dips appearing in the diagonal panel. These results are simple
and probably have been observed by other researchers, but we haven't
found a prior reference for them.
The entire paper is available from our anonymous ftp site: 138.67.12.63,
in the directory pub/papers/wavelets.
There are 2 versions Dip300dpi.ps.Z and Dip400dpi.ps.Z to
accommodate different printing devices.
Jack K. Cohen,
University of Colorado
jkc@dix.mines.colorado.edu
From: Marten D. van der Laan, University of Groningen, The Netherlands
Subject: Survey of wavelet routines in MATLAB
SURVEY of wavelet routines in MATLAB
Via Usenet-News I asked for Matlab-routines for wavelet analysis. I got some
responses which are, in my opinion, interesting for the digest-readers:
#1 From: Serge J. Belongie (sergeb@cco.caltech.edu)
I have put together and debugged some m-files to implement
the forward and inverse DWT with DAUB4 coefficients. The
input data has to be a power of 2. The 1-D version seems
to be working fine, though the 2-D version still has some minor
problems to be worked out. These m-files are very elementary
as far as wavelet analysis goes, and are most likely a tiny
subset of the toolbox you used, but I thought I'd mention it
to you anyway since they are a simple introduction to a really
neat concept.
#2 From: Srinivas Palavajjhala (srini@wuche2.wustl.edu)
The following are some programs I have written in MATLAB.
wtrans - does wavelet packet decomposition and/or decomp. and
reconstruction at each scale using Daubechies Wavelets and
Coifman Wavelets.
mra - does the multiscale plot.
reconph - is reconstruction of high freq part.
reconpl - is reconstruction of low freq part.
#3 From: Marten van der Laan (marten@cs.rug.nl)
I use a toolbox written by J.C. Kantor (kantor@nd.edu). This toolbox
contains routines for the Fast Wavelet Transform (forward and inverse) using
Daubechies wavelets, a routine for iterating the scaling function \phi and
wavelet \psi, and routines for signal compression using wavelets. This
toolbox has a full TeX documentation.
I tried to contact the author, but I didn't succeed. Anyone who is
interested can contact me.
Myself, I wrote some routines for plotting the wavelet-transformed data in the
time-frequency plane. These routines require Matlab 4.0! I'm currently
fixing some bugs and improving some other things. Again, if you are
interested, contact me.
#4 From: Neil Getz (getz@robotics.Berkeley.EDU)
Neil has written a paper:
"A Fast Discrete Periodic Wavelet Transform"
Memorandum N0. UCB/ERL M92/138
Abstract:
We extend the discrete wavelet transform (DWT) to functions on
the discrete circle to create a fast and complete discrete periodic
wavelet transform (DPWT) for bounded periodic sequences. In so doing
we also solve the problem of non-invertibility that arises in the
application of the DWT to finite dimensional sequences as well as provide
the proper theoretical setting for previous incomplete solutions to the
invertibility problem. We show how and prove that the same filter
coefficients used with the DWT to create orthonormal wavelets on compact
support in l^inf(Z) may be incorporated through the DPWT to create an
orthonormal basis of discrete periodic wavelets. By exploiting transform
symmetry and periodicity we arrive at easily implementable, fast, and
recursive synthesis and analysis algorithms. We include Matlab functions
for DPWT experimentation.
This paper includes MATLAB routines. Please contact the author.
NOTE
I compared the different implementations 1D-discrete wavelet transforms
by Belongie (#1), Kantor (#3) and Getz (#4). Except for some differences in
the lowest frequency components the transformed data were similar.
Also the reconstruction errors (wavelet transform followed by the inverse
wavelet transform) were similar in all three cases.
I only did a very small test with sine input and white noise input, 512
samples. Reconstruction error was of order e-14.
If anyone has some related information, please drop me a message.
Marten D. van der Laan Email: marten@cs.rug.nl
Dept. of Computing Science
University of Groningen
P.O. Box 800
9700 AV GRONINGEN
The Netherlands
From: Wim Sweldens, University of South Carolina
Subject: Preprint available: Wavelets for the fast solution of ODE's.
Title: Wavelet multiresolution analyses adapted for the fast solution of
boundary value ordinary differential equations
Authors: Bjorn Jawerth and Wim Sweldens
Abstract:
We present ideas on how to use wavelets in the solution
of boundary value ordinary differential equations. Rather than
using classical wavelets, we adapt their construction so that
they become (bi)orthogonal with respect to the inner
product defined by the operator. The stiffness matrix in
a Galerkin method then becomes diagonal and can thus be
trivially inverted. We show how one can construct an
O(N) algorithm for various constant and variable coefficient
operators.
Status: Industrial Mathematics Initiative, Report 1993:3
To appear the in proceedings of the sixth Copper Mountain
Multigrid Conference, April 1993.
The postscript or tex (without figures) file of this paper can be
retrieved by using anonymous ftp to maxwell.math.sc.edu,
directory /pub/imi_93, files imi93_3.tex or imi93_3.ps.
From: Lynn Orlando Lynn, UCLA
Subject: Wavelet transform course announcement
UCLA Extension announces a new short course
Wavelet Transform: Techniques and Applications
August 9-11, 1993 at UCLA
For many years, the Fourier Transform (FT) has been used in a wide
variety of application areas, including multimedia compression of
wideband ISDN for teleRcommunications; lossless transform for
fingerprint storage, identification, and retrieval; an increased
S/N ratio for target discrimination in oil prospect seismic
imaging; inRscale and rotationRinvariant pattern recognition in
automatic target recognition; and inRheart, tumor, and biomedical
research.
This course describes a new technique, the Wavelet Transform (WT),
that is replacing the windowed FT in the applications mentioned
above. The WT uses appropriately matched bandpass kernels, called
mother wavelets, thereby enabling improved representation and
analysis of wideband, transient, and noisy signals.
This course is taught by Harold Szu, Research Physicist and
President of INNS, and John D. Villasenor of UCLA's School of
Engineering and Applied Science.
To request a brochure, call (310) 825-1047; FAX (310) 206-2815; or
send your external mailing address to:
lorlando@unex.ucla.edu
Please forward this message to interested colleagues.
<webmaster@wavelet.org>