[Home]
[Back Issues]
[Search]
[Calendar]
[Vol 1]
[Vol 2]
[Vol 3]
[Vol 4]
[Vol 5]
[Vol 6]
[Vol 7]
[Vol 8]
[Vol 9]
The Wavelet Digest, Volume 9, Issue 4 (June 2, 00)
Today's Editor: Wim Sweldens
Lucent Technologies, Bell Laboratories
http://wim.sweldens.com
Today's Topics:
1: Book: Coherent States, Wavelets and Their Generalizations
2: Preprint: Wavelet based fractal analysis of airborne pollen
3: Preprint: Modification of Space-Frequency Quantization ...
4: Preprint: Blind Source Separation by Sparse Decomposition
5: Preprint: Wavelet based image compression by adaptive scanning...
6: Preprint: Fast Block Noncoherent Decoding
7: Thesis: Transform Domain Algorithms for Image Compression...
8: Thesis: Doctorial dissertation of Xin Li
9: Software: Low Bit-rate Wavelet Based Image and Video Codec
10: Meeting: Wavelet Applications & Smart Visualization, Hawaii
11: Job: Research Scholarship in Staffordshire University, UK
12: Job: Four PhD Positions at the NetAGES Project
13: Job: Position in speech processing at INRIA-LORIA
14: Content: J. Approx. Th. - feb00 may00
15: Contents: Numerical Algorithms 23 (2000) 2,3
16: Answer: Wavelets and impulse-type signals (WD 9.3 #24)
17: Question: Frequency Analysis and Wavelets
18: Question: Raw video files for wavelet video codec
19: Question: Doubt about wavelets
20: Question: Request for "Atmospheric energetics" comments
21: Question: Solution of Large, Dense, Complex Systems, Error Bounds.
22: Question: Look for local cosine transorm software
Current number of members: 16069
E-mail:
General help: help@wavelet.org
Add yourself: add@wavelet.org
Remove yourself: remove@wavelet.org with Subject: $ADDRESS
Publish in the WD: publish@wavelet.org
Publishing policy: policy@wavelet.org
Visit us on the Web at http://www.wavelet.org/
Calendar of events:
Jun 5-9: Wavelets at the SIMAI 2000 conference, Ischia, Italy
Jun 29 - Jul 4: 5th Curves and Surfaces, Oslo, Norway
Jul 13-17: Steve Smale's 70th birthday, Hong Kong
Jul 17-19: Wavelet Applications, Tokyo, Japan
Jul 30 - Aug 2: SPIE Wavelet Applications VIII, San Diego
Jul 30 - Aug 2: IEEE Multimedia And Expo, New York
Aug 7-12: Video Compression Short Course, Portland, OR
Sep 11-14: The Eleventh British Machine Vision Conference Bristol
Sep 22-24: AMS Special Session on Wavelets, Toronto
Nov 13-16: Wavelets, Image Analysis, and Lossless Coding
2001
Mar 18-21: Wavelet Applications & Smart Visualization, Hawaii
Date: Thu, 18 May 2000 17:03:20 +0200
From: Jean-Pierre Antoine <Antoine@fyma.ucl.ac.be>
Subject: #1 Book: Coherent States, Wavelets and Their Generalizations
The purpose of this message is the announcement of a new
book in the field of wavelets and coherent states:
'Coherent States, Wavelets and Their Generalizations '
S.T. Ali, J-P. Antoine and J-P. Gazeau,
xvi + 418 pages, Graduate Texts in Contemporary Physics,
Springer-Verlag, New York, Berlin, Heidelberg, 2000
ISBN: 0-387-98908-0
Recommended List Price : DM 159,-
Contents
1. Introduction
2. Canonical Coherent States
3. Positive Operator-Valued Measures and Frames
4. Some Group Theory
5. Hilbert Spaces with Reproducing Kernels and Coherent States
6. Square Integrable and Holomorphic Kernels
7. Covariant Coherent States
8. Coherent States from Square Integrable Representations
9. Some Examples and Generalizations
10. CS of General Semidirect Product Groups
11. CS of the Relativity Groups
12. Wavelets
13. Discrete Wavelet Transforms
14. Multidimensional Wavelets
15. Wavelets Related to Other Groups
16. The Discretization Problem: Frames, Sampling, and All That
Conclusion and Outlook
J-P. Antoine
Institut de Physique Th\'eorique
Universit\'e Catholique de Louvain
2, chemin du Cyclotron
B-1348 - Louvain-la-Neuve, BELGIUM
Tel.: +32.10.47.32.83; Fax : +32.10.47.24.14
Date: Wed, 03 May 2000 18:27:26 -0300
From: Maria Elena Degaudenzi <elen@fi.mdp.edu.ar>
Subject: #2 Preprint: Wavelet based fractal analysis of airborne pollen
I have a publication called "Wavelet Based Fractal Analysis of
Airborne Pollen". You can access it through this address
http://xxx.lanl.gov/format/adap-org/9808004
Yous truly
Maria Elena Degaudenzi
Electrician Engineer
Departamento de Fisica
Facultad de Ingenieria
Universidad Nacional de Mar del Plata
degaudenzi@interoffices.com
elen@fi.mdp.edu.ar
Date: 13 May 2000 13:47:19 +0300
From: s9206013@polynet.lviv.ua
Subject: #3 Preprint: Modification of Space-Frequency Quantization ...
Title: "Modification of Space-Frequency Quantization mode of
Z.Xiong and K.Ramchandran for Embedded Wavelet Image Coding."
Kirenko I.O.,
Post-graduate student,
Lviv Polytechnic State University (Ukraine).
s9206013@polynet.lviv.ua
Presented at the the Central European III Scientific-Technical
Conference Numerical Methods and Computer Systems in
Automatic Control and Electrical Engineering (Poland)
Abstract The popularity of the World Wide Web and the development of
large image databases have created a demand for flexible embedded
image representations. A number of recent Wavelet transform coders of
still image employ similar algorithms which are based on exploitation
of spatial-oriented tree-structured set of wavelet coefficients. One
of the most successful in terms of both rate and distortion of
resulted image is scheme of Space-Frequency Quantization (SFQ). Along
with important advantages it has many drawbacks. One of the main
shortcomings is impossibility of generating of embedded code. With an
embedded code, at any point in the decoding process it is possible to
recover the lossy version of full size image with distortion
corresponding to the rate of the received message, which allows
coding/decoding exactly to desired rate or distortion. Such codes are
of great practical interest especially for broadcast applications.
Improvement of SFQ for embedded image coding could be accomplished by
using a bit-slice approach. The lowest band is coded separately from
the remaining bands without quantization and coefficients of that band
have to be transmitted first. For decodability, the remaining bands
are scanned from coarse to fine scale. Bit-slice code has to be
generated along with accomplishing uniform scalar quantization for
each band separately with decreasing thresholds of
quantization. Scanning one-dimensional coefficient's array and
comparing each coefficient with threshold generates the bit- slice
code. The zerotree map is reducing for next band, so the map rate
corresponding to the higher frequency coefficients decreases as well
as their data rate.
Date: Fri, 19 May 2000 17:23:00 -0600
From: Zibulevsky Michael <michael@cs.unm.edu>
Subject: #4 Preprint: Blind Source Separation by Sparse Decomposition
Title: Blind Source Separation by Sparse Decomposition
in a Signal Dictionary
Authors: Michael Zibulevsky and Barak A. Pearlmutter
Abstract
The blind source separation problem is to extract the underlying
source signals from a set of linear mixtures, where the mixing matrix
is unknown. This situation is common, in acoustics, radio, medical
signal and image processing, hyperspectral imaging, etc. We suggest a
two-stage separation process. First, a priori selection of a possibly
overcomplete signal dictionary (for instance a wavelet frame, or a
learned dictionary) in which the sources are assumed to be sparsely
representable. Second, unmixing the sources by exploiting the their
sparse representability. We consider the general case of more sources
than mixtures, but also derive a more efficient algorithm in the case
of a non-overcomplete dictionary and an equal numbers of sources and
mixtures. Experiments with artificial signals and with musical sounds
demonstrate significantly better separation than other known
techniques.
URL of the ps file:
http://ie.technion.ac.il/~mcib/spica12.ps.gz
Contact: michael@cs.unm.edu, bap@cs.unm.edu
Date: Thu, 25 May 2000 14:49:25 +0300
From: "Rusen Oktem" <rusen@cs.tut.fi>
Subject: #5 Preprint: Wavelet based image compression by adaptive scanning...
Rusen Oktem, Levent Oktem, and Karen Egiazarian
"Wavelet based image compression by adaptive scanning of transform
coefficients",
submitted to SPIE Journal of Electronic Imaging, April 2000.
Abstract: An image compression algorithm exploiting the interband and
intraband dependencies in a multiresolution decompo-sition structure
is introduced. The transform coefficients, other than those which
belong to the DC band, are adaptively scanned into two different 1-D
arrays. These arrays are generated by using the observed statistical
behavior of wavelet transform coefficients, in an effort to maximize
local stationarity. The arrays are then entropy coded separately. The
algorithm is also extended for the compression of wavelet packet
transform coefficients. Experimental results indicate that the
algorithm has competitive performance.
The pdf file of the full paper can be downloaded from
http://www.cs.tut.fi/~rusen/Publ/index_publ.html
Rusen Oktem
Signal Processing Laboratory,
Tampere University of Technology,
P.O. Box 553, 33101 Tampere, Finland
Tel: +358 400 830641 Fax: +358 3 365 3857
e-mail: rusen@cs.tut.fi
web: http://www.cs.tut.fi/~rusen
From: Wim Sweldens <wim@bell-labs.com>
Subject: #6 Preprint: Fast Block Noncoherent Decoding
Title: Fast Block Noncoherent Decoding
Abstract: We present a fast algorithm for exact maximum likelihood
multi-symbol noncoherent PSK decoding. While the standard algorithm is
exponential in the rate and the block length, our algorithm is rate
independent and linear-logarithmic in the block length.
Status: Technical Memorandum, Bell Laboratories, Lucent Technologies,
November 1999. Submitted
/who/wim/papers/block/
Date: Thu, 25 May 2000 14:55:58 +0300
From: "Rusen Oktem" <rusen@cs.tut.fi>
Subject: #7 Thesis: Transform Domain Algorithms for Image Compression...
Rusen Oktem
"Transform Domain Algorithms for Image Compression and Denoising"
Signal Processing Laboratory, Tampere University of Technology, May 2000.
The thesis addresses the following problems: efficient encoding of
transform coefficients in lossy still image compression, transform domain
image denoising, and lossy compression of noisy images.
Table of Contents:
1-Introduction
2-An Overview of Transforms
3-Transform Coding of Noise-Free Still Images
4-Transform Domain Image Denoising
5-Noisy Image Coding
6-Conclusions
pdf file of the full thesis can be downloaded from
http://www.cs.tut.fi/~rusen/Publ/index_publ.html
Rusen Oktem
Signal Processing Laboratory,
Tampere University of Technology,
P.O. Box 553, 33101 Tampere, Finland
Tel: +358 400 830641 Fax: +358 3 365 3857
e-mail: rusen@cs.tut.fi
web: http://www.cs.tut.fi/~rusen
Date: Thu, 25 May 2000 16:09:56 -0400
From: "Xin Li" <lixin@EE.Princeton.EDU>
Subject: #8 Thesis: Doctorial dissertation of Xin Li
This thesis explores fundamental properties of natural-image source
from edge point of view. Both postscript version and PDF version of
the thesis are available through
http://www.ee.princeton.edu/~lixin
Short
Abstract
From:information theoretic point of view, prediction, interpolation
Date: Mon, 22 May 2000 10:30:00 +0800
From: Xuejun Li <lxj@ns.glc.cn.net>
Subject: #9 Software: Low Bit-rate Wavelet Based Image and Video Codec
Very low bit-rate wavelet image and video codec can be downloaded from
http://lfpc2000.easthome.net
More description of softwares and other compression algorithms are also
include in the same page.
Dr. Xuejun Li
Wavelet Compression Laboratory,
Beijing Univ. of Aero & Astro
Email:lxj@ns.glc.cn.net
Date: Wed, 31 May 2000 15:56:19 +0900
From: "Hui LI" <li@mech.kagoshima-u.ac.jp>
Subject: #10 Meeting: Wavelet Applications & Smart Visualization, Hawaii
Call for Papers and Announcement
Organized Session on Wavelet Applications & Smart Visualization
Part of The 3rd Pacific Symposium on Flow Visualization and Image Processing
(PSFVIP-3)
March 18-21, 2001
Outrigger Wailea Resort, Maui, Hawaii, USA
Organizer:
Hui LI (Kagoshima University, Japan)
This organized session is open to researchers in applied mathematics,
signal and image processing, computer vision, medical imaging,
physics, engineering and et al.. Papers are solicited on topics
related to the latest developments in the wavelet applications and
smart visualization in all fields. Authors should submit a 500-word
abstract including the title of paper, name of authors and
affiliations, exact address (with phone & fax numbers, and e-mail
address), and five keywords to
Dr. Hui LI
Department of Mechanical Engineering
Kagoshima University
1-21-40, Korimoto, Kagoshima 890-0065
Japan
Tel: +81-99-285-8252
Fax: +81-99-250-3181
E-mail: li@mech.kagoshima-u.ac.jp
URL : http://www.mech.kagoshima-u.ac.jp/~li/
Accepted papers will be published in the CD-ROM Proceedings, and
selected papers on this organized session are recommended to submit to
the Journal of Flow Visualization and Image Processing. Send, please,
all the correspondence to the organizer of the session: Dr. Hui LI
(see the address above).
CALENDAR
September 1, 2000 Deadline for submission of abstract
October 15, 2000 Notification of acceptance
December 15, 2000 Camera-ready manuscript due
For more information on The 3rd Pacific Symposium on Flow Visualization and
Image Processing please go to our PSFVIP-3 web site:
http://icebeer.iis.u-tokyo.ac.jp/psfvip3/
http://www.mech.kagoshima-u.ac.jp/~li/os3.html
Date: Wed, 10 May 2000 14:13:45 +0100
From: Mansour Moniri <M.Moniri@staffs.ac.uk>
Subject: #11 Job: Research Scholarship in Staffordshire University, UK
A scholarship is available in The School of Engineering and Advanced
Technology at Staffordshire University to undertake research in the
areas of:
- Wavelets
- Automata
- Video signal processing
Overseas students are eligible.
The starting date: immediately
Please contact Mansour Moniri for further information.
Dr M. Moniri
School of Engineering and Advanced Technology,
P.O. Box 33
Staffordshire University
Stafford
ST18 0DF
United Kingdom
E-mail : M.Moniri@staffs.ac.uk
Tel : +44 (0) 1785 353634
Fax : +44 (0) 1785 353552
Date: Fri, 12 May 2000 19:33:20 +0200
From: Armin Iske <iske@mathematik.tu-muenchen.de>
Subject: #12 Job: Four PhD Positions at the NetAGES Project
NetAGES: Four Vacant Ph.D. Studentships
Applied Mathematics / Computer Vision / Signal Processing
Four Ph.D. scholarships in; applied mathematics, computer vision, and
signal/image processing are available from a consortium comprising of:
GECO Research (SSR), Stavanger, Norway.
Munich University of Technology (TUM), Chair of Numerical Analysis and
Scientific Computing.
Stavanger University College (HiS), Dept. of Electrical and Computer
Engineering, Norway.
University of Vienna (UniVie), Mathematics Department, Austria.
The Ph.D. students will participate in the European Union research and
training group NetAGES (Network for Automated Geometry Extraction from
Seismic) and will work in close collaboration with each other, two
PostDocs in geo-sciences, the staff at SSR and the
universities. Throughout the creation of the NetAGES group, the
partners intend to provide cross-training of young researchers between
industry and academia and across academic institutions.
The scientific objective is to develop new methodologies for updating
3D geometric descriptions based on measurement data and modelled
responses applied to petroleum reservoir life cycle monitoring using
seismic data. This is a problem area with a high research focus and
significant implication for the oil and gas industry. The highly
skilled multi-disciplinary team of SSR is a leading solution provider
in this area. The Ph.D. students' missions will be to develop new and
complementary competencies in automatic 3D geometry extraction and up-
and down-scaling technologies.
The available Ph.D. studentships are:
Ph.D. 1: Fault geometry extraction. Fault surfaces, which are very
important when searching for oil and gas, are currently identified and
mapped manually, this process needs to be automated. The successful
candidate will posses a sound background in applied mathematics
(e.g. constructive approximation theory) or computer vision (pattern
matching). The Ph.D. student will be with the University of Vienna.
Ph.D. 2: 3D texture recognition. The signal texture defines various
properties that are crucial for unveiling the geologic history of the
subsurface. Texture recognition of the 3D data is therefore very
important. The successful candidate will posses a sound background in
signal/image processing, pattern recognition, computer vision, or
applied mathematics The Ph.D. student will be with Stavanger
University College.
Ph.D. 3: Optimised up- and down-scaling of 3D irregular sampling
grids. Radically different sampling strategies are applied in seismic
measurements of the sub-surface and in reservoir modelling. Tools for
optimised conversions between these domains are necessary in order to
couple the simulation results with actual measurements. The successful
candidate will posses a sound background in applied mathematics or
signal/image processing. The Ph.D. student will be with the University
of Vienna.
Ph.D. 4: Transformation of geometric properties between regularly and
irregularly sampled domains. The successful candidate will posses a
sound background in numerical analysis and scientific computing. In
addition, a deeper knowledge and practical experience in at least two
of the following fields; scattered data modelling, approximation
theory, signal and image processing, sampling theory, grid generation,
and computational geometry are required. The Ph.D. student will be
with the Munich University of Technology .
The NetAGES consortium is an equal opportunities employer, these
positions are open to all qualified European candidates without regard
to race, creed, sex or physical mobility. The Ph.D.'s are expected to
start in Sept. 2000.
All positions are of three years duration. The students must expect a
high level of travel activities during the project, with the expenses
covered by the consortium. The salaries will be compatible with
similar positions at the respective institutions. The application
deadline for the positions is June 30, 2000. Applications should be
sent to Schlumberger Stavanger Research, Attn: NetAGES, P.O. Box 330,
4002 Stavanger, Norway, fax +47 51 50 65 00 or email to
NetAGES@Stavanger.Geco-Prakla.slb.com.
Schlumberger is the worlds leading supplier of technological services
and solutions for the international petroleum industry. For more
information on Schlumberger please visit www.slb.com.
Further information on the Ph.D. positions may be obtained at
http://www.slb.com/research/stavanger/NetAGES/ or by contacting the
consortium partners:
Dr. Kjetil Fagervik, SSR (fagervik@stavanger.geco-prakla.slb.com, +47
51 50 63 35)
Dr. Trygve Randen SSR (randen@slb.com +47 51 50 64 19)
Dr. Armin Iske, TUM (iske@mathematik.tu-muenchen.de, +49 89 289-28375)
Prof. Jan Erik �Ødeg�ård, HiS (jan.e.odegard@tn.his.no, +47 51 83 20 44)
Prof. Hans Georg Feichtinger, UniVie (fei@tyche.mat.univie.ac.at,
+43-1-4277 50696)
Date: Wed, 24 May 2000 12:09:02 +0200
From: Khalid Daoudi <Khalid.Daoudi@loria.fr>
Subject: #13 Job: Position in speech processing at INRIA-LORIA
Development of a software/tutorial for speech analysis
Nancy, France (http://www.loria.fr/equipes/parole).
Duration : one year
Description:
Besides automatic speech recognition, Speech Group at INRIA-LORIA is
working on speech analysis. The objective of this research field is to
design algorithms able to extract relevant acoustic parameters from
the speech signal (the vocal fold vibration frequency named
fundamental frequency, resonance frequencies of the vocal tract...)
with the aim of coding, transforming or interpreting speech
signals. Speech analysis relies on digital signal processing,
phonetics and perception. It gives rise to applications in the domains
of speech coding for telecommunications, second language acquisition,
hearing aids...
This position involves the extension of our software for speech
analysis, Snoori, which is distributed since the end of 99, and allows
the visualization, the annotation and the edition of speech signals
(in particular, by changing the prosody of a sentence or by piloting a
formant synthesizer). The work will consists in adding speech analysis
algorithms and tools to enable the use of Snoori from an interactive
tutorial. The speech analysis aspects include new algorithms to detect
and modify the fundamental frequency with a high accuracy, to track
resonance frequencies and to perform copy synthesis with the formant
synthesizer. In addition to these algorithms, the work involves the
development of a toolbox intended to pilot Snoori interactively from a
html document by means of a script language.
Desired profile:
Requires a BS or MS in computer science, signal processing or related
fields. Programming skills are essential (C, C++) and a familiarity
with Linux and Windows platforms is helpful.
To know more about this position, contact Yves Laprie
Yves.Laprie@loria.fr
Tel : +33 3 83 59 20 36
and visit the web page
http://www.loria.fr/equipes/parole/Html/NA-11Eng.html
To apply :
Reference of this position : NA-11
Send a CV (including the names and contact information of references)
and a motivation letter by email
IMPORTANT: this position is NOT a postdoc and is well suited for people
who have just graduated with a Bachelor or Masters degree.
Deadline: 9th June 2000
Gross wage (before-tax): 140000 to 240000 Frs / year according to the
experience.
Date: Mon, 8 May 2000 17:34:42 -0400 (EDT)
From: Thomas Hogan <hogan@math.ohio-state.edu>
Subject: #14 Content: J. Approx. Th. - feb00 may00
Table of Contents: J. Approx. Theory, Volume 102, Number 2, February 2000
Announcement
George G. Lorentz turns 90
v
N. Skiba and V. Zahariuta
Asymptotics of Kolmogorov diameters for some classes of harmonic
functions on spheroids
175--188
Henrik Shahgholian
Dense subsets of ${\cal L}^1$-solutions to linear elliptic partial
differential equations
189--216
Dinh Dung
Continuous algorithms in $n$-term approximation and non-linear widths
217--242
Oleg Davydov and Manfred Sommer
Interpolation by weak Chebyshev spaces
243--262
K\'aroly B\"or\"oczky, Jr.
Polytopal approximation bounding the number of $k$-faces
263--285
Alexander B. Pevnyi and Valery A. Zheludev
On the interpolation by discrete splines with equidistant nodes
286--301
P. Fern\'andez-Mart\'inez and Y. Raynaud
A Wolff Theorem for interpolation methods associated to polygons II
302--324
Ying Guang Shi
On the fine and rough theory of Lagrange type interpolation of
higher order
325--340
E. B. Saff and P. C. Simeonov
Rational approximation with varying weights III
341--362
Table of Contents: J. Approx. Theory, Volume 104, Number 1, May 2000
Milutin R. Dostani\'c
Fourier expansions with respect to the Rayleigh system
1--20
B. Bojanov and G. Petrova
Uniqueness of the Gaussian quadrature for a ball
21--44
E. Mainar and J. M. Pe\~na
Knot insertion and totally positive systems
45--76
M. P. Prophet
On $j$-convex preserving interpolation operators
77--89
J. Peters and U. Reif
Least squares approximation of B\'ezier coefficients provides best
degree reduction in the $L_2$-norm
90--97
Adi Levin
Surface design using locally interpolating subdivision schemes
98--120
Hongming Ding, Kenneth I. Gross, and Donald St. P. Richards
The $N$-widths of spaces of holomorphic functions on bounded symmetric
domains of tube type
121--141
Tam\'as Erd\'elyi
Markov- and Bernstein-type inequalities for M\"untz polynomials and
exponential sums in $L_p$
142--152
Song Li
Convergence of cascade algorithms in Sobolev spaces associated with
inhomogeneous refinement equations
153--163
Chengmin Yang
Dependence of $\alpha$ in peak norms and best peak norms approximation
164--182
Date: Fri, 19 May 2000 11:11:36 +0200
From: "Listowner" <listowner@baltzer.nl>
Subject: #15 Contents: Numerical Algorithms 23 (2000) 2,3
Numerical Algorithms 23 (2000) 2,3
Dario Andrea Bini and Giuseppe Fiorentino
Design, analysis, and implementation of a multiprecision polynomial
rootfinder 127-173
Francesc Ar�àndiga and Rosa Donat
Nonlinear multiscale decompositions: The approach of A. Harten 175-216
M.I. Karavelas and P.D. Kaklis
Spatial shape-preserving interpolation using ν-splines 217-250
Marek A. Kowalski
Sensitivity of best recovery in the Sobolev spaces Wr,d∞,
\widetildeWr,d∞ for perturbed sampling 251-261
Dominique Apprato and Christian Gout
A result about scale transformation families in approximation: application
to surface fitting from rapidly varying data 263-279
Claude Brezinski
Book reviews 281-284
Date: Sun, 7 May 2000 08:57:38 +0800
From: "Chen Xiangxun" <xxchen@epri.ac.cn>
Subject: #16 Answer: Wavelets and impulse-type signals (WD 9.3 #24)
Hi, Andrzej Mikulski:
In my opinion your key problem is not how to sample the impulse-type
signals. This can be done according to the sampling theorem. Your key
problem is how to sample the continuous wavelet(CW) at a particular
scale so that it almost contains all the information on the CW. In
genegal, this involves the concept of wavelet frame which is described
in detail by Daubechies. However, the wavelet frame is rather
complicated for practical applications. Let the CW be g(t) and its
Fourier G(w). Here I suggest to discrete your wavelet by the following
way:
1. Determine a equivalent maxmum frequency Fm for the CW by a
reasonable criterion such as energy error Error(E) at scale S=1:
E1=integral(-infinite to infinite)(square(G(w))*df)
E2=integral(-Fm to Fm)(square(G(w))*df)
Error(w)=(E1-E2)/E1<=e(the permissible error)
Then get the sampling frequency Fs=2Fm and the sampling space
T=1/Fs. Note that T must be as the same as the sampling space on the
signal to be analyzed.
2.Determine a equivalent minmum sampling interval Tmin on the CW by
the same criterion at the same scale:
E1=integral(-infinite to infinite)(square(g(t))*dt)
E2=integral(-Tmin to Tmin)(square(g(t))*dt)
Error(t)=(E1-E2)/E1<=e(the permissible error)
3. determine the minimum samplig point number Nmin=Tmin/T on the
CW. Nmin means that if the sampling points N(CW) on the CW at the
scale you used by the space T is more than Nmin then all the
information on the CW in the sense Error(E)<=e is contained.
4. Determine the minmum applicable scale Smin. Smin corresponts to the case of N(CW)=Nmin. All the scales less than Smin are not admissble to take.
5.Determine the maxmum applicable scale Sm. Sm corresponts to the case
of N(CW)=N(signal). All the scales larger than Sm are also not
admissble to take.
For example, if you data-file from the signal is only Nmin points then
only a scale, Smin, you can take. If you want to take other scales
larger than Smin you must take more sampling points from the signal,
that is you must increase the sampling frequency.
Chen Xiangxun
Electric Power Research Institute
Qinghe, Beijing 100085
P.R.China
Email: cxx@public2.east.cn.net (Home)
xxchen@epri.ac.cn (Office)
Date: Sun, 7 May 2000 21:43:58 -0700 (PDT)
From: bobby thomas <bobby_dlss@yahoo.com>
Subject: #17 Question: Frequency Analysis and Wavelets
My query regarding wavelet transform is;
Is it possible to deduce accurate frequency
information from the wavelet transform of a
signal(like in Fourier Transform)?
I am Bobby Thomas from Cochin University of
Science and Technology, India; a post graduate student
undertaking a project in Audio Compression.
Thanking you,
Bobby
Date: Sun, 28 May 2000 12:41:21 +0800
From: Xuejun Li <lxj@ns.glc.cn.net>
Subject: #18 Question: Raw video files for wavelet video codec
For the purpose of testing my wavelet video codec, I want to find more
raw video files, but I dont how to get these files? Thanks for your
help.
Xuejun Li
lxj@ns.glc.cn.net
Date: Mon, 29 May 2000 12:04:41 +0530
From: "giby samson" <giby.sam@wipro.com>
Subject: #19 Question: Doubt about wavelets
A wavelet is a 'small wave' , a function whose energy is concentrated =
over a short interval of time ..etc.
Please tell me when a function can be classified as a wavelet.
And more specifically
Can a Gaussian pulse be considered as a wavelet ..=20
f(t) =3D exp(-pi * (t*t) ).
or for a gaussian pulse of unit amplitude .the width of the pulse can be =
varied by changing the value of T(tau) in the eqation
f(t) =3D (1/T) * exp (-[pi * t*t ]/ [T*T]).
Please give me the conditions a particular function of time is supposed =
to satisfy for being called a wavelet. Please give more stress to the =
example I have given.
Thanks in advance
Giby
Date: Tue, 30 May 2000 16:18:33 -0600 (MDT)
From: "Aime' Fournier" <fournier@ucar.edu>
Subject: #20 Question: Request for "Atmospheric energetics" comments
To anyone who has read, or would like to read my preprint sequence
"Atmospheric energetics in the wavelet domain"
<http://www.wavelet.org/wavelet/digest_08/digest_08.08.html#3>
<ftp://ftp.cgd.ucar.edu/pub/fournier/preprint/aeitwd1.ps.gz>
<ftp://ftp.cgd.ucar.edu/pub/fournier/preprint/aeitwd2.ps.gz>
<ftp://ftp.cgd.ucar.edu/pub/fournier/preprint/aeitwd3.ps.gz>
I would be very interested to receive your opinions, pro and con, on
the value of this work and of publishing (a revised version of) it.
The official journal reviewers have given me very useful comments,
and I will follow their advice in greatly shortening the manuscripts
and concentrating on illumenating physically relevant interpretations
(and other wavelet-technical points).
However, the fundamental utility and relevance to atmospheric science
of my wavelet approach to nonlinear energetics has also been questioned,
and I would appreciate frank and candid comments about this and related
aspects of my work. I may use "pro" comments (anonymously or with
your permission) e.g., to argue that there is interest in and support
for this approach, while "con" comments would certainly help me decide
where (else) to focus my research.
Thanks in advance,
Aime'
--
Aime' Fournier 303-497-1614
www.cgd.ucar.edu/gds/fournier (fax 303-497-1700)
National Center for Atmospheric Research
PO Box 3000, Boulder CO 80307-3000 USA
Date: Wed, 31 May 2000 11:28:40 +0200
From: Miguel Pires <pires@iheguam.etec.uni-karlsruhe.de>
Subject: #21 Question: Solution of Large, Dense, Complex Systems, Error Bounds.
Hi everyone!
My name is Miguel Pires and for the past few months I have been
working with the application of Wavelets ( wavelet-like transform ) to
the solution of large,dense, complex linear systems, such as those
that occur in the Method of Moments ( Electrodynamics ). The procedure
is rather straightforward: We start with a Linear System, resultant of
the discretization of an Integral operator :
Z . i = v
The Matrix Z is then transformed with the Wavelet-Like Transform. We
then threshold all the elements of the transformed matrix, setting to
zero all those whose value is inferior to a given limit. We then
obtain:
Z_tt*i_t = v_t
The Z_tt Matrix is sparse and we can use a Iterative Solver with
advantage . All this is old news !! However, I have found no
references regarding the subjacent error ( that is the error involved
in solving the thresholded system instead of the original one ). I
would like to know if there is any work in this area that I have
missed
I thank you in advance for your patience/attention and all the help you
can provide,
Miguel PIres
Date: Fri, 02 Jun 2000 15:05:31 +0800
From: xdliu <xdliu97@online.sh.cn>
Subject: #22 Question: Look for local cosine transorm software
Dear colleage:
I am looking for 1-D local cosine transform software for
matlab. Please send me available internet-link or another source of
information! I'm really need this information in my working.
Thank you in advance
Sincerely
Xu S Z
Xu Shuzhen, PhD candidate
Dept. of Electrical Engineering
Shanghai Jiao Tong University
1954 Hua Shan Road
Shanghai, 200030
P.R.China
<webmaster@wavelet.org>