[Home]
[Back Issues]
[Search]
[Calendar]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
[Vol 6]
The Wavelet Digest, Volume 6, Issue 2 (February 11, 1997)
Today's Editor: Wim Sweldens
Lucent Technologies, Bell Laboratories
wim@bell-labs.com
Today's Topics:
1: Preprint: Papers on data smooting using regularization.
2: Preprint: Composite Wavelet Bases for Operator Equations
3: Preprint: Preprints from Akram Aldroubi on multiwavelets.
4: Preprint: Preprints on shift-invariant decompositions
5: Preprint: Stable wavelet bases on non-uniform meshes.
6: Preprint: Comparison of wavelet and wavelet packet denoising algorithms
7: Preprint: Improved transient signal detection
8: Preprint: Preprints from Graphics Group at Caltech.
9: Preprint: Bayesian Wavelet Shrinkage
10: Preprint: Dithered Trigonometric Functions
11: Hardware: Biorthogonal wavelet filters from Fastman, Inc.
12: Software: C++ wavelet image compression source
13: Meeting: Summer school on New Interactions in Marseille
14: Varia: Request for MSc thesis External Examiner
15: Varia: Call for nominations 1998 Popov's Prize
16: Job: PDF Position at UBC in Vancouver
17: Job: Postdoctoral Fellowships At Los Alamos National Laboratory
18: Job: Graduate Fellowships At Los Alamos National Laboratory
19: Contents: J. Approx. Th. - nov96 dec96 jan97
20: Answer: Biorthogonal Wavelets in high dimensions (WD 5.10 #24)
21: Answer: Wavelet sampling (WD 6.1 #24)
22: Answer: Wavelet sampling (WD 6.1 #24)
23: Question: Wavelet and CDMA
24: Question: Wavelet applications in Communications
25: Question: Wavelets and DSP implementations
26: Question: Wavelets in Speech Recognition
27: Question: Papers on wavelets applications in Image Registration.
28: Question: What is the best wavelet package for image compression?
29: Question: Wavelets and DSP
30: Question: Help on wavelet compression of medical images
Current number of members: 8853
E-mail:
Help: help@wavelet.org
Add yourself as a member: add@wavelet.org
Remove yourself as a member: remove@wavelet.org
Publish in the next WD: publish@wavelet.org
Visit us on the Web at http://www.wavelet.org/
Calendar of events:
Jan 23-25: Workshop on Wavelets and Applications, Madras, India
Mar 10-12: Workshop on Scientific Computing 97, Hong Kong
Mar 20-22: Multiwavelets conference, Huntsville, TX
Mar 21: Wavelets & Subband transf. in Communications, NJIT
Apr 13-16: 1997 ImageTech Conference Multimedia Imaging, Atlanta
Apr 20 : Wavelet Transforms in Communications, Munich Germany
Apr 22-24: SPIE Fourth Wavelet Application Conference, Orlando
Jun 16-18: Engineering Applications of Neural Networks, Stockholm
Jun 16-19: Sampling Theory and Applications, Aveiro, Portugal
Jun 23-25: Multimedia Signal Processing Workshop, Princeton, NJ
Jun 24-27: European conf. signal analysis and prediction, Prague
Jun 25-27: Fractals in engineering, Arcachon, France
Jul 2-4: Scale-Space Theory in Computer Vision, Utrecht, Nl
Jul 2-4: Tutorial on Scale-Space Theory, The Netherlands
*Jul 21-27: Summer school: New interactions, Marseille, France
Jul 25-Aug 1: SPIE Signal and Image Processing V, San Diego
Aug 27-29: Time-Frequency and Time-Scale, Coventry, UK
Sep 14-17: Time-Frequency Wavelet analysis symposium, Sacramento
Sep 24-26: IEEE Neural Networks for Signal Processing, Florida
Nov 16-Dec 6: UCLA short courses on communications, LA
Dec 17-19: Introduction to wavelets, Boston
Date: Thu, 16 Jan 1997 09:40:16 +0100
From: Umberto Amato <amato@iamna.iam.na.cnr.it>
Subject: #1 Preprint: Papers on data smooting using regularization.
We would like to announce the availability of the following papers on
Wavelets applied to smooth data by means of regularization:
- Wavelet Regularization for Smoothing Data, by U. Amato and D.T. Vuza,
Technical Report N. 108/94 of the Istituto per Applicazioni della Matematica,
Napoli (1994).
- Wavelet Approximation of a Function from Samples Affected by Noise, by
U. Amato and D.T. Vuza, Revue Roumaine Math. Pures Appl. (1996), to appear.
- Besov Regularization, Thresholding and Wavelets for Smoothing Data,
by U. Amato and D.T. Vuza, Numerical Functional Analysis and Optimization
(1996), to appear.
- An Alternate Proof of a Result of Johnstone and Silverman concerning
Wavelet Thresholding Estimators for Data with Correlated Noise, Revue
Roumaine Math. Pures Appl., 41 (1996), 431-438.
Moreover, the following Fortran, C++ and 80386 upward Assembler software
(and related Technical Report) is freely available:
- A Collection of Routines for the Wavelet Transform of Daubechies Type,
by U. Amato and D.T. Vuza, Techincal Report N. 122/95 of the Istituto
per Applicazioni della Matematica CNR, Napoli (1995).
Reprints are available to interested people by contacting the authors
at the following addresses:
Umberto Amato
Istituto per Applicazioni della Matematica CNR
Via Pietro Castellino, 111
80131 Napoli (Italy)
e-mail: amato@iamna.iam.na.cnr.it
Dan Tudor Vuza
Institute of Mathematics
Romanian Academy
P.O. Box 1 764
RO-70700 Bucharest (Romania)
e-mail: dvuza@stoilow.imar.ro
Date: Tue, 28 Jan 1997 12:40:02 +0000
From: "Wolfgang Dahmen" <dahmen@igpm.rwth-aachen.de>
Subject: #2 Preprint: Composite Wavelet Bases for Operator Equations
the following paper is available under
http://www.igpm.rwth-aachen.de/~dahmen
or on the ftp server
ftp.igpm.rwth-aachen.de
The papers can be found in the directory of the respective authors
/pub/dahmen/file.ps.Z
Title: Composite Wavelet Bases for Operator Equations
Authors: Wolfgang Dahmen, Reinhold Schneider
Abstract: This paper is concerned with the construction of
biorthogonal wavelet bases defined on a union of parametric images of
the unit $d$-cube. These bases are to satisfy certain requirements
imposed by applications to a class of operator equations acting on
such domains. This covers also elliptic boundary value problems
although this study is primarily motivated by our previous analysis of
wavelet methods for pseudo-differential equations with special
emphasis on boundary integral equations. In this case it is natural
to model the boundary surface as a union of parametric images of the
unit cube. It will be shown how to construct wavelet bases on the
surface which are composed of wavelet bases defined on each surface
patch. Here the relevant properties are the validity of norm
equivalences in certain ranges of Sobolev scales as well as
appropriate moment conditions.
Date: Wed, 29 Jan 1997 12:57:36 +0000
From: Akram Aldroubi <aldroubi@helix.nih.gov>
Subject: #3 Preprint: Preprints from Akram Aldroubi on multiwavelets.
New preprints available
1) Title: Oblique and hierarchical multiwavelet bases
Author: Akram Aldroubi
Abstract: We develop the theory of oblique multiwavelet bases, which
encompasses the orthogonal, semiorthogonal and biorthogonal cases, and
we circumvent the non-commutativity problems that arise in the
construction of multiwavelets. Oblique multiwavelets preserve the
advantages of orthogonal and biorthogonal wavelets and enhance the
flexibility of the theory to accommodate a wider variety of wavelet
bases. For example, for a given multiresolution, we can construct
supercompact wavelets for which the support is half the size of the
shortest orthogonal, semiorthogonal, or biorthogonal wavelet. The
theory also produces the h-type, piecewise linear hierarchical bases
used in finite element methods, and it allows us to construct new
h-type, smooth hierarchical bases, as well as h-type hierarchical
bases that use several template functions. For the hierarchical
bases, and for all other types of oblique wavelets, the expansion of a
function can still be implemented with a perfect reconstruction filter
bank. We illustrate the results using the Haar scaling function and
the Cohen-Daubechies-Plonka multiscaling function. We also construct a
supercompact spline uniwavelet of order 3 and a hierarchical basis
that is based on the Hermit cubic spline, and explicitly give the
coefficients of the corresponding filter bank.
A copy can be downloaded from
http://aa2mac.ncrr.nih.gov/preprints.html
or Email to aldroubi@helix.nih.gov
2) Title:Pre-filtering for the initialization of multi-wavelet
transforms
Authors: Michael J. Vrhel, Akram Aldroubi
Abstract:We introduce a new method for initializing the multi-wavelet
decomposition algorithm. The approach assumes that the input signal
is contained within some well-defined subspace of $L_2$ (e.g. space of
bandlimited functions). The initialization algorithm is the
orthogonal projection of the input signal into the space defined by
the multi-scaling function. Unlike an interpolation approach, the
projection method will always have a solution. We provide examples and
implementation details.
A copy can be downloaded from
http://aa2mac.ncrr.nih.gov/preprints.html
or Email to aldroubi@helix.nih.gov
3) Title: Construction of biorthogonal wavelets starting from any two
multiresolutions
Authors: A. Aldroubi, P. Abry and M. Unser
Abstract: Starting from any two given multiresolution approximations
$\{V^1_j\}_{j \in \ZZ}$ and $\{V^2_j\}_{j \in \ZZ}$, we construct
biorthogonal wavelet bases that are associated with this chosen pair
of multiresolutions. Thus, our construction method takes a point of
view opposite to the one of Cohen-Daubechies-Feauveau which starts
from a well-chosen pair of biorthogonal discrete filters. In our
construction, the necessary and sufficient condition is the
non-perpendicularity of the multiresolutions. This condition can be
checked explicitly by a simple formula that computes the angle between
the spaces. Thus, by selecting different sets of non-perpendicular
multiresolutions, we generate different biorthogonal wavelet bases
with various desired shapes and properties. For biorthogonal wavelets
generated by this method, we derive the formulae that give the filter
bank coefficients needed in the Mallat-type
decomposition/reconstruction algorithms.
A copy can be downloaded from
http://aa2mac.ncrr.nih.gov/preprints.html
or Email to aldroubi@helix.nih.gov
4) Title:Complete iterative reconstruction algorithms for irregularly
sampled data in spline-like spaces
Authors: Akram Aldroubi and Hans Feichtinger
Abstract: We prove that the exact reconstruction of a function $\fv$
from its samples $\fv (x_i)$ on any "sufficiently dense" sampling set
$X_{i \in \ind \subset \RR^n}$, where $\ind$ is a countable indexing
set, can be obtained for a large class of spline-like spaces that
belong to $\Lp (\RR^n)$. Moreover, The reconstruction can be
implemented using fast algorithms. Since, a special case is the space
of bandlimited functions, our result generalizes the classical
Shannon-whittacker sampling theorem on regular sampling and the
Paley-Wiener theorem on nonuniform sampling.
A copy can be downloaded from
http://aa2mac.ncrr.nih.gov/preprints.html
or Email to aldroubi@helix.nih.gov
5) Title: Exact iterative reconstruction algorithm for multivariate
irregularly sampled functions in spline-like spaces: The $\Lp$-theory
Authors: Akram Aldroubi and Hans Feichtinger
Abstract: We prove that the exact reconstruction of a function $\fv$
from its samples $\fv (x_i)$ on any "sufficiently dense" sampling set
$\{x_i}_{i\in \Lambda}$ can be obtained, as long as $\fv$ is known to
belong to a large class of spline-like spaces in $\Lp (\RR^n)$.
Moreover, the reconstruction can be implemented using fast algorithms.
Since a limiting case is the space of bandlimited functions, our result
generalizes the classical Shannon-Whittacker sampling theorem on regular
sampling and the Paley-Wiener theorem on non-uniform sampling.
A copy can be downloaded from
http://aa2mac.ncrr.nih.gov/preprints.html
or Email to aldroubi@helix.nih.gov
Thanks
Akram Aldroubi
BEIP/NIH
Building 13/3N17
13 South DR MSC 5766
Bethesda MD 20892-5766
USA
http://aa2mac.ncrr.nih.gov
Date: Thu, 30 Jan 1997 09:37:08 -0100 (GMT-1:00)
From: Cohen Israel <cisrael@rotem.technion.ac.il>
Subject: #4 Preprint: Preprints on shift-invariant decompositions
The following two preprints are available via www at:
http://www-sipl.technion.ac.il/publications/wavelet_pub.html
Title: Orthonormal Shift-Invariant Adaptive Local Trigonometric
Decomposition
Authors: Israel Cohen, Shalom Raz and David Malah
Abstract: In this paper, an extended library of smooth local
trigonometric bases is defined, and an appropriate fast ``best-basis''
search algorithm is introduced. When compared with the standard local
cosine decomposition (LCD), the proposed algorithm is advantageous in
three respects. First, it leads to a best-basis expansion that is
shift-invariant. Second, the resulting representation is characterized
by a lower information cost. Third, the polarity of the folding
operator is adapted to the parity properties of the segmented signal
at the end-points. The shift-invariance stems from an adaptive relative
shift of expansions in distinct resolution levels. We show that at any
resolution level $\ell$ it suffices to examine and select one of two
relative shift options --- a zero shift or a $2^{-\ell-1}$ shift.
A variable folding operator, whose polarity is locally adapted to the
parity properties of the signal, further enhances the representation.
The computational complexity is manageable and comparable to that of
the LCD.
Note: To appear in Signal Processing, 57(1)
Location:
http://www-sipl.technion.ac.il/publications/siltd.ps
http://www-sipl.technion.ac.il/publications/siltd.ps.gz
Title: Orthonormal Shift-Invariant Wavelet Packet Decomposition and
Representation
Authors: Israel Cohen, Shalom Raz and David Malah
Abstract: In this work, a shifted wavelet packet (SWP) library,
containing all the time shifted wavelet packet bases, is defined. A
corresponding shift-invariant wavelet packet decomposition (SIWPD)
search algorithm for a ``best basis'' is introduced. The search
algorithm is representable by a binary tree, in which a node
symbolizes an appropriate subspace of the original signal. We prove
that the resultant ``best basis'' is orthonormal and the associated
expansion, characterized by the lowest information cost, is
shift-invariant. The shift-invariance stems from an additional degree
of freedom, generated at the decomposition stage and incorporated into
the search algorithm. The added dimension is a relative shift between
a given parent-node and its respective children-nodes. We prove that
for any subspace it suffices to consider one of two alternative
decompositions, made feasible by the SWP library. These decompositions
correspond to a zero shift and a $2^{-\ell}$ relative shift where
$\ell$ denotes the resolution level. The optimal relative shifts,
which minimize the information cost, are estimated using finite depth
subtrees. By adjusting their depth, the quadratic computational
complexity associated with SIWPD may be controlled at the expense of
the attained information cost down to $O(N log_2 N)$.
Note: To appear in Signal Processing, 57(3)
Location:
http://www-sipl.technion.ac.il/publications/siwpd.ps
http://www-sipl.technion.ac.il/publications/siwpd.ps.gz
Israel Cohen
Department of Electrical Engineering
Technion - Israel Institute of Technology
Technion City, Haifa 32000, Israel
Email: cisrael@rotem.technion.ac.il
Voice: 972 4 897 5033 Fax: 972 4 879 5315
Date: Thu, 30 Jan 1997 15:44:32 +0100 (MET)
From: Rob Stevenson <stevenso@sci.kun.nl>
Subject: #5 Preprint: Stable wavelet bases on non-uniform meshes.
Title: Piecewise linear (pre-)wavelets on non-uniform meshes
Author: Rob Stevenson
Abstract: In this paper, an explicit construction of compactly
supported prewavelets on linear finite element spaces is introduced on
non-uniform meshes on polyhedron domains and on boundaries of such
domains. The obtained bases are stable in the Sobolev spaces H^r for
-3/2<r<3/2. The only condition we need is that of uniform
refinements. Compared to existing prewavelets bases on uniform meshes,
with our construction the basis transformation from wavelet- to nodal
basis (the wavelet transform) can be implemented more efficiently.
A copy can be downloaded from
http://www.sci.kun.nl/math/~stevenson.html
or can be obtained by emailing me at the address below
Best regards,
Rob Stevenson
Department of Mathematics, University of Nijmegen, The Netherlands
Email: stevenso@sci.kun.nl
Date: Thu, 30 Jan 1997 18:13:26 -0600
From: Markus Kraft <mkraft@rhrk.uni-kl.de>
Subject: #6 Preprint: Comparison of wavelet and wavelet packet denoising algorithms
I would like to make the following article available to wavelet digest
readers:
Title: Comparison and Assessment of Various Wavelet and Wavelet Packet
based Denoising Algorithms for Noisy Data
Authors: F. Hess and M. Kraft
Abstract: In the recent past a variety of denoising methods based on
wavelet and wavelet packet analysis have been introduced and
investigated. In this work some of these methods have been compared
with each other in order to give a user an idea which of these methods
suits best for a particular problem. One field of application is data
analysis of neurophysiological signals. In the test case presented,
white noise is superimposed to a noise free neurophysiological signal,
containing different local structures. Then in a Monte-Carlo
simulation linear wavelet and wavelet packet thresholding, non-linear
soft and hard thresholding for wavelets (e.g. Donoho) and wavelet
packets (Donoho and Johnstone), the coherence denoising algorithm
(e.g. Wickerhauser) are compared with each other (with respect to
different norms) and tested versus several parameters. For example
the influence of the choice of the basis function, choice of the cost
function in case of wavelet packets, of the type of noise have been
investigated. For the neurophysiological signal under investigation it
was found that wavelet nonlinear hard thresholding performed
best. Additionally, it is demonstrated that a scale dependent
threshold can improve this result significantly.
A copy can be downloaded from
http://www.rhrk.uni-kl.de/~mkraft/paper/ecmi96-paper252.ps
or by contacting via the following address:
Markus Kraft
Fachbereich Chemie
Universitaet Kaiserslautern
D 67663 Kaiserslautern
FRG
http://www.rhrk.uni-kl.de/~mkraft/
mkraft@rhrk.uni-kl.de
Date: 04 Feb 97 23:06:32 EST
From: "Nurit L. Weiss" <73074.3215@compuserve.com>
Subject: #7 Preprint: Improved transient signal detection
Title: Improved transient signal detection using a wavepacket-based detector
with an extended translation-invariant wavelet transform
Authors: Stephen Del Marco and John Weiss
Abstract: This paper presents the theory of M-band, extended
translation-invariant wavelet transforms (ETI). The ETI generalizes
the translation-invariant wavelet transform of Weiss. It is shown that
iteration of the ETI, in a tree structure, provides a signal
decomposition into an orthonormal wave-packet basis. Other properties
such as translation-invariance and invertibility of the transform are
proven. The theory is then applied to transient signal detection
through development of a family of translation-invariant
wavepacket-based detectors. This family of detectors provides improved
performance over previously defined wavepacket-based detectors. A
performance analysis is conducted. ROC curves, generated by
Monte-Carlo simulation are presented indicating detector performance.
Detector performance is demonstrated to be independent of the signal
translation.
Note: To appear in IEEE Transactions of Signal Processing
Preprint available on the web in Postscript format:
http://www.tiac.net/users/nurit/ftp/ (click on ETI.ZIP)
John Weiss
nurit@tiac.net
http://www.tiac.net/users/nurit/
Date: Fri, 7 Feb 1997 14:12:23 -0800
From: Peter Schroeder <ps@cs.caltech.edu>
Subject: #8 Preprint: Preprints from Graphics Group at Caltech.
Dear Editor,
The following preprints are available from the Department of Computer
Science, Caltech:
-------------------------------------------------------------------------
C^k Continuity of Subdivision Surfaces
CS-TR-96-23 (ftp://ftp.cs.caltech.edu/tr/cs-tr-96-23.ps.Z)
Denis Zorin
Stationary subdivision is an important tool for generating smooth
free-form surfaces for CAGD and computer graphics. One of the
challenges in construction of subdivision schemes for arbitrary meshes
is to guarantee that the limit surface will have smooth regular
parameterization in a neighborhood of any point. First results in this
direction were obtained only recently. In this paper we derive
necessary and sufficient criteria for $C^k$-continuity that generalize
and extend most known conditions. We create a general mathematical
framework that can be used for analysis of more general types of
schemes. Finally, we prove a degree estimate for $C^k$-continuous
polynomial schemes generalizing an estimate of Reif and give a
practical sufficient condition for smoothness.
------------------------------------------------------------------------
Interactive Multiresolution Mesh Editing
CS-TR-97-06 (http://www.cs.caltech.edu/~ps/multiediting.ps.gz)
Denis Zorin, Peter Schr\"oder, Wim Sweldens
We describe a multiresolution representation for meshes based on
subdivision. Subdivision is a natural extension of the existing
patch-based surface representations. At the same time subdivision
algorithms can be viewed as operating directly on polygonal meshes,
which makes them a useful tool for mesh manipulation. Combination of
subdivision and smoothing algorithms of Taubin allows us to construct
a set of algorithms for interactive multiresolution editing of complex
meshes of arbitrary topology. Simplicity of the essential algorithms
for refinement and coarsification allows to make them local and
adaptive, considerably improving their efficiency. We have built a
scalable interactive multiresolution editing system based on such
algorithms.
See also http://www.gg.caltech.edu/~dzorin/ for figures and MPEG
movies.
------------------------------------------------------------------------
Constructing Variationally Optimal Curves through Subdivision
CS-TR-97-05 (http://www.cs.caltech.edu/~ps/variation.ps.gz)
Leif Kobbelt and Peter Schr\"oder
Subdivision is a powerful paradigm for the generation of curves and
surfaces. It is easy to implement, computationally efficient, and
useful in a variety of applications because of its intimate connection
with multiresolution analysis. An important task in computer graphics
and geometric modeling is the construction of curves which interpolate
a given set of points and minimize a fairness functional (variational
design). In the context of subdivision, fairing leads to special
schemes requiring the solution of a (banded) linear system at every
step. We present several examples of such schemes including one which
reproduces non-uniform interpolating cubic B-splines. By implementing
variational schemes in a wiring diagram formalism we find associated
wavelets and efficient algorithms to perform the corresponding
decomposition and reconstruction transformations. The computational
costs are low enough for interactive applications.
Date: Tue, 11 Feb 1997 17:15:39 +0000 (GMT)
From: "M.Vannucci" <m.vannucci@ukc.ac.uk>
Subject: #9 Preprint: Bayesian Wavelet Shrinkage
Title: Some Findings on the Covariance Structure of Wavelet
Coefficients: Theory and Models in a Bayesian Perspective
Authors: Marina Vannucci and Fabio Corradi
Abstract: This paper refers to a wavelet shrinkage
technique. Specifically, the wavelet transform, linear and orthogonal,
permits a decomposition of noisy data into a set of wavelet
coefficients; noise is then removed by shrinking the coefficients. For
this purpose, a Bayesian approach is possible based on imposing a
statistical model on the wavelet coefficients of the unknown signal
and replacing the coefficients with the results of a Bayesian
analysis. In contrast with other Bayesian models recently proposed,
the model adopted in this paper does not assume that the wavelet
coefficients of the unknown signal are independent. Theoretical
results regarding the covariance structure of random wavelet
coefficients are presented and used to specify the Bayesian model.
Moreover, a hierarchical structure is implemented to learn about some
of the parameters of the prior distributions. Applications to
simulated signals are presented. The technique is generally applicable
to the problem of modeling wavelet coefficients and has also been used
for density estimation involving wavelets.
KEY WORDS: Non Parametric Regression, Wavelet Shrinkage, Random
Wavelet Coefficients, Bayesian Inference
If interested, download a copy from
http://stork.ukc.ac.uk/IMS/statistics/people/M.Vannucci/bayshr.ps.Z
or e-mail me at the address below. Comments are welcome.
Thanks
Marina
Marina Vannucci
Institute of Maths & Stats
University of Kent at Canterbury Phone: +44 1227 823135
Canterbury, Kent Fax: +44 1227 827932
CT2 7NF, United Kingdom E-mail: M.Vannucci@ukc.ac.uk
http://stork.ukc.ac.uk/IMS/statistics/people/M.Vannucci.html
Date: Wed, 22 Jan 1997 02:31:49 -0500 (EST)
From: "Soltis James Dr." <soltis@server.uwindsor.ca>
Subject: #10 Preprint: Dithered Trigonometric Functions
By making use of the Jacobian elliptic functions
one can generate a whole new class of basis functions
with properties of interest in signal processing as
regards transform processing.
The prescription is to replace 2*pi in the
digital Fourier (and related DCT,DST,etc.) with 4*K in the
relevant equations , where K is the elliptic integral
of the 1st kind.Also the standard sine and cosine should
be replaced by the Jacobian sn and cn functions.Unlike
the standard case , many versions of any transform exist
since the SHAPES of sn and cn differ (unlike sin and cos).
Thus , for example, one can have(symbolically)
W =cn+sn(K+)+i*(sn+cn(K+))
There are many variations on this theme.e.g,
W=cn+i*sn
The resulting transform(s) matrices are of interest,
with due regard to aliasing issues ,however of special interest
the inversion of this matrix leads to BASIS functions which mimic the
standard trig functions with fuzzy or dithered behavior.
There are many versions of the transform , since unlike
sin and cos the waveshapes of Jacobian sn and cn differ.
For example, shifting the sn function by K (see above) in
its argument offers squarer-looking cosine waves.
A special attribute is that the Jacobian elliptic
functions offer a 'built in' stretching parameter so that
their utility extends beyond the standard trig functions.
Obviously, in standard WAVELET work , one can replace the
presence of trig functions with this arena of work.
Please contact me at emailing soltis@server.uwindsor.ca
for any details, including MATLAB programs.
Date: Mon, 27 Jan 1997 14:10:23 -0600 (CST)
From: mrt@wavelet.com
Subject: #11 Hardware: Biorthogonal wavelet filters from Fastman, Inc.
FASTMAN, Inc. has developed a biorthogonal wavelet filter which is
implemented in a field programmable gate array (FPGA). The
biorthogonal filter takes 16-bit data inputs at 68 MHz and produces an
output stream (also at 68 MHz) which consists of alternating lowpass
and highpass outputs. The hardware is implemented as an Altera
megafunction which means that it can be directly inserted into
hardware systems using Altera FPGA chips. Our hardware utilizes the
same biorthogonal filter used by the FBI's WSQ algorithm. Also
available are controllers which can implement standard wavelet or
wavelet packet algorithms by reading image data or signal data from
memory in the proper sequence.
Unlike a DSP, our filter can compute one wavelet coefficient every
clock cycle. This should prove advantageous especially for wavelet
packet algorithms which require the computation of a large number of
coefficients. Our results show that this filter can compute
coefficients about ten times faster than a DSP with an equivalent
clock speed.
Conversion of the wavelet filter into an ASIC will occur pending
additional funding of current DoD contracts. The ASIC implementation
should be about twice as fast as the FPGA implementation. The
hardware and/or its VHDL source code are available for licensing.
Requests for information should be sent to mrt@wavelet.com.
Date: Wed, 29 Jan 1997 22:16:59 -0600
From: Geoff Davis <gdavis@ece.rice.edu>
Subject: #12 Software: C++ wavelet image compression source
The Wavelet Construction Kit code implements a baseline wavelet
transform-based image coder for grayscale images. The coder is not
the most sophisticated -- it's a simple transform coder -- but each
individual piece of the transform coder has been chosen for high
performance. Symmetric boundary extensions are implemented, bit
allocation is optimized via an integer programming algorithm, and
entropy coding is done with a sophisticated adaptive arithmetic coder.
The code has been designed for experimentation. It's very modular and
should allow for simple replacements of individual components. One
can easily replace the quantizer, the entropy coder, and the wavelet
filters. A number of commonly used filters from the compression
literature have been included, together with references. If you are
doing research on wavelet-based image coding, there's no need to
reinvent the wheel!
The performance of the coder is quite good, even though it does not
make use of zerotrees or side classification information.
Performance data for the 512x512 Lena image as compared to Shapiro's
EZW algorithm:
Compression ratio PSNR (dB) PSNR for EZW (dB)
----------------- --------- -----------------
4.0:1 43.71
8.0:1 39.42 39.55
16.0:1 36.18 36.28
32.0:1 33.17 33.17
64.1:1 30.22 30.23
129.3:1 27.73 27.54
Full source code and details are available at
http://www.cs.dartmouth.edu/~gdavis/wavelet/wavelet.html
Geoff Davis
Math Department
Dartmouth College
gdavis@cs.dartmouth.edu
http://www.cs.dartmouth.edu/~gdavis
Date: Tue, 11 Feb 97 14:36:07 +0100
From: Bruno Torresani <torresan@cptsx1.univ-mrs.fr>
Subject: #13 Meeting: Summer school on New Interactions in Marseille
Dear wavelet people
a summer school ``New Interactions: Wavelets, Signal Analysis,
Simulation and Probabilistic Models'' will take place in
Marseille-Luminy next July. Please see the announcement below. More
detailed information is available on the web:
http://cptsx1.univ-mrs.fr/~torresan/ecole/ecole.html
Please note that the number of participants is strictly
limited to 60, for material reasons. We apologize in advance
for this.
yours sincerely
Bruno Torresani
SUMMER SCHOOL
-------------
New Interactions:
Wavelets, Signal Analysis, Simulation
and Probabilistic Models
Marseilles, France, July 21 - 27, 1997
http://cptsx1.univ-mrs.fr/~torresan/ecole/ecole.html
Presentation
------------
These last ten years, methods based upon multiscale decompositions
have emerged in various areas as robust and reliable tools for
analyzing functions, signals, operators,... or for numerical
simulations. Such decomposition methods have been succesfully used
for several problems in signal processing (signal analysis,
compression, detection...), statistics (denoising, classification...)
or numerical analysis (numerical resolution of PDE's, numerical
simulations,...). One may also notice many applications to
(theoretical and experimental) physics, for example in the area of
fluid mechanics and turbulence.
One of the goals of the school is to focus on some of the most recent
developments in these areas, and to allow interaction between
scientists with different points of view on (perhaps) related
problems. The school will be organized around lectures (see the more
detailed preliminary program below) in the following main domains:
Analysis and simulation of fractal and multifractal processes.
Wavelets and multifractal analysis.
Self-similarity and PDE's.
Numerical resolution of PDE's and Homogenization.
Signal analysis methods for turbulence.
)
Organizing Committee:
---------------------
* Ph. Tchamitchian,
Laboratoire de Mathematiques Fondamentales et Appliquees,
Universite d'Aix-Marseille III, Faculte de St Jerome,
Avenue Escadrille Normandie-Niemen, case cour A, 13397 Marseille
cedex 20, France.
E-mail: tchamphi@math.u-3mrs.fr
* B. Torresani ,
Centre de Physique Theorique,
CNRS-Luminy, Case 907, 13288 Marseille Cedex 09, France.
E-mail: torresan@cpt.univ-mrs.fr
Preliminary Program:
--------------------
The school will be organized in the form of short (between 3 and 6
hours) lectures, and more specialized seminars.
The main lectures will be (up to unscheduled modifications)
A. Arneodo (CRPP Bordeaux):
Wavelet analysis of self-similarity and random cascade processes:
application to fully-developed turbulence data.
M. Avellaneda (Courant Institute, New York University):
Turbulent Diffusion: theoretical problems and computation.
G. Beylkin (Program in Applied Mathematics, Boulder, Colorado):
Numerical Homogenization.
R. Carmona (Dept of Civil Infeneering and Operation research,
Princeton):
Numerical Simulations for Stochastic Models in Physical Oceanography.
F. Elliott Jr.(Courant Institute, New York):
title to be announced.
P. Flandrin and P. Abry (ENS Lyon):
Wavelet-based analysis and synthesis of 1/f processes, and applications.
S. Jaffard (ENS Cachan):
Multiscale analysis of Levy processes.
J. Liandrat (IRPHE Marseille):
Multiscale methods for numerical solution of PDE's.
Y. Meyer (ENS Cachan):
On Navier-Stokes equations.
M.V. Wickerhauser (Washington University, St Louis):
Compression methods and feature extraction in turbulence.
Address:
For any question concerning the school, accomodation,
registration,... please contact the
School Secretary:
Mme Nadine Mousseaux
Summer school ``New Interactions''
Centre de Physique Theorique
CNRS-Luminy, Case 907, 13288 Marseille Cedex 09, France.
Fax: +33 4 91 26 95 53
Phone: +33 4 91 26 95 00
E-mail: wavelets@cpt.univ-mrs.fr
Registration:
For material reasons, the number of participants is limited to 60. If
the number of applications is larger than the limit, we will have to
make a selection. The registration fees are fixed to 1000 FF (about
180 US$ at the current exchange rate). The price of accomodation at
CFML is fixed to 350FF per day (about 65 Us$), and includes room,
breakfast, lunch and dinner.
To register, please contact the School secretary.
Registration forms are available by email, or may be retrieved
from the Web:
http://cptsx1.univ-mrs.fr/~torresan/ecole/ecole.html
Date: Tue, 28 Jan 1997 12:41:46 +0300
From: "Adel Kamal" <kamaladl@eng.uob.bh>
Subject: #14 Varia: Request for MSc thesis External Examiner
An external examiner is required to conduct M.Sc thesis examination.
All expenses will be paid. The project involves WAVELETS applications.
It is an investigation of two linear time frequency representations,
namely STFT and Wavelet transform. The two methods are compared and
their applications are examined. A case study is done using the blood
flow signal acquired from the skin.
Working language is English.
Exam date is mid May 1997.
Please send curriculum vitae to;
Dr. Adel Kamal
Department of Electrical Engineering
University of Bahrain
P. O. Box 621
Manama
BAHRAIN
E-mail: kamaladl@internic.uob.bh
kamaladl@iee.org
Tel : (973) 688315
Date: Tue, 28 Jan 1997 10:28:46 -0500
From: Andrey Stefanov Andreev <andreev@math.sc.edu>
Subject: #15 Varia: Call for nominations 1998 Popov's Prize
VASIL A. POPOV PRIZE
in Approximation Theory
Call for 1998 Nominations
The second Vasil A. Popov Prize will be awarded at the Ninth
Texas International Conference on Approximation Theory to be
held in January of 1998. The prize has been established in
memory of Vasil A. Popov and his contributions to approximations
theory and related areas of mathematics.
The prize is awarded every three years for outstanding research
contributions in fields related to Vasil Popov's work. Albert
Cohen was the first recipient of the Vasil A. Popov Prize awarded
in 1995. Eligibility for this prize is restricted to mathematicians
who did not have their terminal degree on June 1, 1991. The winner
of the prize will be asked to deliver a plenary lecture at the
Texas conference.
The Selection Committee for the Vasil A. Popov Prize consists of
Charles Chui, Ronald A. DeVore, Paul Nevai, Alan Pinkus, Pencho
Petrushev, and Edward Saff.
Nominations should include a brief description of the research
related to the nomination. Other supporting material may also be
submitted.
Nominations should be made to the
Chairman of the Selection Committee:
Professor Ronald A. DeVore
Department of Mathematics
University of South Carolina
Columbia, South Carolina 29208
THE CLOSING DATE FOR NOMINATIONS IS JUNE 1, 1997
Date: Fri, 24 Jan 1997 16:29:52 -0800
From: Michael Davies <mdavies@dean.apsc.ubc.ca>
Subject: #16 Job: PDF Position at UBC in Vancouver
University of British Columbia
Vancouver, B.C. Canada
Pulp and Paper Centre
Process Control Group
Applications are invited for a one year appointment (with the
possibility of renewal for a second year) as Postdoctoral Fellow to
carry out research in the application of wavelet methods to the
analysis 2-dimensional paper machine sheet process data. Applicants
should be familiar with wavelet signal and image analysis techniques,
and will be expected to develop methods matched to the paper machine
environment, including real time algorithms, adaptive thresholding and
the use of scanned data. The project is to be carried out with
industrial collaboration, and a portion of the time will be spent in a
manufacturing plant. The position is available immediately. There is
no deadline for applications, however it is expected that an
appointment will be made prior to February 28, 1997. Starting salary
is Can$30,000 annually. Applications should include a CV and the
names of two referees and should be submitted to:
Michael Davies
Department of Electrical and Computer Engineering
The University of British Columbia
2356 Main Mall
Vancouver, B.C. V6T 1Z4, Canada
Tel: + (604) 822-9442
FAX: + (604) 822-7006
E-mail: Michael. S. Davies@ubc.ca
Date: Fri, 31 Jan 97 16:32:49 EST
From: George Zweig <zweig@busco.lanl.gov>
Subject: #17 Job: Postdoctoral Fellowships At Los Alamos National Laboratory
Two-year postdoctoral fellowships in wavelet transform research are now
available in the Theoretical Division at Los Alamos National Laboratory.
The fellowships may be renewed for a third year.
The postdoctoral positions are with a newly formed research group that
focuses on wavelet transform theory (both continuous and discrete),
and unique approaches to image compression, speech denoising, and
other problems in digital signal processing.
Applicants should have received their Ph.D. no earlier than May 1994,
and should have strong technical skills together with a background in
signal processing or related topics in mathematics or computer
science.
Extensive experience in C or C++ programming is essential.
Postdoctoral salaries at Los Alamos are determined commensurate with
previous job experience, with a minimum starting salary of
approximately $44,000 per year.
The deadline for the first round of applications is March 15, 1997;
applications will be considered thereafter on a continuing basis.
Los Alamos National Laboratory is an affirmative action/equal
opportunity employer. Postdoctoral positions are open to both
U.S. and non-U.S. citizens, but the applicant must be available in the
U.S. or Canada for telephone and personal interviews.
Please send resume, undergraduate and graduate transcripts, examples
of your C or C++ code (via email), at least three letters of
recommendation, and a list of your references (together with their
phone numbers and email addresses) to:
George Zweig
MS-B276
Theoretical Division
LANL
Los Alamos, NM 87545
(505)667-8496
zweig@lanl.gov
Date: Thu, 30 Jan 1997 17:25:34 -0700
From: George Zweig <zweig@busco.lanl.gov>
Subject: #18 Job: Graduate Fellowships At Los Alamos National Laboratory
GRADUATE STUDENT FELLOWSHIPS AT LOS ALAMOS NATIONAL LABORATORY
Graduate student fellowships in wavelet transform research are now
available in the Theoretical Division at Los Alamos National
Laboratory. The fellowships are open to students not yet enrolled in a
graduate program, students interested in taking a leave of absence
from their graduate studies, and students enrolled in a graduate
program but interested in carrying out full-time thesis research at
Los Alamos. Summer students are also welcome.
The student fellowships are with a newly formed research group that
focuses on wavelet transform theory (both continuous and discrete),
and unique approaches to image compression, speech denoising, and
other problems in digital signal processing.
Applicants should have strong technical skills together with a
background in signal processing or related topics in mathematics or
computer science.
Extensive experience in C or C++ programming is essential.
Graduate student salaries at Los Alamos are determined commensurate
with previous job experience, with salaries ranging from $20,000 to
$34,000 per year.
Los Alamos National Laboratory is an affirmative action/equal
opportunity employer. Fellowships are open to both U.S. and
non-U.S. citizens, but the applicant must be available in the U.S. or
Canada for telephone and personal interviews.
Please send resume, undergraduate and graduate transcripts, examples
of your C or C++ code (via email), at least three letters of
recommendation, and a list of your references (together with their
phone numbers and email addresses) to:
George Zweig
MS-B276
Theoretical Division
LANL
Los Alamos, NM 87545
(505)667-8496
zweig@lanl.gov
Date: Fri, 17 Jan 1997 15:43:10 -0500 (EST)
From: Edit Kurali <kurali@math.ohio-state.edu>
Subject: #19 Contents: J. Approx. Th. - nov96 dec96 jan97
Table of Contents: J. Approx. Theory, Volume 87, Number 2, November 1996
G. N\"urnberger
Approximation order of bivariate spline interpolation
117--136
Matthew X. He
Explicit representations of Faber polynomials for $m$-cusped
hypocycloids
137--147
Kuei-Fang Chang
Strictly positive definite functions
148--158
Keiji Izuchi and Sin-Ei Takahasi
BKW-operators on the interval and the sequence spaces
159--169
G. Min
Saturation problem of $L_p$-approximation by Hermite-Fej\'er
interpolation
170--178
George Kvernadze
Uniform convergence of Lagrange interpolation based on the Jacobi nodes
179--193
A. Sharma, J. Szabados, B. Underhill, and A. K. Varma
On some general lacunary interpolation problems
194--219
Yuan Xu
Lagrange interpolation on Chebyshev points of two variables
220--238
Note
J. J. Swetits and B. Wood
On the degree of $L_p$ approximation with positive linear operators
239--241
Table of Contents: J. Approx. Theory, Volume 87, Number 3, December 1996
Michele Campiti and Giorgio Metafune
Approximation properties of recursively defined Bernstein-type operators
243--269
Michele Campiti and Giorgio Metafune
Evolution equations associated with recursively defined Bernstein-type
operators
270--290
A. Atzmon and A. Olevski\v{\i}
Completeness of integer translates in function spaces on $\BR$
291--327
Semyon Rafalson
Nonnegative Fourier-Jacobi Coefficients and some classes of functions
328--337
K. Jetter and J. St\"ockler
Riesz bases of splines and regularized splines with multiple knots
338--359
Author index for volume 87
360
Table of Contents: J. Approx. Theory, Volume 88, Number 1, January 1997
R. A. Kerman
Strong and weak weighted convergence of Jacobi series
1--27
Xue-Zhang Liang and Chun-Mei L\"u
On the convergence of Hakopian interpolation and cubature
28--46
Bernard Delyon and Anatoli Juditsky
On the computation of wavelet coefficients
47--79
Daniel Duverney
Explicit computation of Pad\'e-Hermite approximants
80--91
Grzegorz Lewicki
Minimal projections onto two dimensional subspaces of $l^{(4)}_\infty$
92--108
Vladimir Andrievskii and Hans-Peter Blatt
Erd\H{o}s-Tur\'an theorems on piecewise smooth curves and arcs
109--134
Note
A. Z. Grinshpan and E. B. Saff
Estimating the argument of some analytic functions
135--138
Date: Thu, 30 Jan 1997 15:49:16 +0100 (MET)
From: Ingo Nagel <nagel@iam.uni-bonn.de>
Subject: #20 Answer: Biorthogonal Wavelets in high dimensions (WD 5.10 #24)
Dear Digest,
I received some hints for literature which are listed below:
R. Long, D. Chen,
``Biorthogonal Wavelet Bases on R^d''
Applied and Computational Harmonic Analysis 2-3 (1995) p 230.
A. Karoui, R. Vaqillancourt,
``McClellan Transformation and the Construction of
Biorthogonal Wavelet Bases of L^2(R^2)''
Computers & Mathematics with Applications 29-12 (1995) p 13
R. Vaillancourt, A. Karoui,
``On the Construction of Biorthogonal Wavelet Bases of L^2(R^2)
by McClellan's transformations''
Comptes Rendus Mathematiques de l'Academie des Sciences 16-6 (1994) p 247
Some more paper can be found on the page of the CRM in montreal:
http://www.crm.umontreal.ca/Publications/FureterRapportsEng.shtml
Thank you very much!!
Date: Fri, 7 Feb 97 13:55:40 +0200
From: isar@ee.utt.ro (Alexandru Isar)
Subject: #21 Answer: Wavelet sampling (WD 6.1 #24)
Your problem has a name: the initialisation of DWT. There are some
papers dealing with this problem. For example:
[Abr.,Fla.'94] P. Abry, P. Flandrin, "On the Initialisation of the
Discrete Wavelet Transform Algorithms", IEEE Signal
Processing Letters, vol.1, no.2, February 1994;
[Del.,Jud.'95] B. Delyon, A. Juditsky, "Estimating Wavelet
Coefficients", in "Wavelets and Statistics", Editors: A.Antoniadis,
G.Oppenheim , Springer-Verlag, 1995,
[Rio.,Duh.'92] O.Rioul, P. Duhamel, "Fast Algorithms for Discrete and
Continuous Wavelet Transforms", IEEE Trans. on Inf. Theory, vol. 38,
no.2, March 1992,
[She.'92] M.J.Shensa, "The Discrete Wavelet Transform: Weding the A
Trous and Mallat Algorithms", IEEE Trans. on Signal
Proc. vol. 40, no.10, October 1992,
[Xia.,Kuo.,Zha.'94] X.G.Xia, C.C.J.Kuo, Z.Zhang, "Wavelet Coefficient
Computation with Optimal Prefiltering", IEEE Trans. On Signal
Proc. Vol. 42, no.8, Aug. 1994.
I work myself on this subject, and I can be found by e-mail
at the address isar@ee.utt.ro, for a change of information .
Best wishes.
Date: Fri, 8 Feb 97 13:35:40 +0200
From: wim@bell-labs.com (Wim Sweldens)
Subject: #22 Answer: Wavelet sampling (WD 6.1 #24)
I worked on this problem several years ago. There are two papers
that you may be interested in:
Wavelet Sampling Techniques
/who/wim/papers/papers.html#sampling
Quadrature Formulae and Asymptotic Error Expansions for Wavelet
Approximations of Smooth Functions
/who/wim/papers/papers.html#quad
Hope this helps,
Wim Sweldens.
Date: Fri, 17 Jan 1997 17:14:11 +0800
From: eyzhao@bupt.edu.cn
Subject: #23 Question: Wavelet and CDMA
Hello,
Is there anyone uses wavelet in CDMA?if so,who can tell me what topics do
you research,and Is there any good paper to refer to?
Thanks.
My email eyzhao@bupt.edu.cn
[Answer]
Date: Fri, 17 Jan 1997 08:23:16 -0800
From: afzal@iastate.edu
Subject: #24 Question: Wavelet applications in Communications
Dear friends,
I am looking for a list of publications on application of Wavelets in
Cummunication systems, specially in the area of spread spectrum
systems and CDMA. If anybody has such a biblipgraphy or know about
a site where I can get one, please respond.
Muhammad A.K. Afzal
ECE Depaterment
Iowa State University
email: afzal@iastate.edu
[Answer]
Date: Tue, 21 Jan 1997 09:13:45 +0000
From: islrp@concorde.cedocar.fr
Subject: #25 Question: Wavelets and DSP implementations
Dear colleagues and waveleteers,
Has anyone successfully implemented a bi-orthogonal wavelet based
black and white still images compression algorithm on a DSP processor
such as an ANALOG DEVICES SHARK ADSP21xxx ? Both a good compression
ratio and processing time are of major importance for the research
programm I'm engaged (PSNR > 20 dB, Cr > 20, t < 500 ms). I have
already investigated some solutions with MATLAB and the calculation
cost is prohibitive for a near real-time DSP application : entropy
coding, VQ, VQ+RLE+HUFFMAN ...... On the other hand, the VGA B/W still
images (640x480 pixels) I have to compress and transmit with an UHF
tranceiver are uncorrelated and of poor quality (noised, blurred, low
contrasted). For these reasons, I think it's difficult to use a VQ
method based on stastical dictionaries.
Thanks in advance for your help,
Yours sincerely,
Pf. Pierre RAYMOND
Dr. P. RAYMOND
Institut de Recherches de Saint-Louis
B.P.34
68301 Saint-LOUIS Cedex
voice : (+33) 03 89 69 50 83
fax. : (+33) 03 89 69 50 02
Email : ISL.Raymond.Pierre@Cedocar.fr
Date: Sun, 19 Jan 97 11:34:51 CST
From: Urvi <U35527@UICVM.UIC.EDU>
Subject: #26 Question: Wavelets in Speech Recognition
Hello. I am a student at the University of Illinois at Chicago doing
a project on the use of wavelet theory in speech recognition. I am
looking for papers in this area and I have had no real success. The
closest I came was in finding a paper on the use of wavelet theory in
pitch detection of speech signals. I visited the wavelet digest home
page and saw that there were other students interested in this area.
Is there a way for me to post my email address and question on this
site? As I am in the very early stages of my research, any help
and/or guidance you can give me will be greatly appreciated.
Thank You,
Urvi
Date: Mon, 27 Jan 97 10:33:05+050
From: shailesh@cair.ernet.in (S.R.Chansarkar)
Subject: #27 Question: Papers on wavelets applications in Image Registration.
I am looking for papers (available as well as non-available on the
web) on applications of wavelets in Image Registration. I would be thanful
to get a bibliography on the above mentioned subject.
Thanks in advance.
Regards and best wishes.
shailesh@cair.ernet.in
Date: Thu, 30 Jan 1997 11:28:12 -0500 (EST)
From: Javad Alirezaie <javad@mcmail.cis.mcmaster.ca>
Subject: #28 Question: What is the best wavelet package for image compression?
Dear colleagues,
We have developed a new algorithm for image coding (medical images),
which performs better than WSQ (FBI standard), however, I would like to
compare our results with one of the best (well known) wavelet programs
which can be obtained via ftp. I appreciate if anyone can help me and
provide some information in this regard.
Regards,
-Javad
Date: Sun, 9 Feb 97 02:49:33 UT
From: "Steven Schulze" <Captain_SOS@msn.com>
Subject: #29 Question: Wavelets and DSP
Hi!
I'm currently experimenting with applying DSP functions to sampled
audio waveforms. I'm currently using the FFT, but ran into problems
concerning it's limitations.
For instance, the low frequancy resolution is very poor, and the large
sidelobes when transforming waveforms with frequancies that don't fall
on the transform harmonics also cause problems.
Note that my objective is to transform the discrete time signal,
perform some processing to it, and CONVERT IT BACK to time domain.
Obviously, hi-fedility is important.
Some of the processing I currently do using the FFT:
1) Selective frequancy filtering.
2) Noise removal
3) Frequancy shifting (constant time)
4) Time compression/expansion (constant frequancy)
5) Selective frequancy phase shifting
6) etc.
I know nothing about wavelets at this point, so my question is the
following... Is it worth investing the time into learning about
wavelets, and can it do the same type of DSP on audio as described
above, with maybe better results? Is this a slower transform than the
FFT?
Note: This is not for speach, but for much more critical music
applications. ANY noticable artifacts will make the resultant data
unusable. I'm not looking for sample-by-sample reconstruction, but
just very good results.
Any help would be greatly appreciated!
Thanks...
Steven Schulze
Concord, CA
Captain_SOS@msn.com
Date: Tue, 11 Feb 1997 15:21:03 -0600
From: Bipin Kumar Paracha <bipin@ttacs.ttu.edu>
Subject: #30 Question: Help on wavelet compression of medical images
I am a grad student at the Texas Tech University. I am working
on multistage compression of medical images. I would like to
compare the results of compression of images using LBG
algorithm and our own algorithm - AFLC on DAUB 4, DAUB 12
wavelet coefficients. I need help in locating an algorithm for
DAUB 12 coeffecients which can implemented on C or C++.
Any help will be greatly appreciated.
Bipin Kumar Paracha
<webmaster@wavelet.org>