[Home] [Back Issues] [Search] [Vol 1] [Vol 2] [Vol 3] [Vol 4] [Vol 5]

The Wavelet Digest, Volume 5, Issue 10 (December 5, 1996)




Today's Editor: Wim Sweldens
                wim@bell-labs.com



Today's Topics:

     1: Preprint: Wavelet Thresholding via a Bayesian Approach
     2: Preprint: Wavelet Approaches to Statistical Inverse Problems
     3: Preprint: Spectral factorization of Laurent polynomials
     4: Preprint: Preprints from Naoki Saito available
     5: Preprint: New preprint on spherical wavelets
     6: Preprint: Application of Wavelets to Bifurcation and Chaos
     7: Preprint: Scalable Wavelet Video Codec for Low Bit rate
     8: Preprint: Preprints form Bao Liu on Basis Selection
     9: Preprint: A Pyramid Scheme for Spherical Wavelets
    10: Meeting:  Workshop on Wavelets and Applications - Madras, India
    11: Meeting:  IEEE Neural Networks for Signal Processing
    12: Course:   IEEE Educational Videos on Wavelets
    13: Job:      Position at Focus Interactive Technology
    14: Job:      Lecturer at University of Bath
    15: Job:      Position at Sam Houston State University
    16: Contents: Numerical Algorithms 13-1
    17: Contents: Annals of Numerical Mathematics Vol 4 1997
    18: Contents: Multidimensional Systems & Signal Processing
    19: Answer:   Help Using Non-Haar Wavelets (WD 5.9 #25)
    20: Question: Using Wavelet in Lightning current signal ?
    21: Question: Software on DWT modulus maxima extraction
    22: Question: I) smoothing on the interval / II) an integral
    23: Question: biorthogonal Box-Spline Wavelets
    24: Question: Papers on high dimensional biorthogonal wavelets
    25: Question: Wavelets vs. Fourier Analysis
    26: Question: Looking for Wavelet Software without Web/Ftp access
    27: Question: Lifting for Multi-Spectral images
    28: Question: 3-band wavelets
     
Current number of members: 8035

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:

 Dec 15-19: American Geophysical Union Meeting, San Franscisco
 Dec 17-19: Mathematics in signal processing, Warwick, UK
 -- 1997
 Jan 3-5:   Course on Wavelets and Filter Banks, San Diego
*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 22-24: SPIE Fourth Wavelet Application Conference, Orlando
 Jun 16-18: Engineering Applications of Neural Networks, Stockholm
 Jun 23-26: Sampling Theory and Applications, Aveiro, Portugal
 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 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: Sat, 9 Nov 1996 15:19:17 +0000 (GMT)
From: mafs <t.sapatinas@bristol.ac.uk>
Subject: #1 Preprint: Wavelet Thresholding via a Bayesian Approach

Dear readers,

The following preprint is available:

Authors: Abramovich, F., Sapatinas, T. and Silverman, B.W.

Title: Wavelet Thresholding via a Bayesian Approach

Abstract. We discuss a Bayesian formalism which gives rise to a type
of wavelet threshold estimation in nonparametric regression. A prior
distribution is imposed on the wavelet coefficients of the unknown
response function, designed to capture the sparseness of wavelet
expansion common to most applications. For the prior specified, the
posterior median yields a thresholding procedure. Several examples are
used to illustrate the method, and comparisons are made with other
thresholding methods.  We also present an application to a real data
set collected in an anaesthesiological study. Not surprisingly,
incorporating reasonable prior information about the smoothness of the
signal can improve the quality of estimates. Our prior model for the
underlying function can be adjusted to give functions falling in any
specific Besov space. We establish a relation between the
hyperparameters of the prior model and the parameters of those Besov
spaces within which realizations from the prior will fall. This makes
it possible to incorporate prior knowledge about the function's
regularity properties into the prior model for its wavelet
coefficients. It is therefore of interest in its own right as a way of
understanding and demonstrating the meaning of the Besov space
parameters.

This preprint is available at:

http://www.stats.bris.ac.uk/~mafs/bayesthresh_1.ps.gz

Dr. Theofanis Sapatinas,    *  e-mail: T.Sapatinas@bristol.ac.uk  *
Department of Mathematics,  |                                     |      
Bristol University,         *  Tel: + (44)-0117-9287980           *
University Walk,            |                                     |
Bristol BS8 1TW,            *  Fax: + (44)-0117-9287999           *
United Kingdom.             |                                     |



Date: Tue, 12 Nov 1996 17:10:05 +0200 (GMT+0200)
From: Abramovich Felix <felix@math.tau.ac.il>
Subject: #2 Preprint: Wavelet Approaches to Statistical Inverse Problems

Title: Wavelet Decomposition Approaches to Statistical Inverse Problems

Authors: Felix Abramovich and Bernard W. Silverman

Preprint available on the web:

http://www.math.tau.ac.il/~felix/Papers.html

                Abstract.

A wide variety of scientific settings involve indirect noisy
measurements where one faces a linear inverse problem in the presence
of noise.  Primary interest is in some function f(t) but the data is
accessible only about some transform (Kf)(t), where K is some linear
operator, and Kf(t) is in addition corrupted by noise. The usual
linear methods for such inverse problems, for example those based on
singular value decompositions, do not perform satisfactorily when the
original function f(t) is spatially inhomogeneous. One alternative
that has been suggested is the wavelet--vaguelette decomposition
method, based on the expansion of the unknown f(t) in wavelet series.

The vaguelette--wavelet decomposition method proposed in this paper is
also based on wavelet expansion. In contrast to wavelet--vaguelette
decomposition, the observed data are expanded directly in wavelet
series. Using exact risk calculations, the performances of the two
wavelet-based methods are compared with one another and with SVD
methods, in the context of the estimation of the derivative of a
function observed subject to noise. A result is proved demonstrating
that, with a suitable universal threshold somewhat larger than that
used for standard denoising problems, both wavelet-based approaches
have an ideal spatial adaptivity property.

Felix Abramovich     felix@math.tau.ac.il

Department of Statistics & Operations Research
Tel Aviv University, Tel Aviv 69978, Israel



Date: Wed, 20 Nov 1996 12:19:36 +0100 (MET)
From: gppe@tex.unica.it (Giuseppe Rodriguez)
Subject: #3 Preprint: Spectral factorization of Laurent polynomials

Title: Spectral factorization of Laurent polynomials
 
Authors: Tim N.T. Goodman, Charles A. Micchelli, 
         Giuseppe Rodriguez and Sebastiano Seatzu

Abstract: We analyse the performance of five numerical methods for
factoring a Laurent polynomial, which is positive on the unit circle,
as the modulus squared of a real algebraic polynomial. It is found
that there is a wide disparity between the methods, and all but one of
the methods are significantly influenced by the variation in magnitude
of the coefficients of the Laurent polynomial, by the closeness of the
zeros of this polynomial to the unit circle, and by the spacing of
these zeros.
 
Status: To appear in Advances in Computational Mathematics
 
You can download a copy of this paper from:
  http://tex.unica.it/~gppe/lavori/
then click on the title of the paper 
  ftp://tex.unica.it/pub/papers/facsym.ps

