Pattern Matching Matching is another basic approach to segmentation that can be used to locate known objects in an image, to search for specific patterns, etc. The best match is based on some criterion of optimality which depends on object properties and object relations.
Matched patterns can be very small, or they can represent whole objects of interest.
In such cases, the matching may become invariant to image transforms. Criteria of optimality can compute anything from simple correlations up to complex approaches of graph matching. Matching criteria Exact copy of the pattern of interest cannot be expected in the processed image - some part of the pattern is usually corrupted in real images by noise, geometric distortion, occlusion, etc. Search for locations of maximum match is appropriate. Let f be a processed image, h be a pattern for which to search, and V be the set of all image pixels in the processed image.