CleanedBinaryImage.C

Go to the documentation of this file.

/*---------------------------------------------------------------------+
 | Library QgarLib, graphics analysis and recognition                  |
 | Copyright (C) 2002  Qgar Project, LORIA                             |
 |                                                                     |
 | This library is free software; you can redistribute it and/or       |
 | modify it under the terms of the GNU Lesser General Public          |
 | License version 2.1, as published by the Free Software Foundation.  |
 |                                                                     |
 | This library 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 Lesser General Public License for more details.         |
 |                                                                     |
 | The GNU Lesser General Public License is included in the file       |
 | LICENSE.LGPL, in the root directory of the Qgar packaging. See      |
 | http://www.gnu.org/licenses/lgpl.html for the terms of the licence. |
 | To receive a paper copy, write to the Free Software Foundation,     |
 | Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.       |
 |                                                                     |
 | Contact Project Qgar for any information:                           |
 |   LORIA - équipe Qgar                                               |
 |   B.P. 239, 54506 Vandoeuvre-lès-Nancy Cedex, France                |
 |   email: qgar-contact@loria.fr                                      |
 |   http://www.qgar.org/                                              |
 *---------------------------------------------------------------------*/


/**
 * @file   CleanedBinaryImage.C
 * @brief  Implementation of class qgar::CleanedBinaryImage.
 *
 * See file CleanedBinaryImage.H for the interface.
 *
 * @author <a href="mailto:qgar-develop@loria.fr?subject=Qgar fwd Karl Tombre">Karl Tombre</a>
 * @date   July 4, 2001  17:32
 * @since  Qgar 1.0
 */


// QGAR
#include <qgarlib/CleanedBinaryImage.H>



namespace qgar
{

// -------------------------------------------------------------------
// C O N S T R U C T O R
// -------------------------------------------------------------------
CleanedBinaryImage::CleanedBinaryImage(const BinaryImage& img)

  : BinaryImage(img)

{
  // Allocate a table for three lines
  BinaryImage::value_type* rows = new BinaryImage::value_type[3 * _width];
  // Allocate a table for resulting line
  BinaryImage::value_type* resrow = new BinaryImage::value_type[_width];
  // Read two first lines
  img.row(0, rows);
  img.row(1, rows+_width);
  // Where the last line read is located in rows
  int nextLine = 1;
  // Where the current line is located
  int currLine = 0;
  // Where the previous line is located (fiction right here)
  int prevLine = 2;

  for (int i = 1 ; i < _height - 1 ; i++)
    {
      // Read the new line and set up all pointers to right place
      // We replace the previous line
      img.row(i+1, rows + prevLine*_width);
      // rotate the three positions
      int savprevLine = prevLine;
      // the previous line becomes last current line
      prevLine = currLine;
      // the current line becomes the last read
      currLine = nextLine;
      // the next line is the last read
      nextLine = savprevLine;

      // Pointers in the three rows
      BinaryImage::value_type* pprev = rows + prevLine*_width + 1;
      BinaryImage::value_type* pcurr = rows + currLine*_width + 1;
      BinaryImage::value_type* pnext = rows + nextLine*_width + 1;

      // and in result
      img.row(i, resrow);
      BinaryImage::value_type* q = resrow + 1;

      for (int j = 1 ; j < _width-1 ; j++, pprev++, pcurr++, pnext++, q++)
        {
        if(*pcurr == 0)
          {
            if((*(pcurr-1) && *(pcurr+1) &&
                *(pnext-1) && *pnext && *(pnext+1) &&
                ! *(pprev-1) && ! *pprev && ! *(pprev+1)) ||
               (*pprev && *(pprev+1) && *(pcurr+1) &&
                *(pnext+1) && *pnext &&
                ! *(pnext-1) && ! *(pcurr-1) && ! *(pprev-1)) ||
               (*(pcurr-1) && *(pcurr+1) &&
                *(pprev-1) && *pprev && *(pprev+1) &&
                ! *(pnext-1) && ! *pnext && ! *(pnext+1)) ||
               (*pprev && *(pprev-1) && *(pcurr-1) &&
                *(pnext-1) && *pnext &&
                ! *(pnext+1) && ! *(pcurr+1) && ! *(pprev+1)) ||
               (*(pcurr-1) && *pprev && *(pcurr+1) && *pnext))
              // ????????????????????????????????????????????
              // Maybe we should add the diagonal directions?
              // ????????????????????????????????????????????
              {
                *q = 1;
              }
          }
        else
          {
          if((! *(pcurr-1) && ! *(pcurr+1) &&
              ! *(pnext-1) && ! *pnext && ! *(pnext+1) &&
              *(pprev-1) && *pprev && *(pprev+1)) ||
             (! *pprev && ! *(pprev+1) && ! *(pcurr+1) &&
              ! *(pnext+1) && ! *pnext &&
              *(pnext-1) && *(pcurr-1) && *(pprev-1)) ||
             (! *(pcurr-1) && ! *(pcurr+1) &&
              ! *(pprev-1) && ! *pprev && ! *(pprev+1) &&
              *(pnext-1) && *pnext && *(pnext+1)) ||
             (! *pprev && ! *(pprev-1) && ! *(pcurr-1) &&
              ! *(pnext-1) && ! *pnext &&
              *(pnext+1) && *(pcurr+1) && *(pprev+1)) ||
             (! *(pcurr-1) && ! *(pcurr+1) &&
              ! *(pnext-1) && ! *pnext && ! *(pnext+1) &&
              ! *(pprev-1) && ! *pprev && ! *(pprev+1)))
            // ????????????????????????????????????????????
            // Maybe we should add the diagonal directions?
            // ????????????????????????????????????????????
            {
              *q = 0;
            }
          }
        }

      setRow(i, resrow);
    }

  delete [] rows;
  delete [] resrow;

}
} // namespace qgar
// -------------------------------------------------------------------