Giuseppe Rodriguez
rodriguez@unica.it
http://tex.unica.it/~gppe



Date: Wed, 20 Nov 1996 10:44:40 -0500
From: Naoki Saito <saito@ridgefield.sdr.slb.com>
Subject: #4 Preprint: Preprints from Naoki Saito available

The following two preprints are available via ftp or www:

Title: Improved Local Discriminant Bases Using Empirical Probability Density
Estimation

Authors: Naoki Saito and Ronald R. Coifman

Abstract: The authors developed the so-called Local Discriminant Bases
(LDB) method for signal and image classification problems a few years
back.  The original LDB method relies on the difference in
time-frequency energy distributions of the signal classes: from a
time-frequency dictionary (a large collection of localized basis
functions including wavelet packets and local trigonometric
functions), it selects a basis which maximizes "distances" among
energy distributions of signal classes.  Through our experience and
experiments on various datasets, however, we realized that the
time-frequency energy distribution is not always the best quantity to
analyze for classification.  In this paper, we propose to use
empirical probability densities of coordinates for discrimination
instead of the time-frequency energy distributions. That is, we first
estimate the probability density function of projection of signals
onto each basis vector in the time-frequency dictionary using the
available training signals.  Then, we measure the "distances" among
the corresponding densities using the Kullback-Leibler divergence or
the Hellinger distance for each coordinate and use them as the
discriminant power of that coordinate.  Finally, we select a basis
which maximizes the sum of these discriminant powers.  Compared to the
original LDB, our new LDB should be able to carry subtler discriminant
information including phase information of signals.  Using this
probability setting, the meaning of the original LDB is clarified.  We
also compare the performances of the original and new methods using
both synthetic and real datasets.

Note: To appear in Amer. Stat. Assoc. 1996 Proceeding on Statistical
      Computing

Location: http://www.math.yale.edu/pub/wavelets/papers/impldb.ps.gz
          ftp://pascal.math.yale.edu/pub/wavelets/papers/impldb.ps.gz

Title: Classification of Geophysical Acoustic Waveforms Using
       Time-Frequency Atoms

Author: Naoki Saito

Abstract: Acoustic waveforms recorded in boreholes carry important
information for oil and gas exploration and development.  For example,
classifying such waveforms to the ones propagated through sandstone
layers and the ones through shale layers is helpful for identifying
the reservoir region.  We apply the Local Discriminant Basis (LDB)
method recently developed by Saito and Coifman to this classification
problem.  In this paper, we compare the performance of a variety of
discriminant measures on the time-frequency energy distributions
including the Kullback-Leibler divergence, the Hellinger distance, and
the l^2 distance.  We also examine the dependence of classification
accuracy on the number of time-frequency features (or coordinates)
supplied to the final classifiers (LDA or CART).  It turned out that
in this dataset the classification accuracy was rather sensitive to
the number of features fed to the classifiers whereas the choice of
the distance measure did not make much difference.

Note: To appear in Amer. Stat. Assoc. 1996 Proceeding on Statistical
      Computing 

Location: http://www.math.yale.edu/pub/wavelets/papers/sonic.ps.gz
          ftp://pascal.math.yale.edu/pub/wavelets/papers/sonic.ps.gz

          Naoki Saito, Ph.D.                 Schlumberger-Doll Research
Email: saito@ridgefield.sdr.slb.com          Old Quarry Road
Voice: (203) 431-5209  Fax: (203) 438-3819   Ridgefield, CT 06877 USA



Date:          Tue, 26 Nov 1996 15:25:25 +0100
From: "JOCHEN GoeTTELMANN" <jochen@mat.mathematik.uni-mainz.de>
Subject: #5 Preprint: New preprint on spherical wavelets

Title: Locally Supported Wavelets on the Sphere

Author: Jochen Goettelmann

Abstract: In this paper we construct explicitly wavelets on the sphere
that provide a locally supported and stable (or unconditional) basis
for the Sobolev spaces $H^s,0\leq s<1$.  We get at hand a fast wavelet
transform with almost optimal complexity.  Our construction yields
continuous wavelets that are bilinear w.r.t.\ some special spherical
grid. A numerical example confirms that in our approach the poles are
not exceptional points concerning the approximation power or the
stability of the wavelet basis. Due to the simple data structure and
the explicit construction principle this basis can be easily
implemented in any numerical scheme that makes use of spherical
wavelets as trial functions.

It is not available by FTP, but I sent a postscript file or a printed 
copy on request. 

Best regards, Jochen

Jochen Goettelmann FB Mathematik Universitaet Mainz Staudinger Weg 9
55099 Mainz Germany

jochen@mat.mathematik.uni-mainz.de 



Date: Sun, 1 Dec 1996 10:10:10 +0800
From: mengg@nwpu.edu.cn
Subject: #6 Preprint: Application of Wavelets to Bifurcation and Chaos

The Application of Wavelet Transform to Bifurcation and Chaos in a
Nonlinear Vibration System

Zheng Jibing   Guo Yinchao
Inst. of Vibration Engineering
Northwestern Polytechnical University
Xi'an, P.R.China, 710072

Abstract The response of a nonlinear vibration system may be various
periodic motions, quasiperiodic response or chaotic vibration when the
parameter of the system changed. The periodic motions corresponding
the parameters can be identified by Poincare map, and harmonic wavelet
transform (HWT) can distinguish quasiperiod from chaos, so the motion
styles of the system will be revealed in the parametric space by the
method of joining HWT with Poincare map.

Key Words:  Wavelet Transform    Nonlinear Vibration    Bifurcation
Chaos

The styles of motion for a nonlinear vibration system may be period,
quasiperiod or chaos. When the parameters of the system is given,
Poincare map, power spectral, wave form or Lyapunov exponent is always
utilized to see whether the response of the system is chaotic or not,
but making conclusion from graph is impossible when we have to learn
about the motions corresponding the parametric space or initial value
space, and computing Lyapunov exponent is very time consumed.  As
wavelet transform has local property in both time domain and frequency
domain, and one of the chaotic vibration's properties is that part or
all of the harmonic component can*t repeat periodically, wavelet
transform can reveal it. In this paper, using the HWT discovered by
Newland[1][2] to identify chaotic motion, and considering Poincare map
at the same time, a new method is put up to analyzing the styles of
motion corresponding the parametric space of a nonlinear system.



Date: Tue, 03 Dec 1996 15:42:48 +0800
From: Tham Jo Yew <thamjy@haar.math.nus.sg>
Subject: #7 Preprint: Scalable Wavelet Video Codec for Low Bit rate

Title: Highly Scalable Wavelet-Based Video Codec for Very Low Bit-rate
       Environment

Authors: Jo Yew Tham, Surendra Ranganath, Ashraf A. Kassim 
Department of Electrical Engineering, 
National University of Singapore 
10 Kent Ridge Crescent, 
Singapore 119260

Status: Submitted to IEEE Transactions on Circuits And Systems for Video
Technology, August 1996  

