An artifactual fibre overlap removal algorithm for micro-computed tomography image post-processing and 3D microstructure generation with graphics processing unit acceleration
Bibliographic record
Abstract
A novel algorithm based on radial basis functions is proposed for the removal of artifactual fibre overlap within fibre structures extracted from micro-computed tomography (micro-CT) images of fibre reinforced polymer matrix composites. The proposed algorithm is highly efficient and excels in preserving the original fibre structures extracted from the micro-CT images. Besides, graphics processing unit (GPU) acceleration is applied to further enhance the efficiency of the fibre overlap removal process. Furthermore, the proposed algorithm is also modified for the generation of periodic 3D microstructures. For practical application, the proposed algorithm is implemented for both the artifactual fibre overlap removal within micro-CT images from an injection moulded part and the microstructure generation for 3D printed samples. The unidirectional elastic modulus of the resultant microstructures is computed via numerical simulations and shows a close match to the experimental measurements with relative errors less than 2%. Overall, the proposed algorithm significantly facilitates the reconstruction of micro-CT image-based numerical models and can also be easily repurposed to generate complex microstructures, which is of great value for the development of data-driven models for characterization and design of composite materials that demands large amounts of data on material microstructures. • An algorithm for the efficient removal of artifactual fibre overlap within fibre structures extracted from micro-CT images. • The proposed algorithm introduces minimal distortion to the original fibre structures from micro-CT images. • The proposed algorithm is also adapted to generate periodical 3D microstructures that contain both fibres and voids. • Runtime of the proposed algorithm is further reduced via parallelization and graphics processing unit computing. • The practical application of the proposed algorithm is demonstrated through two case studies with validated results.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".