Search NASA⌕ Search

SEARCH · Search NASA

Results for “Reconstruction algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,639 records · Page 91

Wasserstein normalized autoencoder for anomaly detection

A novel anomaly detection algorithm is presented. The Wasserstein normalized autoencoder (WNAE) is a normalized probabilistic model that minimizes the Wasserstein distance between the learned probability distribution—a Boltzmann distribution where the energy is the reconstruction error of the autoencoder (AE)—and the distribution of the training data. This algorithm has been developed and applied to the identification of semivisible jets—conical sprays of visible standard model (SM) particles and invisible dark matter states—with the CMS experiment at the CERN LHC. Trained on jets of particles from simulated SM processes, the WNAE is shown to learn the probability distribution of the input data in a fully unsupervised fashion, such that it effectively identifies new physics jets as anomalies. The model exhibits stable, convergent training and recovers strong classification performance for a wide range of signals against the selected background process, for which a standard AE fails because of outlier reconstruction. In addition, the model improves upon standard normalized autoencoders while remaining fully agnostic to the signal. The WNAE directly tackles the problem of outlier reconstruction, a common failure mode of autoencoders in anomaly detection tasks.

Hayrapetyan, Aram [Yerevan Phys. Inst.]↗

Small convolution kernels for high-fidelity image restoration

An algorithm is developed for computing the mean-square-optimal values for small, image-restoration kernels. The algorithm is based on a comprehensive, end-to-end imaging system model that accounts for the important components of the imaging process: the statistics of the scene, the point-spread function of the image-gathering device, sampling effects, noise, and display reconstruction. Subject to constraints on the spatial support of the kernel, the algorithm generates the kernel values that restore the image with maximum fidelity, that is, the kernel minimizes the expected mean-square restoration error. The algorithm is consistent with the derivation of the spatially unconstrained Wiener filter, but leads to a small, spatially constrained kernel that, unlike the unconstrained filter, can be efficiently implemented by convolution. Simulation experiments demonstrate that for a wide range of imaging systems these small kernels can restore images with fidelity comparable to images restored with the unconstrained Wiener filter.

Reichenbach, Stephen E.↗

Calibration of a soft secondary vertex tagger using proton-proton collisions at s = 13 TeV with the ATLAS detector

Several processes studied by the ATLAS experiment at the Large Hadron Collider produce low-momentum b-flavored hadrons in the final state. This paper describes the calibration of a dedicated tagging algorithm that identifies b-flavored hadrons outside of hadronic jets by reconstructing the soft secondary vertices originating from their decays. The calibration is based on a proton-proton collision dataset at a center-of-mass energy of 13 TeV corresponding to an integrated luminosity of 140 fb -1 . Scale factors used to correct the algorithm’s performance in simulated events are extracted for the b-tagging efficiency and the mistag rate of the algorithm using a data sample enriched in $t\overline{t}$ events. Several orthogonal measurement regions are defined, binned as a function of the multiplicities of soft secondary vertices and jets containing a b-flavored hadron in the event. The mistag rate scale factors are estimated separately for events with low and high average numbers of interactions per bunch crossing. The results, which are derived from events with low missing transverse momentum, are successfully validated in a phase space characterized by high missing transverse momentum and therefore are applicable to new physics searches carried out in either phase space regime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An opposite view data replacement approach for reducing artifacts due to metallic dental objects

Purpose: To present a conceptually new method for metal artifact reduction (MAR) that can be used on patients with multiple objects within the scan plane that are also of small sized along the longitudinal (scanning) direction, such as dental fillings. Methods: The proposed algorithm, named opposite view replacement, achieves MAR by first detecting the projection data affected by metal objects and then replacing the affected projections by the corresponding opposite view projections, which are not affected by metal objects. The authors also applied a fading process to avoid producing any discontinuities in the boundary of the affected projection areas in the sinogram. A skull phantom with and without a variety of dental metal inserts was made to extract the performance metric of the algorithm. A head and neck case, typical of IMRT planning, was also tested. Results: The reconstructed CT images based on this new replacement scheme show a significant improvement in image quality for patients with metallic dental objects compared to the MAR algorithms based on the interpolation scheme. For the phantom, the authors showed that the artifact reduction algorithm can efficiently recover the CT numbers in the area next to the metallic objects. Conclusions: The authors presented a new and efficient method for artifact reduction due to multiple small metallic objects. The obtained results from phantoms and clinical cases fully validate the proposed approach.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-J-153: Reconstructing 4D Cone Beam CT Images for Clinical QA of Lung SABR Treatments