ABSTRACT: In this paper, we describe a complete scalable video
compression system for very low bit rate applications.  First, a
three-parameter motion model is used to compensate for interframe
motion within a chosen group of frames (GOF) with respect to a
reference frame.  This motion-compensated GOF is then transformed via
a three-dimensional separable wavelet (packet) decomposition
framework.  By employing a new data structure called {tri-zerotrees},
and applying the method of layered/progressive coding, very high
compression ratios can be achieved in a fully embedded and scalable
fashion.  With this class of scalable algorithms, we need to generate
only one original version of the compressed video without any prior
information of the potentially different decoders' requirements.  This
is possible because different subsets of the same compressed bit
stream can then be selectively extracted, transmitted, decoded, and
displayed to meet a multitude of combinations of display spatial
resolutions, frame rates, bit rates, and decoders' hardware
complexities.  The newly-extracted bit stream can also subsequently be
rescaled further to fulfil other displayp specifications.  By
generating a fully embedded bit stream, precise bit rate control can
be achieved in both the encoding and decoding processes, regardless of
the chosen frame rates and spatial resolutions.  Our simulations also
showed that compressed videos with high subjective quality and PSNR
values can be obtained at bit rates of less than 15 kbps.

Keywords: video compression, wavelets, motion compensation,
tri-zerotrees, very low bit rates, multiresolution and multirate
scalability

Please visit http://www.cadcam.nus.sg/~ele22091 or e-mail
thamjy@wavelets.math.nus.sg for more information.

Thank you for your attention.

Tham Jo Yew                           |   i) thamjy@wavelets.math.nus.sg 
Research Assistant, and               |  ii) mattjy@nus.sg 
Postgraduate Research Student         | iii)
ele22091@hpdc1.cadcam.nus.sg
The National University of Singapore  |



Date: Wed, 4 Dec 1996 00:16:36 +0800 (SST)
From: Liu Bao <matliub@leonis.nus.sg>
Subject: #8 Preprint: Preprints form Bao Liu on Basis Selection

1.

Title: On the Optimal Selection of Task Dependent Wavelet Packet Basis
                     with Genetic Algorithms

Authors: Bao Liu, Department of Mathematics, NUS, Singapore 119260
         Shih-Fu Ling, School of MPE, NTU, Singapore 639798
         
Abstract: A genetic algorithm for the optimal selection of various
task dependent wavelet packet bases is proposed. We introduce a
transform operator to convert the hard combinatorial selection problem
to a continuous numerical optimization problem. Each individual in a
population is transformed to a corresponding basis, e.g., its best
basis. The 'fitness' of each corresponding basis is then evaluated
with the objective function of the task. According to the fitness of
the individuals, parents are selected from this population to produce
the children that constitute the next generation by using
reproduction, crossover and mutation operators. This algorithm offers
a great deal of flexibility for the optimal selection of both complete
and incomplete (without pruning) bases in terms of different fitness
criteria for different tasks and does not need an additive cost
function. The performance of this algorithm has been tested with good
results on practical machinery diagnosis problems.

2.

Title: Tree Structured Local Basis Selection Using Genetic Algorithms

Authors: Bao Liu, Department of Mathematics, NUS, Singapore 119260
         Shih-Fu Ling, School of MPE, NTU, Singapore 639798
         
Abstract: A genetic algorithm for the optimal selection of tree structured
local bases for various tasks is proposed. We introduce a transform
operator to convert the hard combinatorial selection problem to a
continuous numerical optimization problem. Each individual in a population
is transformed to a corresponding basis, e.g., its best basis. The
'fitness' of each corresponding basis to a given task is then evaluated
with the task objective function. According to the fitness of the
individuals, parents are selected from this population to produce the
children that constitute the next generation by using reproduction,
crossover and mutation operators. This algorithm offers a great deal of
flexibility for the optimal selection of both complete and incomplete
(without pruning)  bases in terms of different fitness criteria for
different tasks and does not need an additive cost function. The
performance of this algorithm has been tested with good results on
practical machinery diagnosis problems.

Keywords: wavelet packets, local trigonometric transforms, orthonormal
          basis construction, genetic algorithms

3.

Title: On the Selection of Informative Wavelets for Machinery Diagnosis

Authors: Bao Liu, Department of Mathematics, NUS, Singapore 119260
         Shih-Fu Ling, School of MPE, NTU, Singapore 639798

Abstract: An application of wavelet analysis to machinery fault
diagnosis is presented. We introduce an extension to Mallat and
Zhang's matching pursuit for signal classification problems. Instead
of the 'best matching' criterion, a mutual information measure is used
to search a wavelet library for the set of wavelets that carry
meaningful information about class differences. With these informative
wavelets treated as feature extractors, this approach effectively
facilitates the diagnosis of machinery faults of a non-stationary
nature. We have applied this approach to the detection of diesel
engine malfunctions.  The results show that both the sensitivity and
the reliability of this approach are good. Besides machinery fault
diagnosis, this approach can also be applied to other signal
classification tasks, such as speech recognition, etc.. In addition,
it can also be used to initialize the parameters of wavelet networks.

For Postscript format copy, E-mail a request to 

Liu Bao
lb@haar.math.nus.sg



Date: Wed, 4 Dec 1996 13:48:11 +0100 (MET)
From: Michael Schreiner <schreiner@mathematik.uni-kl.de>
Subject: #9 Preprint: A Pyramid Scheme for Spherical Wavelets

Author: Michael Schreiner

Title:  A Pyramid Scheme for Spherical Wavelets

Abstract: We consider a scale discrete wavelet approach on the sphere
based on spherical radial basis functions. If the generators of the
wavelets have a compact support, the scale and detail spaces are
finite--dimensional, so that the detail information of a function is
determined by only finitely many wavelet coefficients for each scale.
We describe a pyramid scheme for the recursive determination of the
wavelet coefficients from level to level, starting from an initial
approximation of a given function.  Basic tools are integration
formulas which are exact for functions up to a given polynomial degree
and spherical convolutions.

This preprint is available at

http://www.mathematik.uni-kl.de/~wwwgeo/WWW/publications/AGGEO-reports/pyramid.ps.gz

or:

ftp://www.mathematik.uni-kl.de/pub/Math/Papers/AGGEO-reports/pyramid.ps.gz

Best regards

M. Schreiner

Dr. Michael Schreiner                   e-mail: schreiner@mathematik.uni-kl.de
University of Kaiserslautern            http://www.mathematik.uni-kl.de/~wwwgeo
Department of Mathematics               Tel.:   +49 631 205 3244
Geomathematics Group                    Fax:    +49 631 29081   
P.O.Box 3049
D-67653 Kaiserslautern
Germany



