Comments (1)
Hi Michael,
thanks for your message - no problem.
From m understanding any continous function, transform, etc, has to be discretized. Therefore, some f(x) goes to f(x_i), where x_i ist one postion in an array of length n, for example: [0.25, 0.5, 0.75, 0.5] | n=4 and x_0=0.25, x_1=0.5, etc.. For jWave's wavelet implementation it is necessary to have always a number of n = 2^p | p € N .. 0, 1, 2, 4, 8, 16, 32, 64, ..., to allow for a full - all possible levels - wavelet decomposition.
To come back to your question, I think any CWT implementation ends up in a DWT, otherwise the number n of x_i has to reach infinity to allow for a "continous" transform; that's due to how binary based machines are working.
However, the two implemented algorithm FWT and WPT are some kind of discrezied CWT, or DWT. those are different in their lifting scheme. The decompose method you are mentioning ist just computing all filter levels or steps and hand them back as a matrix (steps over arr length). Each filter level can be used to do a full reverse transform by appling the method reverse( arr, steps ), where "steps" has to match the level. This feature was request by a lot of people who want to manipulates coefficients at a certain level and then get the result, effect, etc. in time series by reversing this certain level.
best
Christian
from jwave.
Related Issues (19)
- easy speed improvement HOT 1
- Consider moving to Maven project layout? HOT 1
- decompose() then recompose() giving incorrect results HOT 4
- Different with Matlab? HOT 3
- AMD Aparapi OpenCL Java suport? HOT 1
- Arbitrary length wavelet coefficients order HOT 4
- Flipped signs in all high pass filter coefficients, error in _buildOrthonormalSpace HOT 1
- Symlet HOT 1
- Question: Structure of the coefficients in the array returned from the forward transform HOT 1
- Java 16 SIMD Support for faster Library HOT 1
- Power of 2 test (isBinary) HOT 4
- Cannot build
- reverse and forward functions HOT 1
- Maven repo HOT 1
- Discrete Wavelet Transform HOT 1
- Use of arbitrary length input array to Daubechies 4 FWT HOT 6
- Example Usage doesn't work HOT 1
- question on example. HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from jwave.