[Edge Detection]

For a 2-D function F(x,y), one might define the Laplacian operator as :

. More...

## Classes | |

class | SoDoBFilterProcessing |

SoDoBFilterProcessing engine More... | |

class | SoMorphologicalLaplacianProcessing |

SoMorphologicalLaplacianProcessing engine More... | |

class | SoRecursiveLaplacianProcessing |

SoRecursiveLaplacianProcessing engine applies a recursive algorithm for the determination of the laplacian. More... |

For a 2-D function F(x,y), one might define the Laplacian operator as :

.

The Laplacian is an isotropic, second-order derivative operator. It is approximated in the discrete case, with the 4-connected grid, as .

The normalization parameter allows one to divide the value of the Laplacian by the sum of the absolute values of the masks. It reduces the noise sensitivity, avoids overflow, but lowers the contrast. Only main edges will appear on the Laplacian image. When no normalization is performed, there may be overflow, but edges will be much more evident.

Use the magnitude of the Laplacian to measure the edge strength, and then use a threshold strategy to mark edge points has severe drawbacks:

- A second-order derivative is
*more sensitive to noise*than a first-order derivative, thus making the distinction between edge and noise is more difficult on the Laplacian. - The Laplacian carries
*no directional information*.

As it is not directional, the Laplacian does not privileged one direction more than another. However, it is even more sensitive to noise than the gradient. Because of this sensitivity to noise, a lot of isolated points are enhanced along with the edges.

Copyright © FEI S.A.S. All rights reserved.