vpImageMorphology.h

/****************************************************************************
 *
 * $Id: vpImageMorphology.h 4574 2014-01-09 08:48:51Z fspindle $
 *
 * This file is part of the ViSP software.
 * Copyright (C) 2005 - 2014 by INRIA. All rights reserved.
 * 
 * This software is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * ("GPL") version 2 as published by the Free Software Foundation.
 * See the file LICENSE.txt at the root directory of this source
 * distribution for additional information about the GNU GPL.
 *
 * For using ViSP with software that can not be combined with the GNU
 * GPL, please contact INRIA about acquiring a ViSP Professional 
 * Edition License.
 *
 * See http://www.irisa.fr/lagadic/visp/visp.html for more information.
 * 
 * This software was developed at:
 * INRIA Rennes - Bretagne Atlantique
 * Campus Universitaire de Beaulieu
 * 35042 Rennes Cedex
 * France
 * http://www.irisa.fr/lagadic
 *
 * If you have questions regarding the use of this file, please contact
 * INRIA at visp@inria.fr
 * 
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *
 * Description:
 * Morphology tools.
 *
 * Authors:
 * Fabien Spindler
 *
 *****************************************************************************/


#ifndef vpImageMorphology_H
#define vpImageMorphology_H

#include <visp/vpImage.h>
#include <visp/vpImageException.h>
#include <visp/vpMatrix.h>

#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>

class vpImageMorphology
{
public:
  typedef enum {
    CONNEXITY_4, 
    CONNEXITY_8 
  } vpConnexityType;

public:
  template<class Type>
  static void erosion(vpImage<Type> &I, Type value, Type value_out,
              vpConnexityType connexity = CONNEXITY_4);

  template<class Type>
  static void dilatation(vpImage<Type> &I, Type value, Type value_out,
             vpConnexityType connexity = CONNEXITY_4);

} ;

template<class Type>
void vpImageMorphology::erosion(vpImage<Type> &I,
                Type value,
                Type value_out,
                vpConnexityType connexity)
{
  vpImage<Type> J(I.getHeight(), I.getWidth()) ;
  J = I;

  if (connexity == CONNEXITY_4) {
    for (unsigned int i=1 ; i < I.getHeight()-1   ; i++)
      for (unsigned int j=1 ; j < I.getWidth()-1   ; j++)
      {
    if (I[i][j] == value)
    {
      // Consider 4 neighbors
      if ((I[i-1][j] == value_out) ||
          (I[i+1][j] == value_out) ||
          (I[i][j-1] == value_out) ||
          (I[i][j+1] == value_out))
        J[i][j] = value_out;
    }
      }
  }
  else {
    for (unsigned int i=1 ; i < I.getHeight()-1   ; i++)
      for (unsigned int j=1 ; j < I.getWidth()-1   ; j++)
      {
    if (I[i][j] == value)
    {
      // Consider 8 neighbors
      if ((I[i-1][j-1] == value_out) ||
          (I[i-1][j]   == value_out) ||
          (I[i-1][j+1] == value_out) ||
          (I[i][j-1]   == value_out) ||
          (I[i][j+1]   == value_out) ||
          (I[i+1][j+1] == value_out) ||
          (I[i+1][j+1] == value_out) ||
          (I[i+1][j+1] == value_out) )
        J[i][j] = value_out ;
    }
      }


  }
  I = J ;
}

template<class Type>
void vpImageMorphology::dilatation(vpImage<Type> &I,
                   Type value,
                   Type value_out,
                   vpConnexityType connexity)
{
  vpImage<Type> J(I.getHeight(), I.getWidth()) ;
  J = I;
  if (connexity == CONNEXITY_4) {
    for (unsigned int i=1 ; i < I.getHeight()-1   ; i++)
      for (unsigned int j=1 ; j < I.getWidth()-1   ; j++)
      {
    if (I[i][j] == value_out)
    {
      // Consider 4 neighbors
      if ((I[i-1][j] == value) ||
          (I[i+1][j] == value) ||
          (I[i][j-1] == value) ||
          (I[i][j+1] == value))
        J[i][j] = value ;
    }
      }
  }
  else {
    for (unsigned int i=1 ; i < I.getHeight()-1   ; i++)
      for (unsigned int j=1 ; j < I.getWidth()-1   ; j++)
      {
    if (I[i][j] == value_out)
    {
      // Consider 8 neighbors
      if ((I[i-1][j-1] == value) ||
          (I[i-1][j]   == value) ||
          (I[i-1][j+1] == value) ||
          (I[i][j-1]   == value) ||
          (I[i][j+1]   == value) ||
          (I[i+1][j+1] == value) ||
          (I[i+1][j+1] == value) ||
          (I[i+1][j+1] == value) )
        J[i][j] = value ;
    }
      }
  }

  I = J ;
}
#endif


/*
 * Local variables:
 * c-basic-offset: 2
 * End:
 */