/usr/include/x86_64-linux-gnu/visp3/core/vpImageMorphology.h is in libvisp-core-dev 3.0.0-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 | /****************************************************************************
*
* This file is part of the ViSP software.
* Copyright (C) 2005 - 2015 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://visp.inria.fr for more information.
*
* This software was developed at:
* Inria Rennes - Bretagne Atlantique
* Campus Universitaire de Beaulieu
* 35042 Rennes Cedex
* France
*
* 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
/*!
\file vpImageMorphology.h
\brief Various mathematical morphology tools, erosion, dilatation...
*/
#include <visp3/core/vpImage.h>
#include <visp3/core/vpImageException.h>
#include <visp3/core/vpMatrix.h>
#include <fstream>
#include <iostream>
#include <math.h>
#include <string.h>
/*!
\class vpImageMorphology
\ingroup group_core_image
\brief Various mathematical morphology tools, erosion, dilatation...
\author Fabien Spindler (Fabien.Spindler@irisa.fr) Irisa / Inria Rennes
*/
class vpImageMorphology
{
public:
/*! \enum vpConnexityType
Type of connexity 4, or 8.
*/
typedef enum {
CONNEXITY_4, /*!< For a given pixel 4 neighbors are considered (left,
right, up, down) */
CONNEXITY_8 /*!< For a given pixel 8 neighbors are considered (left,
right, up, down, and the 4 pixels located on the diagonal) */
} 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);
} ;
/*!
Erode a binary image using a structuring element of size one.
\param I : Image to process.
\param value : Values of the pixels to erode.
\param value_out : Value to set if erosion is done.
\param connexity : Type of connexity: 4 or 8.
To erode a black area in an unsigned char image, set \e value to
0 and \e value_out to 255.
To erode a white area in an unsigned char image with one element mask, set
\e value to 255 and \e value_out to 0.
\sa dilatation()
*/
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 ;
}
/*!
Dilate a binary image using a structuring element of size one.
\param I : Image to process.
\param value : Values of the pixels to dilate.
\param value_out : Value to set if dilatation is done.
\param connexity : Type of connexity: 4 or 8.
To dilate a black area in an unsigned char image with one element mask, set
\e value to 0 and \e value_out to 255.
To dilate a white area in an unsigned char image with one element mask, set
\e value to 255 and \e value_out to 0.
\sa erosion()
*/
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:
*/
|