initial sd-vbs

initial sd-vbs

add sd-vbs

sd-vbs

52 files changed, 5480 insertions, 0 deletions

diff --git a/SD-VBS/benchmarks/sift/src/c/diffss.c b/SD-VBS/benchmarks/sift/src/c/diffss.c
new file mode 100644
index 0000000..683cbe7
--- /dev/null
+++ b/SD-VBS/benchmarks/sift/src/c/diffss.c
@@ -0,0 +1,53 @@
+/********************************
+Author: Sravanthi Kota Venkata
+********************************/
+
+#include "sift.h"
+
+/**
+    DIFFSS  Difference of scale space
+    Returns a scale space DSS obtained by subtracting
+    consecutive levels of the scale space SS.
+
+    In SIFT, this function is used to compute the difference of
+    Gaussian scale space from the Gaussian scale space of an image.
+**/
+
+F2D** diffss(F2D** ss, int num, int intervals)
+{
+    F2D** dss;
+    int o, sizeM, sizeN, s, i, j; 
+    F2D *current, *in1, *in2;
+
+    dss = malloc(num*intervals*sizeof(F2D*));
+
+    for(o=0; o<num; o++)
+    {
+        for(s=0; s<(intervals-1); s++)
+        {
+            sizeM = ss[o*intervals+s]->height;
+            sizeN = ss[o*intervals+s]->width;
+
+            dss[o*intervals+s] = fMallocHandle(sizeM, sizeN);
+
+            current = dss[o*intervals+s];
+            in1 = ss[o*intervals+s+1];
+            in2 = ss[o*intervals+s];
+            
+            for(i=0; i<sizeM; i++)
+            {
+                for(j=0; j<sizeN; j++)
+                {
+                    subsref(current,i,j) = subsref(in1,i,j) - subsref(in2,i,j);
+                }
+            }
+        }
+    }
+
+    return dss;
+
+}
+
+
+
+
diff --git a/SD-VBS/benchmarks/sift/src/c/doubleSize.c b/SD-VBS/benchmarks/sift/src/c/doubleSize.c
new file mode 100644
index 0000000..dd17f77
--- /dev/null
+++ b/SD-VBS/benchmarks/sift/src/c/doubleSize.c
@@ -0,0 +1,55 @@
+/********************************
+Author: Sravanthi Kota Venkata
+********************************/
+
+#include "sift.h"
+
+F2D* doubleSize(F2D* I)
+{
+    F2D *J;
+    int M, N, i, j;
+
+    M = I->height;
+    N = I->width;
+    J = fSetArray(2*M, 2*N, 0);
+
+    for(i=0; i<M; i++)
+    {
+        for(j=0; j<N; j++)
+        {
+            subsref(J,2*i,j*2) = subsref(I,i,j);
+        }
+    }
+    
+    for(i=0; i<M-1; i++)
+    {
+        for(j=0; j<N-1; j++)
+        {
+            subsref(J,i*2+1,j*2+1) = (0.25 * (subsref(I,i,j) + subsref(I,i+1,j) + subsref(I,i,j+1) + subsref(I,(i+1),j+1)));
+        }
+    }
+
+    for(i=0; i<M-1; i++)
+    {
+        for(j=0; j<N; j++)
+        {
+            subsref(J,i*2+1,j*2) = (0.5 * (subsref(I,i,j) + subsref(I,i+1,j)));
+        }
+    }
+   
+    for(i=0; i<M; i++)
+    {
+        for(j=0; j<N-1; j++)
+        {
+            subsref(J,i*2,j*2+1) = (0.5 * (subsref(I,i,j) + subsref(I,i,j+1)));
+        }
+    }
+    
+    return J;
+}
+
+
+
+
+
+
diff --git a/SD-VBS/benchmarks/sift/src/c/filterBoundaryPoints.c b/SD-VBS/benchmarks/sift/src/c/filterBoundaryPoints.c
new file mode 100644
index 0000000..c68e717
--- /dev/null
+++ b/SD-VBS/benchmarks/sift/src/c/filterBoundaryPoints.c
@@ -0,0 +1,61 @@
+#include "sift.h"
+
+/**
+    Filter out points on the boundaries. 
+    The function returns oframes, which
+    contains the row, col and the interval number 
+**/
+