Date: Fri, 15 Nov 1996 15:56:06 +0000 (GMT)
From: "DR.C.N.KRISHNAN." <siemit@giasmd01.vsnl.net.in>
Subject: #10 Meeting: Workshop on Wavelets and Applications - Madras, India

                           WORKSHOP ON
                    WAVELETS & APPLICATIONS

                   (23-25  January 1997)

      School Of Instrumentation & Electronics,
      Madras Institute Of Technology,
      Anna University,
      Chromepet,
      Madras-600044
      INDIA

       ABOUT THE WORKSHOP

            The course is intended for researchers working in the area
       of Electronics,Communication or computer science. However, parti-
       cipation from Mathematicians,Physicists,Researchers and Students
       from other branches of engineering and sciences would also be
       welcome.
           The course would consist largely of tutorial lectures with
       half of them devoted to principles and properties and half of them
       to applications.
       Topics to be covered include
            Wavelet Principles & Properties
            Wavelet applications
              - Image & Speech Processing
              - Biomedical
              - Digital Communication
       The speakers include apart from faculty of Anna University:
         Dr.S.B.Adiga     (Motorola India, Bangalore)
         Dr.Bindu Chandna (EE Dept., I.I.T.,Bombay)
         Dr.Gnana Bhaskar (Maths Dept., I.I.T.,Delhi)
         Prof.N.Pradhan   (NIMHANS,Bangalore)
         Dr.Vikram Gadre  (EE Dept., I.I.T., Bombay)
         Prof.K.R.Unni    (MATSCIENCE,Madras,Retd)
       Registration Fees(excluding boarding and lodging):

         For fulltime Research Scholars = Rs 1500/-
         For others                     = Rs 2500/-
       Limited shared student hostel accomodation is available on specific
       request.
       Last date for receipt of completed registration forms: 27.12.96
       For further details contact the course co_ordinators.
      
           Course Co_ordinators

       Dr.P.V.Ramakrishna                        Ms.D.S.C.Thanamala

                School Of Instrumentation & Electronics
                Madras Institute Of Technology
                Anna University
                Chromepet
                Madras- 600044
                INDIA

      e_mail:   siemit@giasmd01.vsnl.net.in
      Fax   : (044)2368403
      Phone
         off: 2368850,2368852,2368853
         res:4992704, 2353412 



From: devries@sarnoff.com (Aalbert De Vries x2456)
Subject: #11 Meeting: IEEE Neural Networks for Signal Processing

                             1997 IEEE Workshop

                                     on

                    Neural Networks for Signal Processing

                            24-26 September 1997

                      Amelia Island Plantation, Florida

                   FIRST ANNOUNCEMENT AND CALL FOR PAPERS

Thanks to the sponsorship of the IEEE Signal Processing Society and
the co-sponsorship of the IEEE Neural Network Council, we are proud to
announce the seventh of a series of IEEE Workshops on Neural Networks
for Signal Processing.

Papers are solicited for, but not limited to, the following topics:

   * Paradigms: artificial neural networks, Markov models, fuzzy logic,
     inference net, evolutionary computation, nonlinear signal processing,
     and wavelets

   * Application areas: speech processing, image processing, OCR, robotics,
     adaptive filtering, communications, sensors, system identification,
     issues related to RWC, and other general signal processing and pattern
     recognition

   * Theories: generalization, design algorithms, optimization, parameter
     estimation, and network architectures

   * Implementations: parallel and distributed implementation, hardware
     design, and other general implementation technologies

Instructions for submitting papers

Prospective authors are invited to submit 5 copies of extended
summaries of no more than 6 pages. The top of the first page of the
summary should include a title, authors' names, affiliations, address,
telephone and fax numbers and email address, if any. Camera-ready full
papers of accepted proposals will be published in a hard-bound volume
by IEEE and distributed at the workshop.

Submissions should be sent to:

Dr. Jose C. Principe
IEEE NNSP'97
444 CSE Bldg #42
P.O. Box 116130
University of Florida
Gainesville, FL 32611

Important Dates:

   * Submission of extended summary: January 27, 1997 *
   * Notification of acceptance: March 31, 1997
   * Submission of photo-ready accepted paper: April 26, 1997
   * Advanced registration: before July 1, 1997

Further Information

Local Organizer
     Ms. Sharon Bosarge
     Telephone: 352-392-2585
     Fax: 352-392-0044
     e-mail: sharon@ee1.ee.ufl.edu

World Wide Web
     http://www.cnel.ufl.edu/nnsp97/

Organization

General Chairs
     Lee Giles (giles@research.nj.nec.com), NEC Research
     Nelson Morgan (morgan@icsi.berkeley.edu), UC Berkeley
Proceeding Chair
     Elizabeth J. Wilson (bwilson@ed.ray.com), Raytheon Co.
Publicity Chair
     Bert DeVries (bdevries@sarnoff.com), David Sarnoff Research Center
Program Chair
     Jose Principe (principe@synapse.ee.ufl.edu), University of Florida

Program Committee

Les ATLAS               Andrew BACK             A. CONSTANTINIDES
Federico GIROSI         Lars Kai HANSEN         Allen GORIN
Yu-Hen HU               Jenq-Neng HWANG         Biing-Hwang JUANG
Shigeru KATAGIRI        Gary KUHN               Sun-Yuan KUNG
Richard LIPPMANN        John MAKHOUL            Elias MANOLAKOS
Erkki OJA               Tomaso POGGIO           Tulay ADALI
Volker TRESP            John SORENSEN           Takao WATANABE
Raymond WATROUS         Andreas WEIGEND         Christian WELLEKENS



Date: Tue, 5 Nov 1996 10:30:21 -0500
From: "Pankaj N. Topiwala" <pnt@mitre.org>
Subject: #12 Course: IEEE Educational Videos on Wavelets

A series of IEEE Educational videos on wavelets is now available from
IEEE headquarters, featuring an easy graphical review of the relevant
mathematics behind wavelets, and an exciting array of applications
from image, audio and video compression, to speech coding and
recognition, to noise filtering. This video series is accessible to a
wide audience of researchers and students in mathematics, science and
especially in engineering disciplines.  Prerequisites are kept to a
minimum: some calculus and linear algebra, and a working familiarity
with concepts in signal processing.

The pricing on this series has now been significantly reduced.  For
more information or to order these videos, please contact:

Elizabeth Sivco
Video Producer, IEEE Educational Activities
Institute of Electrical and Electronics Engineers, Inc. (IEEE)
445 Hoes Lane
Piscataway, NJ  08855-1331
E-mail: e.sivco@ieee.org
Phone:  (908) 562-5499
Fax:  (908) 981-1686

Check us out on the WWW!
http://www.ieee.org/eab/

A brief overview of the contents of the video courses follows.

Full Course: FUNDAMENTALS OF WAVELETS AND APPLICATIONS
Release Date: September 1995 (10 hours/7 tapes)
Presented by Pankaj Topiwala, MITRE Corporation; Shubha Kadambe, Atlantic
Aerospace; Peter Niels Heller, Aware Inc.; Tom Hopper, FBI; and Ronald
Coifman, Yale University

Complete program comes in three (3) sections:
        PRINCIPLES OF WAVELET THEORY
        WAVELET APPLICATIONS IN SPEECH & AUDIO
        WAVELET APPLICATIONS IN IMAGE PROCESSING

As applications of wavelet theory grow rapidly, high-tech industries
are experiencing a virtual flood of engineers entering this field with
diverse backgrounds and skills. As a result, thousands of engineers
working in everything from mathematics and physics to applied areas in
digital signal processing, image compression, speech recognition, and
pattern recognition need to understand this exciting new subject. No
other publication can offer the comprehensive and timely coverage
found in this IEEE video as presented by today's foremost experts.

FUNDAMENTALS OF WAVELETS AND APPLICATIONS covers all major aspects of
wavelet theory including: 
        - time-frequency localization    - multi-resolution analysis 
        - digital filter banks           - subband coding