Purpose: To verify that the planned Primary Target Volume (PTV) and Internal Gross Tumor Volume (IGTV) fully enclose a moving lung tumor volume as visualized on a pre-SABR treatment verification 4D Cone Beam CT. Methods: Daily 3DCBCT image sets were acquired immediately prior to treatment for 10 SABR lung patients using the on-board imaging system integrated into a Varian TrueBeam (v1.6: no 4DCBCT module available). Respiratory information was acquired during the scan using the Varian RPM system. The CBCT projections were sorted into 8 bins offline, both by breathing phase and amplitude, using in-house software. An iterative algorithm based on total variation minimization, implemented in the open source reconstruction toolkit (RTK), was used to reconstruct the binned projections into 4DCBCT images. The relative tumor motion was quantified by tracking the centroid of the tumor volume from each 4DCBCT image. Following CT-CBCT registration, the planning CT volumes were compared to the location of the CBCT tumor volume as it moves along its breathing trajectory. An overlap metric quantified the ability of the planned PTV and IGTV to contain the tumor volume at treatment. Results: The 4DCBCT reconstructed images visibly show the tumor motion. The mean overlap between the planned PTV (IGTV) and the 4DCBCT tumor volumes was 100% (94%), with an uncertainty of 5% from the 4DCBCT tumor volume contours. Examination of the tumor motion and overlap metric verify that the IGTV drawn at the planning stage is a good representation of the tumor location at treatment. Conclusion: It is difficult to compare GTV volumes from a 4DCBCT and a planning CT due to image quality differences. However, it was possible to conclude the GTV remained within the PTV 100% of the time thus giving the treatment staff confidence that SABR lung treatements are being delivered accurately.

60 APPLIED LIFE SCIENCES↗

3D reconstruction identifies loci linked to variation in angle of individual sorghum leaves

Selection for yield at high planting density has reshaped the leaf canopy of maize, improving photosynthetic productivity in high density settings. Further optimization of canopy architecture may be possible. However, measuring leaf angles, the widely studied component trait of leaf canopy architecture, by hand is a labor and time intensive process. Here, we use multiple, calibrated, 2D images to reconstruct the 3D geometry of individual sorghum plants using a voxel carving based algorithm. Automatic skeletonization and segmentation of these 3D geometries enable quantification of the angle of each leaf for each plant. The resulting measurements are both heritable and correlated with manually collected leaf angles. This automated and scaleable reconstruction approach was employed to measure leaf-by-leaf angles for a population of 366 sorghum plants at multiple time points, resulting in 971 successful reconstructions and 3,376 leaf angle measurements from individual leaves. A genome wide association study conducted using aggregated leaf angle data identified a known large effect leaf angle gene, several previously identified leaf angle QTL from a sorghum NAM population, and novel signals. Genome wide association studies conducted separately for three individual sorghum leaves identified a number of the same signals, a previously unreported signal shared across multiple leaves, and signals near the sorghum orthologs of two maize genes known to influence leaf angle. Automated measurement of individual leaves and mapping variants associated with leaf angle reduce the barriers to engineering ideal canopy architectures in sorghum and other grain crops.

3D reconstruction↗

Adaptive error detection for HDR/PDR brachytherapy: Guidance for decision making during real-time in vivo point dosimetry

