Sparse signal representation and the tunable Q-factor wavelet transform
|
|
- Barnaby Blair
- 5 years ago
- Views:
Transcription
1 Sparse signal representation and the tunable Q-factor wavelet transform Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York
2 Introduction Problem: Decomposition of a signal into the sum of two components:. Oscillatory (rhythmic, tonal) component 2. Transient (non-oscillatory) component Outline. Signal resonance and Q-factors 2. Morphological component analysis (MCA) 3. Tunable Q-factor wavelet transform (TQWT) 4. Split augmented Lagrangian shrinkage algorithm (SALSA) 5. Examples References (MDCT, etc) S. N. Levine and J. O. Smith III. A sines+transients+noise audio representation for data compression and time/pitch scale modications. (998) L. Daudet and B. Torrésani. Hybrid representations for audiophonic signal encoding. (22) S. Molla and B. Torrésani. An hybrid audio coding scheme using hidden Markov models of waveforms. (25) M. E. Davies and L. Daudet. Sparse audio representations using the MCLT. (26) 2
3 Oscillatory (rhythmic) and Transient Components in EEG Many measured signals have both an oscillatory and a non-oscillatory component. 4 EEG SIGNAL TIME (SECONDS) Rhythms of the EEG: Transients in EEG due to: ) unwanted measurement artifacts Delta Theta Alpha Beta Gamma - 3 Hz 4-7 Hz 8-2 Hz 2-3 Hz 26 - Hz 2) non-rhythmic brain activity (spikes, spindles, and vertex waves) 3
4 Signal resonance and Q-factor PULSE SPECTRUM Q factor = PULSE 2 4 Q factor = PULSE Q factor = PULSE 4 5 Q factor = TIME (SAMPLES) (a) Signals FREQUENCY (CYCLES/SAMPLE) (b) Spectra. Figure : The resonance of an isolated pulse can be quantified by its Q-factor, defined as the ratio of its center frequency to its bandwidth. Pulses and 3, essentially a single cycle in duration, are low-resonance pulses. Pulses 2 and 4, whose oscillations are more sustained, are high-resonance pulses. 4
5 Resonance-based signal decomposition 2 TEST SIGNAL 2 TEST SIGNAL HIGH RESONANCE COMPONENT 2 LOW PASS FILTERED LOW RESONANCE COMPONENT 2 BAND PASS FILTERED RESIDUAL 2 HIGH PASS FILTERED TIME (SAMPLES) (a) Resonance-based decomposition TIME (SAMPLES) (b) Frequency-based filtering. Figure 2: Resonance- and frequency-based filtering. (a) Decomposition of a test signal into high- and low-resonance components. The high-resonance signal component is sparsely represented using a high Q-factor WT. Similarly, the low-resonance signal component is sparsely represented using a low Q-factor WT. (b) Decomposition of a test signal into low, mid, and high frequency components using LTI discrete-time filters. 5
6 Resonance-based signal decomposition must be nonlinear SIGNAL LOW RESONANCE COMPONENT = + HIGH RESONANCE COMPONENT = + = + = + = + = + = + Figure 3: Resonance-based signal decomposition must be nonlinear: The signal in the bottom left panel is the sum of the signals above it; however, the low-resonance component of a sum is not the sum of the low-resonance components. The same is true for the high-resonance component. Neither the low- nor high-resonance components satisfy the superposition property. F (s + + s 6 ) F (s ) + + F (s 6 ) 6
7 Rational-dilation wavelet transform (RADWT) Prior work on rational-dilation wavelet transforms addresses the critically-sampled case.. K. Nayebi, T. P. Barnwell III and M. J. T. Smith (99) 2. P. Auscher (992) 3. J. Kovacevic and M. Vetterli (993) 4. T. Blu (993, 996, 998) 5. A. Baussard, F. Nicolier and F. Truchetet (24) 6. G. F. Choueiter and J. R. Glass (27) RADWT (29) gives a solution for the overcomplete case. Reference: Bayram, Selesnick. Frequency-domain design of overcomplete rational-dilation wavelet transforms. IEEE Trans. on Signal Processing, 57, August 29. New: Tunable Q-factor wavelet transform dilation need not be rational. 7
8 Low-pass Scaling x(n) LPS α y(n) X(ω) X(ω).5.5 π απ απ π FREQUENCY (ω) π π FREQUENCY (ω) Y(ω) Y(ω).5.5 π π FREQUENCY (ω) π π/α π/α π FREQUENCY (ω) Low-pass scaling with α < Low-pass scaling with α > 8
9 High-pass Scaling x(n) HPS β y(n) X(ω) X(ω).5.5 π ( β)π ( β)π π FREQUENCY (ω) π π FREQUENCY (ω) Y(ω) Y(ω).5.5 π π FREQUENCY (ω) π ( /β)π ( /β)π π FREQUENCY (ω) High-pass scaling with β < High-pass scaling with β > 9
10 Tunable Q-factor wavelet transform (TQWT) H (ω) LPS α v (n) LPS /α H (ω) y (n) x(n) + y(n) H (ω) HPS β v (n) HPS /β H (ω) y (n) < β, < α <, α + β > H (ω) 2 X(ω) ω α π Y (ω) = α π < ω π ω < ( β) π Y (ω) = H (ω) 2 X(ω) ( β) π ω π H (ω) 2 X(ω) ω < ( β) π Y (ω) = ( H (ω) 2 + H (ω) 2 ) X(ω) ( β) π ω < α π H (ω) 2 X(ω) α π ω π
11 For perfect reconstruction, the filters should satisfy H (ω) =, H (ω) =, ω ( β) π H (ω) =, H (ω) =, α π ω π The transition bands of H (ω) and of H (ω) must be chosen so that H (ω) 2 + H (ω) 2 = ( β) π < ω < α π. () H(ω).5 π απ ( β)π ( β)π απ π FREQUENCY (ω) H(ω).5 π απ ( β)π ( β)π απ π FREQUENCY (ω)
12 The transition band of H (ω) and H (ω) can be constructed using any power-complementary function, θ(ω), θ 2 (ω) + θ 2 (π ω) =, (2) We use the Daubechies filter frequency response with two vanishing moments, θ(ω) = 2 ( + cos(ω)) 2 cos(ω), ω π. (3) Scale and dilate θ(ω) to obtain transition bands for H (ω) and H (ω). 2
13 X(ω).5 π απ ( β)π ( β)π απ π ω (a) Fourier transform of input signal, X(ω). H(ω) H(ω).5.5 π απ ( β)π ( β)π απ π FREQUENCY (ω) π απ ( β)π ( β)π απ π FREQUENCY (ω) (b) Frequency responses H (ω) and H (ω). H(ω) X(ω) H(ω) X(ω).5.5 π απ ( β)π ( β)π απ π ω π απ ( β)π ( β)π απ π ω (c) Fourier transforms of input signal after filtering. V(ω) V(ω).5.5 π.5π.5π π ω π.5π.5π π ω (d) Fourier transforms after scaling. 3
14 Iterated Filters x(n) stage d (n) stage 2 d 2 (n) stage 3 c(n) d 3 (n) Redundancy (total oversampling rate) for many stages: r = β α When α, β, we have the system equivalence: x(n) H (ω) LPS α H (ω) LPS α H (ω) HPS β j stages H (j) (ω) LPS αj HPS β d j (n) 4
15 The equivalent filter is H (j) (ω) := ω < ( β) α j π j 2 H (ω/α j ) H (ω/α m ) ( β) α j π ω α j π m= α j π < ω π. (4) H j (ω) ω ( β) α j π α j π π Q-factor: Scaling factors α, β: Q = ω c BW = 2 β β β = 2 Q +, α = β r 5
16 LOW Q-FACTOR WT FREQUENCY RESPONSES 4 LEVELS alpha =.67, beta =., Q =., R = 3. HIGH Q-FACTOR WT FREQUENCY RESPONSES 3 LEVELS alpha =.87, beta =.4, Q = 4., R = π/4 π/2 3π/4 π FREQUENCY (ω)..5 WAVELET TIME (SAMPLES).5. π/4 π/2 3π/4 π FREQUENCY (ω)..5 WAVELET TIME (SAMPLES) Q-factor = Q-factor = 4 Redundancy = 3 Redundancy = 3 6
17 Finite-length Signals... The TWQT can be implemented for finite-length signals using the DFT (FFT)... H (k) LPS N : N v (n) LPS N : N H (k) y (n) x(n) + y(n) H (k) HPS N :N v (n) HPS N :N H (k) y (n) 7
18 Low-pass scaling N :N x(n) LPS N : N y(n) X (k) X (k) N/2 N N/2 N Y (k) Y (k) N /2 N N /2 N Low-pass scaling with N < N Low-pass scaling with N > N. 8
19 High-pass scaling N :N x(n) HPS N :N y(n) X (k) X (k) N/2 N N/2 N Y (k) Y (k) N /2 N N /2 N High-pass scaling with N < N High-pass scaling with N > N 9
20 X (k) N/2 N (a) DFT of input signal, X(k). H (k) H (k) T N/2 T N T N/2 T N (b) Filters H (k) and H (k). The transitions-bands are indicated by T. H (k)x (k) H (k)x (k) N/2 N (c) DFT of input signal after filtering. N/2 N V (k) V (k) N /2 N N /2 N (d) DFT after scaling. 2
21 Example: Low Q-factor vs High Q-factor WT SUBBANDS (LOW Q RADWT) SUBBANDS (HIGH Q RADWT).89% % % 2 6.4% % 3.72%.54% SUBBAND % 22.82% SUBBAND 2 7.3% 6.3% % % 4.74% % 5 2.2% 8.38% % 9.% % TIME (SAMPLES) P = 2, Q = 3, S =, Levels = Dilation =.5, Redundancy = TIME (SAMPLES) P = 5, Q = 6, S = 2, Levels = 2 Dilation =.2, Redundancy = 3. 2
22 Low Q-factor vs High Q-factor WT after sparsification SUBBANDS (LOW Q RADWT) SUBBANDS (HIGH Q RADWT).% 7.% % 2 2.7% 9.% %.% SUBBAND %.79% SUBBAND 2.2% 38.66% % 3.2% 4.2% 7.68% % 8.% % 9.% 7.% TIME (SAMPLES) P = 2, Q = 3, S =, Levels = Dilation =.5, Redundancy = TIME (SAMPLES) P = 5, Q = 6, S = 2, Levels = 2 Dilation =.2, Redundancy = 3. 22
23 Low Q-factor vs High Q-factor WT SUBBANDS (LOW Q RADWT) SUBBANDS (HIGH Q RADWT) 6.82% 2.58% % 2 6.3% 8 3.2% % 3.7% 5.65% SUBBAND 4 6.% SUBBAND % 6.95% % % % % % 7 3.5% 6 2.4% % % 8 5.4% 9.42% 9 3.7% TIME (SAMPLES) P = 2, Q = 3, S =, Levels = Dilation =.5, Redundancy = TIME (SAMPLES) P = 5, Q = 6, S = 2, Levels = 2 Dilation =.2, Redundancy = 3. 23
24 Low Q-factor vs High Q-factor WT after sparsification SUBBANDS (LOW Q RADWT) SUBBANDS (HIGH Q RADWT) %.% % 2 3.2% % 9 2.6% 3.99% 4.2% SUBBAND % SUBBAND % 6.25% 5.6% 3 4.% % 4 8.7% % % % % 7 9.5% 8.36% 9.23% 9 3.% TIME (SAMPLES) P = 2, Q = 3, S =, Levels = Dilation =.5, Redundancy = TIME (SAMPLES) P = 5, Q = 6, S = 2, Levels = 2 Dilation =.2, Redundancy = 3. 24
25 Constant-Q vs Constant-BW Constant-Q Constant-BW FREQUENCY RESPONSES FREQUENCY RESPONSES FREQUENCY (CYCLES/SAMPLE) FREQUENCY (CYCLES/SAMPLE) ANALYSIS FUNCTION ANALYSIS FUNCTION TIME (SAMPLES) TIME (SAMPLES) ANALYSIS FUNCTION ANALYSIS FUNCTION TIME (SAMPLES) TIME (SAMPLES) fixed resonance frequency-dependent temporal duration frequency-dependent resonance fixed temporal duration 25
26 Tunable Q-factor wavelet transform (TQWT) Run Times Total execution time for forward/inverse N-point TQWT. N time (ms) N time (ms) Run times measured on a 2 base-model Apple MacBook Pro (2.4 GHz Intel Core 2 Duo). C implementation. 26
27 Tunable Q-factor wavelet transform (TQWT) Summary:. Fully-discrete, modestly overcomplete 2. Exact perfect reconstruction ( self-inverting ) 3. Adjustable Q-factor: Can attain higher Q-factors than (or same low Q-factor of) the dyadic WT. = Can achieve higher-frequency resolution needed for oscillatory signals. 4. Samples the time-frequency plane more densely in both time and frequency. = Exactly invertible, fully-discrete approximation of the continuous WT. 5. FFT-based implementation 27
28 Morphological Component Analysis (MCA) Given an observed signal x = x + x 2, with x, x, x 2 R N, the goal of MCA is to estimate/determine x and x 2 individually. Assuming that x and x 2 can be sparsely represented in bases (or frames) Φ and Φ 2 respectively, they can be estimated by minimizing the objective function, J(w, w 2 ) = λ w + λ 2 w 2 with respect to w and w 2, subject to the constraint: Φ w + Φ 2 w 2 = x. Then MCA provides the estimates ˆx = Φ w and ˆx 2 = Φ 2 w 2. Reference: Starck, Elad, Donoho. Image Decomposition via the Combination of Sparse Representations and a Variational Approach, IEEE Trans. on Image Processing, Oct
29 Why not a quadratic cost function? If a quadratic cost function is minimized, subject to Φ w + Φ 2 w 2 = x, J(w, w 2 ) = λ w λ 2 w then, using Φ Φ t = Φ 2 Φ t 2 = I, the w and w 2 can be found in closed form: w = λ2 2 λ 2 + λ2 2 Φ t x, w 2 = λ2 λ 2 + Φ t λ2 2 x 2 and the estimated components, ˆx = Φ w and ˆx 2 = Φ 2 w 2, are given by Both ˆx and ˆx 2 are just scaled versions of x. = No separation at all! ˆx = λ2 2 λ 2 + λ2 2 ˆx 2 = λ2 λ 2 + λ2 2 x, x 29
30 MCA as a linear inverse problem The constrained optimization problem can be written as min w,w 2 λ w + λ 2 w 2 subject to Φ w + Φ 2 w 2 = x min w subject to λ w Hw = x where ] H = [Φ Φ 2, w = w w 2 and denotes point-by-point multiplication. This is basis pursuit, an l -regularized linear inverse problem... Non-differentiable Convex = We use a variant of SALSA (split augmented Lagrangian shrinkage algorithm). Reference: Afonso, Bioucas-Dias, Figueiredo. Fast Image Recovery Using Variable Splitting and Constrained Optimization. IEEE Trans. on Image Processing, 2. 3
31 SALSA for MCA (bais pursuit form) Applying SALSA to the MCA problem yields the iterative algorithm: initialize: µ >, d i (5) u i soft(w i + d i,.5λ i /µ) d i, i =, 2 (6) c x Φ u Φ 2 u 2 (7) d i 2 Φt i c i =, 2 (8) w i d i + u i i =, 2 (9) repeat () where soft(x, T ) is the soft-threshold rule with threshold T, soft(x, T ) = x max(, T/ x ). Note: no matrix inverses; only forward and inverse transforms. 3
32 9.5 OBJECTIVE FUNCTION ISTA SALSA ITERATION Figure 4: Reduction of objective function during the first iterations. SALSA converges faster than ISTA. 32
33 Example: Resonance-selective nonlinear band-pass filtering 2 (a) TEST SIGNAL 2 (c) OUTPUT OF BAND PASS FILTER TIME (SAMPLES) TIME (SAMPLES) (b) TWO BAND PASS FILTERS 2 (d) OUTPUT OF BAND PASS FILTER 2.5 BAND PASS FILTER BAND PASS FILTER FREQUENCY (CYCLES/SAMPLE) TIME (SAMPLES) Figure 5: LTI band-pass filtering. The test signal (a) consists of a sinusoidal pulse of frequency. cycles/sample and a transient. Band-pass filters and 2 in (b) are tuned to the frequencies.7 and. cycles/second respectively. The output signals, obtained by filtering the test signal with each of the two band-pass filters, are shown in (c) and (d). The output of band-pass filter, illustrated in (c), contains oscillations due to the transient in the test signal. Moreover, the transient oscillations in (c) have a frequency of.7 Hz even though the test signal (a) contains no sustained oscillatory behavior at this frequency. 33
34 2 (a) HIGH RESONANCE COMPONENT 2 (c) OUTPUT OF BAND PASS FILTER TIME (SAMPLES) TIME (SAMPLES) 2 (b) LOW RESONANCE COMPONENT 2 (d) OUTPUT OF BAND PASS FILTER TIME (SAMPLES) TIME (SAMPLES) Figure 6: Resonance-based decomposition and band-pass filtering. When resonance-based analysis method is applied to the test signal in Fig. 5a, it yields the high- and low-resonance components illustrated in (a) and (b). The output signals, obtained by filtering the high-resonance component (a) with each of the two band-pass filters shown in Fig. 5b, are illustrated in (c) and (d). The transient oscillations in (c) are substantially reduced compared to Fig. 5c. 34
35 Example: Resonance-based decomposition of speech.4 (a) SPEECH SIGNAL [Fs = 6, SAMPLES/SECOND] (b) HIGH RESONANCE COMPONENT (c) LOW RESONANCE COMPONENT TIME (SECONDS) Figure 7: Decomposition of a speech signal ( I m ) into high- and low-resonance components. The high-resonance component (b) contains the sustained oscillations present in the speech signal, while the low-resonance component (c) contains non-oscillatory transients. (The residual is not shown.) 35
36 . (a) ORIGINAL SPEECH (b) HIGH RESONANCE COMPONENT (c) LOW RESONANCE COMPONENT FREQUENCY (Hz) Figure 8: Frequency spectra of the speech signal in Fig. 7 and of the extracted high- and low-resonance components. The spectra are computed using the 5 msec segment from.5 to. seconds. The energy of each resonance component is widely distributed in frequency and their frequency-spectra overlap. 36
37 .2 (a) RECONSTRUCTION FROM SUBBANDS 9, (b) RECONSTRUCTION FROM SUBBANDS 8, (c) RECONSTRUCTION FROM SUBBANDS (D) SUM OF ABOVE 3 SIGNALS TIME (SECONDS) Figure 9: Frequency decomposition of high-resonance component in Fig. 7. Reconstructing the high-resonance component from a few subbands of the high Q-factor WT at a time, yields an efficient AM/FM decomposition. 37
38 Constant bandwidth + Constant Q-factor CONSTANT BANDWITH FREQUENCY CONSTANT Q FACTOR FREQUENCY A constant bandwidth and a constant Q-factor decomposition can have high coherence due to some analysis functions, from each decomposition, having similar frequency support. This can degrade the results of MCA in principle. 38
39 Constant Q-factor: High Q-factor + Low Q-factor CONSTANT Q FACTOR (HIGH Q FACTOR) FREQUENCY CONSTANT Q FACTOR (LOW Q FACTOR) FREQUENCY Two constant Q-factor decompositions with markedly different Q-factors will have low coherence because no analysis functions from the two decompositions will have similar frequency support. This is beneficial for the operation of MCA. 39
40 Small coherence between low and high Q-factor WTs Ψ 2 (f) Q2 /f 2 f 2 /Q 2 Ψ (f) Q /f f /Q f f 2 f Figure : For reliable resonance-based decomposition, the inner product between the low-q and high-q wavelets should be small for all dilations and translations. The computation of the maximum inner product is simplified by assuming the wavelets are ideal band-pass functions and expressing the inner product in the frequency domain. The inner products can be defined in the frequency domain, ρ(f, f 2 ) := Ψ (f)ψ 2 (f) df, as a function of their center frequencies (equivalently, dilation). The maximum value of the inner product, ρ(f, f 2 ), occurs when f 2 = f (2 + /Q )/(2 + /Q 2 ) and is given by ρ max = Q + /2 Q 2 + /2, Q 2 > Q. () 4
41 Constant Bandwidth: Narrow-band + Wide-band CONSTANT BANDWITH (NARROW BAND) FREQUENCY CONSTANT BANDWITH (WIDE BAND) FREQUENCY Two constant bandwidth decompositions with markedly different bandwidths will also have low coherence and are therefore also suitable transform for MCA-based signal decomposition. This gives a bandwidthbased decomposition, rather than a resonance-based decomposition. 4
42 Conclusion: Resonance-based signal decomposition Low Q-factor WT used for sparse representation of the transient component. High Q-factor WT used for sparse representation of the oscillatory (rhythmic) component. Morphological component analysis (MCA) used to separate the two signal components. Oscillatory component not necessarily high-pass contains both low and high frequencies. Transient component not necessarily a low-pass signal contains sharp bumps and jumps. Software available (Matlab software on web, C code by request). 42
43 Graphical User Interface: Facilitates interactive selection and tuning of parameters. 43
44 . More slides... 44
45 Comparison: EMD & TQWT We compare Empirical Mode Decomposition (EMD) Sparse TQWT Representation A goal of EMD is to decompose a multicomponent signal into several narrow-band components (intrinsic mode functions). For some real signals, a sparse TQWT representation leads to a more reasonable decomposition than EMD (next two slides). 45
46 7 Empirical mode decomposition (EMD) IMF index Time (seconds) 46
47 Sparse TQWT Representation band band 2 band 3 band 4 residual recon Time (seconds) 47
48 Morphological Component Analysis (MCA) Noisy signal case In the noisy case, we should not ask for exact equality. Given an observed signal x = x + x 2 + n, with x, x, x 2 R N, where n is noise, the components x and x 2 can be estimated by minimizing the objective function, J(w, w 2 ) = x Φ w Φ 2 w λ w + λ 2 w 2 with respect to w and w 2. Then MCA provides the estimates ˆx = Φ w and ˆx 2 = Φ 2 w 2. Reference: Starck, Elad, Donoho. Image Decomposition via the Combination of Sparse Representations and a Variational Approach, IEEE Trans. on Image Processing, Oct
49 Why not a quadratic cost function? If the l 2 -norm is used for the penalty term, J(w, w 2 ) = x Φ w Φ 2 w λ w λ 2 w 2 2 2, then, using Φ Φ t = Φ 2 Φ t 2 = I, the minimizing w and w 2 can be found in closed form: w = λ λ + λ 2 + λ λ 2 Φ t x λ 2 w 2 = Φ t 2 x λ + λ 2 + λ λ 2 and the estimated components, ˆx = Φ w and ˆx 2 = Φ 2 w 2, are given by ˆx = ˆx 2 = Both ˆx and ˆx 2 are just scaled versions of x. = No separation at all! λ λ + λ 2 + λ λ 2 x λ 2 λ + λ 2 + λ λ 2 x 49
50 MCA as a linear inverse problem The objective function can be written as J(w, w 2 ) = x Φ w Φ 2 w λ w + λ 2 w 2 J(w) = x Hw λ w where H = [Φ ] Φ 2, w = and denotes point-by-point multiplication. w w 2 An l -regularized linear inverse problem... Non-differentiable Convex = Use Iterative Soft Thresholding Algorithm (ISTA) or another algorithm to minimize J(w). Other algorithms include SparSA, TwIST, FISTA, SALSA, etc. 5
51 Split augmented Lagrangian shrinkage algorithm (SALSA) SALSA is an algorithm for minimizing SALSA is based on the minimization of J(w) = x Hw λ w by the alternating split augmented Lagrangian algorithm: min u f (u) + f 2 (u) (2) u (k+) = arg min u f (u) + µ u v (k) d (k) 2 2 (3) v (k+) = arg min v f 2 (v) + µ u (k+) v d (k) 2 2 (4) d (k+) = d (k) u (k+) + v (k+) (5) Reference: Afonso, Bioucas-Dias, Figueiredo. Fast Image Recovery Using Variable Splitting and Constrained Optimization. IEEE Trans. on Image Processing, 2. 5
52 SALSA Applying SALSA to the MCA problem yields the iterative algorithm: initialize: µ >, d (6) u i soft(w i + d i,.5λ i /µ) d i, i =, 2 (7) c x Φ u Φ 2 u 2 (8) d i µ + 2 Φt i c i =, 2 (9) w i d i + u i, i =, 2 (2) repeat where soft(x, T ) is the soft-threshold rule with threshold T, soft(x, T ) = x max(, T/ x ). Note: no matrix inverses; only forward and inverse transforms. (2) 52
53 NOISY SPEECH WAVEFORM HIGH Q FACTOR COMPONENT LOW Q FACTOR COMPONENT RESIDUAL TIME (SECONDS) 53
Sparse signal representation and the tunable Q-factor wavelet transform
Sparse signal representation and the tunable Q-factor wavelet transform Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York Introduction Problem: Decomposition of a signal into
More informationFrequency-Domain Design and Implementation of Overcomplete Rational-Dilation Wavelet Transforms
Frequency-Domain Design and Implementation of Overcomplete Rational-Dilation Wavelet Transforms Ivan Selesnick and Ilker Bayram Polytechnic Institute of New York University Brooklyn, New York 1 Rational-Dilation
More informationWavelet Transform with Tunable Q-Factor
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2) Wavelet Transform with Tunable Q-Factor Ivan W. Selesnick, Senior Member, IEEE Abstract This paper describes a discrete-time wavelet transform for which the Q-factor
More informationIntroduction to Sparsity in Signal Processing 1
Introduction to Sparsity in Signal Processing Ivan Selesnick June, NYU-Poly Introduction These notes describe how sparsity can be used in several signal processing problems. A common theme throughout these
More informationSPARSE SIGNAL RESTORATION. 1. Introduction
SPARSE SIGNAL RESTORATION IVAN W. SELESNICK 1. Introduction These notes describe an approach for the restoration of degraded signals using sparsity. This approach, which has become quite popular, is useful
More informationIntroduction to Sparsity in Signal Processing
1 Introduction to Sparsity in Signal Processing Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York selesi@poly.edu 212 2 Under-determined linear equations Consider a system
More informationIntroduction to Sparsity in Signal Processing
1 Introduction to Sparsity in Signal Processing Ivan Selesnick Polytechnic Institute of New York University Brooklyn, New York selesi@poly.edu 212 2 Under-determined linear equations Consider a system
More informationAn Analytic Wavelet Transform with a Flexible Time-Frequency Covering
Freuency An Analytic Wavelet Transform with a Flexible -Freuency Covering 1 İlker Bayram ibayram@ituedutr Abstract We develop a rational-dilation wavelet transform for which the dilation factor, the Q-factor
More informationDenoising of NIRS Measured Biomedical Signals
Denoising of NIRS Measured Biomedical Signals Y V Rami reddy 1, Dr.D.VishnuVardhan 2 1 M. Tech, Dept of ECE, JNTUA College of Engineering, Pulivendula, A.P, India 2 Assistant Professor, Dept of ECE, JNTUA
More informationSPARSITY-ASSISTED SIGNAL SMOOTHING (REVISITED) Ivan Selesnick
SPARSITY-ASSISTED SIGNAL SMOOTHING (REVISITED) Ivan Selesnick Electrical and Computer Engineering Tandon School of Engineering, New York University Brooklyn, New York, USA ABSTRACT This paper proposes
More informationSparse linear models
Sparse linear models Optimization-Based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_spring16 Carlos Fernandez-Granda 2/22/2016 Introduction Linear transforms Frequency representation Short-time
More informationMorphological Diversity and Source Separation
Morphological Diversity and Source Separation J. Bobin, Y. Moudden, J.-L. Starck, and M. Elad Abstract This paper describes a new method for blind source separation, adapted to the case of sources having
More informationSparse Time-Frequency Transforms and Applications.
Sparse Time-Frequency Transforms and Applications. Bruno Torrésani http://www.cmi.univ-mrs.fr/~torresan LATP, Université de Provence, Marseille DAFx, Montreal, September 2006 B. Torrésani (LATP Marseille)
More informationWavelet Based Image Restoration Using Cross-Band Operators
1 Wavelet Based Image Restoration Using Cross-Band Operators Erez Cohen Electrical Engineering Department Technion - Israel Institute of Technology Supervised by Prof. Israel Cohen 2 Layout Introduction
More informationSymmetric Wavelet Tight Frames with Two Generators
Symmetric Wavelet Tight Frames with Two Generators Ivan W. Selesnick Electrical and Computer Engineering Polytechnic University 6 Metrotech Center, Brooklyn, NY 11201, USA tel: 718 260-3416, fax: 718 260-3906
More informationA Higher-Density Discrete Wavelet Transform
A Higher-Density Discrete Wavelet Transform Ivan W. Selesnick Abstract In this paper, we describe a new set of dyadic wavelet frames with three generators, ψ i (t), i =,, 3. The construction is simple,
More informationIntroduction to Biomedical Engineering
Introduction to Biomedical Engineering Biosignal processing Kung-Bin Sung 6/11/2007 1 Outline Chapter 10: Biosignal processing Characteristics of biosignals Frequency domain representation and analysis
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationDenosing Using Wavelets and Projections onto the l 1 -Ball
1 Denosing Using Wavelets and Projections onto the l 1 -Ball October 6, 2014 A. Enis Cetin, M. Tofighi Dept. of Electrical and Electronic Engineering, Bilkent University, Ankara, Turkey cetin@bilkent.edu.tr,
More informationRecent developments on sparse representation
Recent developments on sparse representation Zeng Tieyong Department of Mathematics, Hong Kong Baptist University Email: zeng@hkbu.edu.hk Hong Kong Baptist University Dec. 8, 2008 First Previous Next Last
More informationTranslation-Invariant Shrinkage/Thresholding of Group Sparse. Signals
Translation-Invariant Shrinkage/Thresholding of Group Sparse Signals Po-Yu Chen and Ivan W. Selesnick Polytechnic Institute of New York University, 6 Metrotech Center, Brooklyn, NY 11201, USA Email: poyupaulchen@gmail.com,
More informationIntroduction to time-frequency analysis Centre for Doctoral Training in Healthcare Innovation
Introduction to time-frequency analysis Centre for Doctoral Training in Healthcare Innovation Dr. Gari D. Clifford, University Lecturer & Director, Centre for Doctoral Training in Healthcare Innovation,
More informationSIGNAL SEPARATION USING RE-WEIGHTED AND ADAPTIVE MORPHOLOGICAL COMPONENT ANALYSIS
TR-IIS-4-002 SIGNAL SEPARATION USING RE-WEIGHTED AND ADAPTIVE MORPHOLOGICAL COMPONENT ANALYSIS GUAN-JU PENG AND WEN-LIANG HWANG Feb. 24, 204 Technical Report No. TR-IIS-4-002 http://www.iis.sinica.edu.tw/page/library/techreport/tr204/tr4.html
More informationSparse linear models and denoising
Lecture notes 4 February 22, 2016 Sparse linear models and denoising 1 Introduction 1.1 Definition and motivation Finding representations of signals that allow to process them more effectively is a central
More informationAn Introduction to Filterbank Frames
An Introduction to Filterbank Frames Brody Dylan Johnson St. Louis University October 19, 2010 Brody Dylan Johnson (St. Louis University) An Introduction to Filterbank Frames October 19, 2010 1 / 34 Overview
More informationThe Dual-Tree Complex Wavelet Transform A Coherent Framework for Multiscale Signal and Image Processing
The Dual-Tree Complex Wavelet Transform A Coherent Framework for Multiscale Signal and Image Processing Ivan W. Selesnick Electrical and Computer Engineering Polytechnic University 6 Metrotech Center,
More information2D Wavelets. Hints on advanced Concepts
2D Wavelets Hints on advanced Concepts 1 Advanced concepts Wavelet packets Laplacian pyramid Overcomplete bases Discrete wavelet frames (DWF) Algorithme à trous Discrete dyadic wavelet frames (DDWF) Overview
More informationMultiresolution image processing
Multiresolution image processing Laplacian pyramids Some applications of Laplacian pyramids Discrete Wavelet Transform (DWT) Wavelet theory Wavelet image compression Bernd Girod: EE368 Digital Image Processing
More informationLarge-Scale L1-Related Minimization in Compressive Sensing and Beyond
Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Arizona State University March
More informationEMPLOYING PHASE INFORMATION FOR AUDIO DENOISING. İlker Bayram. Istanbul Technical University, Istanbul, Turkey
EMPLOYING PHASE INFORMATION FOR AUDIO DENOISING İlker Bayram Istanbul Technical University, Istanbul, Turkey ABSTRACT Spectral audio denoising methods usually make use of the magnitudes of a time-frequency
More informationVARIOUS types of wavelet transform are available for
IEEE TRANSACTIONS ON SIGNAL PROCESSING A Higher-Density Discrete Wavelet Transform Ivan W. Selesnick, Member, IEEE Abstract This paper describes a new set of dyadic wavelet frames with two generators.
More informationWavelets in Pattern Recognition
Wavelets in Pattern Recognition Lecture Notes in Pattern Recognition by W.Dzwinel Uncertainty principle 1 Uncertainty principle Tiling 2 Windowed FT vs. WT Idea of mother wavelet 3 Scale and resolution
More informationMultiresolution Analysis
Multiresolution Analysis DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Frames Short-time Fourier transform
More informationSparse Solutions of Systems of Equations and Sparse Modelling of Signals and Images
Sparse Solutions of Systems of Equations and Sparse Modelling of Signals and Images Alfredo Nava-Tudela ant@umd.edu John J. Benedetto Department of Mathematics jjb@umd.edu Abstract In this project we are
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationAn Investigation of 3D Dual-Tree Wavelet Transform for Video Coding
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com An Investigation of 3D Dual-Tree Wavelet Transform for Video Coding Beibei Wang, Yao Wang, Ivan Selesnick and Anthony Vetro TR2004-132 December
More informationSignal Restoration with Overcomplete Wavelet Transforms: Comparison of Analysis and Synthesis Priors
Signal Restoration with Overcomplete Wavelet Transforms: Comparison of Analysis and Synthesis Priors Ivan W. Selesnick a and Mário A. T. Figueiredo b a Polytechnic Institute of New York University, Brooklyn,
More informationEmpirical Wavelet Transform
Jérôme Gilles Department of Mathematics, UCLA jegilles@math.ucla.edu Adaptive Data Analysis and Sparsity Workshop January 31th, 013 Outline Introduction - EMD 1D Empirical Wavelets Definition Experiments
More informationDigital Image Processing Lectures 15 & 16
Lectures 15 & 16, Professor Department of Electrical and Computer Engineering Colorado State University CWT and Multi-Resolution Signal Analysis Wavelet transform offers multi-resolution by allowing for
More informationSI 1. Figure SI 1.1 CuCl 4
Electronic Supplementary Material (ESI) for Dalton Transactions. This journal is The Royal Society of Chemistry 2014 SI 1 FFT analysis of residuals was carried out. The residuals were obtained by fitting
More informationWavelets and multiresolution representations. Time meets frequency
Wavelets and multiresolution representations Time meets frequency Time-Frequency resolution Depends on the time-frequency spread of the wavelet atoms Assuming that ψ is centred in t=0 Signal domain + t
More informationLecture Notes 5: Multiresolution Analysis
Optimization-based data analysis Fall 2017 Lecture Notes 5: Multiresolution Analysis 1 Frames A frame is a generalization of an orthonormal basis. The inner products between the vectors in a frame and
More informationSparse Regularization via Convex Analysis
Sparse Regularization via Convex Analysis Ivan Selesnick Electrical and Computer Engineering Tandon School of Engineering New York University Brooklyn, New York, USA 29 / 66 Convex or non-convex: Which
More informationPrimal-Dual Algorithms for Audio Decomposition Using Mixed Norms
Noname manuscript No. (will be inserted by the editor Primal-Dual Algorithms for Audio Decomposition Using Mixed Norms İlker Bayram and Ö. Deniz Akyıldız Received: date / Accepted: date Abstract We consider
More informationA Novel Fast Computing Method for Framelet Coefficients
American Journal of Applied Sciences 5 (11): 15-157, 008 ISSN 1546-939 008 Science Publications A Novel Fast Computing Method for Framelet Coefficients Hadeel N. Al-Taai Department of Electrical and Electronic
More informationINTRODUCTION TO. Adapted from CS474/674 Prof. George Bebis Department of Computer Science & Engineering University of Nevada (UNR)
INTRODUCTION TO WAVELETS Adapted from CS474/674 Prof. George Bebis Department of Computer Science & Engineering University of Nevada (UNR) CRITICISM OF FOURIER SPECTRUM It gives us the spectrum of the
More informationSparsity in Underdetermined Systems
Sparsity in Underdetermined Systems Department of Statistics Stanford University August 19, 2005 Classical Linear Regression Problem X n y p n 1 > Given predictors and response, y Xβ ε = + ε N( 0, σ 2
More informationMULTI-RESOLUTION SIGNAL DECOMPOSITION WITH TIME-DOMAIN SPECTROGRAM FACTORIZATION. Hirokazu Kameoka
MULTI-RESOLUTION SIGNAL DECOMPOSITION WITH TIME-DOMAIN SPECTROGRAM FACTORIZATION Hiroazu Kameoa The University of Toyo / Nippon Telegraph and Telephone Corporation ABSTRACT This paper proposes a novel
More information1 Sparsity and l 1 relaxation
6.883 Learning with Combinatorial Structure Note for Lecture 2 Author: Chiyuan Zhang Sparsity and l relaxation Last time we talked about sparsity and characterized when an l relaxation could recover the
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More informationFrom Fourier Series to Analysis of Non-stationary Signals - X
From Fourier Series to Analysis of Non-stationary Signals - X prof. Miroslav Vlcek December 14, 21 Contents Stationary and non-stationary 1 Stationary and non-stationary 2 3 Contents Stationary and non-stationary
More informationFilter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing. G. Schuller Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany Page Modulated Filter Banks Extending the DCT The DCT IV transform can be seen as modulated
More informationEstimation Error Bounds for Frame Denoising
Estimation Error Bounds for Frame Denoising Alyson K. Fletcher and Kannan Ramchandran {alyson,kannanr}@eecs.berkeley.edu Berkeley Audio-Visual Signal Processing and Communication Systems group Department
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationBayesian Paradigm. Maximum A Posteriori Estimation
Bayesian Paradigm Maximum A Posteriori Estimation Simple acquisition model noise + degradation Constraint minimization or Equivalent formulation Constraint minimization Lagrangian (unconstraint minimization)
More informationDesign of bi-orthogonal rational Discrete Wavelet Transform and the associated applications
Design of bi-orthogonal rational Discrete Wavelet Transform and the associated applications by Nguyen, Nguyen Si Tran B. Eng. (Information Technology and Telecommunication, with first class Honours), The
More informationIndex. p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96
p, lip, 78 8 function, 107 v, 7-8 w, 7-8 i,7-8 sine, 43 Bo,94-96 B 1,94-96 M,94-96 B oro!' 94-96 BIro!' 94-96 I/r, 79 2D linear system, 56 2D FFT, 119 2D Fourier transform, 1, 12, 18,91 2D sinc, 107, 112
More informationNew Machine Learning Methods for Neuroimaging
New Machine Learning Methods for Neuroimaging Gatsby Computational Neuroscience Unit University College London, UK Dept of Computer Science University of Helsinki, Finland Outline Resting-state networks
More information446 SCIENCE IN CHINA (Series F) Vol. 46 introduced in refs. [6, ]. Based on this inequality, we add normalization condition, symmetric conditions and
Vol. 46 No. 6 SCIENCE IN CHINA (Series F) December 003 Construction for a class of smooth wavelet tight frames PENG Lizhong (Λ Π) & WANG Haihui (Ξ ) LMAM, School of Mathematical Sciences, Peking University,
More informationTutorial: Sparse Signal Processing Part 1: Sparse Signal Representation. Pier Luigi Dragotti Imperial College London
Tutorial: Sparse Signal Processing Part 1: Sparse Signal Representation Pier Luigi Dragotti Imperial College London Outline Part 1: Sparse Signal Representation ~90min Part 2: Sparse Sampling ~90min 2
More informationWhich wavelet bases are the best for image denoising?
Which wavelet bases are the best for image denoising? Florian Luisier a, Thierry Blu a, Brigitte Forster b and Michael Unser a a Biomedical Imaging Group (BIG), Ecole Polytechnique Fédérale de Lausanne
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationFinite Frame Quantization
Finite Frame Quantization Liam Fowl University of Maryland August 21, 2018 1 / 38 Overview 1 Motivation 2 Background 3 PCM 4 First order Σ quantization 5 Higher order Σ quantization 6 Alternative Dual
More informationSparse Signal Estimation by Maximally Sparse Convex Optimization
IEEE TRANSACTIONS ON SIGNAL PROCESSING. (PREPRINT) Sparse Signal Estimation by Maximally Sparse Convex Optimization Ivan W. Selesnick and Ilker Bayram Abstract This paper addresses the problem of sparsity
More informationInverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France
Inverse problems and sparse models (1/2) Rémi Gribonval INRIA Rennes - Bretagne Atlantique, France remi.gribonval@inria.fr Structure of the tutorial Session 1: Introduction to inverse problems & sparse
More informationAn Overview of Sparsity with Applications to Compression, Restoration, and Inverse Problems
An Overview of Sparsity with Applications to Compression, Restoration, and Inverse Problems Justin Romberg Georgia Tech, School of ECE ENS Winter School January 9, 2012 Lyon, France Applied and Computational
More informationSuper-resolution via Convex Programming
Super-resolution via Convex Programming Carlos Fernandez-Granda (Joint work with Emmanuel Candès) Structure and Randomness in System Identication and Learning, IPAM 1/17/2013 1/17/2013 1 / 44 Index 1 Motivation
More informationRelaxed linearized algorithms for faster X-ray CT image reconstruction
Relaxed linearized algorithms for faster X-ray CT image reconstruction Hung Nien and Jeffrey A. Fessler University of Michigan, Ann Arbor The 13th Fully 3D Meeting June 2, 2015 1/20 Statistical image reconstruction
More informationArtifact-free Wavelet Denoising: Non-convex Sparse Regularization, Convex Optimization
IEEE SIGNAL PROCESSING LETTERS. 22(9):164-168, SEPTEMBER 215. (PREPRINT) 1 Artifact-free Wavelet Denoising: Non-convex Sparse Regularization, Convex Optimization Yin Ding and Ivan W. Selesnick Abstract
More informationPhase recovery with PhaseCut and the wavelet transform case
Phase recovery with PhaseCut and the wavelet transform case Irène Waldspurger Joint work with Alexandre d Aspremont and Stéphane Mallat Introduction 2 / 35 Goal : Solve the non-linear inverse problem Reconstruct
More informationIntroduction to Wavelets and Wavelet Transforms
Introduction to Wavelets and Wavelet Transforms A Primer C. Sidney Burrus, Ramesh A. Gopinath, and Haitao Guo with additional material and programs by Jan E. Odegard and Ivan W. Selesnick Electrical and
More informationIntroduction to Compressed Sensing
Introduction to Compressed Sensing Alejandro Parada, Gonzalo Arce University of Delaware August 25, 2016 Motivation: Classical Sampling 1 Motivation: Classical Sampling Issues Some applications Radar Spectral
More informationSparsifying Transform Learning for Compressed Sensing MRI
Sparsifying Transform Learning for Compressed Sensing MRI Saiprasad Ravishankar and Yoram Bresler Department of Electrical and Computer Engineering and Coordinated Science Laborarory University of Illinois
More informationAn Introduction to Wavelets and some Applications
An Introduction to Wavelets and some Applications Milan, May 2003 Anestis Antoniadis Laboratoire IMAG-LMC University Joseph Fourier Grenoble, France An Introduction to Wavelets and some Applications p.1/54
More informationTRACKING SOLUTIONS OF TIME VARYING LINEAR INVERSE PROBLEMS
TRACKING SOLUTIONS OF TIME VARYING LINEAR INVERSE PROBLEMS Martin Kleinsteuber and Simon Hawe Department of Electrical Engineering and Information Technology, Technische Universität München, München, Arcistraße
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1396 1 / 44 Table
More informationMinimizing Isotropic Total Variation without Subiterations
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Minimizing Isotropic Total Variation without Subiterations Kamilov, U. S. TR206-09 August 206 Abstract Total variation (TV) is one of the most
More informationSignal Recovery, Uncertainty Relations, and Minkowski Dimension
Signal Recovery, Uncertainty Relations, and Minkowski Dimension Helmut Bőlcskei ETH Zurich December 2013 Joint work with C. Aubel, P. Kuppinger, G. Pope, E. Riegler, D. Stotz, and C. Studer Aim of this
More informationFilter Banks For "Intensity Analysis"
morlet.sdw 4/6/3 /3 Filter Banks For "Intensity Analysis" Introduction In connection with our participation in two conferences in Canada (August 22 we met von Tscharner several times discussing his "intensity
More informationSensing systems limited by constraints: physical size, time, cost, energy
Rebecca Willett Sensing systems limited by constraints: physical size, time, cost, energy Reduce the number of measurements needed for reconstruction Higher accuracy data subject to constraints Original
More informationGeneralized Orthogonal Matching Pursuit- A Review and Some
Generalized Orthogonal Matching Pursuit- A Review and Some New Results Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur, INDIA Table of Contents
More informationThe Suppression of Transient Artifacts in Time Series via Convex Analysis
The Suppression of Transient Artifacts in Time Series via Convex Analysis Yining Feng 1, Harry Graber 2, and Ivan Selesnick 1 (1) Tandon School of Engineering, New York University, Brooklyn, New York (2)
More informationMedical Image Processing
Medical Image Processing Federica Caselli Department of Civil Engineering University of Rome Tor Vergata Medical Imaging X-Ray CT Ultrasound MRI PET/SPECT Digital Imaging! Medical Image Processing What
More informationPERCEPTUAL MATCHING PURSUIT WITH GABOR DICTIONARIES AND TIME-FREQUENCY MASKING. Gilles Chardon, Thibaud Necciari, and Peter Balazs
21 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP) PERCEPTUAL MATCHING PURSUIT WITH GABOR DICTIONARIES AND TIME-FREQUENCY MASKING Gilles Chardon, Thibaud Necciari, and
More informationAn Introduction to Sparse Approximation
An Introduction to Sparse Approximation Anna C. Gilbert Department of Mathematics University of Michigan Basic image/signal/data compression: transform coding Approximate signals sparsely Compress images,
More informationIMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES
IMPROVEMENTS IN MODAL PARAMETER EXTRACTION THROUGH POST-PROCESSING FREQUENCY RESPONSE FUNCTION ESTIMATES Bere M. Gur Prof. Christopher Niezreci Prof. Peter Avitabile Structural Dynamics and Acoustic Systems
More informationSystem Identification in the Short-Time Fourier Transform Domain
System Identification in the Short-Time Fourier Transform Domain Yekutiel Avargel System Identification in the Short-Time Fourier Transform Domain Research Thesis As Partial Fulfillment of the Requirements
More informationCh. 15 Wavelet-Based Compression
Ch. 15 Wavelet-Based Compression 1 Origins and Applications The Wavelet Transform (WT) is a signal processing tool that is replacing the Fourier Transform (FT) in many (but not all!) applications. WT theory
More informationReview: Learning Bimodal Structures in Audio-Visual Data
Review: Learning Bimodal Structures in Audio-Visual Data CSE 704 : Readings in Joint Visual, Lingual and Physical Models and Inference Algorithms Suren Kumar Vision and Perceptual Machines Lab 106 Davis
More informationDesign of Image Adaptive Wavelets for Denoising Applications
Design of Image Adaptive Wavelets for Denoising Applications Sanjeev Pragada and Jayanthi Sivaswamy Center for Visual Information Technology International Institute of Information Technology - Hyderabad,
More informationA Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary
More informationWavelet Footprints: Theory, Algorithms, and Applications
1306 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 51, NO. 5, MAY 2003 Wavelet Footprints: Theory, Algorithms, and Applications Pier Luigi Dragotti, Member, IEEE, and Martin Vetterli, Fellow, IEEE Abstract
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationMultiple Change Point Detection by Sparse Parameter Estimation
Multiple Change Point Detection by Sparse Parameter Estimation Department of Econometrics Fac. of Economics and Management University of Defence Brno, Czech Republic Dept. of Appl. Math. and Comp. Sci.
More informationWavelet Analysis for Nanoscopic TEM Biomedical Images with Effective Weiner Filter
Wavelet Analysis for Nanoscopic TEM Biomedical Images with Effective Weiner Filter Garima Goyal goyal.garima18@gmail.com Assistant Professor, Department of Information Science & Engineering Jyothy Institute
More informationSPECTRAL COMPRESSIVE SENSING WITH POLAR INTERPOLATION. Karsten Fyhn, Hamid Dadkhahi, Marco F. Duarte
SPECTRAL COMPRESSIVE SENSING WITH POLAR INTERPOLATION Karsten Fyhn, Hamid Dadkhahi, Marco F. Duarte Dept. of Electronic Systems, Aalborg University, Denmark. Dept. of Electrical and Computer Engineering,
More informationDesign Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
CENTER FOR COMPUTER RESEARCH IN MUSIC AND ACOUSTICS DEPARTMENT OF MUSIC, STANFORD UNIVERSITY REPORT NO. STAN-M-4 Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
More informationNew Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit
New Coherence and RIP Analysis for Wea 1 Orthogonal Matching Pursuit Mingrui Yang, Member, IEEE, and Fran de Hoog arxiv:1405.3354v1 [cs.it] 14 May 2014 Abstract In this paper we define a new coherence
More informationDiscrete Wavelet Transform
Discrete Wavelet Transform [11] Kartik Mehra July 2017 Math 190s Duke University "1 Introduction Wavelets break signals up and then analyse them separately with a resolution that is matched with scale.
More information