Plus many exciting applications are presented in detail:
        - image compression              - speech coding and recognition
        - audio and video coding         - automatic target recognition

The FBI's Wavelet Scalar Quantization compression of fingerprint
images is given special coverage by the FBI's expert, Tom Hopper.

Learning is supported by a complete booklet of hardcopy visuals,
notes, and reference materials. This program is appropriate for use by
individuals or for group-study.

Also available in three separate video excerpts...

Video Excerpt 1 - PRINCIPLES OF WAVELET THEORY
(3.5 hours/3 tapes)
Presented by Pankaj Topiwala, Peter Niels Heller, and Ronald Coifman

This tutorial provides a complete overview of the theoretical
underpinnings of wavelets and their applications. Emphasis is placed
on the novel time frequency decomposition afforded by wavelets and the
associated impact on a variety of applications.

>From this tutorial you will learn:
1.      Basics of Fourier analysis and sampling theory
2.      Fundamentals of wavelet theory and its distinctions from
        Fourier theory 
3.      Time-frequency analysis and localization techniques 
4.      Filterbank theory, including generalizations to M-band
        splittings 
5.      Methods of wavelet packets and their implications for noise
        suppression and numerical analysis

Contents: Mathematical Preliminaries: Linear Algebra, Linear Analysis,
Fourier Transform, Uncertainty Relations, Extremal Solutions, Sampling
Theory; Wavelets Continuous and Discrete: Gabor, Affine, Nonstationary
Signals, Time-Frequency Representations, Time-Frequency Localization;
Core Wavelet Theory: Multi-resolution Analysis, Digital Filters,
Subband Coding, QMFs, Daubechies Wavelets, Regularity/Symmetry,
Spectral Factorization, Biorthogonal Wavelets; Wavelet Packets: Tree
Structured Decompositions, Basis Libraries, Entropy-Based Selection,
Example Bases, Sparse Matrix Representation, M-Band Multi-rate
Filters.

Video Excerpt 2 - WAVELET APPLICATIONS IN SPEECH, AUDIO, AND 1-D
SIGNAL ANALYSIS 
(4 hours/3 tapes)
Presented by Pankaj Topiwala, Shubha Kadambe, Peter Niels Heller, and
Ronald Coifman 

Detailed applications in speech and audio processing are covered in this
tutorial as well as the methods of noise removal from speech and audio
signals. Applications range from speech coding, phoneme recognition, pitch
detection, and CD quality audio coding.

>From this tutorial you will learn:
1.      Applications to speech coding and speech pattern recognition
2.      High quality audio coding using wavelets and filterbanks
3.      Methods of noise suppression in speech and audio using wavelets
4.      Transient detection and radar target classification

Contents: 1-D Signal Processing: Transient Detection, Radar Target
Classification; Speech: Background, Physiology, Review State-of-Art,
Adaptive Wavelets, Neural Networks, Recognition and Coding Highlights;
Audio: M-Band Wavelets, Wavetool Demonstration, Multi-rate Filter banks,
Audio Characteristics/Background, Compression Examples; Wavelet Packets:
Tree Structured Decompositions, 1-D Pattern Recognition Audio Denoising.

Video Excerpt 3 - WAVELET APPLICATIONS IN IMAGE PROCESSING
(2.5 hours/2 tapes)
Presented by Pankaj Topiwala, Peter Niels Heller, Tom Hopper, and Ronald Coifman

Fundamentals of wavelets and filter banks are presented as well as
detailed applications in image processing. This tutorial presents a
thorough account of the theory and practice of wavelet image
compression. Applications covered range from the compression of still
grayscale images to color images, multi-spectral images, and
video. The FBI's WSQ fingerprint compression standards are treated in
detail.

>From this tutorial you will learn:
1.      Live applications in still image compression
2.      Application to multi-spectral imagery
3.      Basics of wavelet video compression
4.      Methods of noise suppression in images using wavelets

Contents: Still Image Compression: Overview of Transform Coding,
Review of JPEG, Wavelet vs. JPEG Examples, PSNR Plots, Review
State-of-Art, Wavetool Demonstration, Higher-D Wavelets;
Multi-spectral Image Compression: WSQ Fingerprint Compression,
Background/ History, Fingerprint Characteristics, IAFIS Requirements,
Wavelet vs. JPEG for Fingerprints, WSQ Compression Overview; Wavelet
Packets: Tree Structured Decomposions, Image Denoising, Compression.



Date: Sat, 16 Nov 1996 14:18:47 -0500 (EST)
From: "Leonard V. Granda" <granda@focusweb.com>
Subject: #13 Job: Position at Focus Interactive Technology

Focus Interactive Technology is located in the Technology Incubator
Center of Rensselaer Polytechnic Institute in Troy, NY

Focus is developing the SPIHT (Set Partitioning in Hierarchical Trees)
image compression technology for commercial applications and licensing
partners.  Application emphasis is in the areas of still and motion
image compression for transmission, storage , specialized IP
applications, telemedicine, etc.

Opportunities are available for professionals with demonstrated
effectiveness in both application oriented R & D as well as project
consulting. Technical excellence in optimization techniques in
wavelets, computational analysis , and communications are
prerequisites.

Resumes may be forwarded.



Date: Mon, 18 Nov 1996 11:25:01 GMT
From: jaws1@ee.bath.ac.uk (Don Monro)
Subject: #14 Job: Lecturer at University of Bath

                   UNIVERSITY OF BATH

     School of Electronic & Electrical Engineering

                    LECTURESHIP IN

I n f o r m a t i o n   S y s t e m s   E n g i n e e r i n g

The Information Systems group in the Department of Electronic and
Electrical Engineering is one of the world's leading centres for
research into signal and image coding.  The new lecturer will be
expected to contribute to research in information processing and to
participate in the teaching of undergraduate and MSc programmes in
information systems, particularly those areas concerned with digital
signal processing and software engineering.  Essential qualifications
are a first degree with significant mathematical content and a PhD
earned in either signal or image processing.  A postdoctoral record
including grants earned and publications achieved is considered
desirable.

The position of Lecturer does not map directly onto terminology used
in other countries. The nearest match is that Lecturer A is similar to
Assistant Professor, and Lecturer B is similar to Associate Professor.

Salary  Lecturer Grade A GBP 15,154 - GBP 19,848
        Lecturer Grade B GBP 20,677 - GBP 26,430

These salaries should be considered in relation to the lower cost of
living in the United Kingdom. For futher information please e-mail
Professor D M Monro on d.m.monro@bath.ac.uk. For advice on the
suitability of a cv for this appointment, please e-mail it to the
above address, or send it by Fax to (+44) 1225 826073.

This is an opportunity to join a world class research effort which is
increasingly attracting industrial support and exploitation, with good
opportunities for supplementation of salary through consultancy and
licensing income.



Date: Tue, 19 Nov 96 10:00:01 -0600
From: vanfleet@guy.shsu.edu (Patrick J. Van Fleet)
Subject: #15 Job: Position at Sam Houston State University

