next up previous contents index
Next: Watershed Segmentation Up: Process menu Previous: Thresholding, Dilation, Erosion, Opening,   Contents   Index

Quick Segmentation

Quick segmentation Uses a highly efficient segmentation algorithm to separate features, converting an image into a line drawing in which the lines depict outlines of objects in the image. Its purpose is to reduce the complexity of the image for pattern counting or further analysis. The algorithm is rapid but does not always give perfect segmentation.

The image to be segmented should be converted to grayscale and 8 bits/pixel for best results. If the segmentation appears incorrect, try one or more of the following:

The structuring element is the morphological kernel that determines how pixels are added or removed. Two structuring elements can be selected in imal:

This parameter is not used by watershed segmentation, which uses the ``Watershed kernel size'' parameter instead.


\begin{picture}( 100,100 )(-20,0)
\put(-30, -10){ \epsfig{file = tnimage-fig17....
...}
\put(90, 100){ B }
\put(210, 100){ C }
\put(327, 100){ D }
\end{picture}

Quick segmentation of an image of a 2D protein gel.
A Original image
B Quick segmentation classifies much of upper left of image as a big feature.
C Same image filtered to remove low frequencies (kernel = 15x15, multiplier = 1).
D Quick segmentation of filtered image (threshold = 180).

Binary vs Graylevel - Binary filtering produces a solid white or black result, while graylevel filtering retains the original shades of gray. This is also not used by segmentation.

Maximum signal - If the features of interest in an image are black, this should be set to black. For grayscale erosion, switching the maximum signal is the same as switching from erosion to dilation.

Threshold - Determines the cutoff value for deciding whether a pixel is a feature or the background. A higher threshold causes more pixels to be considered features and produces more lines in the segmentation.

Watershed kernel - Used for watershed segmentation instead of structuring element. Determines distance from pixel to be considered as part of a neighborhood group. Large values will take a long time.

Notes

  1. For quick segmentation, a threshold that is too high or too low will produce an all-white image.
  2. For watershed segmentation, excessive low-pass smoothing can result in no watersheds being found, while no smoothing can result in over-segmentation.

Contour Map Uses the quick segmentation algorithm to create a new image consisting of contours following areas of steepest gradient. The image should be low-pass filtered first to avoid drawing circles around small noise features. The number of contours is determined by the ``Contour sep'' setting. A larger value results in fewer lines but is faster. The actual number of contours also depends on the image. The product is still an image and does not contain vectorized data. Note that it is not a true iso-intensity contour map since the number of lines is determined by the gradient.
\begin{picture}( 100,100 )(0,0)
\put(0, -15){ \epsfig{file = contours.ps, width=5.7in }}
\ssc
\end{picture}
Contour map Image was low-pass filtered with a 9$ \times$9 kernel before creating the map using a spacing of 10. Left: Original, Center:Contours, Right: Contours superimposed on original image.


next up previous contents index
Next: Watershed Segmentation Up: Process menu Previous: Thresholding, Dilation, Erosion, Opening,   Contents   Index
root 2008-10-10