[Home]
[Back Issues]
[Search]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
The Wavelet Digest - Volume 2, Issue 5 (March 31, 1993)
Today's Editor: Wim Sweldens
sweldens@math.sc.edu
Today's Topics:
1. New wavelet book
2. Question: "complex" orthogonal wavelets.
3. Call for papers, International Conference on Pattern Recognition
4. Question: wavelets and transient signal sprectral analysis.
5. Wavelets at the Dutch Mathematical Congress
6. Reply: Question concerning Numerical Recipes software WD 2.4 #9
7. Wavelet software available (IBM PC and unix c)
8. Contents Numerical Algorithms
9. Question: Implementing C. Chui's semi-orthogonal wavelets.
10. Question: Prediction using wavelets?
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: 2570
From: John J. Benedetto, University of Maryland.
Subject: New wavelet book
Note from the editor:
The following is a TeX file with information on a wavelet book that
John Benedetto and Michael Frazier are editing.
This book will appear in late spring of 1993 (probably by this June).
The publisher is CRC Press, Inc.
\documentstyle[12pt,amssymb]{article}
\pagestyle{empty}
\begin{document}
\begin{center}
{\large\bf WAVELETS: Mathematics and Applications} \\[.4cm]
{\bf John J. Benedetto and Michael Frazier \\
Editors}
\end{center}
\vspace{.4in}
\begin{center}
{\bf TABLE of CONTENTS}
\end{center}
\vspace{.2in}
\hspace*{-.65in} \noindent Introduction
\hspace{.14in} John J. Benedetto and Michael Frazier
\begin{center}
{\bf Core Material}
\end{center}
\begin{enumerate}
\item[Chapter 1] Construction of Orthonormal Wavelets
Robert S. Strichartz
\item[Chapter 2] An Introduction to the Orthonormal Wavelet Transform on Discrete Sets
Michael Frazier and Arun Kumar
\item[Chapter 3] Gabor Frames for $L^2$ and Related Spaces
John J. Benedetto and David F. Walnut
\item[Chapter 4] Dilation Equations and the Smoothness of Compactly Supported Wavelets
Christopher Heil and David Colella
\item[Chapter 5] Remarks on the Local Fourier Bases
Pascal Auscher
\end{enumerate}
\vspace{.2in}
\begin{center}
{\bf Wavelets and Signal Processing}
\end{center}
\begin{enumerate}
\item[Chapter 6] The Sampling Theorem, $\phi$-Transform and Shannon Wavelets for $\Bbb R, \; \Bbb Z, \; \Bbb T$, and ${\Bbb Z}_N$
Michael Frazier and Rodolfo Torres
\item[Chapter 7] Frame Decompositions, Sampling, and Uncertainty Principle Inequalities
John J. Benedetto
\item[Chapter 8] Theory and Practice of Irregular Sampling
Hans Feichtinger and Karlheinz Gr\"{o}chenig
\item[Chapter 9] Wavelets, Probability, and Statistics: Some Bridges
Christian Houdr\'{e}
\item[Chapter 10] Wavelets and Adapted Waveform Analysis
Ronald R. Coifman and Victor Wickerhauser
\item[Chapter 11] Near Optimal Compression of Orthonormal Wavelet Expansions
Bj\"{o}rn Jawerth, Chia-chang Hsiao, Bradley Lucier, and Xiangming Yu
\end{enumerate}
\vspace{.2in}
\begin{center}
{\bf Wavelets and Partial Differential Operators}
\end{center}
\begin{enumerate}
\item[Chapter 12] On Wavelet-Based Algorithms for Solving Differential Equations
Gregory Beylkin
\item[Chapter 13] Wavelets and Nonlinear Analysis
Stephane Jaffard
\item[Chapter 14] Scale Decomposition in Burgers' Equation
Fr\'{e}d\'{e}ric Heurtaux, Fabrice Planchon, and Victor Wickerhauser
\item[Chapter 15] The Cauchy Singular Integral Operator and Clifford Wavelets
Lars Andersson, Bj\"{o}rn Jawerth, and Marius Mitrea
\item[Chapter 16] The Use of Decomposition Theorems in the Study of Operators
Richard Rochberg
\end{enumerate}
\end{document}
From: Praveen Kumar, NASA-Goddard Space Flight Center
Subject: Question: "complex" orthogonal wavelets.
Hi:
I am looking for a "complex" orthogonal wavelet for two-dimensional data
analysis. I'll appreciate receiving any references, info on programs etc.
Praveen Kumar
Code 974 Bldg. 22
NASA-Goddard Space Flight Center
Greenbelt, MD 20771
301-552-2656 (home) 301-286-6811 (office)
praveen@hydromet.gsfc.nasa.gov
From: David Malah, Technion, Israel.
Subject: Call for papers, International Conferences on Pattern Recognition
CALL FOR PAPERS - 12th ICPR
International Conferences on Pattern Recognition
Oct 9-13, 1994, Jerusalem, Israel
The 12th ICPR of the International Association for Pattern Recognition will be
organized as a set of four conferences, each dealing with a special topic. The
program for each individual conference will be organized by its own Program
Committee. Papers describing applications are encouraged, and will be reviewed
by a special Applications Committee. An award will be given for the best
industry-related paper presented at the conference. Considerations for this
award will include innovative applications, robust performance, and
contributions to industrial progress. An exhibition will also be held.
The conference proceedings are published by the IEEE Computer Society Press.
GENERAL CO-CHAIRS: S. Ullman - Weizmann Inst. (shimon@wisdom.weizmann.ac.il)
S. Peleg - The Hebrew University (peleg@cs.huji.ac.il)
LOCAL ARRANGEMENTS: Y. Yeshurun - Tel-Aviv University (hezy@math.tau.ac.il)
INDUSTRIAL & APPLICATIONS LIAISON: M. Ejiri - Hitachi (ejiri@crl.hitachi.co.jp)
CONFERENCE DESCRIPTIONS
1. COMPUTER VISION AND IMAGE PROCESSING, T. Huang - University of Illinois
Early vision and segmentation; image representation; shape and texture
analysis; motion and stereo; range imaging and remote sensing; color;
3D representation and recognition.
2. PATTERN RECOGNITION AND NEURAL NETWORKS, N. Tishby - The Hebrew University
Statistical, syntactic, and hybrid pattern recognition techniques; neural
networks for associative memory, classification, and temporal processing;
biologically oriented neural networks models; biomedical applications.
3. SIGNAL PROCESSING, D. Malah - Technion, Israel Institute of Technology
Analysis, representation, coding, and recognition of signals; signal and
image enhancement and restoration; scale-space and joint time-frequency
analysis and representation; speech coding and recognition; image and video
coding; auditory scene analysis.
4. PARALLEL COMPUTING, S. Tanimoto - University of Washington
Parallel architectures and algorithms for pattern recognition, vision, and
signal processing; special languages, programming tools, and applications of
multiprocessor and distributed methods; design of chips, real-time hardware,
and neural networks; recognition using multiple sensory modalities.
PAPER SUBMISSION DEADLINE: February 1, 1994.
Notification of Acceptance: May 1994. Camera-Ready Copy: June 1994.
Send four copies of paper to: 12th ICPR, c/o International, 10 Rothschild blvd,
65121 Tel Aviv, ISRAEL. Tel. +972(3)510-2538, Fax +972(3)660-604
Each manuscript should include the following:
1. A Summary Page addressing these topics:
- To which of the four conference is the paper submitted?
- What is the paper about? - What is the original contribution of this work?
- Does the paper mainly describe an application, and should be reviewed by
the applications committee?
2. The paper, limited in length to 4000 words. This is the estimated length
of the proceedings version.
For further information contact the secretariat at the above address, or use
E-mail: icpr@math.tau.ac.il .
From: L Geoffroy, The Queen's University of Belfast
Subject: Question: wavelets and transient signal sprectral analysis.
I am looking for information on the application of wavelet transforms
to transient signal spectral analysis.
I would appreciate if someone working in this area could tell me
where I can find some useful information such as literature sources.
Thanks.
Best regards.
L.Geoffroy,
Department of Orthopaedic Surgery
The Queen's University of Belfast
Tel: +44 232 669501 x2823 Fax: +44 232 661112
e-mail: OSG0008@v2.qub.ac.uk
From: Tom H. Koornwinder, Universiteit van Amsterdam, The Netherlands.
Subject: Wavelets at the Dutch Mathematical Congress
The 29th Dutch Mathematical Congress will be held on April 15 and 16, 1993
at the University of Amsterdam, in the psychology building at Roetersstraat 15.
On Friday afternoon, April 16 one of the mini-symposia (organized by
H.J.A.M. Heijmans and Wim Sweldens) will be on wavelets,
with lectures by A. Cohen, J.-P. Antoine and W. Dahmen.
Furthermore the final (plenary) lecture of the congress will be
delivered by B. Jawerth on a wavelet topic.
The full program of these wavelet activities is given below.
For information about the many other congress activities:
see the last issue of "Mededelingen van het Wiskundig Genootschap"
or send email with request for information to wgcong93@fwi.uva.nl
The secretarial address is Ph. Zijlstra, University of Amsterdam,
Faculty of Mathematics and Computer Science, Plantage Muidergracht 24,
1018 TV Amsterdam, fax 020-525 5101.
Advance registration (preferred) can be done by email before April 5.
Ask for electronic registration form by sending email to wgcong93@fwi.uva.nl
and mention on the subject line the single word
formrequest
Late registration is possible during the congress.
Program of the wavelet activities on April 16
13.45-14.30 A. Cohen (Paris), "Regularity estimates for scaling functions and
wavelets"
14.30-15.15 J.-P. Antoine (Louvain-la-Neuve), "Wavelets, from group theory to
signal and image processing"
15.30-16.15 W. Dahmen (Aachen), "Computing inner products of wavelets"
16.30-17.30 B. Jawerth, "Wavelets on closed sets and applications"
Abstract of A. Cohen's lecture:
In many applications of wavelet bases, e.g. image processing and numerical
analysis, it is important to use a regular wavelet and scaling function.
This requirement leads to the problem of estimating the Holder or Sobolev
exponent of these functions which are in many case obtained as a limit of
a subdivision scheme.
We shall review several existing methods that provide with such estimations,
and we shall discuss their specific advantages and drawbacks.
Several related open problems will be raised.
Abstract of J.-P. Antoine's lecture:
The n-dimensional Continuous Wavelet Transform (CWT) is ultimately
rooted in group theory, since it is based on a square integrable
representation of the similitude group of R^n, which in one dimension
reduces to the connected affine group of the line or $ax+b$-group.
From this all the relevant formulas follow: energy conservation,
reproducing kernel, reconstruction formula, etc. In addition, the
parameter space of the CWT may be considered as a phase space, i.e., a
co-adjoint orbit of the corresponding group. In addition to the general
abstract theory just outlined, special emphasis will be put on the
reproducing kernel, both from the conceptual point of view and for
practical implementation (discretization problems, resolving power of
the CWT). Finally, a comparison will be made between the CWT and the
familiar discrete or dyadic transform.
Abstract of W. Dahmen's lecture:
In many applications of wavelet bases, e.g. image processing and numerical
analysis, it is important to use a regular wavelet and scaling function.
This requirement leads to the problem of estimating the Holder or Sobolev
exponent of these functions which are in many case obtained as a limit of
a subdivision scheme.
We shall review several existing methods that provide with such estimations,
and we shall discuss their specific advantages and drawbacks.
Several related open problems will be raised.
Abstract of B. Jawerth's lecture:
Multiscale analysis comes with a natural hierarchical structure obtained by
only considering the linear combinations of building blocks up to a certain
scale. This hierarchical structure is particularly suited for fast numerical
implementations; the underlying idea being that functions on a certain
scale only need to be sampled at a rate approximately given by the scale they
live on. This hierarchical structure is easy to turn into a fast
numerical algorithm for calculating the wavelet transform.
In this lecture we shall discuss procedures which utilize
the inherent hierarchical structure in a different way. These procedures share
the feature that they involve probing and gathering information from
several different scales while keeping the location (essentially) fixed.
Typically, they lead to numerical algorithms which are very fast, with a
complexity proportional to the number of levels being processed.
There are a number of examples of this kind of ``wavelet probing.''
The one we shall consider in greatest detail is the construction of wavelets
on closed subsets. We shall also show how similar ideas lead to extremely quick
algorithms for splitting and merging functions.
Splitting allows us to find the wavelet coefficients associated with
different subsets of a function originally defined on a larger
set. Merging goes in the opposite direction and involves starting with
the wavelet coefficients on the smaller sets and finding the wavelet
coefficients associated with the the union of the sets.
Other examples we shall discuss briefly are algorithms for very quick,
smoothness preserving extensions of functions, pointwise evaluation of
wavelet decompositions, and edge detection.
We shall present applications of these ideas to image compression and
to compression of matrices, and also show how they readily lead to algorithms
perfectly suited for massively parallel environments.
From: Arnold G. Gill
Subject: Reply: Question concerning Numerical Recipes software WD 2.4 #9
Note from the editor: this is a reply to the question posed in
Wavelet Digest 2.4, topip #9. The original question is repeated here.
Guru Prasad writes:
>I got through ananymous ftp, thanks to W. Press, software in FORTRAN
>for 1-d (vector) and 2-d (matrices) wavelet transforms. It has 2 options
>i) D4 wavelets or
>ii) D4, D12 or D20 wavelets
>When I try using these programs to wavelet transform matrices, I get
>different results from D4 of (i) which used subroutine DAUB4 explicitly
>and from D4 option of (ii) where user has to preset the wavelets he wants.
>I am puzzeled about this unable to figure out some thing wrong
>in my using the code or understanding or bug in one of the options
>Any comments from whoever experienced with these softwares?
I discovered this when I tried his routines over two years ago. At
that time, I noticed that the coefficients in the two routines are
rotated in a slightly different manner. I compared the routines to the
defining equations and fixed the appropriate subroutine (can't remember
which one it was). I sent Press a note, got an acknowledgement from him
and uploaded the corrected routines to him. I don't know if this is the
same problem that you are experiencing now, but I would be very
disappointed if Press hadn't corrected the routines after having the
very minor error pointed out to him years ago.
So that is my advice - check the rotation of the coefficients,
using a Dirac signal. That should help you to clear things up.
Arnold G. Gill, gill@mala.bc.ca
From: Steven Gollmer, Purdue University.
Subject: Wavelet software available (IBM PC and unix c)
I have written a wavelet program for the IBM PC. It performs the wavelet
transform along with low, high, bandbass and notch filtering. Though it does
not have a graphical interface, the documentation explains how the results
are saved in the output file along with some examples of what the wavelet
transform is doing. The wavelets used are Haar, D4 through D20. The source
code is included with the program. If you are interested in obtaining this
program, it is located at the following anonymous ftp sites.
simtel20 - msdos/electrical/daubwave.zip
wuarchive.wustl.edu - edu/math/msdos/modelling/daubwave.zoo
If you do not have access to these sites I am willing to e-mail you the
source code, which is written in ANSI C, and the documentation. I also have a
version that will compile under unix c.
Steven Gollmer
Civil Building
Dept EAS
Purdue University
West Lafayette, IN 47907
nls@mace.cc.purdue.edu
From: Daniel Baltzer
Subject: Contents Numerical Algorithms
Editor-in-Chief: Claude Brezinski, Laboratoire d'Analyse Numerique et
d'Optimisation, UFR IEEA - M3, Universite de Lille 1, France, fax: +33 - 20
43 49 95, e-mail: brezinsk@frcitl81.bitnet
Numerical Algorithms, Volume 3 (1993), issues 1-4:
Moment problem formulation of the Schrödinger equation, D. Bessis and C. R.
Handy.
Extrapolation methods in numerical integration, P. Rabinowitz
A reliable modification of the cross rule for rational Hermite
interpolation, B. Beckermann and C. Carstensen.
A uniform approach for Hermite Pade and simultaneous Pade approximants and
their matrix-type generalizations, B. Beckermann and G. Labahn.
Interpolatory integration rules and orthogonal polynomials with varying
weights, T. Bloom, D.S. Lubinsky and H. Stahl.
Para-orthogonal Laurent polynomials and associated sequences of rational
functions, C.M. Bonan-Hamada, W.B. Jones, W.J. Thron and A. Magnus.
Some vector sequence transformations with applications to system of
equations, C. Brezinski and H. Sadok.
A Favard theorem for orthogonal rational functions on the unit circle, A.
Bultheel, P. Gonzalez-Vera, E. Hendriksen and O. Njastad.
A moment problem associated to rational Szego functions, A. Bultheel, P.
Gonzalez-Vera, E. Hendriksen and O. Njastad.
Orthogonal rational functions and quadrature on the unit circle, A.
Bultheel, P. Gonzalez-Vera, E. Hendriksen and O. Njastad.
Rational approximants to symmetric formal Laurent series, M. Camacho and P.
Gonzalez-Vera.
Rational interpolation with a single variable pole, J. M. Carnicer.
The Neville-Aitken formula for rational interpolants with prescribed poles,
C. Carstensen and G. Muhlbach.
Rational approximations for the cosine function: P-acceptability and order,
J.P. Coleman.
Multivariate rational data fitting: general data structure, maximal
accuracy and object orientation, A. Cuyt and B. Verdonk.
Implementation of the recurrence relations of biorthogonality, Z. Da Rocha.
Convergence of simultaneous Hermite-Pade approximants to the n-tuple of
q-hypergeometric series, M. G. de Bruin, K.A. Driver and D.S. Lubinsky.
Bivariate Hermite-Birkhoff interpolation and Vandermonde determinants, M
Gasca and J.J. Martinez.
Matrix orthogonal Laurent polynomials and two-point Pade approximants, C.
Gonzalez-Concepcion, P. Gonzalez-Vera, and E. Hendriksen.
On extrapolation of Jagerman and Stetter rules, S. Gonzalez-Pinto, P.
Gonzalez-Vera and J.C. Santos.
Solution of integral equations using function-valued Pade approximants II,
P.R. Graves-Morris and R. Thukral
Rational approximation to Neumann series of Bessel functions, N. Hayek, P.
Gonzalez-Vera and F. Perez-Acosta.
A Levin-type algorithm for accelerating the convergence of Fourier series,
H.H.H. Homeier.
Asymptotics for Szego polynomial zeros, W.B. Jones, O. Njastad and H. Waadeland.
Evaluation of a rational function, A.G. Law, C.N. Zhang, A. Rezazadeh and
L. Jodar.
The quadratic convergence of the topological epsilon algorithm for systems
of nonlinear equations, H. Le Ferrand.
Quadratic decomposition of orthogonal polynomials: a matrix approach, F.
Marcellan and G. Sansgire.
Two-dimensional orthogonal polynomials, their associated sets and the
co-recursive sets, P. Maroni.
Convergence and acceleration properties for the vector e-algorithm, A.C. Matos.
On the internal stepsize of an extrapolation algorithm for IVP in ODE,
M.Murofushi and H. Nagasaka.
Extrapolation methods for some singular fixed point sequences, N. Osada.
On higher order Pade-type approximants with some prescribed coefficients in
the numerator, M.A. Pinar and T.E. Perez.
Particular rules for the O-algorithm, M. Redivo Zaglia.
Clifford algebras and vector-valued rational forms II, D.E. Roberts.
P.C.-fractions and Szego polynomials associated with starlike univalent
functions, F. Ronning.
Sobolev inner products and orthogonal polynomials of Sobolev type, A, Ronveaux.
Asymptotic behaviour of iterated modified transforms on some slowly
convergent sequences, P. Sablonniere.
Numerical factorization of a polynomial by rational Hermite interpolation,
T.Sakurai, H. Sugiura and T. Torii.
On extending backwards positive definite sequences, F.H. Szafraniec.
Global extrapolation with a parallel splitting method, X.-C. Tai.
Limit period Schur algorithms, W.J. Thron.
A general module theoretic framework for vector M-Pade and matrix rational
interpolation, M. van Barel and A. Bultheel.
Best choice of the pole for the Pade-type approximant of a Stieltjes
function, J. van Iseghem.
Interpolation between sequence transformations, E.J. Weniger.
Requests for sample copies and orders are to be sent to J.C. Baltzer AG,
fax: +41-61-692 42 62, e-mail: na.baltzer@na-net.ornl.gov
From: Patrick Marais
Subject: Question: Implementing C. Chui's semi-orthogonal wavelets.
Hi,
I am currently implementing C. Chui's semi-orthogonal wavelet
decomposition (of images) as part of my master's thesis. I was able to
implement the quadratic scheme without any real problems. However, when
I included code to perform the cubic decomposition, the reconstructed
images were overlayed with a regular grid of lines in some circumstances
as outlined below.
When the number of terms in the detail decomposition sequence,
conventionally named {b}, is increased to about 25, these lines are no
longer evident. At first, I believed my boundary conditions to be at
fault; subsequently, I tried substituting an alternative sequence for
the detail sequence - just the original sequence {b} negated - without
altering my boundary conditions. Obviously, the image was distorted (as
I had expected), however, these lines are no longer visible.
It is possible that my boundary conditions may indeed be in error.
Could some kind soul out there inform me of the methods generally used
to deal with such boundary problems? I have used a periodic
symmetrization to extend the image (fairly standard as far as I know).
Furthermore, I generally only consider image (basis) coefficients
supported on a lattice marginally larger than the original image - this
certainly proved sufficient in the quadratic case. (I have, however,
tried extending this support dramatically for the cubic case, to no
avail). Is there anything else I might consider?
Any help would be greatly appreciated!
Thanks in advance,
Patrick C. Marais
e-mail: patrick@cs.uct.ac.za
From: Dilip Krishnaswamy, Computer Science Dept, Syracuse University.
Subject: Question: Prediction using wavelets?
Hi.
I am seeking information related to prediction of non-stationary
time signals using wavelets. If someone has any info related to this,
please do let me know. (preferably on discrete time signals).
Thanks.
Dilip Krishnaswamy
Computer Science Dept.
Syracuse University NY 13244
email: dkrishna@cat.syr.edu
<webmaster@wavelet.org>