comparison util/Rice Wavelet Toolbox/midwt.c @ 78:f69ae88b8be5

added Rice Wavelet Toolbox with my modification, so it can be compiled on newer systems.

+/*
+File Name: midwt.c
+Last Modification Date:	06/14/95	12:55:58
+Current Version: midwt.c	1.4
+File Creation Date: Wed Oct 12 08:44:43 1994
+Author: Markus Lang  <[e-mail]>
+
+Copyright: All software, documentation, and related files in this distribution
+           are Copyright (c) 1994  Rice University
+
+Permission is granted for use and non-profit distribution providing that this
+notice be clearly maintained. The right to distribute any portion for profit
+or as part of any commercial product is specifically reserved for the author.
+
+Change History: Fixed code such that the result has the same dimension as the 
+                input for 1D problems. Also, added some standard error checking.
+		Jan Erik Odegard <[e-mail]> Wed Jun 14 1995
+
+*/
+#include <math.h>
+/*#include <malloc.h>*/
+#include <stdio.h>
+#include "mex.h"
+#include "matrix.h"
+#if !defined(_WIN32) && !defined(_WIN64)
+#include <inttypes.h>
+#endif
+#define max(A,B) (A > B ? A : B)
+#define min(A,B) (A < B ? A : B)
+#define even(x)  ((x & 1) ? 0 : 1)
+#define isint(x) ((x - floor(x)) > 0.0 ? 0 : 1)
+
+
+
+void mexFunction(int nlhs,mxArray *plhs[],int nrhs,const mxArray *prhs[])
+
+{
+  double *x, *h,  *y, *Lf, *Lr;
+  intptr_t m, n, h_col, h_row, lh, L, i, po2, j;
+  double mtest, ntest;
+
+  /* check for correct # of input variables */
+  if (nrhs>3){
+    mexErrMsgTxt("There are at most 3 input parameters allowed!");
+    return;
+  }
+  if (nrhs<2){
+    mexErrMsgTxt("There are at least 2 input parameters required!");
+    return;
+  }
+  y = mxGetPr(prhs[0]);
+  n = mxGetN(prhs[0]); 
+  m = mxGetM(prhs[0]); 
+  h = mxGetPr(prhs[1]);
+  h_col = mxGetN(prhs[1]); 
+  h_row = mxGetM(prhs[1]); 
+  if (h_col>h_row)
+    lh = h_col;
+  else  
+    lh = h_row;
+  if (nrhs == 3){
+    L = (intptr_t) *mxGetPr(prhs[2]);
+    if (L < 0)
+      mexErrMsgTxt("The number of levels, L, must be a non-negative integer");
+  }
+  else /* Estimate L */ {
+    i=n;j=0;
+    while (even(i)){
+      i=(i>>1);
+      j++;
+    }
+    L=m;i=0;
+    while (even(L)){
+      L=(L>>1);
+      i++;
+    }
+    if(min(m,n) == 1)
+      L = max(i,j);
+    else
+      L = min(i,j);
+    if (L==0){
+      mexErrMsgTxt("Maximum number of levels is zero; no decomposition can be performed!");
+      return;
+    }
+  }
+  /* Check the ROW dimension of input */
+  if(m > 1){
+    mtest = (double) m/pow(2.0, (double) L);
+    if (!isint(mtest))
+      mexErrMsgTxt("The matrix row dimension must be of size m*2^(L)");
+  }
+  /* Check the COLUMN dimension of input */
+  if(n > 1){
+    ntest = (double) n/pow(2.0, (double) L);
+    if (!isint(ntest))
+      mexErrMsgTxt("The matrix column dimension must be of size n*2^(L)");
+  }
+  plhs[0] = mxCreateDoubleMatrix(m,n,mxREAL);
+  x = mxGetPr(plhs[0]);
+  plhs[1] = mxCreateDoubleMatrix(1,1,mxREAL);
+  Lr = mxGetPr(plhs[1]);
+  *Lr = L;
+  MIDWT(x, m, n, h, lh, L, y);
+}
+
+#define mat(a, i, j) (*(a + (m*(j)+i)))  /* macro for matrix indices */
+
+
+#ifdef __STDC__
+MIDWT(double *x, intptr_t m, intptr_t n, double *h, intptr_t lh, intptr_t L, double *y)
+#else
+MIDWT(x, m, n, h, lh, L, y)
+double *x, *h, *y;
+intptr_t m, n, lh, L;
+#endif
+{
+  double  *g0, *g1, *ydummyl, *ydummyh, *xdummy;
+  intptr_t i, j;
+  intptr_t actual_L, actual_m, actual_n, r_o_a, c_o_a, ir, ic, lhm1, lhhm1, sample_f;
+  xdummy = (double *)mxCalloc(max(m,n),sizeof(double));
+  ydummyl = (double *)mxCalloc(max(m,n)+lh/2-1,sizeof(double));
+  ydummyh = (double *)(intptr_t)mxCalloc(max(m,n)+lh/2-1,sizeof(double));
+  g0 = (double *)(intptr_t)mxCalloc(lh,sizeof(double));
+  g1 = (double *)(intptr_t)mxCalloc(lh,sizeof(double));
+
+  if (n==1){
+    n = m;
+    m = 1;
+  }
+  /* synthesis lowpass and highpass */
+  for (i=0; i<lh; i++){
+    g0[i] = h[i];
+    g1[i] = h[lh-i-1];
+  }
+  for (i=1; i<=lh; i+=2)
+    g1[i] = -g1[i];
+  
+  lhm1 = lh - 1;
+  lhhm1 = lh/2 - 1;
+  /* 2^L */
+  sample_f = 1;
+  for (i=1; i<L; i++)
+    sample_f = sample_f*2;
+  
+  if (m>1)
+    actual_m = m/sample_f;
+  else 
+    actual_m = 1;
+  actual_n = n/sample_f;
+
+  for (i=0; i<(m*n); i++)
+    x[i] = y[i];
+  
+  /* main loop */
+  for (actual_L=L; actual_L >= 1; actual_L--){
+    r_o_a = actual_m/2;
+    c_o_a = actual_n/2;
+    
+    /* go by columns in case of a 2D signal*/
+    if (m>1){
+      for (ic=0; ic<actual_n; ic++){            /* loop over column */
+	/* store in dummy variables */
+	ir = r_o_a;
+	for (i=0; i<r_o_a; i++){    
+	  ydummyl[i+lhhm1] = mat(x, i, ic);  
+	  ydummyh[i+lhhm1] = mat(x, ir++, ic);  
+	}
+	/* perform filtering lowpass and highpass*/
+	bpsconv(xdummy, r_o_a, g0, g1, lhm1, lhhm1, ydummyl, ydummyh); 
+	/* restore dummy variables in matrix */
+	for (i=0; i<actual_m; i++)
+	  mat(x, i, ic) = xdummy[i];  
+      }
+    }
+    /* go by rows */
+    for (ir=0; ir<actual_m; ir++){            /* loop over rows */
+      /* store in dummy variable */
+      ic = c_o_a;
+      for  (i=0; i<c_o_a; i++){    
+	ydummyl[i+lhhm1] = mat(x, ir, i);  
+	ydummyh[i+lhhm1] = mat(x, ir, ic++);  
+      } 
+      /* perform filtering lowpass and highpass*/
+      bpsconv(xdummy, c_o_a, g0, g1, lhm1, lhhm1, ydummyl, ydummyh); 
+      /* restore dummy variables in matrices */
+      for (i=0; i<actual_n; i++)
+        mat(x, ir, i) = xdummy[i];  
+    }  
+    if (m==1)
+      actual_m = 1;
+    else
+      actual_m = actual_m*2;
+    actual_n = actual_n*2;
+  }
+}
+
+#ifdef __STDC__
+bpsconv(double *x_out, intptr_t lx, double *g0, double *g1, intptr_t lhm1, 
+	intptr_t lhhm1, double *x_inl, double *x_inh)
+#else
+bpsconv(x_out, lx, g0, g1, lhm1, lhhm1, x_inl, x_inh)
+double *x_inl, *x_inh, *g0, *g1, *x_out;
+intptr_t lx, lhm1, lhhm1;
+#endif
+{
+  intptr_t i, j, ind, tj;
+  double x0, x1;
+
+  for (i=lhhm1-1; i > -1; i--){
+    x_inl[i] = x_inl[lx+i];
+    x_inh[i] = x_inh[lx+i];
+  }
+  ind = 0;
+  for (i=0; i<(lx); i++){
+    x0 = 0;
+    x1 = 0;
+    tj = -2;
+    for (j=0; j<=lhhm1; j++){
+      tj+=2;
+      x0 = x0 + x_inl[i+j]*g0[lhm1-1-tj] + x_inh[i+j]*g1[lhm1-1-tj] ;
+      x1 = x1 + x_inl[i+j]*g0[lhm1-tj] + x_inh[i+j]*g1[lhm1-tj] ;
+    }
+    x_out[ind++] = x0;
+    x_out[ind++] = x1;
+  }
+}