fast_tree_to_cxx_score_iterate

#!/usr/bin/env bash
#    This file is part of the FAST-ER machine learning system.
#    Copyright (C) 2008  Edward Rosten and Los Alamos National Laboratory
#
#    This program is free software; you can redistribute it and/or modify
#    it under the terms of the GNU General Public License as published by
#    the Free Software Foundation; either version 2 of the License, or
#    (at your option) any later version.
#
#    This program is distributed in the hope that it will be useful,
#    but WITHOUT ANY WARRANTY; without even the implied warranty of
#    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#    GNU General Public License for more details.
#
#    You should have received a copy of the GNU General Public License along
#    with this program; if not, write to the Free Software Foundation, Inc.,
#    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

file="$2"
name="$1"
if [ "$#" != 2 ]
then
	echo `basename $0`: error: incorrect arguments.
	echo "Usage:  `basename $0` <function_name> <file>"
	exit 1
fi


debug_use_test_rig=0

num_offsets=$(head -1 $file)


border=$(
      awk '
        NR==1{features = $1}
        NR==2{
          gsub(/[\[\],]/, "")
          if(features != NF/2)
          {
            print "Malformed offsets line"
            exit(1);
          }
		  o=0
          
          for(x=1; x <= NF; x++)
		  	o = ($x > o? $x : o)

		  print o

		  exit(0);
      } ' $file 
)


cat << END
#include <cvd/image.h>
#include <cvd/byte.h>
#include <vector>
#include <climits>
using namespace CVD;
using namespace std;

static inline bool test_gt_set(int a, int b, int& min_diff)
{
	if(a > b)
	{
		if(a-b < min_diff)
			min_diff = a-b;

		return 1;
	}
	return 0;
}

static inline int fast_corner_score(const byte* p, const int pixel[], int b)
{	
	b++;
	//This function computes the score for a pixel which is known to be 
	//a corner at barrier b. So we start looking at b+1 and above to 
	//establish where it stops becoming a corner.
	for(;;)
	{
		int cb = *p + b;
		int c_b= *p - b;
		int min_diff = INT_MAX;
$(
            awk '
                { ind = "        "substr($0, 1, match($0, /[^ ]/)-1)}
                /if_brighter/{print ind "if(test_gt_set(p[pixel["$2"]], cb, min_diff))"}
                /elsf_darker/ {print ind "else if(test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /if_darker/ {print ind "if(test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /if_either/{print ind "if(test_gt_set(p[pixel["$2"]], cb, min_diff) || test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /else/{print ind "else"}
                /corner/{print ind "b += min_diff;"}
                /background/{print ind "break;"}
            ' $file
)

	}

	return b-1;
}

static inline int corner_score(const byte* p, const int pixel[], int b)
{	
	b++;
	//This function computes the score for a pixel which is known to be 
	//a corner at barrier b. So we start looking at b+1 and above to 
	//establish where it stops becoming a corner.
	for(;;)
	{
		int cb = *p + b;
		int c_b= *p - b;
		int min_diff = INT_MAX;
$(
            awk '
                { ind = "        "substr($0, 1, match($0, /[^ ]/)-1)}
                /if_brighter/{print ind "if(test_gt_set(p[pixel["$2"]], cb, min_diff))"}
                /elsf_darker/ {print ind "else if(test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /if_darker/ {print ind "if(test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /if_either/{print ind "if(test_gt_set(p[pixel["$2"]], cb, min_diff) || test_gt_set(c_b, p[pixel["$2"]], min_diff))"}
                /else/{print ind "else"}
                /corner/{print ind "b += min_diff;"}
                /background/{print ind "break;"}
            ' $file
)

	}

	return b-1;
}

static void make_offsets(int pixel[], int row_stride)
{
$(
      awk '
        NR==1{features = $1}
        NR==2{
          gsub(/[\[\],]/, "")
          
          for(x=1; x <= features; x++)
            print "        pixel[" (x-1) "] = "$(2*x-1) " + row_stride * " $(2*x)";"

		  exit(0);
      } ' $file 
    )


}

void ${name}_score(const SubImage<byte>& i, const vector<ImageRef>& corners, int b, vector<int>& scores)
{
    scores.resize(corners.size());
	int pixel[$num_offsets];
	make_offsets(pixel, i.row_stride());

    for(unsigned int n=0; n < corners.size(); n++)
        scores[n] = corner_score(&i[corners[n]], pixel, b);
}

void ${name}_detect(const SubImage<byte>& i, vector<ImageRef>& corners, int b)
{
	corners.clear();

	int pixel[$num_offsets];
	make_offsets(pixel, i.row_stride());

	for(int y=$border; y < i.size().y - $border; y++)
		for(int x=$border; x < i.size().x - $border; x++)
		{
			const byte* p = i[y] + x;
		
			int cb = *p + b;
			int c_b= *p - b;
$(
            awk '
                { ind = "        "substr($0, 1, match($0, /[^ ]/)-1)}
                /if_brighter/{print ind "if(p[pixel["$2"]] > cb)"}
                /elsf_darker/ {print ind "else if(p[pixel["$2"]] < c_b)"}
                /if_darker/ {print ind "if(p[pixel["$2"]] < c_b)"}
                /if_either/{print ind "if(p[pixel["$2"]] > cb || p[pixel["$2"]]<c_b)"}
                /else/{print ind "else"}
                /corner/{print ind "{}"}
                /background/{print ind "continue;"}
            ' $file
)

			corners.push_back(ImageRef(x, y));
		}

}
END


if [ "$debug_use_test_rig" == 1 ]
then
cat<<END
#include <cvd/fast_corner.h>
#include <cvd/image_io.h>
#include <algorithm>

int main(int argc, char** argv)
{	
	for(int i=1; i < argc; i++)
	{
		cerr << argv[i]<< endl;
		Image<byte> im = img_load(argv[i]);
		vector<ImageRef> c1, c2;
		vector<int> s1, s2;
		for(int t=0; t < 256; t++)
		{
			c1.clear();
			c2.clear();
			s1.clear();
			s2.clear();

			${name}_detect(im, c1, t);
			${name}_score(im, c1, t, s1);
			fast_corner_detect_9(im, c2, t);
			fast_corner_score_9(im, c2, t, s2);
			
			cerr << t << endl;
			if(c1.size() != c2.size())
				cerr << "Size mismatch\n";
			else if(!equal(c1.begin(), c1.end(), c2.begin()))
				cerr << "Detection mismatch\n";
			else if(!equal(s1.begin(), s1.end(), s2.begin()))
				cerr << "Score mismatch\n";
		}
	}
}
END
fi