Purpose: This study presents an adaptive error detection algorithm (AEDA) for real-timein vivo point dosimetry during high dose rate (HDR) or pulsed dose rate (PDR) brachytherapy (BT) where the error identification, in contrast to existing approaches, does not depend on an a priori reconstruction of the dosimeter position. Instead, the treatment is judged based on dose rate comparisons between measurements and calculations of the most viable dosimeter position provided by the AEDA in a data driven approach. As a result, the AEDA compensates for false error cases related to systematic effects of the dosimeter position reconstruction. Given its nearly exclusive dependence on stable dosimeter positioning, the AEDA allows for a substantially simplified and time efficient real-time in vivo BT dosimetry implementation. Methods: In the event of a measured potential treatment error, the AEDA proposes the most viable dosimeter position out of alternatives to the original reconstruction by means of a data driven matching procedure between dose rate distributions. If measured dose rates do not differ significantly from the most viable alternative, the initial error indication may be attributed to a mispositioned or misreconstructed dosimeter (false error). However, if the error declaration persists, no viable dosimeter position can be found to explain the error, hence the discrepancy is more likely to originate from a misplaced or misreconstructed source applicator or from erroneously connected source guide tubes (true error). Results: The AEDA applied on twoin vivo dosimetry implementations for pulsed dose rate BT demonstrated that the AEDA correctly described effects responsible for initial error indications. The AEDA was able to correctly identify the major part of all permutations of simulated guide tube swap errors and simulated shifts of individual needles from the original reconstruction. Unidentified errors corresponded to scenarios where the dosimeter position was sufficiently symmetric with respect to error and no-error source position constellations. The AEDA was able to correctly identify all false errors represented by mispositioned dosimeters contrary to an error detection algorithm relying on the original reconstruction. Conclusions: The study demonstrates that the AEDA error identification during HDR/PDR BT relies on a stable dosimeter position rather than on an accurate dosimeter reconstruction, and the AEDA’s capacity to distinguish between true and false error scenarios. The study further shows that the AEDA can offer guidance in decision making in the event of potential errors detected with real-timein vivo point dosimetry.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Error Detection, Factorization and Correction for Multi-View Scene Reconstruction from Aerial Imagery

Scene reconstruction from video sequences has become a prominent computer vision research area in recent years, due to its large number of applications in fields such as security, robotics and virtual reality. Despite recent progress in this field, there are still a number of issues that manifest as incomplete, incorrect or computationally-expensive reconstructions. The engine behind achieving reconstruction is the matching of features between images, where common conditions such as occlusions, lighting changes and texture-less regions can all affect matching accuracy. Subsequent processes that rely on matching accuracy, such as camera parameter estimation, structure computation and non-linear parameter optimization, are also vulnerable to additional sources of error, such as degeneracies and mathematical instability. Detection and correction of errors, along with robustness in parameter solvers, are a must in order to achieve a very accurate final scene reconstruction. However, error detection is in general difficult due to the lack of ground-truth information about the given scene, such as the absolute position of scene points or GPS/IMU coordinates for the camera(s) viewing the scene. In this dissertation, methods are presented for the detection, factorization and correction of error sources present in all stages of a scene reconstruction pipeline from video, in the absence of ground-truth knowledge. Two main applications are discussed. The first set of algorithms derive total structural error measurements after an initial scene structure computation and factorize errors into those related to the underlying feature matching process and those related to camera parameter estimation. A brute-force local correction of inaccurate feature matches is presented, as well as an improved conditioning scheme for non-linear parameter optimization which applies weights on input parameters in proportion to estimated camera parameter errors. Another application is in reconstruction pre-processing, where an algorithm detects and discards frames that would lead to inaccurate feature matching, camera pose estimation degeneracies or mathematical instability in structure computation based on a residual error comparison between two different match motion models. The presented algorithms were designed for aerial video but have been proven to work across different scene types and camera motions, and for both real and synthetic scenes.

42 ENGINEERING↗

Toward an event-level analysis of hadron structure using differential programming

Reconstructing the internal properties of hadrons in terms of fundamental quark and gluon de- grees of freedom is a central goal in nuclear and particle physics. This effort lies at the core of major experimental programs, such as the Jefferson Lab 12 GeV program and the upcoming Electron-Ion Collider. A primary challenge is the inherent inverse problem: converting large-scale observational data from collision events into the fundamental QCD-defined densities that characterize the micro- scopic structure of hadronic systems. Recent advances in AI and machine learning have opened new avenues for addressing this challenge using deep learning techniques. A particularly promising direction is the integration of complex theoretical calculations and experimental simulations into a unified framework capable of reconstructing these densities directly from event-level information. In this document, we introduce a key algorithm called LOITS, which enables differentiable program- ming within such a framework, facilitating the use of AI/ML techniques to solve the inverse problem of QCF reconstruction at the event level.

