next up previous
Next: Texture Features Up: The Proposed Segmentation Scheme Previous: The Proposed Segmentation Scheme

Segmentation

The segmentation phase can be stated as follows:

  1. Extract a feature vector tex2html_wrap_inline171 for an image pixel.
  2. Feed tex2html_wrap_inline171 into SOM and find the best-matching unit c (Eq. 1 and 2). Show the minimum error tex2html_wrap_inline177 as the output.
  3. If tex2html_wrap_inline177 is larger than the specified limit T, the pixel is classified to a defect.
  4. Repeat steps 1-3 for each image pixel.
The limit T is determined by hand, and it depends on features and on the desired accuracy of the segmentation. The segmentation scheme is depicted in Figure 1.

   figure32
Figure 1: The proposed segmentation scheme.

The matching error tex2html_wrap_inline185 for the feature vector tex2html_wrap_inline187 and the map unit i is defined similarly to the Hamming distance as

  equation38

tex2html_wrap_inline193 is defined in Eq. 5 and tex2html_wrap_inline195 in Eq. 6. The best-matching unit c is now chosen to be the unit with the minimum error tex2html_wrap_inline177 ,

  equation55

If there are several map units with the same minimum error tex2html_wrap_inline177 , the one with the minimum Euclidean distance with the feature vector tex2html_wrap_inline187 is chosen.



Jukka Iivarinen
Tue Mar 5 10:03:40 EET 1996