[an error occurred while processing this directive]
Main Page | Modules | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

Crack Edge Image

Crack edges are marked between the pixels of an image. A Crack Edge Image is an image that represents these edges. In order to accomodate the cracks, the Crack Edge Image must be twice as large as the original image (precisely (2*w - 1) by (2*h - 1)). A Crack Edge Image can easily be derived from a binary image or from the signs of the response of a Laplacean filter. Consider the following sketch, where + encodes the foreground, - the background, and * the resulting crack edges.

sign of difference image         insert cracks         resulting CrackEdgeImage

                                   + . - . -              . * . . .
      + - -                        . . . . .              . * * * .
      + + -               =>       + . + . -      =>      . . . * .
      + + +                        . . . . .              . . . * *
                                   + . + . +              . . . . .

Starting from the original binary image (left), we insert crack pixels to get to the double-sized image (center). Finally, we mark all crack pixels whose non-crack neighbors have different signs as crack edge points, while all other pixels (crack and non-crack) become region pixels.

Requirements on a Crack Edge Image:

The last two requirements ensure that both edges and regions are 4-connected. Thus, 4-connectivity and 8-connectivity yield identical connected components in a Crack Edge Image (so called well-composedness). This ensures that Crack Edge Images have nice topological properties (cf. L. J. Latecki: "Well-Composed Sets", Academic Press, 2000).


Generated on Mon Sep 20 01:01:35 2010 for Hugintrunk by doxygen 1.3.9.1