The Department of Mathematical and Information Sciences at the SHSU
has an opening for a non-tenure track position for Spring 1996
(starting date January 13, 1997), with a possibility for renewal
during the 1996-1997 academic year.  The position includes a 3 course
teaching load.

The ideal candidate will possess a PhD in mathematics by the time of
appointment, research potential and a record of teaching ability.
Preference will be given to applicants in the area of wavelet analysis
and related areas.  SHSU has an active research program in
multiwavelets.  More information regarding the department is available
on the World Wide Web at http://galois.shsu.edu/math_home.html

All applicants must provide evidence of excellence in teaching and
evidence of the ability to teach in English effectively.

We encourage immediate application. Review of applications begins
December 1, 1996 and will continue until the position is filled.

Correspondence regarding job description, qualifications and
application procedures should be sent either by e-mail to
 
                    position@galois.shsu.edu, 
by regular mail to

               Search Comittee - Visiting Position
       Department of Mathematical and Information Sciences
                  Sam Houston State University
                     Huntsville, TX  77341

or by FAX:  
                        (409)-294-1882.



Date: Thu, 7 Nov 1996 15:32:17 +0100
From: Baltzer Science <mailer@ns.baltzer.nl>
Subject: #16 Contents: Numerical Algorithms 13-1

Numerical Algorithms

http://www.baltzer.nl/numa/

Volume 13 (1996) Nos. 1,2

Published October 1996

Contents

An automatic integration procedure for infinite range integrals involving
oscillatory kernels. T. Hasegawa and A. Sidi.

Computing a family of reprodusing kernels for statistical applications.
C. Thomas-Agnan.

Isotropic refinement and recoarsening in two dimensions.
D. Hempel.

Preconditioned Barzilai-Borwein method for the numerical solution of
partial differential equations.  B. Molina and M. Raydan.

A globally convergent method for solving nonlinear equations without
the differentiability condition.  A. Pietrus.

On the comparison of four different implementations of a third-order
ENO scheme of box type for the computation of compressible flow.
D. Hietel, A. Meister and T. Sonar.

Approximating dominant singular triplets of large sparse matrices via
modified moments.  S. Varadhan, M.W. Berry and G.H. Golub.

Book Reviews



Date: Thu, 21 Nov 1996 16:11:31 +0100
From: Baltzer Science <mailer@ns.baltzer.nl>
Subject: #17 Contents: Annals of Numerical Mathematics Vol 4 1997

Contents: Annals of numerical Mathematics Vol 4, 1997
http://www.baltzer.nl/anuma/

The heritage of P.L. Chebyshev: A Festschrift in honor of the 70th
birthday of T.J. Rivlin

Editor: Charles A. Micchelli

Dedication
Charles A. Micchelli

On the work of Theodore J. Rivlin
C.A. Micchelli

A brief preface
T.J. Rivlin

On Chebyshev polynomials in dynamics
R. Adler, B. Kitchens, C.A. Micchelli and C. Tresser 1

Renewal sequences and ordered partitions
J.M. Anderson and A. Hinkkanen 11

Bounds for the trace of the inverse and the determinant of symmetric
positive definite matrices
Z. Bai and G.H. Golub 29

On approximation by exponentials
B.J.C. Baxter and A. Iserles 39

A discrepancy lemma for oscillating polynomials and sign changes of the
error function of best approximants
H.-P. Blatt 55

On the zeros of various kinds of orthogonal polynomials
C. Brezinski and M. Redivo-Zaglia 67

On the lower semicontinuity of best rational Chebyshev approximation
B. Brosowski 79

Rivlin's problem
B. Brosowski and F. Deutsch 95

Lebesgue functions for polynomial interpolation -- a survey
L. Brutman 111

On a recovery problem
M. Buhmann and A. Pinkus 129

The approximate sampling theorem, Poisson's sum formula, a decomposition
theorem for Parseval's equation and their interconnections
P.L. Butzer and A. Gessinger 143

Support and foundation of bases
J.M. Carnicer, T.N.T. Goodman and J.M. Pen¬a 161

Lacunary interpolation by cosine polynomials
A.S. Cavaretta, C.R. Selvaraj and A. Sharma 181

A study of asymptotically optimal time-frequency localization by scaling
functions and wavelets
C.K. Chui and J.Z. Wang 193

A de Montessus theorem for multivariate homogeneous Pade¨ approximants
A. Cuyt and D.S. Lubinsky 217

The multiplicity of a spline zero
C. de Boor 229

Overconvergence of some simultaneous Hermite-Pade¨ interpolants
M.G. de Bruin and A. Sharma 239

Approximation by feed-forward neural networks
R.A. DeVore, K.I. Oskolkov and P.P. Petrushev 261

Uniqueness of least-norm generalized monosplines induced by log-concave
weight-functions
N. Dyn 289

On upper bounds for the number of extrema of Chebyshev alternants
M.K. El-Daou and E.L. Ortiz 301

Polynomial approximation of functions continuous on [-1, 1] and analytic on
(-1, 1)
D. Gaier 315

On the computation of special Sobolev-type orthogonal polynomials
W. Gautschi 329

On some recursive triangular systems
W.M.Y. Goh, E. Schmutz and J. Wimp 343

On a measure of dissimilarity between positive definite matrices
A.J. Hoffman and C.A. Micchelli 351

On computing $Ax$ and $\pi^T A$, when A is sparse
A.J. Hoffman, W.R. Pulleyblank and J.A. Tomlin 359

The dynamics of group automorphisms
B. Kitchens 369

A variational approach to optimizing linear functionals over Haar spaces
A. Kroó and D. Schmidt 393

Weighted polynomial approximation of some entire functions on the real line
A. Kroó, J. Szabados and R.S. Varga 405

On monotone and convex approximation by splines with free knots
D. Leviatan and A. Shadrin 415

On optimal Padé-type cuts
A.P. Magnus 435

Subdivision schemes with non-negative masks converge always -- unless they
obviously cannot?
A.A. Melkman 451

On a measure of dissimilarity for normal probability densities
C.A. Micchelli 461

A splitting problem
D.J. Newman 479

Fast multipoint polynomial evaluation and interpolation
via computations with structured matrices V.Y. Pan, A. Zheng, X. Huang and
Y. Yu 483

Bernstein polynomials based on the q-integers
G.M. Phillips 511

A new iterative algorithm for thin plate spline interpolation in two
dimensions
M.J.D. Powell 519

The Fundamental Theorem of Linear Programming applied to certain extremal
problems for polynomials
M.A. Qazi and Q.I. Rahman 529

Optimal recovery in translation-invariant spaces of functions
R. Schaback 547

The Chebyshev constant of a linear set
H.S. Shapiro 557

On the zeros of generalized Jacobi polynomials
P. Vértesi 561

Smoothing spline ANOVA fits for very large, nearly regular data sets, with
application to historical global climate data
G. Wahba and Z. Luo 579

Measurable entire functions
B. Weiss 599

Strong tractability of weighted tensor products
H. Wozniakowski 607

Summability of certain product ultraspherical orthogonal series in several
variables
Y. Xu 623

Author index 639



Date: Mon, 11 Nov 96 11:44:35 EDT
From: "Mike Groth" <mgroth@wkap.com>
Subject: #18 Contents: Multidimensional Systems & Signal Processing

