15 #ifndef __IPSDKIPLADVANCEDMORPHOLOGY_PROCESSORLOGMESSAGES_H__ 16 #define __IPSDKIPLADVANCEDMORPHOLOGY_PROCESSORLOGMESSAGES_H__ 180 #endif // __IPSDKIPLADVANCEDMORPHOLOGY_PROCESSORLOGMESSAGES_H__ Level 1 algorithm: grey reconstruction of an image 3d.
Definition: ProcessorLogMessages.h:132
Level 2 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:110
Definition of import/export macro for library.
Level 2 algorithm: keep only the big connected components in binary or label 3d image.
Definition: ProcessorLogMessages.h:156
Level 2 algorithm: algorithm allowing to mark pixels of a shape in contact with image border (used va...
Definition: ProcessorLogMessages.h:194
Level 2 algorithm: removal of small connected component in binary or label 2d image.
Definition: ProcessorLogMessages.h:224
Level 3 algorithm: Super pixels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:292
Level 2 algorithm: algorithm allowing to extract local extrema 3d from an image.
Definition: ProcessorLogMessages.h:186
Level 3 algorithm: generic seeded distance map transform of a 2d input binary image according to a 2d...
Definition: ProcessorLogMessages.h:76
Level 2 algorithm: seeded watershed 3d algorithm.
Definition: ProcessorLogMessages.h:280
Level 3 algorithm: algorithm allowing to mark pixels of a shape in contact with image border (used va...
Definition: ProcessorLogMessages.h:192
Level 1 algorithm: iterative algorithm for extremum propagation on image 3d.
Definition: ProcessorLogMessages.h:144
Level 3 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:112
Level 2 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:246
Level 1 algorithm: propagation of maxima in a 2d image.
Definition: ProcessorLogMessages.h:198
Level 1 algorithm: algorithm allowing to remove borders from a label 2d image.
Definition: ProcessorLogMessages.h:210
Level 3 algorithm: Super voxels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:302
Level 1 algorithm: Super pixels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:288
Adaptive binary watershed 3d needed to reallocate a label 16 image to label 32 data type...
Definition: ProcessorLogMessages.h:42
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:116
Level 3 algorithm: algorithm for extremum propagation on image 3d using an image label.
Definition: ProcessorLogMessages.h:176
Level 1 algorithm: removal of small connected component in binary or label 3d image.
Definition: ProcessorLogMessages.h:226
Level 2 algorithm: Initialization step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:266
Level 2 algorithm: removal of small connected component in binary or label 3d image.
Definition: ProcessorLogMessages.h:228
Level 3 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:106
Level 1 algorithm: algorithm, based on watershed, allowing to separate binary 3d shapes.
Definition: ProcessorLogMessages.h:306
Level 1 algorithm: Adaptive binary watershed 3d algorithm.
Definition: ProcessorLogMessages.h:40
Level 2 algorithm: Super voxels algorithm based on SLIC on Gpu.
Definition: ProcessorLogMessages.h:296
Connected component first pass has detected an overflow on output label 16 image (d provisional label...
Definition: ProcessorLogMessages.h:72
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:124
Level 1 algorithm: Super voxels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:298
Level 3 algorithm: grey reconstruction of an image 2d.
Definition: ProcessorLogMessages.h:130
Level 1 algorithm: Adaptive binary watershed 2d algorithm.
Definition: ProcessorLogMessages.h:36
Level 3 algorithm: iterative algorithm for extremum propagation on image 2d.
Definition: ProcessorLogMessages.h:142
Level 3 algorithm: algorithm for extremum propagation on image 2d using an image label.
Definition: ProcessorLogMessages.h:166
Level 1 algorithm: algorithm allowing to extract dilated local extrema 2d from an image...
Definition: ProcessorLogMessages.h:94
Level 1 algorithm: algorithm, based on watershed, allowing to separate binary 2d shapes.
Definition: ProcessorLogMessages.h:304
Level 3 algorithm: algorithm for extremum propagation on image 3d using an image label.
Definition: ProcessorLogMessages.h:170
Level 3 algorithm: iterative algorithm for extremum propagation on image 3d.
Definition: ProcessorLogMessages.h:148
Level 1 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:88
Level 2 algorithm: Flooding step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:258
Level 3 algorithm: generic seeded distance map transform of a 2d input binary image according to a 2d...
Definition: ProcessorLogMessages.h:74
Level 1 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:244
Level 1 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:82
Level 2 algorithm: algorithm allowing to remove borders from a label 2d image.
Definition: ProcessorLogMessages.h:212
Level 1 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:108
Level 3 algorithm: algorithm allowing to extract local extrema 2d from an image.
Definition: ProcessorLogMessages.h:182
Level 2 algorithm: algorithm allowing to mark pixels of a shape in contact with image border (used va...
Definition: ProcessorLogMessages.h:190
Level 1 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:120
Level 1 algorithm: algorithm, based on watershed, allowing to separate grey 3d shapes.
Definition: ProcessorLogMessages.h:310
#define DECLARE_LOG_MESSAGE_MAP(libraryName, enumTypeStr, enumSeq)
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:78
Level 3 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:86
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:232
Level 2 algorithm: seeded watershed 2d algorithm.
Definition: ProcessorLogMessages.h:264
Level 1 algorithm: Binary reconstruction of an image 3d.
Definition: ProcessorLogMessages.h:46
Level 2 algorithm: Final step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:254
Level 2 algorithm: algorithm allowing to remove borders from a label 3d image.
Definition: ProcessorLogMessages.h:218
Level 3 algorithm: Connected component image 3d labeling algorithm (Label initialization pass) ...
Definition: ProcessorLogMessages.h:60
Level 3 algorithm: Connected component image 2d labeling algorithm (Inter strip merge pass) ...
Definition: ProcessorLogMessages.h:58
Level 1 algorithm: Connected component image 3d labeling algorithm.
Definition: ProcessorLogMessages.h:66
Level 3 algorithm: algorithm for extremum propagation on image 2d using an image label.
Definition: ProcessorLogMessages.h:160
Level 2 algorithm: algorithm allowing to extract local extrema 2d from an image.
Definition: ProcessorLogMessages.h:180
Level 1 algorithm: removal of connected components in contact with image borders in binary or label 2...
Definition: ProcessorLogMessages.h:206
Level 2 algorithm: algorithm for extremum propagation on image 2d using an image label.
Definition: ProcessorLogMessages.h:158
Level 3 algorithm: algorithm allowing to mark pixels of a shape in contact with image border (used va...
Definition: ProcessorLogMessages.h:196
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:240
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:230
Level 1 algorithm: algorithm for extremum propagation on image 2d using an image label.
Definition: ProcessorLogMessages.h:162
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:114
Level 1 algorithm: Connected component image 2d labeling algorithm.
Definition: ProcessorLogMessages.h:54
Level 2 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:122
Level 1 algorithm: keep only the big connected components in binary or label 2d image.
Definition: ProcessorLogMessages.h:150
Level 1 algorithm: seeded distance map transform of an input binary image according to a seeded image...
Definition: ProcessorLogMessages.h:250
Level 1 algorithm: iterative algorithm for extremum propagation on image 2d.
Definition: ProcessorLogMessages.h:138
Level 2 algorithm: algorithm for extremum propagation on image 2d using an image label.
Definition: ProcessorLogMessages.h:164
Level 1 algorithm: propagation of minima in a 3d image.
Definition: ProcessorLogMessages.h:204
Level 3 algorithm: Connected component image 3d labeling algorithm (Label initialization pass) ...
Definition: ProcessorLogMessages.h:62
Level 2 algorithm: Super pixels algorithm based on SLIC on Gpu.
Definition: ProcessorLogMessages.h:286
Level 3 algorithm: Final step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:256
Level 2 algorithm: Connected component image 3d labeling algorithm.
Definition: ProcessorLogMessages.h:68
Level 3 algorithm: Connected component image 2d labeling algorithm (Label initialization pass) ...
Definition: ProcessorLogMessages.h:48
Level 3 algorithm: Final step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:272
Level 1 algorithm: algorithm, based on watershed, allowing to separate grey 2d shapes.
Definition: ProcessorLogMessages.h:308
Level 2 algorithm: Super voxels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:300
Level 3 algorithm: Connected component image 3d labeling algorithm (Inter strip merge pass) ...
Definition: ProcessorLogMessages.h:64
Level 2 algorithm: Connected component image 2d labeling algorithm.
Definition: ProcessorLogMessages.h:56
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:238
Level 3 algorithm: algorithm allowing to remove borders from a label 2d image.
Definition: ProcessorLogMessages.h:214
Level 2 algorithm: grey reconstruction of an image 3d.
Definition: ProcessorLogMessages.h:134
Level 2 algorithm: Super pixels algorithm based on SLIC.
Definition: ProcessorLogMessages.h:290
Level 2 algorithm: grey reconstruction of an image 2d.
Definition: ProcessorLogMessages.h:128
Level 3 algorithm: Connected component image 2d labeling algorithm (Label initialization pass) ...
Definition: ProcessorLogMessages.h:50
Level 1 algorithm: holes filling in a binary 3d image.
Definition: ProcessorLogMessages.h:100
Level 3 algorithm: Flooding step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:260
eProcessorMessage
Enumerate describing messages.
Level 1 algorithm: Binary reconstruction of an image 2d.
Definition: ProcessorLogMessages.h:44
Level 2 algorithm: algorithm for extremum propagation on image 3d using an image label.
Definition: ProcessorLogMessages.h:174
Level 1 algorithm: seeded watershed 2d algorithm.
Definition: ProcessorLogMessages.h:262
Level 3 algorithm: Super pixels algorithm correct boundaries.
Definition: ProcessorLogMessages.h:294
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:80
Level 1 algorithm: keep only the big connected components in binary or label 3d image.
Definition: ProcessorLogMessages.h:154
Level 3 algorithm: Connected component image 2d labeling algorithm (Inter strip merge pass) ...
Definition: ProcessorLogMessages.h:52
Level 1 algorithm: algorithm allowing to extract dilated local extrema 3d from an image...
Definition: ProcessorLogMessages.h:96
Level 1 algorithm: seeded distance map transform of a 3d input binary image according to a 3d seeded ...
Definition: ProcessorLogMessages.h:252
Level 3 algorithm: Initialization step for seeded watershed 2d.
Definition: ProcessorLogMessages.h:268
Level 2 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:84
Level 1 algorithm: removal of small connected component in binary or label 2d image.
Definition: ProcessorLogMessages.h:222
Level 3 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:92
Adaptive binary watershed 2d needed to reallocate a label 16 image to label 32 data type...
Definition: ProcessorLogMessages.h:38
Level 1 algorithm: propagation of minima in a 2d image.
Definition: ProcessorLogMessages.h:202
Level 2 algorithm: algorithm for extremum propagation on image 3d using an image label.
Definition: ProcessorLogMessages.h:168
Level 3 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:102
Level 2 algorithm: keep only the big connected components in binary or label 2d image.
Definition: ProcessorLogMessages.h:152
Level 1 algorithm: seeded watershed 3d algorithm.
Definition: ProcessorLogMessages.h:278
Level 1 algorithm: holes filling in a binary 2d image.
Definition: ProcessorLogMessages.h:98
Level 1 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:234
Level 2 algorithm: Final step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:270
Level 2 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:236
Level 2 algorithm: Initialization step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:282
Level 3 algorithm: Initialization step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:284
Level 3 algorithm: Connected component image 3d labeling algorithm (Inter strip merge pass) ...
Definition: ProcessorLogMessages.h:70
Level 1 algorithm: algorithm allowing to extract local extrema 2d from an image.
Definition: ProcessorLogMessages.h:178
Level 2 algorithm: Dilate the labels in the input label image until filling all pixels.
Definition: ProcessorLogMessages.h:90
Level 1 algorithm: algorithm allowing to remove borders from a label 3d image.
Definition: ProcessorLogMessages.h:216
Level 1 algorithm: propagation of maxima in a 3d image.
Definition: ProcessorLogMessages.h:200
Level 1 algorithm: algorithm for extremum propagation on image 3d using an image label.
Definition: ProcessorLogMessages.h:172
Level 2 algorithm: iterative algorithm for extremum propagation on image 3d.
Definition: ProcessorLogMessages.h:146
Level 1 algorithm: removal of connected components in contact with image borders in binary or label 3...
Definition: ProcessorLogMessages.h:208
Level 3 algorithm: generic seeded distance map transform of an input binary image according to a seed...
Definition: ProcessorLogMessages.h:104
Level 2 algorithm: Flooding step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:274
Level 1 algorithm: algorithm allowing to extract local extrema 3d from an image.
Definition: ProcessorLogMessages.h:184
Level 3 algorithm: grey reconstruction of an image 3d.
Definition: ProcessorLogMessages.h:136
Level 2 algorithm: iterative algorithm for extremum propagation on image 2d.
Definition: ProcessorLogMessages.h:140
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:242
Level 3 algorithm: algorithm allowing to remove borders from a label 3d image.
Definition: ProcessorLogMessages.h:220
Level 3 algorithm: generic seeded distance map transform of a 3d input binary image according to a 3d...
Definition: ProcessorLogMessages.h:118
Level 3 algorithm: Computes the shortest path from one border to its opposite, given distance pondera...
Definition: ProcessorLogMessages.h:248
Level 1 algorithm: grey reconstruction of an image 2d.
Definition: ProcessorLogMessages.h:126
Level 3 algorithm: Flooding step for seeded watershed 3d.
Definition: ProcessorLogMessages.h:276
Level 3 algorithm: algorithm allowing to extract local extrema 3d from an image.
Definition: ProcessorLogMessages.h:188