[Home]
[Back Issues]
[Search]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
The Wavelet Digest - Volume 1, Issue 8 (November 7, 1992)
Today's Editor: Wim Sweldens
Today's Topics:
1. Paper available
2. Visit
3. Book announcement
4. Call for papers
5. Question
6. Question
7. Contents Numerical Algorithms
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.
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: 2248
From: Fritz Keinert, Department of Mathematics, Iowa State University
Date: Tue, 03 Nov 92 09:49:43 CST
Subject: paper available
Author: Fritz Keinert
Dept. of Mathematics
Iowa State University
Ames, IA 50011
(515) 294-5223
keinert@iastate.edu
Title: Biorthogonal Wavelets for Fast Matrix Computations
Status: Submitted to "Applied and Computational Harmonic Analysis"
October 1992
Abstract: In (G. Beylkin, R. Coifman, V. Rokhlin, Fast wavelet
transforms and numerical algorithms: I, Comm. Pure Appl.
Math. 44(1991), 141--183), Beylkin et al. introduced a
wavelet-based algorithm that converts matrices of a certain
type into highly sparse matrices, as the basis for efficient
approximate calculations. Compression is achieved by doing
a wavelet decomposition of the matrix and setting small
entries to zero. The wavelets best suited for achieving the
highest possible compression with this algorithm are
Daubechies wavelets, while coiflets lead to a faster
decomposition algorithm at slightly lesser compression. We
demonstrate how the same algorithm can be based on
biorthogonal instead of orthogonal wavelets, and derive two
classes of biorthogonal wavelets that achieve high
compression and high decomposition speed, respectively. In
numerical experiments, these biorthogonal wavelets achieved
both higher compression and higher speed than their wavelet
counterparts, at comparable accuracy.
Availability: anonymous ftp from pollux.math.iastate.edu (129.186.52.4),
in directory pub/keinert. Get file README first.
- biortho.dvi (text of paper, without figures), 84K
- biortho_figures.ps (figures only, in PostScript), 925K
From: Lolina Alvarez, New Mexico State University.
Date: Mon, 2 Nov 92 16:45:34 MST
Subject: visit
Prof. Ingrid Daubechies will be the Distinguished Visiting Professor at
New Mexico State University on March 15-22, 1993.
The visit is supported by a University grant and sponsored by the Departments
of mathematics, Physics and Astronomy, the Center for Space Telemetering,
the Computer Research Laboratory and the Committee for the History,
Philosophy and Social Studies of Science.
Prof. Daubechies will deliver a series of lectures and will conduct discussions
on topics of interest to the sponsoring units.
For more information, please contact
Lolina Alvarez, (505) 646-2717, jalvarez@nmsu.edu
From: P.P. Vaidyanathan, Caltech.
Date: Fri, 30 Oct 92 10:53:33 PST
Subject: Book announcement
NEW BOOK ANNOUNCEMENT
The following text was recently published.
MULTIRATE SYSTEMS AND FILTER BANKS, by P. P. Vaidyanathan,
Prentice Hall (A. V. Oppenheim series on Signal Processing).
911 pages, over 300 homework problems, 65 dollars, hardbound.
Fourteen chapters:
1. Introduction.
2. Review of discrete-time systems.
3. Review of digital filters.
4. Fundamentals of multirate systems.
5. Maximally decimated filter banks.
6. Paraunitary perfect reconstruction systems.
7. Linear phase perfect reconstruction QMF banks.
8. Cosine modulated filter banks.
9. Quantization effects.
10. Multirate filter bank theory and related topics.
11. The wavelet transform and its relation to multirate filter banks.
12. Multidimensional multirate systems.
13. Review of discrete time multi-input multi-output LTI systems.
14. Paraunitary and lossless systems.
Five Appendices:
A. Review of matrices.
B. Review of random processes.
C. Quantization of subband signals.
D. Spectral factorization techniques.
E. Mason's gain formula.
Extensive bibliography.
From: Todd Reed, University of California.
Date: Thu, 29 Oct 92 12:22:59 -0800
Subject: call for papers
Dear Colleague:
The Society for Information Display will meet in Seattle, Washington on
May 16-21, 1993. The meeting will include many sessions of interest to those
involved in image processing, image compression, and image display. I will be
chairing a session entitled "Wavelets and Local Frequency Representations."
Because of your work in this area, I encourage your contribution to this
session.
I enclose a more complete CALL FOR PAPERS below. I hope you will join us at
what promises to be a relevant and exciting meeting.
If you expect to contribute to the session on "Wavelets and Local Frequency
Representations," or if you need further information, please send me a note at:
Todd R. Reed
Department of Electrical and Computer Engineering
University of California
Davis, CA 95616
(916) 752-4720
trreed@ucdavis.edu
CALL FOR PAPERS
SID '93
Society For Information Display (SID)
International Symposium, Seminar And Exhibition
May 16-21, 1993
Washington State Convention Center
Seattle, Washington, USA
Session on
WAVELETS AND LOCAL FREQUENCY REPRESENTATIONS
Session Chair: Todd R. Reed, Univ. of Calif., Davis
The value of the analysis of 1-D phenomena has long been appreciated, in fields
ranging from quantum mechanics to communications. The extension of local
analysis to higher dimensions (2-D and above) has proven valuable in a number
of imaging and computer vision applications, including image segmentation,
enhancement, and coding. There are a variety of representations under
investigation that are suitable as foundations for local analysis. The most
widely known are the class of representations referred to as wavelets. In this
session, we will examine some of the more promising of these representations,
and the applications to which they can be applied.
The following are some other sessions that may be of interest.
SELECTED TOPICS IN IMAGE PROCESSING
SUPER HIGH-DEFINITION IMAGING
Chair: Vasudev Bhaskaran, Hewlett-Packard
IMAGE DATA COMPRESSION
Chair: Ralph Algazi, University of California, Davis
PERCEPTUAL ASPECTS OF IMAGE COMPRESSION
Chair: Andrew B. Watson, NASA Ames Research Center
FIDELITY AND CODING OF IMAGE SEQUENCES
Chair: Stan Klein, University of California, Berkeley
SELECTED TOPICS IN APPLIED VISION
EXTENDING THE DYNAMIC RANGE OF THE DISPLAY
Chair: Eli Peli, Eye Research Institute
IMAGE QUALITY METRICS
Chair: Jeffrey Lubin, David Sarnoff Research Center
Co-Chair: Al Ahumada, NASA Ames Research Center
DIGITAL TYPOGRAPHY
Chair: Avi Naiman, University of Rochester
AVIONIC DISPLAYS
Chair: Brian Tsou, U.S. Air Force
WHERE TO SUBMIT ABSTRACTS:
Send one copy of your abstract and technical summary to:
Beth Akers (SID'93)
Asst. Conference Coordinator
Palisades Institute for Research Services
201 Varick St., Suite 1140,
New York, NY 10014
212/620-3375 (Fax:620-3379)
DEADLINES and KEY DATES:
* Abstract/Summary............Nov. 30, 1992
* Acceptance/Notification.....Jan. 22, 1993
* Paper Submission............Mar. 15, 1993
FORMAT OF SUBMISSIONS:
Please submit your double-spaced 35-50 word abstract and
technical summary on one side of 8.5 x 11 in. pages. The
following format needs to be adhered to:
Page 1: paper title and abstract
Page 2-5: technical summary (including objective,
background, results, impact, references). Four-Page maximum.
From: Samir Chettri, Nasa.
Date: Mon, 26 Oct 92 11:51:52 -0500
Subject: question
Hello Fellow-Surfers:
I have a question related to the article by Gilbert Strang
"Wavelets and Dilation Equations," SIAM, V. 31, #4, pp. 514-627,
December 1989.
On page 617, Strang says:
"For approximation with accuracy $h^p$ , the Fourier transform $ \phi^{\hat} $
must have zeros of order p at all points $ \xi = 2\pi n $ ....."
This statement occurs before "CONDITION A" in his paper. Can anyone
tell me where this statement comes from, i.e., from functional
analysis, approximation theory etc.
It is my understanding that a comprehension the origin of the above
statement is important in understanding CONDITION A.
I have many questions related to the paper but I would like to have
this answered first.
Thanks
Samir (chettri@nssdcs.gsfc.nasa.gov).
From: John Sasso.
Date: Fri, 23 Oct 92 18:56:55 -0400
Subject: question
We have been studying wavelets for some time now and have managed
to get through some of the math that is involved, successfully proving
some of the orthonormality conditions and such for the discrete wavelet
transform. However, I am having trouble with one proof of an
equation which is very important.
Given a set of Daubechies scaling function coefficioents, {h[k]},
k = 0,...,2N-1, the wavelet function psi(t) can be defined in terms of
the scaling function as
psi(t) = ok SUM( (-1)^k h[k+1] phi(2t+k) )
I have had the hardest time trying to derive this equation. I have looked
at Daubechies' proof and others, but I get lost due to the
vagueness of the proof steps. If anyone can send me e-mail on how
to do the proof, I would greatly appreciate it.
Thank you for your help.
John (sassoj@rpi.edu)
From: baltzer%neabbs.UUCP@relay.nluug.nl
Date: Fri Oct 23 12:11:13 1992
Subject: Contents Numerical Algorithms, Vol. 2, no. 2:
Contents new journal NUMERICAL ALGORITHMS,
Editor-in-Chief: CLAUDE BREZINKSI,
Laboratoire d'Analyse Numérique et d'Optimisation,
UFR IEEA - M3,
Université de Lille 1,
France,
fax: +33 - 20 43 49 95,
e-mail: brezinsk@frcitl81.bitnet
Editorial Board: A. BJORCK, Linkoping University, Sweden;
J.C. BUTCHER, University of Auckland, New Zealand;
T.F. CHAN, UCLA, USA;
P.G. CIARLET, Universite Pierre et Marie Curie, France;
W.M. COUGHRAN, Murray Hill, USA;
J. DELLA DORA, Grenoble, France;
M. GASCA, Universidad de Zaragoza, Spain;
G.H. GOLUB, Stanford University, USA;
M.H. GUTKNECHT, ETH Zurich, Switzerland;
P.J. LAURENT, Universite Joseph Fournier, France;
G. MEURANT, Villeneuve St. Georges, France;
C.A. MICCHELLI, IBM Yorktown Heights, USA;
G. MUHLBACH, Universitat Hannover, Germany;
S. PASZKOWSKI, Polish Academy of Sciences, Poland;
K. TANABE, Institute of Statistical Mathematics Tokyo, Japan;
P. VAN DOOREN, Urbana, USA;
R.S. VARGA, Kent State University, USA;
J. VIGNES, Universite Pierre et Marie, France;
M.F. WHEELER, Houston, USA; H. WOZNIAKOWSKI, Warszawa, Poland;
M.H. WRIGHT, Murray Hill, USA;
Software Editor: M. REDIVO ZAGLIA, Universita di Padova, Italy.
Contents Volume 2, no. 2:
N. Osada: Extensions of Levin's transformations to vector sequences;
C. Brezinski, M. Redivo Zaglia and H. Sadok:
Addendum to 'Avoiding breakdown and near-breakdown in Lanczos type algorithms';
K. Tanabe and M. Sagae: Pivoting strategy for rank-one modification
of LDM-like factorization;
S. Paszkowski: Convergence acceleration of continued
fractions of Poincare's type 1;
R.S. Varga and A.J. Carpenter: Some numerical
results on best uinform rational approximation of x^L on [0,1];
J.L. Merrien: A family of Hermite interpolants by bisection algorithms;
S. Cabay and G. Labahn: A superfast algorithm for multi-dimensional Pade
systems;
M. Gasca, C.A. Micchelli and J.M. Pena: Almost strictly positive matrices.
Please submit your papers to one of the Editors of NUMERICAL ALGORITHMS.
ISSN 1017 1398, Volumes 2 and 3 to be published in 1992.
Requests for sample copies and orders are to be sent to
J.C. Baltzer AG,
Scientific Publishing,
fax: +41-61-692 42 62,
e-mail: na.baltzer@na-net.ornl.gov
<webmaster@wavelet.org>