Contents, Volume 8, Numbers 1/2, January 1997
     
Special issue: Multidimensional filter banks and wavelets: 
Research developments and applications
     
Guest editors: Sankar Basu and Bernard Levy
     
Editorial, n. K. Bose
5
     
P)reface, Sankar Basu and Bernard Levy 
7
THEORY
     
Hyunju Park, Ton Kalker, and Martin Vetterli, Grobner Bases 
and Multidimensional FIR Multirate Systems
11
     
Charles A. Micchelli and Yuestheng Xu, Reconstruction and 
Decomposition Algorithms for Biorthogonal Multiwavelets 
31
     
T. G. Marshall, Jr., Zero-Phase Filter Bank and Wavelet 
Code v Matrices: Properties, Triangular Decompositions, and 
a Fast Algorithm
71
     
Steven A. Benno and Jose M. F. Moura, On Translation 
Invariant Subspaces and Critically Sampled Wavelet 
Transforms
89
     
APPLICATIONS
     
Michael Lightstone, Eric Majani, and Sanjit K. Mitra, Low 
Bir-Rate Design Considerations for Wavelet-Based Image 
Coding
111
     
Giancarlo Calvagno and Roberto Rinaldo, Multiresolution 
Vector Quantization for Video Coding
129
     
Eric L. Miller and Alan S. Willsky, Multiscale, Statistical 
Anomaly Detection Analysis and Algorithms for Linearized 
Inverse Scattering Problems
1561
     
Jose Fridman and Elias S. Manolakos, On the Scalability of 
2-D Discrete Wavelet Transform Algorithms
185
     
SHORT PAPER
     
Wayne Lawton, A Fast Algorithm to Map Functions Forward 
219
     
Contributing Authors
229

For subscription information, aims & scope, instructions for 
authors, and previous tables of contents, see our homepage 
at http://www.wkap.nl, or contact:

Mike Groth
Kluwer Academic Publishers
101 Philip Drive
Norwell, MA  02061
Tel: (617) 871-6600
Fax: (617) 871-6528
e-mail: mgroth@wkap.com



Date: Fri, 22 Nov 1996 15:48:56 +0100
From: Bernard Cena <cena@igd.fhg.de>
Subject: #19 Answer: Help Using Non-Haar Wavelets (WD 5.9 #25)

In response to Question #25 of the Wavelet Digest Vol. 5, Nr. 9 titled
"Help Using Non-Haar Wavelets in Code" I had decided to expand on the
answer a little to provide a small guide for those wishing to start to
experiment with wavelets...
 
The (abridged) question:
bhoy@eaw.com (Bill Hoy) wrote:
> For my research project at WPI, I am studying denoising methods
> using wavelets.  My advisor wanted me to write my own algorithms, so
> starting with no previous knowledge of wavelets, I set out to learn
> how to code the Discrete Wavelet Transform. [...] I now would like
> to see if I could modify my existing Matlab code so that I could use
> something better than a Haar wavelet. [...] I realize my question is
> very-very basic and it shows my lack of experience using wavelets!
> I've been having a hard time learning wavelets by myself!  Could
> anyone provide me with some ideas as to the above question, or
> perhaps pointers where I could find some more articles for
> beginners?  Is it considered possible for a beginner to write their
> own DWT algorithms?  It would also be nice to hear from other people
> using wavelets to do denoising!
 
I just saw your question in the Wavelet Digest regarding help with
wavelets more complicated than the Haar wavelet.  Well, since you
already have Matlab you are half way to success :) - this is an
excellent prototyping tool (although not public domain :( ) and is by
far the best way to learn the ropes - forget about coding C at the
start: get your algorithms working in Matlab first!  I myself am a
computer scientist thus I do not have a rock solid maths background so
like yourself I found myself struggling for a while with wavelets. I
looked at countless books, most of which weren't too friendly and
really gave me only snapshots of the whole picture and failed to make
me understand everything from the beginning.
 
Anyway, I'm now in position to share my experiences with you.  So,
seeing that you have access to Matlab, by far the easiest way to go is
to get yourself the Wavelet Toolbox for Matlab from Mathworks.  See
http://www.mathworks.com/wavelet.html You get an excellent set of
routines that let you play with all the "standard" wavelets including
GUI applications to play with denoising and explore both the Discrete
( 1D and 2D ) and Continuous ( 1D ) Wavelet Transforms - all very,
very easy. Not only that - you get an excellent tutorial manual which
is by FAR the easiest and to-the-point introduction I've EVER seen!
(do I get a coffee mug for all the wonderful advertising, Mathworks ?
:) You also get a copy of G. Strang and T. Nguyen's book "Wavelets and
Filter Banks" which gives you all the background (from both a
mathematics and engineering points of views) if you're interested in
the nuts and bolts. I also recommend this book as it's written as a
textbook - very good to get learn the theory.  All code in the toolbox
is available thus you can look for yourself how it's done. Then, if
you have the Matlab compiler you can have Matlab automatically convert
everything for you to C if you really need the extra speed - but I
suppose you are aware that you can mix Matlab and C code together and
most of the time you don't need to code everything in C unless you
need a stand-alone application.
 
Ok, if you cann't buy the Wavelet Toolbox you can get the wavelet
toolbox from Stanford University by David Donoho and his group - this
is also a Matlab toolbox and includes all code to do orthogonal
wavelet transforms and denoising, which is what you need:
http://playfair.stanford.edu/~wavelab There is also another commercial
toolbox for Matlab from ToolSmiths at: http://www.wavbox.com/ it looks
good and seems to have similar functionality to the Matlab Wavelet
Toolbox, but that's all I know about it.
 
For those without access to Matlab, you can run the Stanford WaveLab
toolbox from Octave which is a public domain Matlab clone:
http://www.che.wisc.edu/octave/ You'll need to make slight changes as
some of the plotting commands in the demo scripts of the WaveLab
toolbox will not work - simply delete them.  Otherwise Octave runs
exactly like Matlab, just doesn't have such pretty graphics and GUI
capabilities.
 
Another alternative is Mathematica (commercial), an excellent symbolic
maths application.  There are public domain packages available, and
it's a great tool to play with 1D signals and wavelets (2D tends to be
too slow).  See: http://www.mathematica.com/
 
As far as literature goes, get yourself the SIGGRAPH wavelets for
computer graphics tutorial - it includes material from beginning to
advanced concepts - look for it at:
http://www.cs.caltech.edu/~ps/waveletcourse/ This includes chapters by
Wim Sweldens et al. who introduced the lifting scheme for construction
of wavelets. The main feature of the lifting scheme is that one can
contruct wavelets in the time domain alone without the need to mess
around with Fourier transforms, which is the main reason of woes of
beginner waveleters :) It also introduces in-place (same memory
location) transform computation and faster algorithms based on simple
add/subtract/multiply/divide as opposed to the standard filter
convolutions, etc., etc.  This tutorial is well written, easy to
follow and most imporantly starts from the very basics and gives you
an introduction to some powerful concepts and applications.
 
Look also at Amara's Wavelet Page for lots of other software packages,
papers, books, etc.: http://www.best.com/~agraps/current/wavelet.html
 
