Developer Documentation
Centre for Vision, Speech & Signal Processing
USER IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
IndexNeigh2dC::IndexNeigh2dC(GridDistanceT,GridMetricT)
IndexNeigh2dC::IndexNeigh2dC(SizeT,Index2dC *,GridMetricT)
IndexNeigh2dC::IndexNeigh2dC(const SArray1dC &,GridMetricT)
IndexNeigh2dC::IndexNeigh2dC(const IndexNeigh2dC &)
IndexNeigh2dC::operator=(const IndexNeigh2dC &)
IndexNeigh2dC::~IndexNeigh2dC(void)
IndexNeigh2dC::Metric(void) const
IndexNeigh2dC::MaxDist(void) const
IndexNeigh2dC::Elems(void) const
IndexNeigh2dC::ULCorner(void) const
IndexNeigh2dC::BRCorner(void) const
IndexNeigh2dC::operator[](IndexT) const
IndexNeigh2dC::operator[](const Index2dC &) const
IndexNeigh2dC::Contains(const Index2dC &) const
IndexNeigh2dC::RankMin(GridDistanceT) const
IndexNeigh2dC::RankMax(GridDistanceT) const
IndexNeigh2dC::RankRange(GridDistanceT) const
IndexNeigh2dC::Distance(const Index2dC &) const
IndexNeigh2dC::N8(void)
IndexNeigh2dC::N4(void)
IndexNeigh2dC::BoundaryInfluence(void)
IndexNeigh2dC::GEQ(const void *,const void *)
IndexNeigh2dC::operator>>(istream &,IndexNeigh2dC &)
IndexNeigh2dC::DebugPrint(ostream &,const IndexNeigh2dC &)
IndexNeigh2dC
 
Index neighbourhood in 2d grid
 
include "amma/IndNeig2.hh"
User Level:Default
Library:Mgrid
Example:exBuffer.cc
Section:Basic Types.Indexing Image.Indexing
In Scope:std

Comments:
The class IndexNeigh2dC represents a set of 2D indexes in a neighborhood of a pixel.

Child Classes:
IndDistT
Variables:
IndexNeigh2dC n8;
8 connected neighborhood.

IndexNeigh2dC n4;
4 connected neighborhood.

IndexNeigh2dC boundaryInfluence;
The neighborhood of pixels that can be influented by the fast change of input sensor signal.

GridDistanceT dist;
maximum distance

GridMetricT type;
type of the metric

SizeT sizeR;
number of rows of the 'index' array

SizeT sizeC;
number of columns of the 'index' array

IndexT offsetR;
row offset of the 'index' array

IndexT offsetC;
column offset of the 'index' array

SizeT elms;
number of indexes in the neighbourhood

IndDistT * neighbour;
indexes of the neighbourhood ordered according to distance

IndexT ** index;
mapping from an index into its rank.

IndexRangeC * ranges;
mapping from distance into the rank of elements

Methods:
IndexNeigh2dC(GridDistanceT maxDistance = 5,GridMetricT metric = CITY_BLOCK)
Creates the set of relative indexes which belongs to the neighbourhood determined by 'distance' using the 'metric' of grid.

IndexNeigh2dC(SizeT elementNumber,Index2dC * indexes,GridMetricT metric = CITY_BLOCK)
Creates the set of relative indexes from the array of 'indexes' which number of elements is determined by 'elementNumber'. The metric is defined by variable 'metric'.

IndexNeigh2dC(const SArray1dC<Index2dC> & arr,GridMetricT metric = CITY_BLOCK)
Creates the set of relative indexes from the array of 'indexes'. The metric is defined by variable 'metric'.

IndexNeigh2dC(const IndexNeigh2dC & n)
Copy constructor.

const IndexNeigh2dC & operator=(const IndexNeigh2dC & n)

~IndexNeigh2dC()
Destructor. General informatiom about an object. ------------------------------------

GridMetricT Metric() const
Returns the type of the metric of the neighbourhood.

GridDistanceT MaxDist() const
Returns the maximum distance of elements of the neighbourhood.

SizeT Elems() const
Returns the number of elements in the neighbourhood.

Index2dC ULCorner() const
Returns the upper-left corner of the neighborhood bounding box.

Index2dC BRCorner() const
Returns the bottom-right corner of the neighborhood bounding box.

const Index2dC & operator[](IndexT i) const
Returns the i-th element of the neighbourhood.

IndexT operator[](const Index2dC & i) const
Returns the rank of the element 'i'.

BooleanT Contains(const Index2dC & i) const
Returns TRUE, if the neighbourhood contains the index 'i'.

IndexT RankMin(GridDistanceT distance) const
Returns the rank of the first element whose distance is greater or equal to the 'distance'.

IndexT RankMax(GridDistanceT distance) const
Returns the rank of the last element whose distance is smaller or equal to the 'distance'.

IndexRangeC RankRange(GridDistanceT distance) const
Returns the range of elements related to the 'distance'.

GridDistanceT Distance(const Index2dC & i) const
Returns the distance of the element 'i', if the element is in the neighbourhood. Selected neighborhoods of pixels. ---------------------------------

const IndexNeigh2dC & N8()
8 connected neighborhood.

const IndexNeigh2dC & N4()
4 connected neighborhood.

const IndexNeigh2dC & BoundaryInfluence()
The neighborhood of pixels that can be influented by the fast change of input sensor signal.

int GEQ(const void * i,const void * j)
Returns 1 if the rank of the index 'i' is bigger than the rank of the index 'j', 0, if the ranks of both indexes are equal, and -1, if the rank of the index 'i' is smaller than the rank of the index 'j'.

istream & operator>>(istream & s,IndexNeigh2dC & n)

void DebugPrint(ostream & s,const IndexNeigh2dC & n)


Programmer:Radek Marik, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001