GPU implementation of linear morphological openings with arbitrary angle

Karas, Pavel; Morard, Vincent; Grandpierre, Thierry; Dokladalova, Eva; Matula, Petr; Dokládal, Petr

doi:10.1007/s11554-012-0248-7

Cited by 14 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Along with the repeatability and lack of manual intervention this gives the new method a significant advantage, however, this was achieved using robust parameters, specifically; S h ¼ 10 , S L ¼ 2 pixels and L max ¼ 91. Application specific optimisations could reduce measurement time further, as could more efficient GPU implementations of morphological operators [36], that were outside the scope of this study.…”

Section: Resultsmentioning

confidence: 99%

Automated analysis of platelet microstructures using a feature length orientation space

et al. 2022

View full text Add to dashboard Cite

The ability to measure elongated structures such as platelets and colonies, is an important step in the microstructural analysis of many materials. Widely used techniques and standards require extensive manual interaction making them slow, laborious, difficult to repeat and prone to human error. Automated approaches have been proposed but often fail when analysing complex microstructures. This paper addresses these challenges by proposing a new, automated image analysis technique, to reliably assess platelet microstructure. Tools from Mathematical Morphology are designed to probe the image and map the response onto a new feature-length orientation space (FLOS). This enables automated measurement of key microstructural features such as platelet width, orientation, globular volume fraction, and colony size. The method has a wide field of view, low dependency on input parameters, and does not require prior thresholding, common in other automated analysis techniques. Multiple datasets of complex Titanium alloys were used to evaluate the new techniques which are shown to match measurements from expert materials scientists using recognized standards, while drastically reducing measurement time and ensuring repeatability. The per-pixel measurement style of the technique also allows for the generation of useful colourmaps, that aid further analysis and provide evidence to increase user confidence in the quantitative measurements.

show abstract

Section: Resultsmentioning

confidence: 99%

Automated analysis of platelet microstructures using a feature length orientation space

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Additionally, it would be interesting to try adapting the stack-based algorithm to robust [4] and incomplete [8] path openings, or other schemes for making path openings more robust to noise. Di erent schemes for parallelization could also be explored (for example by dividing the grey levels, rather than pixels, among di erent processors), as well as e cient GPU implementations as has been explored in the 1D case [10].…”

Section: Discussionmentioning

confidence: 99%

Efficient Computation of Greyscale Path Openings

Schubert

Gronde

Roerdink

2016

Mathematical Morphology - Theory and Applications

View full text Add to dashboard Cite

Path openings are morphological operators that are used to preserve long, thin, and curved structures in images. They have the ability to adapt to local image structures,which allows them to detect lines that are not perfectly straight. They are applicable in extracting cracks, roads, and similar structures. Although path openings are very efficient to implement for binary images, the greyscale case is more problematic. This study provides an analysis of the main existing greyscale algorithm, and shows that although its time complexity can be quadratic in the number of pixels, this is optimal in terms of the output (if the full opening transform is created). Also, it is shown that under many circumstances the worst-case running time is much less than quadratic. Finally, a new algorithm is provided,which has the same time complexity, but is simpler, faster in practice and more amenable to parallelization

show abstract

“…However, it uses a histogram, consequently the whole signal to be processed must be known in advance, and the pixel values are limited to 8-bits. Instead, we propose using another fast algorithm [33], [34], which offers the following additional advantages: (i) it computes the output signal progressively, each time a pixel is added to a path; (ii) it can handle the signal borders in two different ways, by padding with −∞ V or with ∞ V ; (iii) it can handle any input data accuracy (integer or floating point) with no extra cost; (iv) the complexity is independent of the size of the opening; (v) it is fast and GPU compliant, as shown by Karas et al [35].…”

Section: B Path Filtering: Efficient Algorithmmentioning

confidence: 99%

Parsimonious Path Openings and Closings

Morard

Dokládal

Decencière

2014

IEEE Trans. on Image Process.

Self Cite

View full text Add to dashboard Cite

Path openings and closings are morphological tools used to preserve long, thin, and tortuous structures in gray level images. They explore all paths from a defined class, and filter them with a length criterion. However, most paths are redundant, making the process generally slow. Parsimonious path openings and closings are introduced in this paper to solve this problem. These operators only consider a subset of the paths considered by classical path openings, thus achieving a substantial speed-up, while obtaining similar results. In addition, a recently introduced 1D opening algorithm is applied along each selected path. Its complexity is linear with respect to the number of pixels, independent of the size of the opening. Furthermore, it is fast for any input data accuracy (integer or floating point) and works in stream. Parsimonious path openings are also extended to incomplete paths, i.e., paths containing gaps. Noise-corrupted paths can thus be processed with the same approach and complexity. These parsimonious operators achieve a several orders of magnitude speed-up. Examples are shown for incomplete path openings, where computing times are brought from minutes to tens of milliseconds, while obtaining similar results.

show abstract

GPU implementation of linear morphological openings with arbitrary angle

Cited by 14 publications

References 26 publications

Automated analysis of platelet microstructures using a feature length orientation space

Automated analysis of platelet microstructures using a feature length orientation space

Efficient Computation of Greyscale Path Openings

Parsimonious Path Openings and Closings

Contact Info

Product

Resources

About