/usr/include/InsightToolkit/Common/itkImageRandomNonRepeatingConstIteratorWithIndex.h is in libinsighttoolkit3-dev 3.20.1-1.
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 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkImageRandomNonRepeatingConstIteratorWithIndex.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkImageRandomNonRepeatingConstIteratorWithIndex_h
#define __itkImageRandomNonRepeatingConstIteratorWithIndex_h
#include "itkImageConstIteratorWithIndex.h"
#include "itkImage.h"
#include <algorithm>
#include <iostream>
#include "itkMersenneTwisterRandomVariateGenerator.h"
namespace itk
{
/** \class NodeOfPermutation
* The itk::ImageRandomNonRepeatingIterator works by creating a random
* permutation of the image pixels and then using that to control the
* order in which it accesses them. The classes NodeOfPermutation and
* RandomPermutation are used to support that. RandomPermutation is
* basically container which holds NodeOfPermutation objects. The
* node class overloads the < operator, which allows the sort algorithm
* from the STL to be used on it.
*/
class NodeOfPermutation
{
public:
unsigned long m_Priority;
unsigned long m_Index;
double m_Value;
NodeOfPermutation ()
{
m_Priority=0;
m_Index=0;
m_Value=0.0;
}
bool operator<( const NodeOfPermutation& b) const
{
if(m_Priority==b.m_Priority)
{
return m_Value < b.m_Value;
}
else
{
return m_Priority < b.m_Priority;
}
}
};
/** \class RandomPermutation */
class RandomPermutation
{
public:
typedef Statistics::MersenneTwisterRandomVariateGenerator::Pointer GeneratorPointer;
NodeOfPermutation * m_Permutation;
GeneratorPointer m_Generator;
unsigned long m_Size;
RandomPermutation(unsigned long sz)
{
m_Size = sz;
m_Permutation = new NodeOfPermutation[m_Size];
m_Generator = Statistics::MersenneTwisterRandomVariateGenerator::New();
this->Shuffle();
}
void Dump()
{
for(unsigned int i=0;i<m_Size;i++)
{
std::cout<<m_Permutation[i].m_Value<<" "<<m_Permutation[i].m_Priority
<<" "<<m_Permutation[i].m_Index<<";";
std::cout<<std::endl;
}
}
void SetPriority(unsigned long i,unsigned long priority)
{
if(i>m_Size)
{
std::cerr<<"Error - i dont have "<<i<<" elements"<<std::endl;
}
else
{
m_Permutation[i].m_Priority = priority;
}
}
void Shuffle()
{
for(unsigned int i=0; i < m_Size; i++ )
{
m_Permutation[i].m_Value = m_Generator->GetVariateWithClosedRange ( 1.0 );
m_Permutation[i].m_Index=i;
}
std::sort(m_Permutation,m_Permutation+m_Size);
}
unsigned long operator[](unsigned long i)
{
return m_Permutation[i].m_Index;
}
~RandomPermutation()
{
delete [] m_Permutation;
}
/** Reinitialize the seed of the random number generator */
void ReinitializeSeed()
{
m_Generator->Initialize();
}
void ReinitializeSeed(int seed)
{
m_Generator->Initialize ( seed );
}
};
/** \class ImageRandomNonRepeatingConstIteratorWithIndex
* \brief A multi-dimensional image iterator that visits a random set of pixels
* within an image region. All pixels in the image will be visited before any
* are repeated. A priority image may be passed to the interator which
* will cause it to select certain sets of pixels (those with lower priority
* values) before others.
*
* This class was contributed by Rupert Brooks, McGill Centre for Intelligent
* Machines, Montreal, Canada. It is heavily based on the
* ImageRandomIterator class.
*
* ImageRandomNonRepeatingConstIteratorWithIndex is a multi-dimensional
* iterator class that
* is templated over image type. ImageRandomNonRepeatingConstIteratorWithIndex
* is constrained to walk only within the specified region. When first
* instantiated, it creates (and stores) a random permutation of the image
* pixels. It then visits each pixel in the order specified by the
* permutation. Thus, iterator++ followed by iterator-- will end up leaving
* the iterator pointing at the same pixel. Furthermore, iterating from
* beginning to end will cover each pixel in the region exactly once.
*
* This iterator can be passed an image the same size as the region, which
* specifies a priority for the pixels. Within areas of this priority image
* that have the same value, the pixel selection will be random. Otherwise
* the pixel selection will be in the order of the priority image. In the
* extreme, this allows the order of the pixel selection to be completely
* specified.
*
* ImageRandomNonRepeatingConstIteratorWithIndex assumes a particular layout
* of the image data. The is arranged in a 1D array as if it were
* [][][][slice][row][col] with
* Index[0] = col, Index[1] = row, Index[2] = slice, etc.
*
*
* \par MORE INFORMATION
* For a complete description of the ITK Image Iterators and their API, please
* see the Iterators chapter in the ITK Software Guide. The ITK Software Guide
* is available in print and as a free .pdf download from http://www.itk.org.
*
* \author Rupert Brooks, McGill Centre for Intelligent Machines. Canada
*
* \ingroup ImageIterators
*
* \sa ImageConstIterator \sa ConditionalConstIterator
* \sa ConstNeighborhoodIterator \sa ConstShapedNeighborhoodIterator
* \sa ConstSliceIterator \sa CorrespondenceDataStructureIterator
* \sa FloodFilledFunctionConditionalConstIterator
* \sa FloodFilledImageFunctionConditionalConstIterator
* \sa FloodFilledImageFunctionConditionalIterator
* \sa FloodFilledSpatialFunctionConditionalConstIterator
* \sa FloodFilledSpatialFunctionConditionalIterator
* \sa ImageConstIterator \sa ImageConstIteratorWithIndex
* \sa ImageIterator \sa ImageIteratorWithIndex
* \sa ImageLinearConstIteratorWithIndex \sa ImageLinearIteratorWithIndex
* \sa ImageRandomNonRepeatingConstIteratorWithIndex \sa ImageRandomIteratorWithIndex
* \sa ImageRegionConstIterator \sa ImageRegionConstIteratorWithIndex
* \sa ImageRegionExclusionConstIteratorWithIndex
* \sa ImageRegionExclusionIteratorWithIndex
* \sa ImageRegionIterator \sa ImageRegionIteratorWithIndex
* \sa ImageRegionReverseConstIterator \sa ImageRegionReverseIterator
* \sa ImageReverseConstIterator \sa ImageReverseIterator
* \sa ImageSliceConstIteratorWithIndex \sa ImageSliceIteratorWithIndex
* \sa NeighborhoodIterator \sa PathConstIterator \sa PathIterator
* \sa ShapedNeighborhoodIterator \sa SliceIterator
* \sa ImageConstIteratorWithIndex
*
*/
template<typename TImage>
class ITK_EXPORT ImageRandomNonRepeatingConstIteratorWithIndex : public ImageConstIteratorWithIndex<TImage>
{
public:
/** Standard class typedefs. */
typedef ImageRandomNonRepeatingConstIteratorWithIndex Self;
typedef ImageConstIteratorWithIndex<TImage> Superclass;
/** Index typedef support. While this was already typdef'ed in the superclass
* it needs to be redone here for this subclass to compile properly with gcc.
* Note that we have to rescope Index back to itk::Index to that is it not
* confused with ImageIterator::Index. */
typedef typename TImage::IndexType IndexType;
/** Region typedef support. While this was already typdef'ed in the superclass
* it needs to be redone here for this subclass to compile properly with gcc.
* Note that we have to rescope Region back to itk::ImageRegion so that is
* it not confused with ImageIterator::Index. */
typedef typename TImage::RegionType RegionType;
/** Image typedef support. While this was already typdef'ed in the superclass
* it needs to be redone here for this subclass to compile properly with gcc.
* Note that we have to rescope Index back to itk::Index to that is it not
* confused with ImageIterator::Index. */
typedef TImage ImageType;
/** PixelContainer typedef support. Used to refer to the container for
* the pixel data. While this was already typdef'ed in the superclass
* it needs to be redone here for this subclass to compile properly with gcc. */
typedef typename TImage::PixelContainer PixelContainer;
typedef typename PixelContainer::Pointer PixelContainerPointer;
/** Default constructor. Needed since we provide a cast constructor. */
ImageRandomNonRepeatingConstIteratorWithIndex();
~ImageRandomNonRepeatingConstIteratorWithIndex()
{
if( m_Permutation )
{
delete m_Permutation;
}
}
/** Constructor establishes an iterator to walk a particular image and a
* particular region of that image. */
ImageRandomNonRepeatingConstIteratorWithIndex(const ImageType *ptr, const RegionType& region);
/** Constructor that can be used to cast from an ImageIterator to an
* ImageRandomNonRepeatingConstIteratorWithIndex. Many routines return an ImageIterator but for a
* particular task, you may want an ImageRandomNonRepeatingConstIteratorWithIndex. Rather than
* provide overloaded APIs that return different types of Iterators, itk
* returns ImageIterators and uses constructors to cast from an
* ImageIterator to a ImageRandomNonRepeatingConstIteratorWithIndex. */
ImageRandomNonRepeatingConstIteratorWithIndex( const ImageConstIteratorWithIndex<TImage> &it)
{
this->ImageConstIteratorWithIndex<TImage>::operator=(it);
m_Permutation = NULL;
}
/** Move an iterator to the beginning of the region. */
void GoToBegin(void)
{
m_NumberOfSamplesDone = 0L;
this->UpdatePosition();
}
/** Move an iterator to one position past the End of the region. */
void GoToEnd(void)
{
m_NumberOfSamplesDone = m_NumberOfSamplesRequested;
this->UpdatePosition();
}
/** Is the iterator at the beginning of the region? */
bool IsAtBegin(void) const
{
return (m_NumberOfSamplesDone == 0L);
}
/** Is the iterator at the end of the region? */
bool IsAtEnd(void) const
{
return (m_NumberOfSamplesDone >= m_NumberOfSamplesRequested);
}
/** The moving image dimension. */
itkStaticConstMacro( ImageDimension, unsigned int, ::itk::GetImageDimension< TImage >::ImageDimension );
/** Image with priorities */
typedef itk::Image< unsigned long, itkGetStaticConstMacro(ImageDimension ) > PriorityImageType;
/** Set the priority image. The priority image controls the order
of the random selection. Pixels of the same priority will be
ordered randomly, but pixels of lower priority value will be
selected first.
*/
void SetPriorityImage(const PriorityImageType * priorityImage);
/** Increment (prefix) the selected dimension.
* No bounds checking is performed. \sa GetIndex \sa operator-- */
Self & operator++()
{
m_NumberOfSamplesDone++;
this->UpdatePosition();
return *this;
}
/** Decrement (prefix) the selected dimension.
* No bounds checking is performed. \sa GetIndex \sa operator++ */
Self & operator--()
{
m_NumberOfSamplesDone--;
this->UpdatePosition();
return *this;
}
/** Set/Get number of random samples to get from the image region */
void SetNumberOfSamples( unsigned long number );
unsigned long GetNumberOfSamples( void ) const;
/** Reinitialize the seed of the random number generator */
void ReinitializeSeed();
/** Reinitialize the seed of the random number generator with
* a specific value */
void ReinitializeSeed(int);
private:
void UpdatePosition();
unsigned long m_NumberOfSamplesRequested;
unsigned long m_NumberOfSamplesDone;
unsigned long m_NumberOfPixelsInRegion;
RandomPermutation * m_Permutation;
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkImageRandomNonRepeatingConstIteratorWithIndex.txx"
#endif
#endif
|