Advertisement
lamiastella

modified_calcAreaSum.c not working

Aug 5th, 2013
133
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 3.13 KB | None | 0 0
  1. /********************************
  2. Author: Sravanthi Kota Venkata
  3. ********************************/
  4.  
  5. #include "tracking.h"
  6.  
  7. /** Compute the sum of pixels over pixel neighborhood.
  8.     Neighborhood = winSize*winSize
  9.     This will be useful when we compute the displacement
  10.     of the neighborhood across frames instead of tracking each pixel.
  11.  
  12.     Input:  src Image
  13.             # rows, cols, size of window
  14.     Output: windowed-sum image, ret.
  15.  
  16.     Example:
  17.    
  18.     winSize = 4, cols = 8, rows = 16
  19.     nave_half = 2, nave = 4
  20.     Say, the first row of the image is:
  21.                 3 8 6 2 4 8 9 5
  22.     a1 =    0 0 3 8 6 2 4 8 9 5 0 0 (append nave_half zeros to left and right border)
  23.     asum =  (sum the first nave # pixels - 0 0 3 8 ) = 11
  24.     ret(0,0) =  11
  25.     For ret(0,1), we need to move the window to the right by one pixel and subtract
  26.     from a1sum the leftmost pixel. So, we add value 6 and subtract value at a1(0,0), = 0 here.
  27.     ret(0,1) = 17 = a1sum
  28.     For ret(0,2), a1sum - a1(0,1) + a1(2+nave) = 17 - 0 + 2 = 19 = a1sum
  29.     For ret(0,3), a1sum - a1(0,2) + a1(3+nave) = 19 - 3 + 4 = 20 = a1sum
  30.  
  31.     We proceed this way for all the rows and then perform summantion across all cols.
  32. **/
  33. F2D* calcAreaSum(F2D* src, int cols, int rows, int winSize)
  34. {
  35.     int nave, nave_half, i, j, k;
  36.     F2D *ret, *a1;
  37.     float a1sum;
  38.    
  39.     nave = winSize;
  40.     nave_half = floor((nave+1)/2);
  41.  
  42.     ret = fMallocHandle(rows, cols);
  43.     a1 = fSetArray(1, cols+nave,0);
  44. /*
  45.     for(i=0; i<rows; i++)
  46.     {
  47.         for(j=0; j<cols; j++) {
  48.             asubsref(a1,j+nave_half) = subsref(src,i,j);
  49.         }
  50.         a1sum = 0;
  51.         for(k=0; k<nave; k++) {
  52.             a1sum += asubsref(a1,k);
  53.         }
  54.         for(j=0; j<cols; j++)
  55.         {
  56.             subsref(ret,i,j) = a1sum;
  57.             a1sum += asubsref(a1,j+nave) - asubsref(a1,j);
  58.         }
  59.     }
  60.  
  61. */
  62.  
  63.    int togo, size;
  64.    int size1=rows*cols;
  65.    for(i=0; i<size1; i=i+8)
  66.     {
  67.        togo = size1 - i;
  68.        size = (togo > 8) ? 8 : togo;
  69.        for(j=0; j<size; j++)
  70.          {
  71.             asubsref(a1,j+nave_half) = asubsref(src,i+j);
  72.           }
  73.       }
  74.     a1sum = 0;
  75.     int size2=rows*nave;
  76.     for(i=0; i<size2; i=i+8)
  77.      {
  78.         togo = size2 - i;
  79.         size = (togo > 8) ? 8 : togo;
  80.         for(k=0; k<size; k++)
  81.            {
  82.             a1sum += asubsref(a1,k);
  83.             }
  84.       }
  85.    int size3=rows*cols;
  86.    for(i=0; i<size3; i=i+8)
  87.    {
  88.         togo = size3 - i;
  89.         size = (togo > 8) ? 8 : togo;
  90.         for(j=0; j<size; j++)
  91.         {
  92.             asubsref(ret,i+j) = a1sum;
  93.             a1sum += asubsref(a1,j+nave) - asubsref(a1,j);
  94.         }
  95.     }
  96.  
  97.  
  98.     fFreeHandle(a1);
  99.  
  100.     a1 = fSetArray(1, rows+nave,0);
  101.     for(i=0; i<cols; i++)
  102.     {
  103.         for(j=0; j<rows; j++) {
  104.             asubsref(a1,j+nave_half) = subsref(ret,j,i);
  105.         }
  106.         a1sum = 0;
  107.         for(k=0; k<nave; k++) {
  108.             a1sum += asubsref(a1,k);
  109.         }
  110.         for(j=0; j<rows; j++)
  111.         {
  112.             subsref(ret,j,i) = a1sum;
  113.             a1sum += asubsref(a1,j+nave) - asubsref(a1,j);
  114.         }
  115.     }
  116.     fFreeHandle(a1);
  117.  
  118.     return ret;
  119. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement