Approximate Connectivity and Mathematical Morphology

Popov, Antony T.

doi:10.1007/0-306-47025-x_17

Cited by 1 publication

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Numerical tests are performed in the next section to compare the performances of each connectivity. We can also extend this work to epsilon-connectivity (see [19] for a more precise introduction) where two pixels are said to be connected if their ∞ -distance is less than k. For instance, for k = 2, this allows to fill small gaps between cracks that may be created because of the noise and/or the thickness of the cracks. All the previous computations remain valid taking m = 24 since a neighborhood of a pixel is now a 5x5 square.…”

Section: Stochastic Dominationmentioning

confidence: 99%

Automatic Choice of the Threshold of a Grain Filter via Galton–Watson Trees: Application to Granite Cracks Detection

2017

View full text Add to dashboard Cite

The goal of this paper is the presentation of a post-processing method allowing to remove impulse noise in binary images, while preserving thin structures. We use a grain filter as in [5]. We propose a method to automatically determine the required threshold using Galton-Watson processes. We present numerical results and a complete analysis on a synthetic image. We end the numerical section considering a specific application to granite samples crack detection: here we deal with X-tomography images that have been binarized via preprocessing techniques and we want to remove residual impulse noise while keeping cracks and micro-cracks structure.

show abstract

Section: Stochastic Dominationmentioning

confidence: 99%