Logo Search packages:      
Sourcecode: ale version File versions  Download package


// Copyright 2003 David Hilvert <dhilvert@auricle.dyndns.org>,
//                              <dhilvert@ugcs.caltech.edu>

/*  This file is part of the Anti-Lamenessing Engine.

    The Anti-Lamenessing Engine 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.

    The Anti-Lamenessing Engine is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with the Anti-Lamenessing Engine; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#ifndef __psf_box_h__
#define __psf_box_h__

#include "../../point.h"
#include "psf.h"

 * Point-spread function module.
 * This module implements the box filter.

class box : public psf {
      ale_pos _radius;

       * The following four functions indicate filter boundaries.  Filter
       * support may include everything up to and including the boundaries
       * specified here.
      float min_i() const { return -_radius; }
      float max_i() const { return  _radius; }
      float min_j() const { return -_radius; }
      float max_j() const { return  _radius; }

       * Response function
       * Get the response to the rectangle bounded by (top, bot, lef, rig).
       * This function must correctly handle points which fall outside of the
       * filter support.  The variety the responding pixel is provided, in
       * case response is not uniform for all pixels (e.g. some sensor arrays
       * stagger red, green, and blue sensors).
      psf_result operator()(float top, float bot, float lef, float rig, 
                  unsigned int variety) const {

            psf_result result;

            if (top < min_i())
                  top = min_i();
            if (bot > max_i())
                  bot = max_i();
            if (lef < min_j())
                  lef = min_j();
            if (rig > max_j())
                  rig = max_j();

            if (bot > top && rig > lef)
                  for (int k = 0; k < 3; k++)
                        result.matrix(k, k) = (bot - top) * (rig - lef) / (4 * _radius * _radius);

            return result;

      box(ale_pos radius) {
            _radius = radius;


Generated by  Doxygen 1.6.0   Back to index