Braga, Kevin [College of William and Mary, William↗

Searching for Clues for a Matter Dominated Universe in Liquid Argon Time Projection Chambers

Liquid Argon Time Projection Chambers (LArTPCs) represent one of the most widely utilized neutrino detection techniques in neutrino experiments, for instance, in the Short Baseline Neutrino (SBN) program and the future large-scale LArTPC: Deep Underground Neutrino Experiment (DUNE). The high-end technique, facilitating excellent spatial and calorimetric reconstruction resolution, also enables testing exotic Beyond Standard Model (BSM) theories, such as baryon number violation (BNV) processes (e.g., proton-decay, neutron-antineutron oscillation). At the same time, Machine Learning (ML) techniques have demonstrated their ubiquitous use in recent decades; ML techniques have also become some of the most powerful tools in high-energy physics (HEP) analyses. Furthermore, the development of algorithms to cater to the needs of problems in HEP (i.e., triggering, reconstruction, improving sensitivity, etc.) has also become an active area of research. By developing a combined approach using Convolutional Neural Network (CNN) and Boosted Decision Tree (BDT) techniques, the sensitivity of neutron-antineutron oscillation in DUNE is evaluated for a projected exposure of 400kton·years. Additionally, to meet the triggering requirement to select such rare events in DUNE, such a search is only supported with highly efficient self-triggering algorithms. An ML-based self-triggering scheme for large-scale LArTPCs, such as DUNE, is also developed with the intention of implementation on field-programmable gate arrays (FPGAs). The ML-based approach for searching for neutron-antineutron oscillation can be demonstrated and validated on the current LArTPC MicroBooNE. The analysis in MicroBooNE represents the first-ever search for neutron-antineutron oscillation in a LArTPC. DUNE's projected 90% C.L. sensitivity to the neutron antineutron oscillation lifetime is 6.45×10³² years, assuming 1.327×10³⁵ neutron·years, equivalent to 10 years of DUNE far detector exposure (400kton·years). For MicroBooNE, assuming 372 seconds of exposure (equivalent to 3.13×10³⁶ neutron·years), the 90% C.L. lifetime sensitivity is found at 3.07×10²⁵ yrs, after accounting for Monte-Carlo statistical uncertainty and systematic uncertainty from detector effects.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Kinetic Monte Carlo Simulation of Hydrogen Diffusion in Tungsten

Nuclear fusion is considered as the most promising sustainable energy source. If achieved, it could provide electricity to the mankind for millions of years. During the reaction, the fusion ash is continuously removed from the magnetic gap, the divertor region, and the divertor facing component is subjected to intense plasma bombardment. It is proposed to use tungsten as the divertor facing material, because it has low physical sputtering yield and superior thermomechanical properties. However, the high mobility of hydrogen in tungsten and the high bombardment flux bring the hydrogen isotopes deep into the tungsten tile. The presence of hydrogen in tungsten tends to weaken the gram boundaries and produce surface blistering. The ejection of tungsten particulates into the plasma core will cool the reaction and cease the fusion reactions. Therefore, it is important to have a detailed understanding of the hydrogen diffusion in tungsten bulk. The KMC method is a stochastic computer simulation to predict the time evolution of a certain system. Typically, at a given time, the system will evolve through a few possible paths with known probabilities. In each step, the KMC method analyzes the entire system and randomly determines the system evolving events based on all transition rates of all possible events and advance the physical time. This process is repeated till the simulation of the entire physical time is completed. In previous work, the authors developed a kinetic Monte Carlo (KMC) algorithm and program to simulate hydrogen diffusion process on tungsten reconstructed surface. In this article, this KMC method is extended to model the hydrogen diffusion in tungsten bulk. The diffusion coefficients are calculated and fitted to the Arrhenius equation. The result matches the experiment measurement very well. KMC diffusion simulation needs the locations of the hydrogen trapping sites, diffusion paths and the corresponding diffusion energy barriers. The hydrogen interstitial sites in tungsten crystal have been thoroughly studied by density function theory (DFT) and molecular dynamics (MD). Johnson and Carter used DFT to determine the preferred location of the hydrogen interstitial sites m tungsten crystal, which are the tetrahedral sites (T-sites) in body-centered-cubic (bcc) lattice surfaces. All T-sites are located on the surfaces of a lattice cell. There are four T-sites per surface and twelve T-sites per lattice cell. The hydrogen atoms diffuse by traveling from one T-site to one of its nearest four T-site neighbors. Thus, each T-site is surrounded by two neighbors on the same surface, and one neighbor on each of the two adjacent surfaces perpendicular to the surface holding the center T-site. The diffusion barrier between two neighboring T-sites was calculated to be 0.38 eV. Knowing the diffusion path, energy barrier, and the crystal structure, the KMC simulation is readily to be performed. Based on other researchers' DFT calculations, the hydrogen stable interstitial site in tungsten bulk is determined as the tetrahedral site on the surface of the bee lattice. Each T-site has 4 neighbors and the energy barrier between two adjacent T-sites are estimated to be 0.38 eV. Based on those facts and the KMC theory, a MATLAB program is developed to model the hydrogen diffusion in tungsten bulk. In the MATLAB program, substrate temperature, hydrogen concentration, physical time to be simulated, and the number of cycles are all customizable. To compare the KMC determined diffusion coefficients with experiment results in the literature, the simulations are performed for temperature 300 K - 2500 K and low hydrogen concentration (0.1%), mimicking the experiment condition. The calculated diffusion coefficients match the reference values measured by the experiment under low hydrogen concentration condition. The results are also fitted to the Arrhenius equation. The pre-exponential factor and the average activation energy in Arrhenius equation are obtained. The good agreement between simulation and experiment proves that the developed KMC algorithm truly reflect the well-established theory of interstitial hydrogens in tungsten. The developed program could easily be used to model the diffusion process and predict the diffusion coefficients under other concentrations and temperatures. This work is part of the ongoing development of hydrogen diffusion in tungsten integrating surface diffusion (previous work), bulk diffusion (this work), and adsorption/desorption on surface (future work)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Iterative Reconstruction for Multimodal Neutron Tomography

Here, we describe a unified framework for model-based iterative 3-D reconstruction of multimodal neutron transmission, hydrogen-scatter, and induced-fission images from low resolution data recorded using 14.1-MeV neutrons and the associated-particle imaging (API) technique. The framework, which was developed to facilitate use in challenging field-deployment scenarios, is centered around physics-based system models and a total variation (TV) constrained implementation of the simultaneous iterative reconstruction technique (SIRT). Modified to solve a statistically weighted least squares (WLS) problem, the SIRT algorithm is accelerated using ordered subsets and Nesterov’s momentum for which we derive a near-optimal value of the governing Lipschitz constant. The approach enables the reconstruction of images that are high resolution compared to the acquired data and is robust to both limited statistics and a limited number of projection angles. Moreover, the framework is fast enough to be practical. Example images are provided that demonstrate both the ability to perform fast-neutron imaging of high-atomic-number materials with low radiation dose and the benefit of multimodal neutron imaging to identify key materials.

Hydrogen scatter↗

Reconstructing lower hybrid fields from ray tracing data

Ray tracing methods are commonly used to estimate the propagation of RF fields in plasmas. By going to higher order in the approximations used to derive the ray equations, it is possible to also reconstruct an approximate field from a family of rays. However, this field reconstruction is often neglected, primarily because of the difficulty of automatically dealing with focusing and reflections (caustics) in computational algorithms. In this work, we have been examining the feasibility of using tools developed for semi-classical quantum approximations to do RF field reconstructions. Specifically, it is possible to obtain a set of ODE's which approximately describe the dynamics of a wave packet centered on a ray. From this information, an approximate field can be reconstructed. We here report preliminary results for the reconstruction of lower hybrid fields using this technique.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical solution of 2D-vector tomography problem using the method of approximate inverse

We propose a numerical solution of reconstruction problem of a two-dimensional vector field in a unit disk from the known values of the longitudinal and transverse ray transforms. The algorithm is based on the method of approximate inverse. Numerical simulations confirm that the proposed method yields good results of reconstruction of vector fields.

97 MATHEMATICS AND COMPUTING↗

Selection Algorithm for electron neutrino charged current interactions in SBND

The Short Baseline Neutrino (SBN) program at Fermilab is a joint proposal by three experimental collaborations primarily for the investigation of the cause behind the low-energy electron-like event excess observed by the MiniBoone experiment. This dissertation focuses on the near detector of the project, named the Short Baseline Near Detector (SBND), a Liquid Argon Time Projection Chamber apparatus which will conduct searches for sterile neutrinos in the mass range of 1 ${eV}^2/{c}^4$, as well as provide cross-section measurements for neutrino interactions in argon and perform other beyond the standard model studies.\\ \indent As is the case for all detectors in the program, the SBND will use the Booster Neutrino Beam as its source, which will provide it with both muon and electron neutrinos. Given that the ability to discern between the neutrino flavors will be crucial to the fulfillment of the detector's physics goals, the objective of this work is to provide the collaboration with a tool capable of doing so. As such, we here present the development process for an inclusive selection algorithm for the identification of electron neutrino charged current (CC) events regardless of their interaction channel. This is done through a combination of traditional techniques, such as the implementation of cuts on the reconstructed interaction properties, with the use of the Convolutional Visual Network, a machine learning algorithm capable of classifying particle interactions through the analysis of the topology of their final states. With this approach, we have developed a selection process that is capable of identifying $\nu_e$ CC interactions across a wide range of topologies with 34.4\% efficiency, as well as a purity of 91.2\%, making it especially promising for use in cross section studies.

Freire, Hector Moya [ABC Federal U.] (ORCID:000900↗

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.

97 MATHEMATICS AND COMPUTING↗

Efficient boundary-guided scanning for high-resolution X-ray ptychography

In the realm of X-ray ptychography experiments, a considerable amount of ptychography scans are typically performed within a field of view encompassing the target sample. While it is crucial to obtain overlapping scans in small increments over the region of interest for achieving high-resolution sample reconstruction, a significant number of these scans often redundantly measure the empty background within the wide field of view. To address this inefficiency, an innovative algorithm is proposed that introduces automatic guidance for data acquisition. The algorithm first directs the scan point to actively search for the object of interest within the field of view. Subsequently, it intelligently scans along the perimeter of the sample, strategically acquiring measurements exclusively within the boundary of the region of interest. By employing this approach, a reduction in the number of measurements required to obtain high-resolution reconstruction images is demonstrated, as compared with conventional raster scanning methods. Furthermore, the automatic guidance provided by the algorithm offers the added advantage of saving valuable time during the reconstruction process. Through practical implementation on real experiments, these findings showcase the efficacy of the proposed algorithm in enhancing the efficiency and accuracy of X-ray ptychography experiments. This novel approach holds immense potential for advancing sample analysis and imaging techniques in various scientific disciplines.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Selection Algorithm Improvement for MicroBooNE

Data selection is an extremely important part of data analysis for any experiment. Finding a physics result is often the result of sifting through a massive amount of data, keeping data that we believe to be signal and throwing out data we do not. This process is called data selection. Creating a selection algorithm is an intensive process that must balance keeping enough data to have statistics and maximizing the signal purity of that data. In this study, we used three different reconstruction tools, Pandora, WireCell, and LANTERN, for the MicroBooNE experiment in conjunction to improve the selection algorithm for analysis. For the case of this study, we look into the charged current N proton 0 pions (CCNp0$\pi$) interaction channel. This is the dominant channel for the Short Baseline Neutrino (SBN) program and is expected to be a large contributor to the Deep Underground Neutrino Experiment (DUNE). We first investigated each of the three tools to find out more about their strengths and weaknesses as reconstructions. We then put together a direct comparison of the three methods to find which method or combination of methods would return the best result for us. While the study is ongoing, we have learned a lot about data selection for the experiment and the differences between the reconstruction tools.

Dillon, Brayden [Michigan State U.]↗