If you need help in anything specific don't hesitate to ask!
 
Cheers and good luck,

Bernard Cena
PhD Candidate
Dept. Computer Science
The University of Western Australia
bernard@cs.uwa.edu.au



Date: Tue, 5 Nov 1996 12:00:47 -0500 (EST)
From: "Y. Chen" <yichen@ee.ryerson.ca>
Subject: #20 Question: Using Wavelet in Lightning current signal ?

        I am a master student in lightning studies.  We got the lightning
current direvative (dI/dt) waveform record.  We got quite a lot of
noise in the records: different DC levels before and after the
lightning inpulse and oscillating sinusoid noise are the worst things.
We need to get rid of them but not effecting the peak values and some
sparks caused by structure reflection.
        I am quite new to wavelet area but at least it killed the
high-frequency noise in my record.  Experts can help me to find a way
to clear the other two types of noise I mentioned above?
        Thanks in advance.

Ying Chen ~{3B!!S-~}                     
Email:  yichen@ee.ryerson.ca 
http://www.ee.ryerson.ca:8080/~yichen/



Date: Thu, 7 Nov 1996 10:18:03 GMT+1
From: Gabriella Olmo - <olmo@polito.it>
Subject: #21 Question: Software on DWT modulus maxima extraction

I would like to know if there exists any software which implements the
DWT modulus maxima extraction and the reconstruction algorithm from
the DWT modulus maxima, for 2D signals (ref.: S. Mallat, S. Zhong,
"Characterization of Signals from Multiscale Edges", IEEE
Trans. Pattern Anal.  Machine Intell., Vol. 14 No. 7, July 92).  Can
anybody help me? Thank you in advance, Gabriella Olmo Dept. of
Electrical Engineering, Politecnico di Torino, Turin, Italy
olmo@polito.it



Date: Wed, 13 Nov 1996 10:12:11 +0100
From: Christian Oehreneder <coehrene@geoinfo.tuwien.ac.at>
Subject: #22 Question: I) smoothing on the interval / II) an integral

Dear wavelet-colleagues!

I need help on tow wavelet-related problems.

I) I need an efficient smoothing algorithm for functions defined on an
interval in R or R^2. One but not the only way would be a wavelet
basis for those domains.  So far I have used the Lifting-Scheme, but I
want to test others too.  What kind of solutions do exist on this
problem?  Has anybody got computer-code, so that I can try it on my
problem?

II) I need to efficiently solve Intergrals of the following type

Int(  f * b_i * b_j  ) over some (nonperiodic) domain. i and j arbitrary
(same or  different).

f is an arbitrary function.  b_i is a collection of (not necessarily
orthogonal) time/frequency localized building blocks (e.g. a set of
translated scaling functions or anything else).

Obviously there is a simple solution in using the well known fast
transforms on f* b_j . However I am looking for something that is more
tailored to this problem.

Thanks for any help!

Christian Oehreneder

Institute for  Photogrammetry and Remote Sensing
Technical University Vienna 

TU Wien, Institut 122        Tel.: +43 1 58801-3730 
Gusshausstrasse 27-29        FAX:  +43 1 5056268
A-1040 Wien                  Email: coehrene@fbgeo1.tuwien.ac.at
AUSTRIA

[Answer]



Date: Wed, 13 Nov 1996 11:07:11 +0100 (MET)
From: Ingo Nagel <nagel@iam.uni-bonn.de>
Subject: #23 Question: biorthogonal Box-Spline Wavelets

Dear Digest,

I am a student at Bonn University with much interest in the
construction of multivariate biorthogonal waveletbases with
box-splines. But I have some problems to find the most actual and
important literatur in this topic. Therefore I would be very thankful
if anyone of the audience would be able to give me some clues where I
can find the desired information.

          Very best regards  Ingo Nagel
e-mail: nagel@zeus.informatik.uni-bonn.de            



Date: Wed, 27 Nov 1996 14:37:50 +0100
From: Ingo Nagel <nagel@iam.uni-bonn.de>
Subject: #24 Question: Papers on high dimensional biorthogonal wavelets

Question: I am looking for two papers concerning biorthogonal
wavelets.  These are: A.Koroiu, R.Vailancourt; Nonseparable
biorthogonal wavelet bases on L^2(R^n) and R.Long, D.Chen;
Biorthogonal wavelet bases on R^d According to what I have heard these
two papers were published in 1994.  I would be very thankful if anyone
can give me a clue where I can find them. Please send mail to
nagel@iam.uni-bonn.de

[Answer]



Date: Fri, 29 Nov 1996 15:36:17 -0800 (PST)
From: cemami@ewu.edu
Subject: #25 Question: Wavelets vs. Fourier Analysis

Dear Wavelet Experts:

For my masters' research project at EWU, I would like to study the
advantages of Wavelet Analysis vs. the more traditional Fourier
Analysis in signal processing applications. Can anyone think of a very
specific application in signal processing?  How about a specific
filter? Do you know of any literature in relation with this subject ?

Thank you very much,
Yours 
Cyrus Emami 
"cemami@ewu.edu"



Date: Sun, 1 Dec 1996 06:52:36 GMT
From: eems9404@violet.iitm.ernet.in (Santosh N)
Subject: #26 Question: Looking for Wavelet Software without Web/Ftp access

Dear Waveleteers,

I am a research scholar working in the areas of "
Wavelet Based Image Coding" . I hear that there are lots of Web sites
where free software is available for Wavelets. But I am crippled
without an Internet Id. As a result, I am unable to access the
material which will greatly enable my understanding of the concepts. I
shall be greatly obliged to you if you can ftp these and send it to me
by E-mail. I shall be glad to provide you whatever help I acn from my
part ot from my Institute, IIT Madras, INDIA. Please help me ....

especially, I would like to have the software at 

                     playfair@stanford.edu
                           and 
                     simaplicity@stanford.edu
Thanks in advance,
                        My mailing address is :
                         N Santosh
                         MS scholar,
                         Dept. of Electrical Engg.,
                         IIT Madras-36.
                         INDIA.
                     E-mail : eem9404@violet.iitm.ernet.in
                                       (or)
                               san@volt.ee.iitm.ernet.in



Date: Tue, 03 Dec 1996 11:08:05 -0500
From: "William J. Miller" <MaCT-USA@worldnet.att.net>
Subject: #27 Question: Lifting for Multi-Spectral images

I am looking for information on use of Lifting Wavelet transform for
Multi-Spectral images and other Geospatial imagery.

I would like to contact individuals interested in this area, potential
collaborative opportunities.

Thanks,

William J. Miller
President
MaCT

E-mail:  MaCT-USA@worldnet.att.net



Date:          Tue, 3 Dec 1996 17:30:12 BST-8
From: lmzhang@fudan.ihep.ac.cn
Subject: #28 Question: 3-band wavelets

Dear wavelet experts,
  I am doing research work on image coding with visual perception.
I need construct multiband wavelet filters, especially 3 bands'.  I'd
like to know where I can get the papers on this subject. The more, the
better.
  Thanks very much.
  
Your sincerely,

suning

Email address: lmzhang@fudan.ihep.ac.cn


<webmaster@wavelet.org>