An efficient and uniformly behaving streamline-based μCT fibre tracking algorithm using volume-wise structure tensor and signal processing techniques
A method for reconstructing polygonal paths of fibres in reinforced composites imaged using micro-computed tomography is formally described, implemented and tested. The algorithm has been crafted to be explicable, require no training data and behave uniformly in all axes or orientations. It consists...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2022 |
| Country: | España |
| Institution: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repository: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/20922 |
| Online Access: | http://hdl.handle.net/10256/20922 |
| Access Level: | Open access |
| Keyword: | Algorismes computacionals Computer algorithms Imatges -- Processament Image processing |
| Summary: | A method for reconstructing polygonal paths of fibres in reinforced composites imaged using micro-computed tomography is formally described, implemented and tested. The algorithm has been crafted to be explicable, require no training data and behave uniformly in all axes or orientations. It consists of four phases: (1) segmenting fibre regions using a scale-dependent Iterative Difference of Gaussians approach, (2) extracting directionality using the structure tensor minimum eigenvector, (3) automatically placing the seeds near a set of user-defined restricting surfaces, and (4) tracking fibres using a streamline-based integration method. The algorithm cost grows in relation to the target fibre diameter and is proportional to the number of voxels in the input volume. Its behaviour, ability to process very curved fibres, and error have been assessed using both synthetic and real datasets. The C++ implementation is performant and parallelizable, and produces helpful visualisations to gain insight of the intermediate and final results |
|---|