Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/**
* JWave is distributed under the MIT License (MIT); this file is part of.
*
* Copyright (c) 2008-2015 Christian Scheiblich ([email protected])
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package jwave;
import jwave.transforms.DiscreteFourierTransform;
import jwave.transforms.wavelets.Wavelet;
import jwave.transforms.wavelets.WaveletBuilder;
/**
* Main class can be used to do a little console test by entering a transform
* type and a wavelet by their names. However, this should only make a quick n
* dirty test available by skipping the JUnit framework. JWave is supported as a
* library and foreseen to be used like this.
*
* @date 23.02.2010 14:26:47
* @author Christian Scheiblich ([email protected])
*/
public class JWave {
/**
* Main method for doing little test runs for different transform types and
* different wavelets without JUnit. Type in the name of the transform and the
* name of the wavelet. The result is an array of length 16 (2^p | p € N) is
* transformed in four hierarchical steps (16/2=8 .. 8/2=4 .. 4/2=2 .. 2/1=1)
* and reduced by 1/sqrt(2.). The result is an array in Hilbert space keeping
* only one coefficient, the energy of value 4. (low pass), in the first
* position of the array. All detail coefficients (high pass of four stages)
* are zero, due to the fact that the input array was constant. This shows an
* application of a loss less compression of 93.75 % (15/16 * 100 %).
* Therefore, the reverse transform allows, due to orthogonality (even
* orthonormality) a located reconstruction of any coefficient that is
* currently supported in Hilbert space. Anyway, this little example already
* reveals the application power of wavelets. that can be used for any kind of
* data!
*
* @date 23.02.2010 14:26:47
* @author Christian Scheiblich ([email protected])
* @param args
* [transformType] [waveletType]
*/
public static void main( String[ ] args ) {
if( args.length < 3 || args.length > 5 ) {
System.err.println( "example usage: JWave [transformType] {waveletType}" );
System.err.println( "" );
System.err.println( "Transform names: " + "'Discrete Fourier Transform'"
+ " " + "'Fast Wavelet Transform'" + " "
+ "'Wavelet Packet Transform'" );
System.err.println( "Wavelet names: " + "'Haar'," + " "
+ "'Haar orthogonal'," + " " + "'Daubechies 2'" + " " + ".." + " "
+ "'Daubechies 20'," + " " + "'Symlet 2'" + " " + ".." + " "
+ "'Symlet 20'," + " " + "'Coiflet 1'" + " " + ".." + " "
+ "'Coiflet 5'," + " " + "'Legendre 1'" + " " + ".." + " "
+ "'Legendre 3'," + " " + " ... 'BiOrthogonal 1/1'"
+ " have a look for more in the 'transform.wavelets' package!" );
return;
} // if args
String waveletIdentifier = args[ 3 ] + " " + args[ 4 ]; // raw n dirty but working
String transformIdentifier = args[ 0 ] + " " + args[ 1 ] + " " + args[ 2 ]; // raw n dirty but working
Transform transform =
TransformBuilder.create(transformIdentifier, waveletIdentifier);
Wavelet wavelet = transform.getWavelet( );
double[ ] arrTime =
{ 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1., 1. };
if( transform.getBasicTransform( ) instanceof DiscreteFourierTransform )
System.out.print( TransformBuilder.identify( transform ) );
else
System.out.print( TransformBuilder.identify( transform ) + " using "
+ WaveletBuilder.identify( wavelet ) );
System.out.println( "" );
System.out.println( "time domain:" );
for( int p = 0; p < arrTime.length; p++ )
System.out.printf( "%7.4f", arrTime[ p ] );
System.out.println( "" );
double[ ] arrFreqOrHilb = transform.forward( arrTime );
if( transform.getBasicTransform( ) instanceof DiscreteFourierTransform )
System.out.println( "frequency domain:" );
else
System.out.println( "Hilbert domain:" );
for( int p = 0; p < arrTime.length; p++ )
System.out.printf( "%7.4f", arrFreqOrHilb[ p ] );
System.out.println( "" );
double[ ] arrReco = transform.reverse( arrFreqOrHilb );
System.out.println( "reconstruction:" );
for( int p = 0; p < arrTime.length; p++ )
System.out.printf( "%7.4f", arrReco[ p ] );
System.out.println( "" );
} // main
} // class
