You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
- Changed the order of “Autocorrelation Wavelet Transform” and “Stationary Wavelet Transform” to agree with the order of presentation in the next sentence and the example code.
- Add numbering to all subsections in “Examples”.
Copy file name to clipboardExpand all lines: paper/paper.md
+4-4Lines changed: 4 additions & 4 deletions
Original file line number
Diff line number
Diff line change
@@ -33,7 +33,7 @@ One of the most distinguishing features of `WaveletsExt.jl` is the presence of a
33
33
34
34
# Examples
35
35
## 1. Redundant Wavelet Transforms
36
-
`WaveletsExt.jl` implements several redundant wavelet transforms including Stationary Wavelet Transform (SWT) [@Nason:1995] and Autocorrelation Wavelet Transform [@Saito:1993]. These transformations can be performed using the `acdwt` and `sdwt` functions, and the resulting decomposition can be visualized with the `wiggle` function included in `WaveletsExt.jl`.
36
+
`WaveletsExt.jl` implements several redundant wavelet transforms including Autocorrelation Wavelet Transform [@Saito:1993] and Stationary Wavelet Transform (SWT) [@Nason:1995]. These transformations can be performed using the `acdwt` and `sdwt` functions, and the resulting decomposition can be visualized with the `wiggle` function included in `WaveletsExt.jl`.
37
37
38
38
```julia
39
39
using Plots, Wavelets, WaveletsExt
@@ -56,7 +56,7 @@ savefig(p, "transforms.png")
56
56
```
57
57

58
58
59
-
## Best Basis Algorithms
59
+
## 2. Best Basis Algorithms
60
60
`WaveletsExt.jl` can select a best basis for a multiple signal input (i.e., an array of signals) through the Joint Best Basis (JBB) [@Wickerhauser:1996] or Least Statistically Dependent Basis (LSDB) [@Saito:2001] algorithms. The resulting best basis tree can be visualized using `plot_tfbdry` also included in `WaveletsExt.jl`.
61
61
62
62
```julia
@@ -85,7 +85,7 @@ savefig(p, "bestbasis.png")
85
85
```
86
86
![The best basis trees of 100 HeaviSine signals (A sinusoid + two Heaviside step functions) [@Donoho:1995a; @Donoho:1995b] selected by the JBB and LSDB algorithms. Each row represents a decomposition level, where level 0 is the original input signal, and each cell represents a frequency subband (low to high frequency from left to right). The colored cells indicate those subbands selected by the JBB (left) and the LSDB (right) algorithms. \label{fig:bestbasis}](bestbasis.png)
87
87
88
-
## Denoising Algorithms
88
+
## 3. Denoising Algorithms
89
89
`WaveletsExt.jl` contains two functions for denoising: `denoise` and `denoiseall`. The former denoises a single signal input whereas the latter denoises multiple signal input. For more examples of denoising algorithms in `WaveletsExt.jl`, see [@Liew:2021].
90
90
91
91
```julia
@@ -126,7 +126,7 @@ savefig(p, "denoising.png")
126
126
```
127
127
![Left: HeaviSine signals with Gaussian noise. Black lines represent the original (non-noisy) signal. Right: Simultaneously denoised signals using the JBB algorithm with a universal thresholding constant determined by the VisuShrink method [@Donoho:1994]. \label{fig:denoising}](denoising.png)
128
128
129
-
## Feature Extraction
129
+
## 4. Feature Extraction
130
130
For signal classification problems, users can extract distinguishing features localized in both the time and frequency domains using the Local Discriminant Basis (LDB) algorithm. Further details can be found in the original papers by Saito and his collaborators [@Saito:1995; @Saito:2002] as well as the interactive tutorial [@Dan:2021].
0 commit comments