Skip to content

I
imagej-elphel
Commit 6d24709c authored by Andrey Filippov's avatar Andrey Filippov
Browse files
Options

Merge branch 'dct' of git@git.elphel.com:Elphel/imagej-elphel.git into dct

parents 79eb3283 a91b3ac6
Hide whitespace changes
Inline Side-by-side
Showing with 1663 additions and 814 deletions
src/main/java/DttRad2.java
View file @ 6d24709c
...@@ -3,14 +3,14 @@ ...@@ -3,14 +3,14 @@
** DttRad2 - Calculate DCT types II and IV for n=2^t and n*n 2-d ** DttRad2 - Calculate DCT types II and IV for n=2^t and n*n 2-d
** also DST-IV and some other related transforms ** also DST-IV and some other related transforms
** **
** Uses algorithm described in ** Uses algorithm described in
** Plonka, Gerlind, and Manfred Tasche. "Fast and numerically stable algorithms for discrete cosine transforms." ** Plonka, Gerlind, and Manfred Tasche. "Fast and numerically stable algorithms for discrete cosine transforms."
** Linear algebra and its applications 394 (2005): 309-345. ** Linear algebra and its applications 394 (2005): 309-345.
** **
** Copyright (C) 2016 Elphel, Inc. ** Copyright (C) 2016 Elphel, Inc.
** **
** -----------------------------------------------------------------------------** ** -----------------------------------------------------------------------------**
** **
** DttRad2.java is free software: you can redistribute it and/or modify ** DttRad2.java is free software: you can redistribute it and/or modify
** it under the terms of the GNU General Public License as published by ** it under the terms of the GNU General Public License as published by
** the Free Software Foundation, either version 3 of the License, or ** the Free Software Foundation, either version 3 of the License, or
...@@ -31,26 +31,37 @@ public class DttRad2 { ...@@ -31,26 +31,37 @@ public class DttRad2 {
int N = 0; int N = 0;
double [][][] CII= null; double [][][] CII= null;
double [][][] CIIe= null; // alternative matrix with all coefficients the same (non-orthogonal, but matching DFT) double [][][] CIIe= null; // alternative matrix with all coefficients the same (non-orthogonal, but matching DFT)
double [][][] CIIIe= null; // alternative matrix with k0=1/2, k(n-1) = 1/2 (non-orthogonal, but matching DFT) double [][][] CIIIe= null; // alternative matrix with k0=1/2, k(n-1) = 1/2 (non-orthogonal, but matching DFT)
double [][][] SIIe= null; // alternative matrix with all coefficients the same (non-orthogonal, but matching DFT) double [][][] SIIe= null; // alternative matrix with all coefficients the same (non-orthogonal, but matching DFT)
double [][][] SIIIe= null; // alternative matrix with k0=1/2, k(n-1) = 1/2 (non-orthogonal, but matching DFT) double [][][] SIIIe= null; // alternative matrix with k0=1/2, k(n-1) = 1/2 (non-orthogonal, but matching DFT)
double [][][] CIV= null; double [][][] CIV= null;
double [][][] SIV= null; double [][][] SIV= null;
double [][] CN1=null; double [][] CN1=null;
double [][] SN1=null; double [][] SN1=null;
double COSPI_1_8_SQRT2 = Math.cos(Math.PI/8)*Math.sqrt(2.0); double COSPI_1_8_SQRT2 = Math.cos(Math.PI/8)*Math.sqrt(2.0);
double COSPI_3_8_SQRT2 = Math.cos(3*Math.PI/8)*Math.sqrt(2.0); double COSPI_3_8_SQRT2 = Math.cos(3*Math.PI/8)*Math.sqrt(2.0);
double sqrt2 = Math.sqrt(2.0); double sqrt2 = Math.sqrt(2.0);
double sqrt1_2 = 1/sqrt2; double sqrt1_2 = 1/sqrt2;
double [] hwindow = null; // half window double [] hwindow = null; // half window
int [][] fold_index = null; // index of the source item in 2nx2n array input to mdct_2d. int [][] fold_index = null; // index of the source item in 2nx2n array input to mdct_2d.
// First index (0..n^2-1) index in the folded array (dct-iV input) // First index (0..n^2-1) index in the folded array (dct-iV input)
// Second index(0..3) - item to add (2 vertical, 2 - horizontal) // Second index(0..3) - item to add (2 vertical, 2 - horizontal)
double [][][] fold_k = null; // First index - mode: 0 - CC 1: SC, 2: CS, 3: SS. Other indices matching fold_index items. Each is a product of 2 window coefficients and sign double [][][] fold_k = null; // First index - mode: 0 - CC 1: SC, 2: CS, 3: SS. Other indices matching fold_index items. Each is a product of 2 window coefficients and sign
int [] unfold_index = null; // index for each element of idct(2nx2n) int [] unfold_index = null; // index for each element of idct(2nx2n)
double [][] unfold_k = null; // First index - mode: 0 - CC 1: SC, 2: CS, 3: SS. Other indices matching unfold_index items. Each is a product of 2 window coefficients and sign double [][] unfold_k = null; // First index - mode: 0 - CC 1: SC, 2: CS, 3: SS. Other indices matching unfold_index items. Each is a product of 2 window coefficients and sign
public int [][] getFoldIndex(){
return fold_index;
}
public int [] getUnfoldIndex(){
return unfold_index;
}
public double [][][] getFoldK(){
return fold_k;
}
public DttRad2 (int maxN){ // n - maximal public DttRad2 (int maxN){ // n - maximal
setup_arrays(maxN); // always setup arrays for fast calculations setup_arrays(maxN); // always setup arrays for fast calculations
} }
...@@ -71,21 +82,21 @@ public class DttRad2 { ...@@ -71,21 +82,21 @@ public class DttRad2 {
for (int i = 0; i < y.length ; i++) y[i] *= scale; for (int i = 0; i < y.length ; i++) y[i] *= scale;
return y; return y;
} }
public double [] dst_iv(double[] x){ public double [] dst_iv(double[] x){
double [] xr= new double[x.length]; double [] xr= new double[x.length];
int j= x.length-1; int j= x.length-1;
for (int i=0; i < x.length;i++) xr[i] = x[j--]; for (int i=0; i < x.length;i++) xr[i] = x[j--];
double [] y= _dctiv_recurs(xr); double [] y= _dctiv_recurs(xr);
double scale = 1.0/Math.sqrt(x.length); double scale = 1.0/Math.sqrt(x.length);
for (int i = 0; i < y.length ; i++) { for (int i = 0; i < y.length ; i++) {
y[i] *= scale; y[i] *= scale;
scale = -scale; scale = -scale;
} }
return y; return y;
} }
// For index in dct-iv input (0..n-1) get 2 variants of index in mdct input array (0..2*n-1) // For index in dct-iv input (0..n-1) get 2 variants of index in mdct input array (0..2*n-1)
// second index : 0 - index in X array 2*n long // second index : 0 - index in X array 2*n long
// 1 - window index (0..n-1), [0] - minimal, [n-1] - max // 1 - window index (0..n-1), [0] - minimal, [n-1] - max
...@@ -104,7 +115,7 @@ public class DttRad2 { ...@@ -104,7 +115,7 @@ public class DttRad2 {
ind[0][3] = 1; ind[0][3] = 1;
ind[0][4] = n1 - x -1; ind[0][4] = n1 - x -1;
ind[0][5] = -1; // c - window derivative over shift is negative ind[0][5] = -1; // c - window derivative over shift is negative
ind[1][0] = n + n1 + x; // C: -d, S: -d ind[1][0] = n + n1 + x; // C: -d, S: -d
ind[1][1] = n1 - x - 1; ind[1][1] = n1 - x - 1;
ind[1][2] = -1; ind[1][2] = -1;
...@@ -120,7 +131,7 @@ public class DttRad2 { ...@@ -120,7 +131,7 @@ public class DttRad2 {
ind[0][3] = 1; ind[0][3] = 1;
ind[0][4] = n - x - 1; ind[0][4] = n - x - 1;
ind[0][5] = 1; // a - window derivative over shift is positive ind[0][5] = 1; // a - window derivative over shift is positive
ind[1][0] = n - x - 1; // C: -bR, S: +bR ind[1][0] = n - x - 1; // C: -bR, S: +bR
ind[1][1] = n - x - 1; ind[1][1] = n - x - 1;
ind[1][2] = -1; ind[1][2] = -1;
...@@ -163,7 +174,7 @@ public class DttRad2 { ...@@ -163,7 +174,7 @@ public class DttRad2 {
} }
for (int mode = 0; mode<4; mode++){ for (int mode = 0; mode<4; mode++){
for (int k = 0; k<4;k++) { for (int k = 0; k<4;k++) {
fold_k[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1]; fold_k[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1];
} }
} }
} }
...@@ -175,9 +186,21 @@ public class DttRad2 { ...@@ -175,9 +186,21 @@ public class DttRad2 {
fi[0][0],fi[0][1],fi[0][2],fi[0][3], fi[0][0],fi[0][1],fi[0][2],fi[0][3],
fi[1][0],fi[1][1],fi[1][2],fi[1][3], hwindow[fi[0][1]], hwindow[fi[1][1]])); fi[1][0],fi[1][1],fi[1][2],fi[1][3], hwindow[fi[0][1]], hwindow[fi[1][1]]));
} }
for (int i = 0; i < n*n; i++){
System.out.println(String.format("%3x: %6x %6x %6x %6x",i,fold_index[i][0],fold_index[i][1],fold_index[i][2],fold_index[i][3]));
// System.out.println(String.format(" : %8.5f %8.5f %8.5f %8.5f", fold_k[0][i][0], fold_k[0][i][1], fold_k[0][i][2], fold_k[0][i][3]));
// System.out.println(String.format(" : %8.5f %8.5f %8.5f %8.5f", fold_k[1][i][0], fold_k[1][i][1], fold_k[1][i][2], fold_k[1][i][3]));
// System.out.println(String.format(" : %8.5f %8.5f %8.5f %8.5f", fold_k[2][i][0], fold_k[2][i][1], fold_k[2][i][2], fold_k[2][i][3]));
// System.out.println(String.format(" : %8.5f %8.5f %8.5f %8.5f", fold_k[3][i][0], fold_k[3][i][1], fold_k[3][i][2], fold_k[3][i][3]));
System.out.println(String.format(" : %2d %2d %2d %2d", (fold_k[0][i][0]<0)?-1:1, (fold_k[0][i][1]<0)?-1:1, (fold_k[0][i][2]<0)?-1:1, (fold_k[0][i][3]<0)?-1:1));
System.out.println(String.format(" : %2d %2d %2d %2d", (fold_k[1][i][0]<0)?-1:1, (fold_k[1][i][1]<0)?-1:1, (fold_k[1][i][2]<0)?-1:1, (fold_k[1][i][3]<0)?-1:1));
System.out.println(String.format(" : %2d %2d %2d %2d", (fold_k[2][i][0]<0)?-1:1, (fold_k[2][i][1]<0)?-1:1, (fold_k[2][i][2]<0)?-1:1, (fold_k[2][i][3]<0)?-1:1));
System.out.println(String.format(" : %2d %2d %2d %2d", (fold_k[3][i][0]<0)?-1:1, (fold_k[3][i][1]<0)?-1:1, (fold_k[3][i][2]<0)?-1:1, (fold_k[3][i][3]<0)?-1:1));
}
} }
} }
public double [][][] get_fold_2d( public double [][][] get_fold_2d(
double scale_hor, double scale_hor,
double scale_vert) double scale_vert)
...@@ -189,7 +212,7 @@ public class DttRad2 { ...@@ -189,7 +212,7 @@ public class DttRad2 {
double scale_hor, double scale_hor,
double scale_vert) double scale_vert)
{ // n - DCT and window size { // n - DCT and window size
double [] hwindow_h = new double[n]; double [] hwindow_h = new double[n];
double [] hwindow_v = new double[n]; double [] hwindow_v = new double[n];
double f = Math.PI/(2.0*n); double f = Math.PI/(2.0*n);
...@@ -213,7 +236,7 @@ public class DttRad2 { ...@@ -213,7 +236,7 @@ public class DttRad2 {
vert_k[0][1] = fi[1][2] * hwindow_v[fi[1][1]]; // use cosine sign vert_k[0][1] = fi[1][2] * hwindow_v[fi[1][1]]; // use cosine sign
vert_k[1][0] = fi[0][3] * hwindow_v[fi[0][1]]; // use sine sign vert_k[1][0] = fi[0][3] * hwindow_v[fi[0][1]]; // use sine sign
vert_k[1][1] = fi[1][3] * hwindow_v[fi[1][1]]; // use sine sign vert_k[1][1] = fi[1][3] * hwindow_v[fi[1][1]]; // use sine sign
for (int j = 0; j < n; j++ ){ for (int j = 0; j < n; j++ ){
fi = get_fold_indices(j,n); fi = get_fold_indices(j,n);
hor_ind[0] = fi[0][0]; hor_ind[0] = fi[0][0];
...@@ -222,12 +245,12 @@ public class DttRad2 { ...@@ -222,12 +245,12 @@ public class DttRad2 {
hor_k[0][1] = fi[1][2] * hwindow_h[fi[1][1]]; // use cosine sign hor_k[0][1] = fi[1][2] * hwindow_h[fi[1][1]]; // use cosine sign
hor_k[1][0] = fi[0][3] * hwindow_h[fi[0][1]]; // use sine sign hor_k[1][0] = fi[0][3] * hwindow_h[fi[0][1]]; // use sine sign
hor_k[1][1] = fi[1][3] * hwindow_h[fi[1][1]]; // use sine sign hor_k[1][1] = fi[1][3] * hwindow_h[fi[1][1]]; // use sine sign
int indx = n*i + j; int indx = n*i + j;
for (int mode = 0; mode<4; mode++){ for (int mode = 0; mode<4; mode++){
for (int k = 0; k<4;k++) { for (int k = 0; k<4;k++) {
fold_sk[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1]; fold_sk[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1];
} }
} }
} }
...@@ -239,19 +262,20 @@ public class DttRad2 { ...@@ -239,19 +262,20 @@ public class DttRad2 {
public double [][][] get_shifted_fold_2d( public double [][][] get_shifted_fold_2d(
int n, int n,
double shift_hor, double shift_hor,
double shift_vert) double shift_vert,
int debugLevel)
{ // n - DCT and window size { // n - DCT and window size
int n2 = 2* n;
double [][][] fold_sk = new double[4][n*n][4]; double [][][] fold_sk = new double[4][n*n][4];
int [] vert_ind = new int[2]; int [] vert_ind = new int[2];
double [][] vert_k = new double[2][2]; double [][] vert_k = new double[2][2];
int [] hor_ind = new int[2]; int [] hor_ind = new int[2];
double [][] hor_k = new double[2][2]; double [][] hor_k = new double[2][2];
double ahc = Math.cos(Math.PI/16*shift_hor); double ahc = Math.cos(Math.PI/n2*shift_hor);
double ahs = Math.sin(Math.PI/16*shift_hor); double ahs = Math.sin(Math.PI/n2*shift_hor);
double avc = Math.cos(Math.PI/16*shift_vert); double avc = Math.cos(Math.PI/n2*shift_vert);
double avs = Math.sin(Math.PI/16*shift_vert); double avs = Math.sin(Math.PI/n2*shift_vert);
int [][] fi; int [][] fi;
for (int i = 0; i < n; i++ ){ for (int i = 0; i < n; i++ ){
fi = get_fold_indices(i,n); fi = get_fold_indices(i,n);
...@@ -263,24 +287,97 @@ public class DttRad2 { ...@@ -263,24 +287,97 @@ public class DttRad2 {
vert_k[0][1] = fi[1][2] * vw1; // use cosine sign vert_k[0][1] = fi[1][2] * vw1; // use cosine sign
vert_k[1][0] = fi[0][3] * vw0; // use sine sign vert_k[1][0] = fi[0][3] * vw0; // use sine sign
vert_k[1][1] = fi[1][3] * vw1; // use sine sign vert_k[1][1] = fi[1][3] * vw1; // use sine sign
for (int j = 0; j < n; j++ ){ for (int j = 0; j < n; j++ ){
fi = get_fold_indices(j,n); fi = get_fold_indices(j,n);
hor_ind[0] = fi[0][0]; hor_ind[0] = fi[0][0];
hor_ind[1] = fi[1][0]; hor_ind[1] = fi[1][0];
double hw0 = ahc*hwindow[fi[0][1]] + ahs*hwindow[fi[0][4]]*fi[0][5]; double hw0 = ahc*hwindow[fi[0][1]] + ahs*hwindow[fi[0][4]]*fi[0][5];
double hw1 = ahc*hwindow[fi[1][1]] + ahs*hwindow[fi[1][4]]*fi[1][5]; double hw1 = ahc*hwindow[fi[1][1]] + ahs*hwindow[fi[1][4]]*fi[1][5];
hor_k[0][0] = fi[0][2] * hw0; // use cosine sign
hor_k[0][1] = fi[1][2] * hw1; // use cosine sign
hor_k[1][0] = fi[0][3] * hw0; // use sine sign
hor_k[1][1] = fi[1][3] * hw1; // use sine sign
int indx = n*i + j;
for (int mode = 0; mode<4; mode++){
for (int k = 0; k<4;k++) {
fold_sk[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1];
}
}
}
}
return fold_sk;
}
// Generate (slightly - up to +/- 0.5) shifted window for standard sin window (derivative uses same table)
// only for mode=1 (sin window)
public double [][][] get_shifted_fold_2d_direct(
int n,
double shift_hor,
double shift_vert,
int debugLevel) // fpga scale (1 << 17 -1)
{ // n - DCT and window size
int n2 = 2 * n;
double [][][] fold_sk = new double[4][n*n][4];
int [] vert_ind = new int[2];
double [][] vert_k = new double[2][2];
int [] hor_ind = new int[2];
double [][] hor_k = new double[2][2];
// double ahc = Math.cos(Math.PI/n2*shift_hor);
// double ahs = Math.sin(Math.PI/n2*shift_hor);
// double avc = Math.cos(Math.PI/n2*shift_vert);
// double avs = Math.sin(Math.PI/n2*shift_vert);
double [] wnd_hor = new double[n2];
double [] wnd_vert = new double[n2];
double f = Math.PI/n2;
for (int i = 0; i < n2; i++ ){
wnd_hor[i] = Math.sin(f * (i+ 0.5 +shift_hor));
wnd_vert[i] = Math.sin(f * (i+ 0.5 +shift_vert));
}
if (debugLevel > 0){
System.out.println("Window (index,hor,vert) ");
for (int i = 0; i <16; i++) System.out.print(String.format("%5x ", i)); System.out.println();
for (int i = 0; i <16; i++) System.out.print(String.format("%5x ", (int) Math.round(debugLevel * wnd_hor[i]))); System.out.println();
for (int i = 0; i <16; i++) System.out.print(String.format("%5x ", (int) Math.round(debugLevel * wnd_vert[i]))); System.out.println();
System.out.println();
}
int [][] fi;
for (int i = 0; i < n; i++ ){
fi = get_fold_indices(i,n);
vert_ind[0] = fi[0][0];
vert_ind[1] = fi[1][0];
// double vw0 = avc*hwindow[fi[0][1]] + avs*hwindow[fi[0][4]]*fi[0][5];
// double vw1 = avc*hwindow[fi[1][1]] + avs*hwindow[fi[1][4]]*fi[1][5];
double vw0 = wnd_vert[vert_ind[0]];
double vw1 = wnd_vert[vert_ind[1]];
vert_k[0][0] = fi[0][2] * vw0; // use cosine sign
vert_k[0][1] = fi[1][2] * vw1; // use cosine sign
vert_k[1][0] = fi[0][3] * vw0; // use sine sign
vert_k[1][1] = fi[1][3] * vw1; // use sine sign
for (int j = 0; j < n; j++ ){
fi = get_fold_indices(j,n);
hor_ind[0] = fi[0][0];
hor_ind[1] = fi[1][0];
// double hw0 = ahc*hwindow[fi[0][1]] + ahs*hwindow[fi[0][4]]*fi[0][5];
// double hw1 = ahc*hwindow[fi[1][1]] + ahs*hwindow[fi[1][4]]*fi[1][5];
double hw0 = wnd_hor[hor_ind[0]];
double hw1 = wnd_hor[hor_ind[1]];
hor_k[0][0] = fi[0][2] * hw0; // use cosine sign hor_k[0][0] = fi[0][2] * hw0; // use cosine sign
hor_k[0][1] = fi[1][2] * hw1; // use cosine sign hor_k[0][1] = fi[1][2] * hw1; // use cosine sign
hor_k[1][0] = fi[0][3] * hw0; // use sine sign hor_k[1][0] = fi[0][3] * hw0; // use sine sign
hor_k[1][1] = fi[1][3] * hw1; // use sine sign hor_k[1][1] = fi[1][3] * hw1; // use sine sign
int indx = n*i + j; int indx = n*i + j;
for (int mode = 0; mode<4; mode++){ for (int mode = 0; mode<4; mode++){
for (int k = 0; k<4;k++) { for (int k = 0; k<4;k++) {
fold_sk[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1]; fold_sk[mode][indx][k] = vert_k[(mode>>1) &1][(k>>1) & 1] * hor_k[mode &1][k & 1];
} }
} }
} }
...@@ -288,14 +385,14 @@ public class DttRad2 { ...@@ -288,14 +385,14 @@ public class DttRad2 {
return fold_sk; return fold_sk;
} }
// return index and two signs (c,s) for 1-d imdct. x is index (0..2*n-1) of the imdct array, value is sign * (idct_index+1), // return index and two signs (c,s) for 1-d imdct. x is index (0..2*n-1) of the imdct array, value is sign * (idct_index+1),
// where idct_index (0..n-1) is index in the dct-iv array // where idct_index (0..n-1) is index in the dct-iv array
private int [] get_unfold_index_signs(int x, int n){ private int [] get_unfold_index_signs(int x, int n){
int n1 = n>>1; int n1 = n>>1;
int segm = x / n1; int segm = x / n1;
x = x % n1; x = x % n1;
int [] is2 = new int[3]; int [] is2 = new int[3];
switch (segm){ switch (segm){
case 0: is2[0] = x + n1; is2[1]= 1; is2[2] = 1; return is2; // return 1+ (x + n1); case 0: is2[0] = x + n1; is2[1]= 1; is2[2] = 1; return is2; // return 1+ (x + n1);
case 1: is2[0] = n - x - 1; is2[1]= -1; is2[2] = 1; return is2; // return -(n - x); case 1: is2[0] = n - x - 1; is2[1]= -1; is2[2] = 1; return is2; // return -(n - x);
...@@ -313,18 +410,18 @@ public class DttRad2 { ...@@ -313,18 +410,18 @@ public class DttRad2 {
int [] is2_vert = get_unfold_index_signs(i,n); int [] is2_vert = get_unfold_index_signs(i,n);
double [] k_vert = {is2_vert[1]*hwindow[(i < n)?i:n2 -i -1], is2_vert[2]*hwindow[(i < n)?i:n2 -i -1]}; double [] k_vert = {is2_vert[1]*hwindow[(i < n)?i:n2 -i -1], is2_vert[2]*hwindow[(i < n)?i:n2 -i -1]};
int index_vert = is2_vert[0] * n; int index_vert = is2_vert[0] * n;
for (int j = 0; j < 2*n; j++ ){ for (int j = 0; j < 2*n; j++ ){
int [] is2_hor = get_unfold_index_signs(j,n); int [] is2_hor = get_unfold_index_signs(j,n);
int index_hor = is2_hor[0]; int index_hor = is2_hor[0];
double [] k_hor = {is2_hor[1] * hwindow[(j < n)?j:n2 -j -1], is2_hor[2] * hwindow[(j < n)?j:n2 -j -1]}; double [] k_hor = {is2_hor[1] * hwindow[(j < n)?j:n2 -j -1], is2_hor[2] * hwindow[(j < n)?j:n2 -j -1]};
unfold_index[n2*i+j]=(index_vert+index_hor); unfold_index[n2*i+j]=(index_vert+index_hor);
for (int mode = 0; mode < 4; mode++){ for (int mode = 0; mode < 4; mode++){
unfold_k[mode][n2*i+j] = k_vert[(mode>>1) &1]*k_hor[mode &1]; unfold_k[mode][n2*i+j] = k_vert[(mode>>1) &1]*k_hor[mode &1];
} }
if (n < 8) System.out.print(String.format("%4d", unfold_index[n2*i+j])); if (n < 8) System.out.print(String.format("%4d", unfold_index[n2*i+j]));
} }
if (n < 8) System.out.println(); if (n < 8) System.out.println();
} }
...@@ -333,14 +430,14 @@ public class DttRad2 { ...@@ -333,14 +430,14 @@ public class DttRad2 {
System.out.println(i+"=>"+get_unfold_index_signs(i,n)[0]+", "+get_unfold_index_signs(i,n)[1]+", "+get_unfold_index_signs(i,n)[2]); System.out.println(i+"=>"+get_unfold_index_signs(i,n)[0]+", "+get_unfold_index_signs(i,n)[1]+", "+get_unfold_index_signs(i,n)[2]);
} }
} }
} }
public double [] dttt_iv(double [] x){ public double [] dttt_iv(double [] x){
return dttt_iv(x, 0, 1 << (ilog2(x.length)/2)); return dttt_iv(x, 0, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iv(double [] x, int mode){ public double [] dttt_iv(double [] x, int mode){
return dttt_iv(x, mode, 1 << (ilog2(x.length)/2)); return dttt_iv(x, mode, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iv(double [] x, int mode, int n){ // mode 0 - dct,dct 1:dst,dct, 2: dct, dst, 3: dst,dst public double [] dttt_iv(double [] x, int mode, int n){ // mode 0 - dct,dct 1:dst,dct, 2: dct, dst, 3: dst,dst
double [] y = new double [n*n]; double [] y = new double [n*n];
...@@ -349,7 +446,7 @@ public class DttRad2 { ...@@ -349,7 +446,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
System.arraycopy(x, n*i, line, 0, n); System.arraycopy(x, n*i, line, 0, n);
line = ((mode & 1)!=0)? dst_iv(line):dct_iv(line); line = ((mode & 1)!=0)? dst_iv(line):dct_iv(line);
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
} }
// second (vertical) pass // second (vertical) pass
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
...@@ -359,9 +456,54 @@ public class DttRad2 { ...@@ -359,9 +456,54 @@ public class DttRad2 {
} }
return y; return y;
} }
public double [] dttt_iv(double [] x, int mode, int n, double scale, int mask){ // mode 0 - dct,dct 1:dst,dct, 2: dct, dst, 3: dst,dst
double [] y = new double [n*n];
double [] line = new double[n];
// first (horizontal) pass
System.out.println("dttt_iv, mode="+mode);
System.out.println("horizontal pass "+(((mode & 1)!=0)? "dst_iv":"dct_iv"));
for (int i = 0; i<n; i++){
System.arraycopy(x, n*i, line, 0, n);
line = ((mode & 1)!=0)? dst_iv(line):dct_iv(line);
System.out.print(String.format("%02x: ", i));
for (int j=0; j < n;j++) {
int di = ((int) Math.round(x[n*i+j]*scale)) & mask;
System.out.print(String.format("%07x ", di));
}
System.out.print(" ");
for (int j=0; j < n;j++) {
int di = ((int) Math.round(line[j] * scale)) & mask;
System.out.print(String.format("%07x ", di));
}
System.out.println();
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
}
// second (vertical) pass
System.out.println("vertical pass "+(((mode & 2)!=0)? "dst_iv":"dct_iv")+" (after transpose)");
for (int i = 0; i<n; i++){
System.arraycopy(y, n*i, line, 0, n);
line = ((mode & 2)!=0)? dst_iv(line):dct_iv(line);
System.out.print(String.format("%02x: ", i));
for (int j=0; j < n;j++) {
int di = ((int) Math.round(y[n*i+j]*scale*0.5)) & mask;
System.out.print(String.format("%07x ", di));
}
System.out.print(" ");
for (int j=0; j < n;j++) {
int di = ((int) Math.round(line[j] * scale)) & mask;
System.out.print(String.format("%07x ", di));
}
System.out.println();
System.arraycopy(line, 0, y, n*i, n);
}
return y;
}
public double [] dttt_ii(double [] x){ public double [] dttt_ii(double [] x){
return dttt_ii(x, 1 << (ilog2(x.length)/2)); return dttt_ii(x, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_ii(double [] x, int n){ public double [] dttt_ii(double [] x, int n){
...@@ -371,7 +513,7 @@ public class DttRad2 { ...@@ -371,7 +513,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
System.arraycopy(x, n*i, line, 0, n); System.arraycopy(x, n*i, line, 0, n);
line = dctii_direct(line); line = dctii_direct(line);
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
} }
// second (vertical) pass // second (vertical) pass
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
...@@ -383,14 +525,14 @@ public class DttRad2 { ...@@ -383,14 +525,14 @@ public class DttRad2 {
} }
public double [] dttt_iie(double [] x){ public double [] dttt_iie(double [] x){
return dttt_iie(x,0, 1 << (ilog2(x.length)/2)); return dttt_iie(x,0, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iie(double [] x, int mode){ public double [] dttt_iie(double [] x, int mode){
return dttt_iie(x, mode, 1 << (ilog2(x.length)/2)); return dttt_iie(x, mode, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iie(double [] x, int mode, int n){ public double [] dttt_iie(double [] x, int mode, int n){
double [] y = new double [n*n]; double [] y = new double [n*n];
double [] line = new double[n]; double [] line = new double[n];
// first (horizontal) pass // first (horizontal) pass
...@@ -398,7 +540,7 @@ public class DttRad2 { ...@@ -398,7 +540,7 @@ public class DttRad2 {
System.arraycopy(x, n*i, line, 0, n); System.arraycopy(x, n*i, line, 0, n);
// line = dctiie_direct(line); // line = dctiie_direct(line);
line = ((mode & 1)!=0)? dstiie_direct(line):dctiie_direct(line); line = ((mode & 1)!=0)? dstiie_direct(line):dctiie_direct(line);
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
} }
// second (vertical) pass // second (vertical) pass
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
...@@ -409,12 +551,12 @@ public class DttRad2 { ...@@ -409,12 +551,12 @@ public class DttRad2 {
} }
return y; return y;
} }
public double [] dttt_iii(double [] x){ public double [] dttt_iii(double [] x){
return dttt_iii(x, 1 << (ilog2(x.length)/2)); return dttt_iii(x, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iii(double [] x, int n){ public double [] dttt_iii(double [] x, int n){
...@@ -424,7 +566,7 @@ public class DttRad2 { ...@@ -424,7 +566,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
System.arraycopy(x, n*i, line, 0, n); System.arraycopy(x, n*i, line, 0, n);
line = dctiii_direct(line); line = dctiii_direct(line);
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
} }
// second (vertical) pass // second (vertical) pass
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
...@@ -436,10 +578,10 @@ public class DttRad2 { ...@@ -436,10 +578,10 @@ public class DttRad2 {
} }
public double [] dttt_iiie(double [] x){ public double [] dttt_iiie(double [] x){
return dttt_iiie(x,0, 1 << (ilog2(x.length)/2)); return dttt_iiie(x,0, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iiie(double [] x, int mode){ public double [] dttt_iiie(double [] x, int mode){
return dttt_iiie(x, mode, 1 << (ilog2(x.length)/2)); return dttt_iiie(x, mode, 1 << (ilog2(x.length)/2));
} }
public double [] dttt_iiie(double [] x, int mode, int n){ public double [] dttt_iiie(double [] x, int mode, int n){
...@@ -450,7 +592,7 @@ public class DttRad2 { ...@@ -450,7 +592,7 @@ public class DttRad2 {
System.arraycopy(x, n*i, line, 0, n); System.arraycopy(x, n*i, line, 0, n);
// line = dctiiie_direct(line); // line = dctiiie_direct(line);
line = ((mode & 1)!=0)? dstiiie_direct(line):dctiiie_direct(line); line = ((mode & 1)!=0)? dstiiie_direct(line):dctiiie_direct(line);
for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose for (int j=0; j < n;j++) y[j*n+i] =line[j]; // transpose
} }
// second (vertical) pass // second (vertical) pass
for (int i = 0; i<n; i++){ for (int i = 0; i<n; i++){
...@@ -461,14 +603,15 @@ public class DttRad2 { ...@@ -461,14 +603,15 @@ public class DttRad2 {
} }
return y; return y;
} }
public void set_window(){ public void set_window(){
set_window(0); set_window(0);
} }
public void set_window(int mode){ public void set_window(int mode){
set_window(mode, N); set_window(mode, N);
} }
public void set_window(int mode, int len){ public void set_window(int mode, int len){ // using mode==1
// for N=8: sin (pi/32), sin (3*pi/32), sin (5*pi/32), sin (7*pi/32), sin (9*pi/32), sin (11*pi/32), sin (13*pi/32), sin (15*pi/32)
hwindow = new double[len]; hwindow = new double[len];
double f = Math.PI/(2.0*len); double f = Math.PI/(2.0*len);
double sqrt1_2=Math.sqrt(0.5); double sqrt1_2=Math.sqrt(0.5);
...@@ -488,7 +631,7 @@ public class DttRad2 { ...@@ -488,7 +631,7 @@ public class DttRad2 {
set_fold_2d(len); set_fold_2d(len);
set_unfold_2d(len); set_unfold_2d(len);
} }
// get current LT window as a 2d tile (2*size * 2*size) // get current LT window as a 2d tile (2*size * 2*size)
public double [] getWin2d(){ public double [] getWin2d(){
int size = this.hwindow.length; int size = this.hwindow.length;
...@@ -499,16 +642,16 @@ public class DttRad2 { ...@@ -499,16 +642,16 @@ public class DttRad2 {
int ia1 = (size2 - i -1) * size2; int ia1 = (size2 - i -1) * size2;
for (int j=0; j< size; j++){ for (int j=0; j< size; j++){
double d = this.hwindow[i] * this.hwindow[j]; double d = this.hwindow[i] * this.hwindow[j];
rslt [ia0 + j] = d; rslt [ia0 + j] = d;
rslt [ia1 + j] = d; rslt [ia1 + j] = d;
rslt [ia0 + size2 - j -1] = d; rslt [ia0 + size2 - j -1] = d;
rslt [ia1 + size2 - j -1] = d; rslt [ia1 + size2 - j -1] = d;
} }
} }
return rslt; return rslt;
} }
// Convert 2nx2n overlapping tile to n*n for dct-iv // Convert 2nx2n overlapping tile to n*n for dct-iv
public double [] fold_tile(double [] x, int mode) { // x should be 2n*2n public double [] fold_tile(double [] x, int mode) { // x should be 2n*2n
return fold_tile(x, 1 << (ilog2(x.length/4)/2)); return fold_tile(x, 1 << (ilog2(x.length/4)/2));
...@@ -532,19 +675,41 @@ public class DttRad2 { ...@@ -532,19 +675,41 @@ public class DttRad2 {
} }
return y; return y;
} }
public double [] fold_tile_debug(
double [] x,
int n,
int mode, //////
double [][][] fold_k
) { // x should be 2n*2n
System.out.println("fold_tile_debug, mode = "+mode);
double [] y = new double [n*n];
for (int i = 0; i<y.length;i++) {
y[i] = 0;
System.out.print(String.format("%2d: ",i));
for (int k = 0; k < 4; k++){
y[i] += x[fold_index[i][k]] * fold_k[mode][i][k];
System.out.print(String.format("(%f * %f) ", x[fold_index[i][k]], fold_k[mode][i][k]));
if (k < 3) System.out.print("+ ");
}
System.out.println(String.format("= %f", y[i]));
}
return y;
}
public double [] unfold_tile( public double [] unfold_tile(
double [] x, // x should be n*n double [] x, // x should be n*n
int mode) int mode)
{ {
return unfold_tile(x, 1 << (ilog2(x.length)/2), mode); return unfold_tile(x, 1 << (ilog2(x.length)/2), mode);
} }
public double [] unfold_tile( public double [] unfold_tile(
double [] x, // x should be 2n*2n double [] x, // x should be 2n*2n
int n, int n,
int mode) int mode)
{ {
double [] y = new double [4*n*n]; double [] y = new double [4*n*n];
for (int i = 0; i<y.length;i++) { for (int i = 0; i<y.length;i++) {
...@@ -553,7 +718,7 @@ public class DttRad2 { ...@@ -553,7 +718,7 @@ public class DttRad2 {
return y; return y;
} }
public double [] dctii_direct(double[] x){ public double [] dctii_direct(double[] x){
int n = x.length; int n = x.length;
int t = ilog2(n)-1; int t = ilog2(n)-1;
...@@ -564,7 +729,7 @@ public class DttRad2 { ...@@ -564,7 +729,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= CII[t][i][j]*x[j]; y[i]+= CII[t][i][j]*x[j];
} }
} }
return y; return y;
...@@ -580,13 +745,13 @@ public class DttRad2 { ...@@ -580,13 +745,13 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= CIIe[t][i][j]*x[j]; y[i]+= CIIe[t][i][j]*x[j];
} }
} }
return y; return y;
} }
public double [] dctiii_direct(double[] x){ public double [] dctiii_direct(double[] x){
// CIII=transp(CII) // CIII=transp(CII)
int n = x.length; int n = x.length;
...@@ -598,12 +763,12 @@ public class DttRad2 { ...@@ -598,12 +763,12 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= CII[t][j][i]*x[j]; y[i]+= CII[t][j][i]*x[j];
} }
} }
return y; return y;
} }
public double [] dctiiie_direct(double[] x){ public double [] dctiiie_direct(double[] x){
int n = x.length; int n = x.length;
int t = ilog2(n)-1; int t = ilog2(n)-1;
...@@ -614,12 +779,12 @@ public class DttRad2 { ...@@ -614,12 +779,12 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= CIIIe[t][i][j]*x[j]; y[i]+= CIIIe[t][i][j]*x[j];
} }
} }
return y; return y;
} }
public double [] dctiv_direct(double[] x){ public double [] dctiv_direct(double[] x){
int n = x.length; int n = x.length;
int t = ilog2(n)-1; int t = ilog2(n)-1;
...@@ -630,7 +795,7 @@ public class DttRad2 { ...@@ -630,7 +795,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= CIV[t][i][j]*x[j]; y[i]+= CIV[t][i][j]*x[j];
} }
} }
return y; return y;
...@@ -646,7 +811,7 @@ public class DttRad2 { ...@@ -646,7 +811,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= SIIe[t][i][j]*x[j]; y[i]+= SIIe[t][i][j]*x[j];
} }
} }
return y; return y;
...@@ -662,12 +827,12 @@ public class DttRad2 { ...@@ -662,12 +827,12 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= SIIIe[t][i][j]*x[j]; y[i]+= SIIIe[t][i][j]*x[j];
} }
} }
return y; return y;
} }
public double [] dstiv_direct(double[] x){ public double [] dstiv_direct(double[] x){
int n = x.length; int n = x.length;
int t = ilog2(n)-1; int t = ilog2(n)-1;
...@@ -678,7 +843,7 @@ public class DttRad2 { ...@@ -678,7 +843,7 @@ public class DttRad2 {
for (int i = 0; i<n; i++) { for (int i = 0; i<n; i++) {
y[i] = 0.0; y[i] = 0.0;
for (int j = 0; j< n; j++){ for (int j = 0; j< n; j++){
y[i]+= SIV[t][i][j]*x[j]; y[i]+= SIV[t][i][j]*x[j];
} }
} }
return y; return y;
...@@ -689,7 +854,7 @@ public class DttRad2 { ...@@ -689,7 +854,7 @@ public class DttRad2 {
int l = ilog2(N)-1; int l = ilog2(N)-1;
CN1 = new double[l][]; CN1 = new double[l][];
SN1 = new double[l][]; SN1 = new double[l][];
for (int t = 0; t<CN1.length; t++) { for (int t = 0; t<CN1.length; t++) {
int n1 = 2 << t; // for N==3: 2, 4, 8 int n1 = 2 << t; // for N==3: 2, 4, 8
double pi_4n=Math.PI/(8*n1); // n1 = n/2 double pi_4n=Math.PI/(8*n1); // n1 = n/2
...@@ -699,11 +864,11 @@ public class DttRad2 { ...@@ -699,11 +864,11 @@ public class DttRad2 {
CN1[t][k] = Math.cos((2*k+1)*pi_4n); CN1[t][k] = Math.cos((2*k+1)*pi_4n);
SN1[t][k] = Math.sin((2*k+1)*pi_4n); SN1[t][k] = Math.sin((2*k+1)*pi_4n);
} }
} }
} }
private void setup_CII(int maxN){ private void setup_CII(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(CII==null) && (CII.length >= l)) return; if (!(CII==null) && (CII.length >= l)) return;
CII = new double[l][][]; // only needed for direct? Assign only when needed? CII = new double[l][][]; // only needed for direct? Assign only when needed?
...@@ -717,14 +882,14 @@ public class DttRad2 { ...@@ -717,14 +882,14 @@ public class DttRad2 {
if (j==0) ej= Math.sqrt(0.5); if (j==0) ej= Math.sqrt(0.5);
else ej = 1.0; else ej = 1.0;
for (int k = 0; k<n; k++){ for (int k = 0; k<n; k++){
CII[t][j][k] = scale * ej * Math.cos(j*(2*k+1)*pi_2n); CII[t][j][k] = scale * ej * Math.cos(j*(2*k+1)*pi_2n);
} }
} }
} }
} }
private void setup_CIIe(int maxN){ private void setup_CIIe(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(CIIe==null) && (CIIe.length >= l)) return; if (!(CIIe==null) && (CIIe.length >= l)) return;
CIIe = new double[l][][]; // only needed for direct? Assign only when needed? CIIe = new double[l][][]; // only needed for direct? Assign only when needed?
...@@ -735,14 +900,14 @@ public class DttRad2 { ...@@ -735,14 +900,14 @@ public class DttRad2 {
double pi_2n=Math.PI/(2*n); double pi_2n=Math.PI/(2*n);
for (int j=0;j<n; j++){ for (int j=0;j<n; j++){
for (int k = 0; k<n; k++){ for (int k = 0; k<n; k++){
CIIe[t][j][k] = scale * Math.cos(j*(2*k+1)*pi_2n); CIIe[t][j][k] = scale * Math.cos(j*(2*k+1)*pi_2n);
} }
} }
} }
} }
private void setup_CIIIe(int maxN){ private void setup_CIIIe(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(CIIIe==null) && (CIIIe.length >= l)) return; if (!(CIIIe==null) && (CIIIe.length >= l)) return;
CIIIe = new double[l][][]; // only needed for direct? Assign only when needed? CIIIe = new double[l][][]; // only needed for direct? Assign only when needed?
...@@ -757,15 +922,15 @@ public class DttRad2 { ...@@ -757,15 +922,15 @@ public class DttRad2 {
// if (j==0) ej= 0.5; // Math.sqrt(0.5); Should it be this? https://en.wikipedia.org/wiki/Discrete_cosine_transform#DCT-III // if (j==0) ej= 0.5; // Math.sqrt(0.5); Should it be this? https://en.wikipedia.org/wiki/Discrete_cosine_transform#DCT-III
else ej = 1.0; else ej = 1.0;
for (int k = 0; k<n; k++){ for (int k = 0; k<n; k++){
CIIIe[t][k][j] = scale * ej * Math.cos(j*(2*k+1)*pi_2n); CIIIe[t][k][j] = scale * ej * Math.cos(j*(2*k+1)*pi_2n);
} }
} }
} }
} }
private void setup_CIV(int maxN){ private void setup_CIV(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(CIV==null) && (CIV.length >= l)) return; if (!(CIV==null) && (CIV.length >= l)) return;
CIV = new double[l][][]; CIV = new double[l][][];
...@@ -776,17 +941,17 @@ public class DttRad2 { ...@@ -776,17 +941,17 @@ public class DttRad2 {
double pi_4n=Math.PI/(4*n); double pi_4n=Math.PI/(4*n);
for (int j=0;j<n; j++){ for (int j=0;j<n; j++){
for (int k = 0; k < j; k++){ for (int k = 0; k < j; k++){
CIV[t][j][k] = CIV[t][k][j]; CIV[t][j][k] = CIV[t][k][j];
} }
for (int k = j; k<n; k++){ for (int k = j; k<n; k++){
CIV[t][j][k] = scale * Math.cos((2*j+1)*(2*k+1)*pi_4n); CIV[t][j][k] = scale * Math.cos((2*j+1)*(2*k+1)*pi_4n);
} }
} }
} }
} }
private void setup_SIIe(int maxN){ private void setup_SIIe(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(SIIe==null) && (SIIe.length >= l)) return; if (!(SIIe==null) && (SIIe.length >= l)) return;
SIIe = new double[l][][]; // only needed for direct? Assign only when needed? SIIe = new double[l][][]; // only needed for direct? Assign only when needed?
...@@ -797,14 +962,14 @@ public class DttRad2 { ...@@ -797,14 +962,14 @@ public class DttRad2 {
double pi_2n=Math.PI/(2*n); double pi_2n=Math.PI/(2*n);
for (int j=0;j<n; j++){ for (int j=0;j<n; j++){
for (int k = 0; k<n; k++){ for (int k = 0; k<n; k++){
SIIe[t][j][k] = scale * Math.sin((j+1)*(2*k+1)*pi_2n); SIIe[t][j][k] = scale * Math.sin((j+1)*(2*k+1)*pi_2n);
} }
} }
} }
} }
private void setup_SIIIe(int maxN){ private void setup_SIIIe(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(SIIIe==null) && (SIIIe.length >= l)) return; if (!(SIIIe==null) && (SIIIe.length >= l)) return;
SIIIe = new double[l][][]; // only needed for direct? Assign only when needed? SIIIe = new double[l][][]; // only needed for direct? Assign only when needed?
...@@ -819,14 +984,14 @@ public class DttRad2 { ...@@ -819,14 +984,14 @@ public class DttRad2 {
if (j == (n-1)) ej= 0.5; // Math.sqrt(0.5); if (j == (n-1)) ej= 0.5; // Math.sqrt(0.5);
else ej = 1.0; else ej = 1.0;
for (int k = 0; k<n; k++){ for (int k = 0; k<n; k++){
SIIIe[t][k][j] = scale * ej * Math.sin((j+1)*(2*k+1)*pi_2n); SIIIe[t][k][j] = scale * ej * Math.sin((j+1)*(2*k+1)*pi_2n);
} }
} }
} }
} }
private void setup_SIV(int maxN){ private void setup_SIV(int maxN){
if (maxN > N) setup_arrays(maxN); if (maxN > N) setup_arrays(maxN);
int l = ilog2(N); int l = ilog2(N);
if (!(SIV==null) && (SIV.length >= l)) return; if (!(SIV==null) && (SIV.length >= l)) return;
SIV = new double[l][][]; SIV = new double[l][][];
...@@ -837,22 +1002,22 @@ public class DttRad2 { ...@@ -837,22 +1002,22 @@ public class DttRad2 {
double pi_4n=Math.PI/(4*n); double pi_4n=Math.PI/(4*n);
for (int j=0;j<n; j++){ for (int j=0;j<n; j++){
for (int k = 0; k < j; k++){ for (int k = 0; k < j; k++){
SIV[t][j][k] = SIV[t][k][j]; SIV[t][j][k] = SIV[t][k][j];
} }
for (int k = j; k<n; k++){ for (int k = j; k<n; k++){
SIV[t][j][k] = scale * Math.sin((2*j+1)*(2*k+1)*pi_4n); SIV[t][j][k] = scale * Math.sin((2*j+1)*(2*k+1)*pi_4n);
} }
} }
} }
} }
private int ilog2(int n){ private int ilog2(int n){
int i; int i;
for (i=0; n>1; n= n >> 1) i++; for (i=0; n>1; n= n >> 1) i++;
return i; return i;
} }
private double [] _dctii_recurs(double[] x){ private double [] _dctii_recurs(double[] x){
int n = x.length; int n = x.length;
...@@ -898,8 +1063,8 @@ public class DttRad2 { ...@@ -898,8 +1063,8 @@ public class DttRad2 {
} }
double [] v0 = _dctii_recurs(u0); double [] v0 = _dctii_recurs(u0);
double [] v1 = _dctii_recurs(u1); //both cos-II double [] v1 = _dctii_recurs(u1); //both cos-II
double [] w0 = new double [n1]; double [] w0 = new double [n1];
double [] w1 = new double [n1]; double [] w1 = new double [n1];
...@@ -907,9 +1072,9 @@ public class DttRad2 { ...@@ -907,9 +1072,9 @@ public class DttRad2 {
w1[n1-1] = sqrt2 * v1[0]; w1[n1-1] = sqrt2 * v1[0];
for (int j = 0; j< n1; j++){ for (int j = 0; j< n1; j++){
int sgn = (1 - 2* (j & 1)); int sgn = (1 - 2* (j & 1));
if (j > 0) w0[j] = v0[j] - sgn * v1[n1 - j]; if (j > 0) w0[j] = v0[j] - sgn * v1[n1 - j];
if (j < (n1-1)) w1[j] = v0[j+1] - sgn * v1[n1 - j -1]; if (j < (n1-1)) w1[j] = v0[j+1] - sgn * v1[n1 - j -1];
} }
double [] y = new double[n]; double [] y = new double[n];
for (int j = 0; j< n1; j++){ for (int j = 0; j< n1; j++){
...@@ -918,6 +1083,6 @@ public class DttRad2 { ...@@ -918,6 +1083,6 @@ public class DttRad2 {
} }
return y; return y;
} }
} }
src/main/java/EyesisDCT.java
View file @ 6d24709c
...@@ -118,101 +118,6 @@ public class EyesisDCT { ...@@ -118,101 +118,6 @@ public class EyesisDCT {
return kernels != null; return kernels != null;
} }
/// public boolean CLTKernelsAvailable(){
/// return clt_kernels != null;
/// }
/// public boolean geometryCorrectionAvailable(){
/// return geometryCorrection != null;
/// }
/***
public boolean initGeometryCorrection(int debugLevel){
geometryCorrection = new GeometryCorrection();
PixelMapping.SensorData [] sensors = eyesisCorrections.pixelMapping.sensors;
// verify that all sensors have the same distortion parameters
int numSensors = sensors.length;
for (int i = 1; i < numSensors; i++){
if ( (sensors[0].focalLength != sensors[i].focalLength) ||
(sensors[0].distortionC != sensors[i].distortionC) ||
(sensors[0].distortionB != sensors[i].distortionB) ||
(sensors[0].distortionA != sensors[i].distortionA) ||
(sensors[0].distortionA5 != sensors[i].distortionA5) ||
(sensors[0].distortionA6 != sensors[i].distortionA6) ||
(sensors[0].distortionA7 != sensors[i].distortionA7) ||
(sensors[0].distortionA8 != sensors[i].distortionA8) ||
(sensors[0].distortionRadius != sensors[i].distortionRadius) ||
(sensors[0].pixelCorrectionWidth != sensors[i].pixelCorrectionWidth) ||
(sensors[0].pixelCorrectionHeight != sensors[i].pixelCorrectionHeight) ||
(sensors[0].pixelSize != sensors[i].pixelSize)){
System.out.println("initGeometryCorrection(): All sensors have to have the same distortion model, but channels 0 and "+i+" mismatch");
return false;
}
}
// set common distportion parameters
geometryCorrection.setDistortion(
sensors[0].focalLength,
sensors[0].distortionC,
sensors[0].distortionB,
sensors[0].distortionA,
sensors[0].distortionA5,
sensors[0].distortionA6,
sensors[0].distortionA7,
sensors[0].distortionA8,
sensors[0].distortionRadius,
sensors[0].pixelCorrectionWidth, // virtual camera center is at (pixelCorrectionWidth/2, pixelCorrectionHeight/2)
sensors[0].pixelCorrectionHeight,
sensors[0].pixelSize);
// set other/individual sensor parameters
for (int i = 1; i < numSensors; i++){
if ( (sensors[0].theta != sensors[i].theta) || // elevation
(sensors[0].heading != sensors[i].heading)){
System.out.println("initGeometryCorrection(): All sensors have to have the same elevation and heading, but channels 0 and "+i+" mismatch");
return false;
}
}
double [] forward = new double[numSensors];
double [] right = new double[numSensors];
double [] height = new double[numSensors];
double [] roll = new double[numSensors];
double [][] pXY0 = new double[numSensors][2];
for (int i = 0; i < numSensors; i++){
forward[i] = sensors[i].forward;
right[i] = sensors[i].right;
height[i] = sensors[i].height;
roll[i] = sensors[i].psi;
pXY0[i][0] = sensors[i].px0;
pXY0[i][1] = sensors[i].py0;
}
geometryCorrection.setSensors(
numSensors,
sensors[0].theta,
sensors[0].heading,
forward,
right,
height,
roll,
pXY0);
geometryCorrection.planeProjectLenses(); // project all lenses to the common plane
// calcualte reverse distortion as a table to be linear intr4epolated
geometryCorrection.calcReverseDistortionTable();
if (numSensors == 4){
geometryCorrection.adustSquare();
System.out.println("Adjusted camera to orient X Y along the sides of a square");
} else {
System.out.println("============= Cannot adustSquare() as it requires exactly 4 sensors, "+numSensors+" provided ==========");
return false;
}
// Print parameters
if (debugLevel > 0){
geometryCorrection.listGeometryCorrection(debugLevel > 1);
}
//listGeometryCorrection
return true;
}
*/
public DCTKernels calculateDCTKernel ( public DCTKernels calculateDCTKernel (
final ImageStack kernelStack, // first stack with 3 colors/slices convolution kernels final ImageStack kernelStack, // first stack with 3 colors/slices convolution kernels
final int kernelSize, // 64 final int kernelSize, // 64
......
src/main/java/Eyesis_Correction.java
View file @ 6d24709c
...@@ -519,10 +519,11 @@ private Panel panel1, ...@@ -519,10 +519,11 @@ private Panel panel1,
panelClt2 = new Panel(); panelClt2 = new Panel();
panelClt2.setLayout(new GridLayout(1, 0, 5, 5)); // rows, columns, vgap, hgap panelClt2.setLayout(new GridLayout(1, 0, 5, 5)); // rows, columns, vgap, hgap
addButton("Setup CLT parameters", panelClt2, color_configure); addButton("Setup CLT parameters", panelClt2, color_configure);
addButton("CLT 4 images", panelClt2, color_conf_process); addButton("CLT 4 images", panelClt2, color_conf_process);
addButton("CLT disparity scan", panelClt2, color_conf_process); addButton("CLT disparity scan", panelClt2, color_conf_process);
addButton("CLT reset fine corr", panelClt2, color_stop); addButton("CLT reset fine corr", panelClt2, color_stop);
addButton("CLT reset extrinsic corr", panelClt2, color_stop); addButton("CLT reset extrinsic corr", panelClt2, color_stop);
addButton("CLT show geometry", panelClt2, color_configure);
addButton("CLT show fine corr", panelClt2, color_configure); addButton("CLT show fine corr", panelClt2, color_configure);
addButton("CLT apply fine corr", panelClt2, color_process); addButton("CLT apply fine corr", panelClt2, color_process);
addButton("CLT test fine corr", panelClt2, color_process); addButton("CLT test fine corr", panelClt2, color_process);
...@@ -4613,6 +4614,18 @@ private Panel panel1, ...@@ -4613,6 +4614,18 @@ private Panel panel1,
} }
QUAD_CLT.resetExtrinsicCorr(CLT_PARAMETERS); QUAD_CLT.resetExtrinsicCorr(CLT_PARAMETERS);
return; return;
} else if (label.equals("CLT show geometry")) {
if (QUAD_CLT == null){
QUAD_CLT = new QuadCLT (
PROPERTIES,
EYESIS_CORRECTIONS,
CORRECTION_PARAMETERS);
if (DEBUG_LEVEL > 0){
System.out.println("Created new QuadCLT instance, will need to read CLT kernels");
}
}
QUAD_CLT.listGeometryCorrection(true);
return;
} else if (label.equals("CLT show fine corr")) { } else if (label.equals("CLT show fine corr")) {
if (QUAD_CLT == null){ if (QUAD_CLT == null){
QUAD_CLT = new QuadCLT ( QUAD_CLT = new QuadCLT (
......
src/main/java/GeometryCorrection.java
View file @ 6d24709c
...@@ -61,20 +61,20 @@ public class GeometryCorrection { ...@@ -61,20 +61,20 @@ public class GeometryCorrection {
public int numSensors = 4; public int numSensors = 4;
public double [] forward = null; private double [] forward = null;
public double [] right = null; private double [] right = null;
public double [] height = null; private double [] height = null;
public double [] roll = null; // degrees, CW (to target) - positive private double [] roll = null; // degrees, CW (to target) - positive
public double [][] pXY0 = null; // sensor center XY in pixels public double [][] pXY0 = null; // sensor center XY in pixels
public double common_right; // mm right, camera center private double common_right; // mm right, camera center
public double common_forward; // mm forward (to target), camera center private double common_forward; // mm forward (to target), camera center
public double common_height; // mm up, camera center private double common_height; // mm up, camera center
public double common_roll; // degrees CW (to target) camera as a whole private double common_roll; // degrees CW (to target) camera as a whole
public double [][] XYZ_he; // all cameras coordinates transformed to eliminate heading and elevation (rolls preserved) private double [][] XYZ_he; // all cameras coordinates transformed to eliminate heading and elevation (rolls preserved)
public double [][] XYZ_her = null; // XYZ of the lenses in a corrected CCS (adjusted for to elevation, heading, common_roll) private double [][] XYZ_her = null; // XYZ of the lenses in a corrected CCS (adjusted for to elevation, heading, common_roll)
public double [][] rXY = null; // XY pairs of the in a normal plane, relative to disparityRadius private double [][] rXY = null; // XY pairs of the in a normal plane, relative to disparityRadius
public double [][] rXY_ideal = {{-0.5, -0.5}, {0.5,-0.5}, {-0.5, 0.5}, {0.5,0.5}}; private double [][] rXY_ideal = {{-0.5, -0.5}, {0.5,-0.5}, {-0.5, 0.5}, {0.5,0.5}};
public double cameraRadius=0; // average distance from the "mass center" of the sensors to the sensors public double cameraRadius=0; // average distance from the "mass center" of the sensors to the sensors
public double disparityRadius=0; // distance between cameras to normalize disparity units to. sqrt(2)*disparityRadius for quad camera (~=150mm)? public double disparityRadius=0; // distance between cameras to normalize disparity units to. sqrt(2)*disparityRadius for quad camera (~=150mm)?
......
src/main/java/ImageDtt.java
View file @ 6d24709c
This source diff could not be displayed because it is too large. You can view the blob instead.
src/main/java/QuadCLT.java
View file @ 6d24709c
...@@ -114,7 +114,15 @@ public class QuadCLT { ...@@ -114,7 +114,15 @@ public class QuadCLT {
String name = prefix+"extrinsic_corr_"+GeometryCorrection.CORR_NAMES[i]; String name = prefix+"extrinsic_corr_"+GeometryCorrection.CORR_NAMES[i];
properties.setProperty(name, gc.getCorrVector().toArray()[i]+""); properties.setProperty(name, gc.getCorrVector().toArray()[i]+"");
} }
} }
public void listGeometryCorrection(boolean full){
GeometryCorrection gc = geometryCorrection;
if (gc == null) { // if it was not yet created
gc = new GeometryCorrection(this.extrinsic_corr);
}
gc.listGeometryCorrection(full);
}
public void getProperties(){ // restore public void getProperties(){ // restore
for (int n = 0; n < fine_corr.length; n++){ for (int n = 0; n < fine_corr.length; n++){
...@@ -3661,7 +3669,7 @@ public class QuadCLT { ...@@ -3661,7 +3669,7 @@ public class QuadCLT {
clt_parameters.shift_x, // final int shiftX, // shift image horizontally (positive - right) - just for testing clt_parameters.shift_x, // final int shiftX, // shift image horizontally (positive - right) - just for testing
clt_parameters.shift_y, // final int shiftY, // shift image vertically (positive - down) clt_parameters.shift_y, // final int shiftY, // shift image vertically (positive - down)
-1234, // clt_parameters.tileX, // final int debug_tileX, clt_parameters.tileX, // -1234, // clt_parameters.tileX, // final int debug_tileX,
clt_parameters.tileY, // final int debug_tileY, -1234 will cause port coordinates debug images clt_parameters.tileY, // final int debug_tileY, -1234 will cause port coordinates debug images
(clt_parameters.dbg_mode & 64) != 0, // no fract shift (clt_parameters.dbg_mode & 64) != 0, // no fract shift
(clt_parameters.dbg_mode & 128) != 0, // no convolve (clt_parameters.dbg_mode & 128) != 0, // no convolve
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment