Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

One of the main issues hindering the adoption of parts produced using laser powder bed fusion (L-PBF) in safety-critical applications is the inconsistencies in quality levels. Furthermore, the complicated nature of the L-PBF process makes optimizing process parameters to reduce these defects experimentally challenging and computationally expensive. To address this issue, sensor-based monitoring of the L-PBF process has gained increasing attention in recent years. Moreover, integrating machine learning (ML) techniques to analyze the collected sensor data has significantly improved the defect detection process aiming to apply online control. This article provides a comprehensive review of the latest applications of ML for in situ monitoring and control of the L-PBF process. First, the main L-PBF process signatures are described, and the suitable sensor and specifications that can monitor each signature are reviewed. Next, the most common ML learning approaches and algorithms employed in L-PBFs are summarized. Then, an extensive comparison of the different ML algorithms used for defect detection in the L-PBF process is presented. The article then describes the ultimate goal of applying ML algorithms for in situ sensors, which is closing the loop and taking online corrective actions. Finally, some current challenges and ideas for future work are also described to provide a perspective on the future directions for research dealing with using ML applications for defect detection and control for the L-PBF processes.

No abstract

No abstract

The presence of manifolds is a common assumption in many applications, including astronomy and computer vision. For instance, in astronomy, low-dimensional stellar structures, such as streams, shells, and globular clusters, can be found in the neighborhood of big galaxies such as the Milky Way. Since these structures are often buried in very large data sets, an algorithm, which can not only recover the manifold but also remove the background noise (or outliers), is highly desirable. While other works try to recover manifolds either by pushing all points toward manifolds or by downsampling from dense regions, aiming to solve one of the problems, they generally fail to suppress the noise on manifolds and remove background noise simultaneously. Inspired by the collective behavior of biological ants in food-seeking process, we propose a new algorithm that employs several random walkers equipped with a local alignment measure to detect and denoise manifolds. During the walking process, the agents release pheromone on data points, which reinforces future movements. Over time the pheromone concentrates on the manifolds, while it fades in the background noise due to an evaporation procedure. We use the Markov chain (MC) framework to provide a theoretical analysis of the convergence of the algorithm and its performance. Moreover, an empirical analysis, based on synthetic and real-world data sets, is provided to demonstrate its applicability in different areas, such as improving the performance of t-distributed stochastic neighbor embedding (t-SNE) and spectral clustering using the underlying MC formulas, recovering astronomical low-dimensional structures, and improving the performance of the fast Parzen window density estimator.