bioprocessing  5.1.2
bio Namespace Reference

Namespaces

 Rescaler
 

Classes

class  ChannelExtractor
 
class  BaseMeasureVector
 
class  BVclass
 
class  ChannelExtractor< AimsHSV, C >
 
class  ChannelExtractor< AimsRGB, C >
 
class  ChannelExtractor< AimsRGBA, C >
 
class  ChannelImageProc
 
class  ColorExtractor
 
class  ConvertibleImageProc
 
class  ConvertibleImageProc< T, U, T >
 
class  DpyBioParsers
 
class  DpyData
 
class  DpyFormat
 
class  DpyHeader
 
class  DpyParsers
 
class  DpyPlugin
 
class  DpyReader
 
class  DpyWriter
 
class  FinderDpyFormat
 
class  GaborExtractor
 
class  ImageProc
 
class  ImageProcessors
 
class  MorphoImageProc
 
class  NeighbourExtractor
 
class  ParsersInterface
 
class  PlaqueDescriptor
 
class  Rescaler
 
class  TextureExtractor
 
class  BaseEdge
 Base class for edges. More...
 
class  BaseEdgeRef
 Reference counting pointer to a BaseEdge. More...
 
class  BaseGraph
 Base class for graphs. More...
 
class  BaseGraphRef
 Reference to a BaseGraph. More...
 
class  BaseVertex
 Base class for vertices. More...
 
class  BaseVertexRef
 Reference counting pointer to a BaseVertex. More...
 
class  EWBaseGraph
 Base class for edge weighted graphs. More...
 
class  EWBaseGraphRef
 Reference to a EWBaseGraph. More...
 
class  PointVertex
 Coordinates-defined vertices. More...
 
class  PointVertexRef
 Reference counting pointer to a PointVertex. More...
 
class  SetEdge
 Edges: set implementation of non-oriented edges. More...
 
class  SetEdgeRef
 Reference counting pointer to a SetEdge. More...
 
class  ValueVertex
 Vertices with value. More...
 
class  ValueVertexRef
 Reference counting pointer to a ValueVertex. More...
 
class  VolumeGraph
 Volume graphs are a graph implementation specifically designed to represent volumes as graphs (vertices are the voxels, and edges are a chosen connectivity). More...
 
class  VolumeGraphRef
 Reference to a VolumeGraph. More...
 
class  ExtremaFinder
 
class  CoustyWatershed
 Watershed implementation as described in Cousty et al - Watershed cuts: minimum spanning forests and the drop of water principle (2007) The computation is done in linear time. More...
 
class  CoustyStream
 Streams represent a descent path in a graph. More...
 
class  CoustyStreamRef
 Reference counting pointer to a CoustyStream. More...
 
class  CoustyFlowMap
 A flow map is a mapping of the vertices of a graph to a value. More...
 
class  CoustyFlowMapRef
 Reference counting pointer to a CoustyFlowMap. More...
 
class  CoustyFlowMap< PointVertexRef< Point4dl >, L >
 Flow map specialization for PointVertexRef<Point4dl> (as used by CoustyWatershed) More...
 
class  CoustyFlowMapRef< PointVertexRef< Point4dl >, L >
 Reference counting pointer to a CoustyFlowMap. More...
 
class  Watershed
 Interface to watershed implementations. More...
 

Typedefs

typedef carto::Array< BVclassBVclasses
 
typedef bio::BaseMeasureVector< double > MeasureVector
 

Enumerations

enum  ImageProcessorMode
 

Functions

std::ostream & operator<< (std::ostream &os, const bio::BVclass &thing)
 
BaseMeasureVector< T > operator+ (const BaseMeasureVector< T > &aa, const BaseMeasureVector< T > &bb)
 
BaseMeasureVector< T > operator- (const BaseMeasureVector< T > &aa, const BaseMeasureVector< T > &bb)
 
BaseMeasureVector< T > operator* (const BaseMeasureVector< T > &aa, const T &bb)
 
BaseMeasureVector< T > operator* (const T &aa, const BaseMeasureVector< T > &bb)
 
BaseMeasureVector< T > operator/ (const BaseMeasureVector< T > &aa, const T &bb)
 
std::ostream & operator<< (std::ostream &out, const bio::BaseMeasureVector< T > &aa)
 
carto::GenericObject * plaquesHelper (carto::GenericObject *o, const std::string &n, carto::PythonReader &r)
 
void plaquesHelper (const carto::GenericObject &obj, soma::PythonWriter &w, int ind, bool writeInternals)
 
std::string timeString (std::string format="%d-%m-%Y %H:%M:%S")
 
DpyReaderoperator>> (DpyReader &reader, DpyData &thing)
 
DpyWriteroperator<< (DpyWriter &writer, const DpyData &thing)
 

Variables

 Init
 
 OnDemand