C AbsPowerSum< N > Basic statistic. AbsPowerSum<N> =
► C AccumulatorChain< T, Selected, dynamic > Create an accumulator chain containing the selected statistics and their dependencies
C DynamicAccumulatorChain< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected >
C AccumulatorChain< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected, dynamic >
C AccumulatorChain< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected, true >
► C AccumulatorChain< CoupledHandleType< N >::type, SELECT >
C StandAloneDataFreeAccumulatorChain< N, SELECT > Create an accumulator chain that works independently of a MultiArray
► C AccumulatorChain< CoupledHandleType< N, T >::type, SELECT >
C StandAloneAccumulatorChain< N, T, SELECT > Create an accumulator chain that works independently of a MultiArray
► C AccumulatorChain< T, Selected, true >
C DynamicAccumulatorChain< T, Selected > Create a dynamic accumulator chain containing the selected statistics and their dependencies
► C AccumulatorChainArray< T, Selected, dynamic > Create an array of accumulator chains containing the selected per-region and global statistics and their dependencies
C DynamicAccumulatorChainArray< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected >
C AccumulatorChainArray< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected, dynamic >
C AccumulatorChainArray< CoupledArrays< N, T1, T2, T3, T4, T5 >::HandleType, Selected, true >
► C AccumulatorChainArray< T, Selected, true >
C DynamicAccumulatorChainArray< T, Selected > Create an array of dynamic accumulator chains containing the selected per-region and global statistics and their dependencies
C AdjacencyListGraph Undirected adjacency list graph in the LEMON API
C AffineMotionEstimationOptions< SPLINEORDER > Option object for affine registration functions
C Any Typesafe storage of arbitrary values
C ArgMaxWeight Basic statistic. Data where weight assumes its maximal value
C ArgMinWeight Basic statistic. Data value where weight assumes its minimal value
C ArrayOfRegionStatistics< RegionStatistics, LabelType > Calculate statistics for all regions of a labeled image
► C ArrayVectorView< T >
C ArrayVector< double >
C ArrayVector< ImageType, typename ImageType::allocator_type::template rebind< ImageType >::other >
C ArrayVector< std::queue< ValueType > >
C ArrayVector< Permutation< N > >
C ArrayVector< Permutation< 1 > >
C ArrayVector< TinyVector< double, 2 > >
C ArrayVector< INT >
C ArrayVector< AxisInfo >
C ArrayVector< MultiArrayIndex >
C ArrayVector< char >
C ArrayVector< std::pair< Int32, double > >
C ArrayVector< unsigned char >
C ArrayVector< int >
C ArrayVector< shape_type >
C ArrayVector< ArrayVector< bool > >
C ArrayVector< ArrayVector< MultiArrayIndex > >
C ArrayVector< NeighborOffsetArray >
C ArrayVector< ArrayVector< edge_descriptor > >
C ArrayVector< vigra::ArrayVector< typename out_edge_iterator::value_type > >
C ArrayVector< vigra::ArrayVector< index_type > >
C ArrayVector< vigra::TinyVector >
C ArrayVector< index_type >
C ArrayVector< arc_descriptor >
C ArrayVector< hsize_t >
C ArrayVector< BinType >
C ArrayVector< SharedChunkHandle< N, T > * >
C ArrayVector< Segment >
C ArrayVector< IndexType >
C ArrayVector< T >
C ArrayVector< Label_t >
C ArrayVector< DecisionTree_t >
C ArrayVector< ClassLabelType >
C ArrayVector< detail::DecisionTreeDeprec >
C ArrayVector< Int32 >
C ArrayVector< std::ptrdiff_t >
C ArrayVector< size_t >
C ArrayVector< bool >
C ArrayVector< Node >
C ArrayVector< npy_intp >
C ArrayVector< vigra::linalg::Matrix< Complex > >
C ArrayVector< point_type >
C ArrayVector< RegionAccumulatorChain >
C ArrayVector< Label >
► C ArrayVector< T, Alloc >
C Polygon< point_type >
C Polygon< POINT >
C ArrayVectorView< arc_descriptor >
C ArrayVectorView< ArrayVector< bool > >
C ArrayVectorView< ArrayVector< edge_descriptor > >
C ArrayVectorView< ArrayVector< MultiArrayIndex > >
C ArrayVectorView< AxisInfo >
C ArrayVectorView< BinType >
C ArrayVectorView< bool >
C ArrayVectorView< char >
C ArrayVectorView< ClassLabelType >
C ArrayVectorView< DecisionTree_t >
C ArrayVectorView< detail::DecisionTreeDeprec >
C ArrayVectorView< double >
C ArrayVectorView< hsize_t >
C ArrayVectorView< ImageType >
C ArrayVectorView< index_type >
C ArrayVectorView< IndexType >
C ArrayVectorView< int >
C ArrayVectorView< INT >
C ArrayVectorView< Int32 >
C ArrayVectorView< Label >
C ArrayVectorView< Label_t >
C ArrayVectorView< MultiArrayIndex >
C ArrayVectorView< NeighborOffsetArray >
C ArrayVectorView< Node >
C ArrayVectorView< npy_intp >
C ArrayVectorView< Permutation< 1 > >
C ArrayVectorView< Permutation< N > >
C ArrayVectorView< point_type >
C ArrayVectorView< RegionAccumulatorChain >
C ArrayVectorView< Segment >
C ArrayVectorView< shape_type >
C ArrayVectorView< SharedChunkHandle< N, T > * >
C ArrayVectorView< size_t >
C ArrayVectorView< std::pair< Int32, double > >
C ArrayVectorView< std::ptrdiff_t >
C ArrayVectorView< std::queue< ValueType > >
C ArrayVectorView< TinyVector< double, 2 > >
C ArrayVectorView< unsigned char >
C ArrayVectorView< vigra::ArrayVector< index_type > >
C ArrayVectorView< vigra::ArrayVector< typename out_edge_iterator::value_type > >
C ArrayVectorView< vigra::linalg::Matrix< Complex > >
C ArrayVectorView< vigra::TinyVector >
C AutoRangeHistogram< BinCount > Histogram where range mapping bounds are defined by minimum and maximum of data
C BasicImage< PIXELTYPE, Alloc > Fundamental class template for images
C BasicImage< double >
C BasicImage< float >
C BasicImage< InternalValue >
C BasicImage< TinyVector< double, 2 > >
C BasicImage< value_type >
C BasicImage< VALUETYPE >
C BasicImageIteratorBase< IMAGEITERATOR, PIXELTYPE, REFERENCE, POINTER, LINESTARTITERATOR >
► C BasicImageIteratorBase< BasicImageIterator< PIXELTYPE, ITERATOR >, PIXELTYPE, PIXELTYPE &, PIXELTYPE *, ITERATOR >
C BasicImageIterator< PIXELTYPE, ITERATOR >
► C BasicImageIteratorBase< ConstBasicImageIterator< PIXELTYPE, ITERATOR >, PIXELTYPE, PIXELTYPE const &, PIXELTYPE const *, ITERATOR >
C ConstBasicImageIterator< PIXELTYPE, ITERATOR >
C BasicImageView< PIXELTYPE > BasicImage using foreign memory
C BestGiniOfColumn< LineSearchLossTag >
C BestGiniOfColumn< vigra::GiniCriterion >
C BilinearInterpolatingAccessor< ACCESSOR, VALUETYPE > Bilinear interpolation at non-integer positions
C BinaryForest BinaryForest stores a collection of rooted binary trees
C BlueAccessor< RGBVALUE >
C Box< VALUETYPE, DIMENSION > Represent an n-dimensional box as a (begin, end) pair. Depending on the value type, end() is considered to be outside the box (as in the STL, for integer types), or inside (for floating point types). size() will always be end() - begin()
C Box< PointValue, DIM >
C BrightnessContrastFunctor< PixelType > Adjust brightness and contrast of an image
C BrightnessContrastFunctor< ComponentType >
C BrightnessContrastFunctor< unsigned char >
► C BSplineBase< ORDER, T >
C BSpline< ORDER, double >
C BSpline< ORDER, T >
C BSplineBase< ORDER, double >
► C BucketQueue< ValueType, Ascending > Priority queue implemented using bucket sort
C MappedBucketQueue< ValueType, PriorityFunctor, Ascending > Priority queue implemented using bucket sort (STL compatible)
C BucketQueue< ValueType, Ascending >
C BucketQueue< ValueType, false >
C CatmullRomSpline< T >
C Central< TAG > Modifier. Substract mean before computing statistic
C Central< PowerSum< 2 > > Spezialization: works in pass 1, operator+=() supported (merging supported)
C Central< PowerSum< 3 > > Specialization: works in pass 2, operator+=() supported (merging supported)
C Central< PowerSum< 4 > > Specialization: works in pass 2, operator+=() supported (merging supported)
C CentralMoment< N > Alias. CentralMoment<N>
C ChangeablePriorityQueue< T, COMPARE > Heap-based changable priority queue with a maximum number of elemements
C ChangeablePriorityQueue< ValueType >
C ChangeablePriorityQueue< WeightType >
► C ChunkedArray< N, T > Interface and base class for chunked arrays
C ChunkedArrayCompressed< N, T, Alloc >
C ChunkedArrayFull< N, T, Alloc >
C ChunkedArrayHDF5< N, T, Alloc >
C ChunkedArrayLazy< N, T, Alloc >
C ChunkedArrayTmpFile< N, T >
C ChunkedArrayOptions Option object for ChunkedArray construction
C ChunkedArrayTag
C cl_charNAccessor_COMP
C cl_TYPE3WriteAccessor_s1
C cl_TYPE3WriteAccessor_s2
C ClusteringOptions Options object for hierarchical clustering
C ColumnIterator< IMAGE_ITERATOR > Iterator adapter to linearly access columns
C ConstValueIterator< PIXELTYPE > Iterator that always returns the constant specified in the constructor
C ConvexHull Compute the convex hull of a region
C ConvexHullFeatures Compute object features related to the convex hull
C ConvolutionOptions< dim > Options class template for convolutions
C ConvolutionOptions< DIM >
► C ConvolutionOptions< N >
C BlockwiseConvolutionOptions< N >
C Coord< TAG > Modifier. Compute statistic from pixel coordinates rather than from pixel values
C CoordinateConstValueAccessor< Accessor, COORD > Forward accessor to the value() part of the values an iterator points to
C CoordinateSystem Basic statistic. Identity matrix of appropriate size
C CorrectStatus
C CoscotFunction< T >
C CountingIterator< T > Iterator that counts upwards or downwards with a given step size
C CoupledHandle< T, NEXT >
► C CoupledIteratorType< N, T1, T2, T3, T4, T5 >
C CoupledArrays< N, T1, T2, T3, T4, T5 >
C CoupledIteratorType< N, void, void, void, void, void >
► C CoupledScanOrderIterator< N, HANDLES, DIMENSION > Iterate over multiple images simultaneously in scan order
C StridedScanOrderIterator< N, V, REFERENCE, POINTER > Sequential iterator for MultiArrayView
► C CoupledScanOrderIterator< N >
C MultiCoordinateIterator< N > Iterate over a virtual array where each element contains its coordinate
C CrackContourCirculator< IMAGEITERATOR > Circulator that walks around a given region
C DataArg< INDEX > Specifies index of data in CoupledHandle
C DepthStop Random forest 'maximum depth' stop criterion
► C Diff2D Two dimensional difference vector
C Point2D Two dimensional point or position
C Size2D Two dimensional size object
C DiffusivityFunctor< Value > Diffusivity functor for non-linear diffusion
C Dist2D
C DistancePowerFunctor< N >
C DivideByCount< TAG > Modifier. Divide statistic by Count: DivideByCount<TAG> = TAG / Count
C DivideUnbiased< TAG > Modifier. Divide statistics by Count-1: DivideUnbiased<TAG> = TAG / (Count-1)
C Draw< T1, T2, C1, C2 >
C DT_StackEntry< Iter >
C DualVector< T, N >
C EarlyStoppStd Standard early stopping criterion
C Edgel
C EdgeWeightNodeFeatures< MERGE_GRAPH, EDGE_INDICATOR_MAP, EDGE_SIZE_MAP, NODE_FEATURE_MAP, NODE_SIZE_MAP, MIN_WEIGHT_MAP, NODE_LABEL_MAP > This Cluster Operator is a MONSTER. It can really do a lot
C EnhancedFrostFunctor< VALUETYPE > This function tries to reduce the speckle noise of an image by applying the Enhanced Frost filter
C EnhancedLeeFunctor< VALUETYPE > This function tries to reduce the speckle noise of an image by applying the Enhanced Lee filter
C EntropyCriterion
C EntropyScore Functor that computes the entropy score
C FFTWComplex< Real > Wrapper class for the FFTW complex types 'fftw_complex
'
C FFTWComplex< Real >
► C FFTWConvolvePlan< N, Real >
C FFTWCorrelatePlan< N, Real >
C FFTWImaginaryAccessor< Real >
C FFTWLogMagnitudeAccessor< Real >
C FFTWMagnitudeAccessor< Real >
C FFTWPhaseAccessor< Real >
C FFTWPlan< N, Real >
C FFTWPlan< N, Real >
► C FFTWRealAccessor< Real >
C FFTWWriteRealAccessor< Real >
C FFTWRealAccessor< double >
C FFTWSquaredMagnitudeAccessor< Real >
C FilterIterator< PREDICATE, ITER > This iterator creates a view of another iterator and skips elements that do not fulfill a given predicate
C FindAverage< VALUETYPE > Find the average pixel value in an image or ROI
C FindAverageAndVariance< VALUETYPE > Find the average pixel value and its variance in an image or ROI
C FindBoundingRectangle Calculate the bounding rectangle of an ROI in an image
C FindMinMax< VALUETYPE > Find the minimum and maximum pixel value in an image or ROI
C FindROISize< VALUETYPE > Calculate the size of an ROI in an image
C FindSum< VALUETYPE > Find the sum of the pixel values in an image or ROI
C FirstSeen Basic statistic. First data value seen of the object
C FixedPoint< IntBits, FractionalBits >
C FixedPoint16< IntBits, OverflowHandling >
C FlatScatterMatrix Basic statistic. Flattened uppter-triangular part of scatter matrix
C FunctorTraits< T > Export associated information for a functor
C GammaFunctor< PixelType > Perform gamma correction of an image
C GammaFunctor< ComponentType >
C GammaFunctor< unsigned char >
C GammaMAPFunctor< VALUETYPE > This function tries to reduce the speckle noise of an image by applying the Gamma Maximum A Posteriori (MAP) filter
C Gaussian< T >
C GetClusterVariables
C GiniCriterion
C GiniScore Functor that computes the gini score
C Global< TAG > Modifier. Compute statistic globally rather than per region
C GlobalRangeHistogram< BinCount > Like AutoRangeHistogram , but use global min/max rather than region min/max
C GrayToRGBAccessor< VALUETYPE >
C GreenAccessor< RGBVALUE >
C GridGraph< N, DirectedTag > Define a grid graph in arbitrary dimensions
C GridGraph< N, undirected_tag >
C HC_Entry
C HClustering
C HDF5DisableErrorOutput Temporarily disable HDF5's native error output
C HDF5File Access to HDF5 files
C HDF5Handle Wrapper for unique hid_t objects
C HDF5HandleShared Wrapper for shared hid_t objects
C HDF5ImportInfo Argument object for the function readHDF5()
C HierarchicalIteratorType< N, T1, T2, T3, T4, T5 >
C HistogramOptions Set histogram options
► C ImageArray< ImageType, Alloc > Fundamental class template for arrays of equal-sized images
C GaborFilterFamily< ImageType, Alloc > Family of gabor filters of different scale and direction
C ImageArray< ImageType, typename ImageType::allocator_type::template rebind< ImageType >::other >
C ImageExportInfo Argument object for the function exportImage()
C ImageImportInfo Argument object for the function importImage()
C ImageIteratorBase< IMAGEITERATOR, PIXELTYPE, REFERENCE, POINTER, StridedOrUnstrided > Base class for 2D random access iterators
► C ImageIteratorBase< ConstImageIterator< PIXELTYPE >, PIXELTYPE, PIXELTYPE const &, PIXELTYPE const * >
C ConstImageIterator< PIXELTYPE > Standard 2D random access const iterator for images that store the data as a linear array
► C ImageIteratorBase< ConstStridedImageIterator< PIXELTYPE >, PIXELTYPE, PIXELTYPE const &, PIXELTYPE const *, StridedArrayTag >
C ConstStridedImageIterator< PIXELTYPE > Const iterator to be used when pixels are to be skipped
► C ImageIteratorBase< ImageIterator< PIXELTYPE >, PIXELTYPE, PIXELTYPE &, PIXELTYPE * >
C ImageIterator< PIXELTYPE > Standard 2D random access iterator for images that store the data in a linear array
► C ImageIteratorBase< StridedImageIterator< PIXELTYPE >, PIXELTYPE, PIXELTYPE &, PIXELTYPE *, StridedArrayTag >
C StridedImageIterator< PIXELTYPE > Iterator to be used when pixels are to be skipped
C ImagePyramid< ImageType, Alloc > Class template for logarithmically tapering image pyramids
C ConvexHullFeatures::Impl< T, BASE > Result type of the covex hull feature calculation
C GridGraph< N, DirectedTag >::InDegMap Type of a property map that returns the number of incoming edges of a given node (API: LEMON, use via lemon::InDegMap<Graph>
)
C GridGraph< N, DirectedTag >::IndexMap Type of a property map that returns the coordinate of a given node (API: LEMON)
C IntegerHistogram< BinCount > Histogram where data values are equal to bin indices
C IterablePartition< T >
C IterablePartition< IdType >
C IteratorAdaptor< Policy > Quickly create 1-dimensional iterator adapters
C IteratorTraits< T > Export associated information for each image iterator
C Kernel1D< ARITHTYPE > Generic 1 dimensional convolution kernel
C Kernel2D< ARITHTYPE > Generic 2 dimensional convolution kernel
C KolmogorovSmirnovScore Functor that computes the Kolmogorov-Smirnov score
C KuanFunctor< VALUETYPE > This function tries to reduce the speckle noise of an image by applying the Kuan filter
C Kurtosis Basic statistic. Kurtosis
C Lab2RGBFunctor< T > Convert perceptual uniform CIE L*a*b* into linear (raw) RGB
C Lab2RGBPrimeFunctor< T > Convert perceptual uniform CIE L*a*b* into non-linear (gamma corrected) R'G'B'
C Lab2XYZFunctor< T > Convert perceptual uniform CIE L*a*b* into standardized tri-stimulus XYZ
C Lab2XYZFunctor< component_type >
C LabelArg< INDEX > Specifies index of labels in CoupledHandle
► C LabelOptions Option object for labelMultiArray()
C BlockwiseLabelOptions
C LastValueFunctor< VALUETYPE > Stores and returns the last value it has seen
C LeastAngleRegressionOptions Pass options to leastAngleRegression()
C LeeFunctor< VALUETYPE > This function tries to reduce the speckle noise of an image by applying the basic Lee filter
C LineIterator< IMAGE_ITERATOR > Iterator adapter to iterate along an arbitrary line on the image
C LocalMinmaxOptions Options object for localMinima() and localMaxima()
C Luv2RGBFunctor< T > Convert perceptual uniform CIE L*u*v* into linear (raw) RGB
C Luv2RGBPrimeFunctor< T > Convert perceptual uniform CIE L*u*v* into non-linear (gamma corrected) R'G'B'
C Luv2XYZFunctor< T > Convert perceptual uniform CIE L*u*v* into standardized tri-stimulus XYZ
C Luv2XYZFunctor< component_type >
C MagnitudeFunctor< ValueType >
C Maximum Basic statistic. Maximum value
C Median
C MergeGraphAdaptor< GRAPH > Undirected graph adaptor for edge contraction and feature merging
C MeshGridAccessor
C Metric< T > Functor to compute a metric between two vectors
C Metric< float >
C Minimum Basic statistic. Minimum value
C Moment< N > Alias. Moment<N>
C MultiArrayNavigator< MULTI_ITERATOR, N > A navigator that provides access to the 1D subranges of an n-dimensional range given by a vigra::MultiIterator and an nD shape
C MultiArrayShape< N >
C MultiArrayShape< 2 >
C MultiArrayShape< actual_dimension >
C MultiArrayShape< dim >
C MultiArrayShape< Dimensions >
► C MultiArrayView< N, T, StrideTag > Base class for, and view to, vigra::MultiArray
► C MultiArray< N+1, Multiband< T > >
C GridGraph< N, DirectedTag >::ArcMap< T > Type of an arc property map that maps arc descriptor objects onto property values of type T
(API: LEMON)
C GridGraph< N, DirectedTag >::EdgeMap< T > Type of an edge property map that maps edge descriptor objects onto property values of type T
(API: LEMON)
C MultiArray< DIM, int >
C MultiArray< N, Handle >
C MultiArray< N, std::size_t >
C MultiArray< N, Complex, FFTWAllocator< Complex > >
C MultiArray< N, Chunk >
C MultiArray< 2, LabelInt >
C MultiArray< 2, int >
C MultiArray< 2, double >
C MultiArray< dimensions, unsigned int >
C MultiArray< 2, double, std::allocator< double > >
C MultiArray< 1, double >
C MultiArray< 2, int, std::allocator< int > >
C MultiArray< 4, double >
C NumpyArray< N, T, Stride >
C MultiArrayView< 1, int >
C MultiArrayView< 1, T >
C MultiArrayView< 1, T, StridedArrayTag >
C MultiArrayView< 2, double >
C MultiArrayView< 2, int >
C MultiArrayView< 2, LabelInt >
C MultiArrayView< 2, T, C1 >
C MultiArrayView< 2, T, C2 >
C MultiArrayView< 2, T1, C1 >
C MultiArrayView< 2, T1, UnstridedArrayTag >
C MultiArrayView< 2, T2, C2 >
C MultiArrayView< 2, T2, UnstridedArrayTag >
C MultiArrayView< 2, UInt8 >
C MultiArrayView< 2, VALUETYPE, StridedOrUnstrided >
C MultiArrayView< DIM, PixelTypeIn >
C MultiArrayView< DIM, RealPromotePixelType >
C MultiArrayView< DIM, RealPromoteScalarType >
C MultiArrayView< IntrinsicGraphShape< Graph >::IntrinsicEdgeMapDimension, Value >
C MultiArrayView< IntrinsicGraphShape< Graph >::IntrinsicNodeMapDimension, Value >
C MultiArrayView< N, NumpyArrayTraits< N, T, StridedArrayTag >::value_type, StridedArrayTag >
C MultiArrayView< N, Real, UnstridedArrayTag >
C MultiArrayView< N, T, S >
C MultiArrayView< N, T, UnstridedArrayTag >
C MultiArrayView< N, UnqualifiedType< U >::type >
► C MultiArrayView< N, vigra::detail::ResolveMultiband< T >::type, vigra::detail::ResolveMultiband< T >::Stride >
C MultiArray< 1, T >
C MultiArray< N, T, std::allocator< T > >
► C MultiArray< N, T >
C GridGraph< N, DirectedTag >::NodeMap< T > Type of a node property map that maps node descriptor objects onto property values of type T
(API: LEMON)
C MultiArray< 2, T, std::allocator< T > >
► C MultiArray< 2, T, ALLOC >
C Matrix< T, ALLOC >
C MultiArray< 2, T >
► C MultiArray< N, T, A > Main MultiArray
class containing the memory management
C Matrix< double >
C Matrix< int >
C ChunkedArrayFull< N, T, Alloc >
C Matrix< T, ALLOC >
C MultiBlocking< DIM, C >
C MultiCoordinateNavigator< Dimensions, N > A navigator that provides access to the 1D subranges of an n-dimensional range given by an nD shape
C MultiImageAccessor2< Iter1, Acc1, Iter2, Acc2 > Access two images simultaneously
C MultiIterator< N, T, REFERENCE, POINTER > A multi-dimensional hierarchical iterator to be used with vigra::MultiArrayView if it is not strided
► C NeighborCode Encapsulation of direction management for the 8-neighborhood
C NeighborOffsetCirculator< EightNeighborCode >
C NeighborCode Encapsulation of direction management for 4-neighborhood
C NeighborCode3D Encapsulation of direction management of neighbors for a 3D 6-neighborhood
C NeighborCode3D Encapsulation of direction management of neighbors for a 3D 26-neighborhood
► C NeighborhoodCirculator< IMAGEITERATOR, NEIGHBORCODE > Circulator that walks around a given location in a given image
C RestrictedNeighborhoodCirculator< IMAGEITERATOR, NEIGHBORCODE > Circulator that walks around a given location in a given image, using a restricted neighborhood
C NeighborhoodCirculator< IMAGEITERATOR, EightNeighborCode >
C NeighborOffsetCirculator< NEIGHBORCODE > Circulator that walks around a given location
► C NodeBase
C Node< e_ConstProbNode >
C NodeComplexityStop Random forest 'node complexity' stop criterion
C NoiseNormalizationOptions Pass options to one of the noise normalization functions
C NonlinearLSQOptions Pass options to nonlinearLeastSquares()
C NormalizeStatus
C NormalRandomFunctor< Engine >
C NumInstancesStop Random forest 'number of datapoints' stop criterion
► C NumpyAnyArray
C NumpyArray< N, T, Stride >
C GridGraph< N, DirectedTag >::OutDegMap Type of a property map that returns the number of outgoing edges of a given node (API: LEMON, use via lemon::OutDegMap<Graph>
)
► C ParallelOptions Option base class for parallel algorithms
► C BlockwiseOptions
C BlockwiseConvolutionOptions< N >
C BlockwiseLabelOptions
C PermuteCluster< Iter, DT >
C PLSAOptions Option object for the pLSA algorithm
► C PolynomialView< T >
C Polynomial< T >
C StaticPolynomial< MAXORDER, T >
► C Polytope< N, T > Represent an n-dimensional polytope
C StarPolytope< N, double >
► C StarPolytope< N, T > Specialization of the polytope to polytopes which forms a star domain
C ConvexPolytope< dimensions, double >
C ConvexPolytope< N, T >
C Polytope< N, double >
C PowerSum< N > Basic statistic. PowerSum<N> =
C Principal< TAG > Modifier. Project onto PCA eigenvectors
C Principal< CoordinateSystem > Specialization (covariance eigenvectors): works in pass 1, operator+=() supported (merging)
C Principal< PowerSum< 2 > > Specialization (covariance eigenvalues): works in pass 1, operator+=() supported (merging)
C PriorityQueue< ValueType, PriorityType, Ascending > Heap-based priority queue compatible to BucketQueue
C ProblemSpec< LabelType > Problem specification class for the random forest
C ProblemSpec< double >
C ProblemSpec< LabelType >
C Processor< Tag, LabelType, T1, C1, T2, C2 >
C Processor< ClassificationTag, LabelType, T1, C1, T2, C2 >
C Processor< RegressionTag, LabelType, T1, C1, T2, C2 >
C PropertyMap< KEYTYPE, MAPPEDTYPE, ContainerTag > The PropertyMap is used to store Node or Arc information of graphs
C PropertyMap< KEYTYPE, MAPPEDTYPE, IndexVectorTag > Specialization of PropertyMap that stores the elements in a vector (size = number of stored elements). An additional index vector is needed for bookkeeping (size = max node id of stored elements)
C PropertyMap< KEYTYPE, MAPPEDTYPE, VectorTag > Specialization of PropertyMap that stores the elements in a vector (size = max node id of stored elements)
C PurityStop Random forest 'node purity' stop criterion
C Quaternion< ValueType >
C RandomForest< LabelType, PreprocessorTag > Random forest version 2 (see also vigra::rf3::RandomForest for version 3)
C RandomForest< FEATURES, LABELS, SPLITTESTS, ACCTYPE > Random forest version 3
C RandomForestClassCounter< DataSource, CountArray >
C RandomForestOptions Options object for the random forest
C RandomForestOptions Options class for vigra::rf3::RandomForest version 3
C RandomNumberGenerator< Engine >
C RandomSplitOfColumn
C Range Return both the minimum and maximum in std::pair
C Rational< IntType >
C Rect2D Two dimensional rectangle
C RedAccessor< RGBVALUE >
C ReduceFunctor< FUNCTOR, VALUETYPE > Apply a functor to reduce the dimensionality of an array
C RegionCircularity Compute the circularity of a 2D region
C RegionContour Compute the contour of a 2D region
C RegionEccentricity Compute the eccentricity of a 2D region in terms of its prinipal radii
C RegionPerimeter Compute the perimeter of a 2D region
C RFErrorCallback
► C RFVisitorBase Base class from which all random forest visitors derive
C OOBError Compute the out of bag error
C RFStopVisiting The default visitor node (= "do nothing")
C VariableImportance Compute the variable importance
C RGB2LabFunctor< T > Convert linear (raw) RGB into perceptual uniform CIE L*a*b*
C RGB2LuvFunctor< T > Convert linear (raw) RGB into perceptual uniform CIE L*u*v*
C RGB2RGBPrimeFunctor< From, To > Convert linear (raw) RGB into non-linear (gamma corrected) R'G'B'
C RGB2sRGBFunctor< From, To > Convert linear (raw) RGB into standardized sRGB
C RGB2XYZFunctor< T > Convert linear (raw) RGB into standardized tri-stimulus XYZ
C RGBGradientMagnitudeFunctor< ValueType >
C RGBPrime2LabFunctor< T > Convert non-linear (gamma corrected) R'G'B' into perceptual uniform CIE L*a*b*
C RGBPrime2LuvFunctor< T > Convert non-linear (gamma corrected) R'G'B' into perceptual uniform CIE L*u*v*
C RGBPrime2RGBFunctor< From, To > Convert non-linear (gamma corrected) R'G'B' into non-linear (raw) RGB
C RGBPrime2XYZFunctor< T > Convert non-linear (gamma corrected) R'G'B' into standardized tri-stimulus XYZ
C RGBPrime2YPrimeCbCrFunctor< T > Convert non-linear (gamma corrected) R'G'B' into Y'CbCr color difference components
C RGBPrime2YPrimeIQFunctor< T > Convert non-linear (gamma corrected) R'G'B' into Y'IQ components
C RGBPrime2YPrimePbPrFunctor< T > Convert non-linear (gamma corrected) R'G'B' into Y'PbPr color difference components
C RGBPrime2YPrimeUVFunctor< T > Convert non-linear (gamma corrected) R'G'B' into Y'UV components
C RGBToGrayAccessor< RGBVALUE >
C RootDivideByCount< TAG > Modifier. RootDivideByCount<TAG> = sqrt( TAG/Count )
C RootDivideUnbiased< TAG > Modifier. RootDivideUnbiased<TAG> = sqrt( TAG / (Count-1) )
C RowIterator< IMAGE_ITERATOR > Iterator adapter to linearly access row
C Sampler< Random > Create random samples from a sequence of indices
C SamplerOptions Options object for the Sampler class
C ScatterMatrixEigensystem
C SeedOptions Options object for generateWatershedSeeds()
C SeedRgDirectValueFunctor< Value > Statistics functor to be used for seeded region growing
C Select< T01, T02, T03, T04, T05, T06, T07, T08, T09, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20 > Wrapper for MakeTypeList that additionally performs tag standardization
C ShortestPathDijkstra< GRAPH, WEIGHT_TYPE > Shortest path computer
C SIFImportInfo Extracts image properties from an Andor SIF file header
C SkeletonOptions Option object for skeletonizeImage()
C Skewness Basic statistic. Skewness
C SlantedEdgeMTFOptions Pass options to one of the slantedEdgeMTF() functions
C SlicOptions Options object for slicSuperpixels()
C SortSamplesByDimensions< DataMatrix >
C Splice< T >
C SplineImageView< ORDER, VALUETYPE > Create a continuous view onto a discrete image using splines
C SplineImageView0< VALUETYPE, INTERNAL_TRAVERSER > Create an image view for nearest-neighbor interpolation
C SplineImageView1< VALUETYPE, INTERNAL_TRAVERSER > Create an image view for bi-linear interpolation
► C SplitBase< Tag >
C ThresholdSplit< ColumnDecisionFunctor, Tag >
C SplitBase< ClassificationTag >
C sRGB2RGBFunctor< From, To > Convert standardized sRGB into non-linear (raw) RGB
► C StandardAccessor< VALUETYPE > Encapsulate access to the values an iterator points to
C SequenceAccessor< RGBVALUE >
► C SequenceAccessor< VECTOR >
C VectorAccessor< VECTOR > Accessor for items that are STL compatible vectors
C StandardAccessor< RGBVALUE >
► C StandardAccessor< SEQUENCE >
► C SequenceAccessor< SEQUENCE > Accessor for items that are STL compatible sequences
► C VectorAccessor< RGBVALUE >
C RGBAccessor< RGBVALUE >
C StandardAccessor< VECTOR >
C StandardConstAccessor< VALUETYPE > Encapsulate read access to the values an iterator points to
C StandardConstValueAccessor< VALUETYPE > Encapsulate access to the values an iterator points to
C StandardQuantiles< HistogramAccumulator > Compute (0%, 10%, 25%, 50%, 75%, 90%, 100%) quantiles from given histogram
C StandardValueAccessor< VALUETYPE > Encapsulate access to the values an iterator points to
► C StopBase
C StopAfterTree
C StopAfterVoteCount
C StopIfBinTest
C StopIfConverging
C StopIfMargin
C StopIfProb
C StridedArrayTag
C StridedMultiIterator< N, T, REFERENCE, POINTER > A multi-dimensional hierarchical iterator to be used with vigra::MultiArrayView if it is not strided
C ThinPlateSplineFunctor
C ThreadPool Thread pool class to manage a set of parallel workers
C Threshold< SrcValueType, DestValueType > Threshold an image
► C TinyVectorBase< VALUETYPE, SIZE, DATA, DERIVED > Base class for fixed size vectors
C TinyVector< unsigned int, N >
C TinyVector< unsigned int, 1 >
► C TinyVector< VALUETYPE, 3 >
C RGBValue< VALUETYPE, RED_IDX, GREEN_IDX, BLUE_IDX > Class for a single RGB value
C TinyVector< double, N >
C TinyVector< double, 7 >
C TinyVector< INDEX_TYPE, 3 >
C TinyVector< int, 2 >
C TinyVector< VALUETYPE, DIMENSION >
C TinyVector< double, 2 >
C TinyVector< PointValue, DIMENSION >
C TinyVector< ValueType, 3 >
C TinyVector< float, 3 >
C TinyVector< double, dimensions >
C TinyVector< double, BinCount >
C TinyVector< double, coordSize >
C TinyVectorBase< double, SIZE, double[SIZE], TinyVector< double, SIZE > >
C TinyVectorBase< float, SIZE, float[SIZE], TinyVector< float, SIZE > >
C TinyVectorBase< INDEX_TYPE, SIZE, INDEX_TYPE[SIZE], TinyVector< INDEX_TYPE, SIZE > >
C TinyVectorBase< int, SIZE, int[SIZE], TinyVector< int, SIZE > >
C TinyVectorBase< PointValue, SIZE, PointValue[SIZE], TinyVector< PointValue, SIZE > >
► C TinyVectorBase< T, SIZE, T *, TinyVectorView< T, SIZE > >
C TinyVectorView< T, SIZE > Wrapper for fixed size vectors
► C TinyVectorBase< T, SIZE, T[SIZE], TinyVector< T, SIZE > >
C TinyVector< T, N >
C TinyVector< T, SIZE > Class for fixed size vectors
C TinyVectorBase< unsigned int, SIZE, unsigned int[SIZE], TinyVector< unsigned int, SIZE > >
C TinyVectorBase< ValueType, SIZE, ValueType[SIZE], TinyVector< ValueType, SIZE > >
C TinyVectorBase< VALUETYPE, SIZE, VALUETYPE[SIZE], TinyVector< VALUETYPE, SIZE > >
C GridGraph< N, DirectedTag >::traversal_category Define several graph tags related to graph traversal (API: boost::graph, use via boost::graph_traits<Graph>::traversal_category
)
C UnbiasedKurtosis Basic statistic. Unbiased Kurtosis
C UnbiasedSkewness Basic statistic. Unbiased Skewness
C UniformIntRandomFunctor< Engine >
C UniformRandomFunctor< Engine >
C UnstridedArrayTag
C UserRangeHistogram< BinCount > Histogram where user provides bounds for linear range mapping from values to indices
C VariableSelectionResult
C VectorComponentAccessor< VECTORTYPE > Accessor for one component of a vector
C VectorComponentValueAccessor< VECTORTYPE > Accessor for one component of a vector
C VectorElementAccessor< ACCESSOR > Accessor for one component of a vector
C VectorNormFunctor< ValueType > A functor for computing the vector norm
C VectorNormSqFunctor< ValueType > A functor for computing the squared vector norm
► C VisitorBase
C ClusterImportanceVisitor
C CompleteOOBInfo
C CorrelationVisitor
C OOB_Error
C OOB_PerTreeError
C OnlineLearnVisitor
C RandomForestProgressVisitor
C StopVisiting
C VariableImportanceVisitor
C VisitorCopy< VISITOR >
C VisitorNode< Visitor, Next >
C VolumeExportInfo Argument object for the function exportVolume()
C VolumeImportInfo Argument object for the function importVolume()
C WatershedOptions Options object for watershed algorithms
C WeightArg< INDEX > Specifies index of data in CoupledHandle
C Weighted< TAG > Compute weighted version of the statistic
C WignerMatrix< Real > Computation of Wigner D matrix + rotation functions in SH,VH and R³
C XYZ2LabFunctor< T > Convert standardized tri-stimulus XYZ into perceptual uniform CIE L*a*b*
C XYZ2LabFunctor< component_type >
C XYZ2LuvFunctor< T > Convert standardized tri-stimulus XYZ into perceptual uniform CIE L*u*v*
C XYZ2LuvFunctor< component_type >
C XYZ2RGBFunctor< T > Convert standardized tri-stimulus XYZ into linear (raw) RGB
C XYZ2RGBPrimeFunctor< T > Convert standardized tri-stimulus XYZ into non-linear (gamma corrected) R'G'B'
C YPrimeCbCr2RGBPrimeFunctor< T > Convert Y'CbCr color difference components into non-linear (gamma corrected) R'G'B'
C YPrimeIQ2RGBPrimeFunctor< T > Convert Y'IQ color components into non-linear (gamma corrected) R'G'B'
C YPrimePbPr2RGBPrimeFunctor< T > Convert Y'PbPr color difference components into non-linear (gamma corrected) R'G'B'
C YPrimeUV2RGBPrimeFunctor< T > Convert Y'UV color components into non-linear (gamma corrected) R'G'B'